Abstract
Path planning is crucial in the scheduling and motion planning of multiple robots. However, solving multi-robot path-planning problems efficiently and quickly is challenging due to their high complexity and long computational time, especially when dealing with many robots. This paper presents a unified mathematical model and algorithm for the path planning of multiple robots moving from one formation to another in an area with obstacles. The problem was initially simplified by constructing a cost matrix, and then the route planning was achieved by integrating an elite enhanced multi-population genetic algorithm and an ant colony algorithm. The performance of the proposed planning method was verified through numerical simulations in various scenarios. The findings indicate that this method exhibits high computational efficiency and yields a minimal overall path distance when addressing the path-planning problem of a multi-robot formation reconstruction. As a result, it holds promising potential for the path-planning problem of a multi-robot formation reconstruction.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
