Abstract
This paper considers the problem of path planning for teams of mobile robots. It investigates two decoupled and prioritized approaches to coordinate the movements of the mobile robots in their environment. The first approach considered is the coordination technique. The second approach is an A*-based path planning technique which computes the paths for the individual robots in the configuration time-space. Thereby it trades off the distance to both to static objects as well as to other robots and the length of the path to be traveled. In different experiments carried out with real robots and in simulations we demonstrate that the A*-based approach is well suited to control the motions of a team of robots in various environments and illustrate its advantages over the coordination technique.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
K. Azarm and Günther 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 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.
M. Erdmann and T. Lozano-Perez. On multiple moving objects. Algorithmica, 2: 477–521, 1987.
J.C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991. ISBN 0–7923–9206–X.
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. R 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.
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.
R A. O’Donnell and T. Lozano-Perez. Deadlock-free and collision-free coordination of two robot manipulators. In Proc. of the IEEE International Conference on Robotics & Automation (ICRA), 1989.
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.
R. 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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bennewitz, M., Burgard, W. (2000). An Experimental Comparison of Path Planning Techniques for Teams of Mobile Robots. In: Dillmann, R., Wörn, H., von Ehr, M. (eds) Autonome Mobile Systeme 2000. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-59576-9_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-59576-9_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41214-4
Online ISBN: 978-3-642-59576-9
eBook Packages: Springer Book Archive