| 1/2014 - 9 |
Visibility-based Planners for Mobile Robots Capable to Handle Path Existence Queries in Temporal LogicPOMARLAN, M.   |
Extra paper information in    |
| Click to see author's profile in SCOPUS, IEEE Xplore, Web of Science |
Download PDF  (734 KB) | Citation | Downloads: 985 | Views: 3,849 |
Author keywords
collision avoidance, computational efficiency, mobile robots, motion planning, reachability analysis, robot motion
References keywords
planning(14), motion(11), robotics(9), iros(9), robot(7), temporal(6), logic(6), icra(6), automation(6), systems(5)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2014-02-28
Volume 14, Issue 1, Year 2014, On page(s): 55 - 64
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2014.01009
Web of Science Accession Number: 000332062300009
SCOPUS ID: 84894612767
Abstract
Over the past few years, sampling based planner algorithms have been applied to planning queries formulated in path existence temporal logic, a formal system that allows more complex specifications on a solution path and is useful for task planning for mobile robots or synthesizing controllers for dynamical systems. In this paper, we extend the visibility heuristic to planners capable to handle finite path existence temporal logic queries. Our interest is justified by the visibility heuristic's ability to construct small roadmaps that are fast to search. We find that the visibility heuristic must be amended so that it can reliably handle temporal logic queries and we propose a suitable modification of the heuristic. We then present a method to extract a solution path from a roadmap, if such a solution exists. Finally, we show how the planner can be used to generate looping paths by augmenting it with a gap reduction step. |
| References | | | Cited By «-- Click to see who has cited this paper |
| [1] I. A. Sucan, S. Chitta, "Motion planning with constraints using configuration space approximations", in proceedings of the IEEE International Conference on Robotics Systems (IROS), 2012, [CrossRef] [SCOPUS Times Cited 30] [2] A. Pnueli, "The temporal logic of programs", in proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS), 1977, [CrossRef] [SCOPUS Times Cited 4257] [3] E. A. Emerson, J. Y. Halpern, "'sometimes' and 'not never' revisited: on branching versus linear time temporal logic", journal of the ACM, vol. 33 nr. 1, pg. 151-178, 1986, [CrossRef] [Web of Science Times Cited 538] [SCOPUS Times Cited 736] [4] D. Kozen, "Results on the propositional µ-calculus", in proceedings of the 9th Colloquium on Automata, Languages and Programming, pg. 348-359, 1982, [CrossRef] [Web of Science Times Cited 1042] [SCOPUS Times Cited 1421] [5] G. E. Fainekos, H. Kress-gazit, G. J. Pappas, "Temporal logic motion planning for mobile robots", in proceedings of the 2005 IEEE International Conference on Robotics and Automation (ICRA), pg. 2020-2025, 2005, [CrossRef] [SCOPUS Times Cited 195] [6] G. E. Fainekos, H. Kress-gazit, "Hybrid controllers for path planning: A temporal logic approach", in proceedings of the IEEE Conference on Decision and Control (CDC), pg. 4885-4890, 2005, [CrossRef] [SCOPUS Times Cited 142] [7] S. Karaman, E. Frazzoli, "Sampling-based motion planning with deterministic µ-calculus specifications", in proceedings of the IEEE Conference on Decision and Control (CDC), 2009, [CrossRef] [Web of Science Times Cited 105] [SCOPUS Times Cited 148] [8] J. F. Canny, "The complexity of robot motion planning", PhD thesis, MIT Press, pp. 1-20, 1987, ISBN: 9780262031363. [9] C. Nissoux, "Visibilite et methodes probabilistes pour la planification de mouvement en robotique" (PhD thesis), University Paul Sabatier Toulouse, 1999. [10] T. Simeon, J.-P. Laumond, C. Nissoux, "Visibility-based probabilistic roadmaps", in proceedings of the IEEE/RSJ International Conference on Robots and Systems (IROS), 1999, [CrossRef] [11] J. D. Marble, K. Bekris, "Computing spanners of asymptotically optimal probabilistic roadmaps", in proceedings of the IEEE/RSJ International Conference on Robots and Systems (IROS), 2011, [CrossRef] [12] J. D. Marble, K. Bekris, "Asymptotically near-optimal is good enough for motion planning", in proceedings of the International Symposium of Robotics Research (ISRR), 2011, [CrossRef] [13] D. Nieuwenhuisen and M. H. Overmars, "Useful cycles in probabilistic roadmap graphs", in proceedings of IEEE International Conference on Robotics and Automation (ICRA), 2004, [CrossRef] [Web of Science Times Cited 49] [SCOPUS Times Cited 65] [14] A Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, A. Tacchella, "NuSMV 2: an OpenSource tool for symbolic model checking", in proceedings of International Conference on Computer-Aided Verification (CAV), 2002, [CrossRef] [SCOPUS Times Cited 1201] [15] G. J. Holzmann, "The SPIN model checker primer and reference manual", Addison-Wesley, pp. 167-190, 2004, ISBN: 978-0321773715. [16] R. E. Tarjan, "Edge-disjoint spanning trees and depth-first search", Acta Informatica, vol. 6 nr. 2, pg. 171-185, 1976, [CrossRef] [Web of Science Times Cited 104] [SCOPUS Times Cited 130] [17] B. Haeupler, T. Kavitha, R. Mathew, S. Sen, R. E. Tarjan, "Incremental cycle detection, topological ordering, and strong component maintenance", ACM Transactions on Algorithms, vol. 8 nr. 1, 2012, [CrossRef] [Web of Science Times Cited 49] [SCOPUS Times Cited 62] [18] S. M. LaValle, "Planning Algorithms", Cambridge University Press, pp. 185-247, 2006. [Online] Available: Temporary on-line reference link removed - see the PDF document [19] L. E. Kavraki, P. Svestka, J.-C. Latombe, M. H. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configurations spaces", IEEE Transactions on Robotics and Automation, vol. 12, nr. 4, 1996, [CrossRef] [Web of Science Times Cited 3762] [SCOPUS Times Cited 4856] [20] J. J. Kuffner, S. M. LaValle, "RRT-connect: an efficient approach to single-query path planning", in proceedings of the IEEE International Conference on Robotics and Automation (ICRA), 2000, [CrossRef] [21] A. Yershova, L. Jaillet, T. Simeon, S. M. LaValle, "Dynamic domain RRTs: efficient exploration by controlling the sampling domain", in proceedings of IEEE International Conference on Robotics and Automation (ICRA), 2005, [CrossRef] [SCOPUS Times Cited 234] [22] S. R. Lindemann, S. M. LaValle, "Steps toward derandomizing RRTs", in proceedings of the 4th International Workshop on Robot Motion and Control (RoMoCon), 2004, [CrossRef] [SCOPUS Times Cited 28] [23] S. Karaman, E. Frazzoli, "Incremental sampling-based algorithms for optimal motion planning", in proceedings of Robotics: Science and Systems (RSS), 2010. [24] S. Karaman, E. Frazzoli, "Incremental sampling-based algorithms for motion planning", 2010. [Online] Available: Temporary on-line reference link removed - see the PDF document [25] D. Grune, C. J. H. Jacobs, "Parsing techniques- a practical guide", Springer, pp. 5-60, 2008, ISBN: 978-0387202488. [26] Andrew H. Wallace, "An Introduction to Algebraic Topology", Dover Books on Mathematics, Dover Publications, pp. 50-54, 2007, ISBN: 978-0486457864 [27] R. Gayle, A. Sud, M. C. Lin, D. Manocha, "Reactive deformation roadmaps: motion planning of multiple robots in dynamic environments", in proceedings of the IEEE/RSJ International Conference on Robots and Systems (IROS), 2007, [CrossRef] [SCOPUS Times Cited 44] [28] M. Pomarlan, I. A. Sucan, "Motion planning for manipulators in dynamically changing environments using real-time mapping of free space", in proceedings of the 14th IEEE International Symposium on Computational Intelligence and Informatics (CINTI), 2013, [CrossRef] [SCOPUS Times Cited 10] [29] M. Lahijanian, J. Wasniewski, S. B. Andersson, C. Belta, "Motion planning and control from temporal logic specifications with probabilistic satisfaction guarantees", in proceedings of IEEE International Conference on Robotics and Automation (ICRA), 2010, [CrossRef] [Web of Science Times Cited 56] [SCOPUS Times Cited 78] [30] I. Cizelj, C. Belta, "Control of noisy differential-drive vehicles from time-bounded temporal logic specifications", CoRR, abs/1209.1139, 2012, [CrossRef] [SCOPUS Times Cited 4] Web of Science® Citations for all references: 5,705 TCR SCOPUS® Citations for all references: 13,641 TCR Web of Science® Average Citations per reference: 184 ACR SCOPUS® Average Citations per reference: 440 ACR TCR = Total Citations for References / ACR = Average Citations per Reference We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more Citations for references updated on 2024-12-21 14:36 in 149 seconds. Note1: Web of Science® is a registered trademark of Clarivate Analytics. Note2: SCOPUS® is a registered trademark of Elsevier B.V. Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site. |
Copyright ©2001-2024
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.
