Main page | Publications | A*-based path planning algorithm for swarm robotics

A*-based path planning algorithm for swarm robotics

Authors

Izhboldina V.V., Usina E.E., Vatamaniuk I.V.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2020. Vol. 12336 LNAI.

Brief description

Currently path planning for a swarm of mobile robots is a relevant problem in the domain of robotics. Various approaches to its solution exist. One of such approaches comprises different methods of informed sampling, which boost the search process through direction of search frontier towards the target. This paper presents combination of such method with the simplified representation of the operational environment, specifically, cellular decomposition. The proposed method ensures transition of a robot swarm into the predefined formation in such manner, that during robot motion along the planned paths no collisions occurred. The experimentation was performed with groups of 5, 10, 15, 20, 25 and 30 robots in three different scenes. Upon experimentation it was revealed, that for a swarm of 30 robots in a complex scene the path computing time does not exceed 7 s.

Ключевые слова

Group control; Mobile robots; Path planning; Route map; Swarm robotics

Izhboldina V.V., Usina E.E., Vatamaniuk I.V. A*-based path planning algorithm for swarm robotics // Lecture Notes in Computer Science. 2020. Vol. 12336 LNAI. P. 107-115. DOI 10.1007/978-3-030-60337-3_11.