Abstract

- This paper addresses path planning algorithms for a multi-robot system based on the Visibility Graph (VG) method.VG has been selected because it produces solutions with optimal path lengths from a start position to a target. However, the main disadvantages of VG are: (1) it plans paths which may go through the vertices of obstacles; (2) the computation time increases with the increased number of obstacles. Therefore, two new algorithms have been developed: Central Algorithm (CA) and its associate, Optimisation Central Algorithm (OCA). Simulation results show that the proposed algorithms can find optimal paths in 2D environments.

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 call

Disclaimer: 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.