Abstract
Coordinating the motion of multiple mobile robots is one of the fundamental problems in robotics. The predominant algorithms for coordinating teams of robots are decoupled and prioritized, thereby avoiding combinatorially hard planning problems typically faced by centralized approaches. While these methods are very efficient, they have two major drawbacks. First, they are incomplete, i.e. they sometimes fail to find a solution even if one exists, and second, the resulting solutions are often not optimal. In this paper we present a method for finding and optimizing priority schemes for such prioritized and decoupled planning techniques. Existing approaches apply a single priority scheme which makes them overly prone to failure in cases where valid solutions exist. By searching in the space of priorization schemes, our approach overcomes this limitation. It performs a randomized search with hill-climbing to find solutions and to minimize the overall path length. To focus the search, our algorithm is guided by constraints generated from the task specification. To illustrate the appropriateness of this approach, this paper discusses experimental results obtained with real robots and through systematic robot simulation. The experimental results illustrate the superior performance of our approach, both in terms of efficiency of robot motion and in the ability to find valid plans.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Reference
K. Azarm and G. Schmidt. A decentralized approach for the conflict-free motion of multiple mobile robots. In Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages 1667–1674, 1996.
J. Barraquand, B. Langois, and J. C. Latombe. Numerical potential field techniques for robot path planning. IEEE Transactions on Robotics and Automation, Man and Cybernetics, 22(2):224–241, 1992.
J. Barraquand and J. C. Latombe. A monte-carlo algorithm for path planning with many degrees of freedom. In Proc. of the IEEE International Conference on Robotics & Automation (ICRA), 1990.
Z. Bien and J. Lee. A minimum-time trajectory planning method for two robots. IEEE Transactions on Robotics and Automation, 8(3):414–418, 1992.
S. J. Buckley. Fast motion planning for multiple moving robots. In Proc. of the IEEE International Conference on Robotics & Automation (ICRA), 1989.
C. Chang, M. J. Chung, and B. H. Lee. Collision avoidance of two robot manipulators by minimum delay time. IEEE Transactions on Robotics and Automation, Man and Cybernetics, 24(3):517–522, 1994.
M. Erdmann and T. Lozano-Perez. On multiple moving objects. Algorithmica, 2:477–521, 1987.
C. Ferrari, E. Pagello, J. Ota, and T. Arai. Multirobot motion coordination in space and time. Robotics and Autonomous Systems, 25:219–229, 1998.
L. Kavraki, P. Svestka, J. C. Latombe, and M. Overmars. Probabilistic road maps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, pages 566–580, 1996.
J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991. ISBN 0-7923-9206-X.
S. M. LaValle and S. A. Hutchinson. Optimal motion planning for multiple robots having independent goals. In Proc. of the IEEE International Conference on Robotics &Automation (ICRA), 1996.
E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys. Sequencing and scheduling: Algorithms and complexity. Technical report, Centre for Mathematics and Computer Science, 1989.
S. Leroy, J. P. Laumond, and T. Simeon. Multiple path coordination for mobile robots: A geometric algorithm. In Proc. of the International Joint Conference on Artificial Intelligence (IJCAI), 1999.
P. Martin and D.B. Shmoys. A new approach to computing optimal schedules for the jobshop scheduling problem. In Proc. of the 5th International IPCO Conference, pages 389–403, 1996.
H.P. Moravec and A.E. Elfes. High resolution maps from wide angle sonar. In Proc. IEEE Int. Conf. Robotics and Automation, pages 116–121, 1985.
N. J. Nilsson. Principles of Artificial Intelligence. Springer Publisher, Berlin, New York, 1982.
P. A. O’Donnell and T. L ozano-Perez. Deadlock-free and collision-free coordination of two robot manipulators. In Proc. of the IEEE International Conference on Robotics&Automation (ICRA), 1989.
B. Selman, H. Levesque, and D. Mitchell. A new method for solving hard instances of satisfiability. In Proc. of the National Conference on Artificial Intelligence (AAAI), 1992.
P. Sveska and M. Overmars. Coordinated motion planning for multiple car-like robots using probabilistic roadmaps. In Proc. of the IEEE International Conference on Robotics & Automation (ICRA), 1995.
P. Tournassoud. A strategy for obstacle avoidence and its application to multi-robot systems. In Proc. of the IEEE International Conference on Robotics & Automation (ICRA), pages 1224–1229, 1986.
C. Warren. Multiple robot path coordination using artificial potential fields. In Proc. of the IEEE International Conference on Robotics & Automation (ICRA), pages 500–505, 1990.
S. Zilberstein and S. Russell. Approximate reasoning using anytime algorithms. In S. Natarajan, editor, Imprecise and Approximate Computation. Kluwer Academic Publishers, Dordrecht, 1995.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bennewitz, M., Burgard, W., Thrun, S. (2001). Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques. In: Baader, F., Brewka, G., Eiter, T. (eds) KI 2001: Advances in Artificial Intelligence. KI 2001. Lecture Notes in Computer Science(), vol 2174. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45422-5_7
Download citation
DOI: https://doi.org/10.1007/3-540-45422-5_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42612-7
Online ISBN: 978-3-540-45422-9
eBook Packages: Springer Book Archive