Multiple path coordination for mobile robots: a geometric algorithm

Authors:
S. Leroy;J. P. Laumond;T. Simeon
Affiliations:
LAAS, CNRS, Toulouse Cedex 4, France;LAAS, CNRS, Toulouse Cedex 4, France;LAAS, CNRS, Toulouse Cedex 4, France
Venue:
IJCAI'99 Proceedings of the 16th international joint conference on Artificial intelligence - Volume 2
Year:
1999

Citing 5
Cited 9

Toward efficient trajectory planning: the path-velocity decomposition

International Journal of Robotics Research
Social potential fields: a distributed behavioral control for autonomous robots

WAFR Proceedings of the workshop on Algorithmic foundations of robotics
Robot Motion Planning

Robot Motion Planning
Cooperative Mobile Robotics: Antecedents and Directions

Autonomous Robots
Feasible Trajectories for Mobile Robots with Kinematic and Environment Constraints

Intelligent Autonomous Systems, An International Conference

Multiple-Robot Motion Planning = Parallel Processing + Geometry

Revised Papers from the International Workshop on Sensor Based Intelligent Robots
Constraint-Based Optimization of Priority Schemes for Decoupled Path Planning Techniques

KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Real-Time Path Planning and Navigation for Multi-agent and Crowd Simulations

Motion in Games
On the Generation of Trajectories for Multiple UAVs in Environments with Obstacles

Journal of Intelligent and Robotic Systems
Multi-robot coordination using generalized social potential fields

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Parameterized collision region for centralized motion planning of multiagents along specified paths

Robotica
An optimal algorithm for two robots path planning problem on the grid

Robotics and Autonomous Systems
Multi-Level Planning for Semi-autonomous Vehicles in Traffic Scenarios Based on Separation Maximization

Journal of Intelligent and Robotic Systems
k-color multi-robot motion planning

International Journal of Robotics Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a geometric based approach for multiple mobile robot motion coordination. All the robot paths being computed independently, we address the problem of coordinating the motion of the robots along their own path in such a way they do not collide each other. The proposed algorithm is based on a bounding box representation of the obstacles in the so-called coordination diagram. The algorithm is resolution-complete. Its efficiency is illustrated by examples involving more than 100 robots.