Abstract
This paper presents the design of an offline collision-free path planning algorithm for multiple mobile robots travelling simultaneously on a 2D gridded map. We first solved this problem by extending the traditional A* algorithm into 3D, namely two spatial and one time dimensions. This 3D approach is proved computationally costly and this led to the development of a novel and faster Spatio-Temporal (S-T) A* algorithm. This is a modified A* algorithm, which uses discrete time stamps and a temporal occupancy table to communicate previously planned routes and potential collision among robots. We further adapted the S-T A* algorithm to allow robots to stop and wait near nodes where potential collision is detected in order to increase their probability of finding a viable path to their destination. Using a time-based objective function that requires all robots in the environment to reach their respective destination in the shortest possible time, this decoupled planning strategy was done using a fixed priority based on the slowest robot first. Another variant using an adaptive priority scheme was then introduced to improve the success rate of finding a viable path for all robots as the number of robots in the fixed-sized environment increased. We present experimental results comparing the performance of the various path planning and priority schemes.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Svestka, P., Overmars, M.: Coordinated path planning for multiple robots. Robotics and Autonomous Systems 23(3), 125–152 (1998)
Guo, Y., Parker, L.E.: A Distributed and Optimal Motion Planning Approach for Multiple Mobile Robots. In: Proceedings of the 2002 IEEE International Conference on Robotics & Automation, pp. 2612–2619 (2002)
Lee, B.H.: Collision-Free Motion Planning of Two Robots. IEEE Transactions on Systems, Man, and Cybernetics 17(1), 21–32 (1987)
Ji, S.H., Choi, J.S., Lee, B.H.: A Computational Interactive Approach to Multi-agent Motion Planning. International Journal of Control, Automation, and Systems 5(3), 295–306 (2007)
Parker, L.E.: Path Planning and Motion Coordination in Multiple Mobile Robot Teams. In: Encyclopedia of Complexity and System Science. Springer, Heidelberg (2009)
Wang, K.H.C., Botea, A.: Tractable Multi-Agent Path Planning on Grid Maps. In: Proceedings of the 21st International Joint Conference on Artificial intelligence, pp. 1870–1875 (2009)
van den Berg, J., Lin, M., Manocha, D.: Reciprocal Velocity Obstacles for Real-Time Multi-Robot Navigation. In: IEEE International Conference on Robotics and Automation, pp. 1928–1935 (2008)
Snape, J., van den Berg, J., Guy, S.J., Manocha, D.: Independent Navigation of Multiple Mobile Robots with Hybrid Reciprocal Velocity Obstacles. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 5917–5922 (2009)
Silver, D.: Cooperative Pathfinding. In: AIIDE, pp. 117–122 (2005)
ter Mors, A.W., Witteveen, C., Zutt, J., Kuipers, F.A.: Context-Aware Route Planning. In: Dix, J., Witteveen, C. (eds.) MATES 2010. LNCS, vol. 6251, pp. 138–149. Springer, Heidelberg (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, W., Goh, WB. (2012). Multi-robot Path Planning with the Spatio-Temporal A* Algorithm and Its Variants. In: Dechesne, F., Hattori, H., ter Mors, A., Such, J.M., Weyns, D., Dignum, F. (eds) Advanced Agent Technology. AAMAS 2011. Lecture Notes in Computer Science(), vol 7068. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27216-5_22
Download citation
DOI: https://doi.org/10.1007/978-3-642-27216-5_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27215-8
Online ISBN: 978-3-642-27216-5
eBook Packages: Computer ScienceComputer Science (R0)