Abstract

This paper addresses a collision avoidance problem in a multi-robot system. Each robot has a set of possible trajectories, each trajectory fulfilling its individual task. The trajectories consist of sequences of regions to be followed, and the time for moving inside each region is known. The problem is to avoid inter-robot collisions by imposing initial time delays for each trajectory. Two solutions are developed, depending on the possibility of imposing a certain trajectory from the available set of paths for each robot. The solutions have the form of mixed integer linear programming optimizations that return the initial time delays and, when necessary, the chosen trajectory for each robot. Finally, we perform a statistical study on the proposed solutions and we conclude that one formulation is preferable to the others.

Full Text
Paper version not known

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.