Abstract
This paper presents an optimal path finding algorithm for a group of robots. Presented approach is based on A* graph traversal algorithm and contains modifications that make it possible to apply strengths of an original algorithm to solve multi-robot path planning problem. Proposed modification is to dynamically change costs of nodes used in path of one robot while planning route for another. In another words to give the cost meaning of a time which robots need to wait to be able to take the node. Although presented approach was used to solve multi-robot path finding problem on unknown map it can be successfully applied to solve navigating problems of group of mobile agents on known maps. Computer simulation showed reliable results for maps of different configuration.
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
References
Hoy, M.: Methods for collision-free navigation of multiple mobile robots in unknown cluttered environments. arXiv preprint 1401.6775 (2014)
Sarid, S., Shapiro, A., Gabriely, Y.: MRBUG: a competitive multi-robot path finding algorithm. In: Proceedings 2007 IEEE International Conference on Robotics and Automation, pp. 877–882 (2007)
Hart, P., Nilsson, N., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybern. 4, 100–107 (1968)
Zhao, L., Wang, W.: A new path search algorithm for providing paths among multiple origins and one single destination. Int. J. Comput. Sci. Appl. 3, 29–33 (2014)
Botea, A., Müller, M., Schaeffer, J.: Near optimal hierarchical path-finding. J. Game Dev. 1, 7–28 (2004)
Gholami, M.R., Delshad, D.E.: Presenting a model for the affordable choice of wiring route in the electrical and telecommunications networks in the residential areas based on the artificial intelligence A-STAR algorithm. J. Am. Sci. 9, 189–191 (2013)
Pokorny, K.L., Ryan, E.V.: Multiple constraint satisfaction problems using the A-star (A*) search algorithm: classroom scheduling with preferences. J. Comput. Sci. Coll. 28, 152–159 (2013)
Vincke, S.: Real-time pathfinding for multiple objects. J. Game Dev. 6, 36–44 (1997)
Stout, B.: Smart moves: intelligent path-finding. J. Game Dev. 7, 28–35 (1997)
Ferguson, D., Likhachev, M., Stentz, A.: A guide to heuristic-based path planning. In: Proceedings of the Workshop on Planning under Uncertainty for Autonomous Systems. International Conference on Automated Planning and Scheduling (ICAPS), pp. 9–18 (2005)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Erokhin, A., Erokhin, V., Sotnikov, S., Gogolevsky, A. (2019). Optimal Multi-robot Path Finding Algorithm Based on A*. In: Silhavy, R., Silhavy, P., Prokopova, Z. (eds) Intelligent Systems in Cybernetics and Automation Control Theory. CoMeSySo 2018. Advances in Intelligent Systems and Computing, vol 860. Springer, Cham. https://doi.org/10.1007/978-3-030-00184-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-030-00184-1_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00183-4
Online ISBN: 978-3-030-00184-1
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)