Abstract
Collision avoidance is a fundamental problem in multi-robot motion planning, enabling robots to coordinate in a safe and efficient manner. In this paper, we introduce several best-known distributed collision avoidance algorithms and present the Voronoi-based method in detail, which assigns optimal dominance regions for robots using the Voronoi diagram, constrains robot motions within the buffered Voronoi diagram, and follows right-hand rule when deadlock happens during navigating to the goals. A series of simulations are conducted to demonstrate the efficacy of collision avoidance guarantee under robot localization uncertainty while avoiding deadlock using our presented algorithm. We claim that such a method is superior to most of the existing distribution methods in a known environment in efficiency of implementation.
Sign-in/Register to access full text options 
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.
