A collision checker for car-like robots coordination
- 27 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 46-51 vol.1
- https://doi.org/10.1109/robot.1998.676252
Abstract
The paper presents a geometric algorithm dealing with collision checking in the framework of multiple mobile robot coordination. We consider that several mobile robots have planned their own collision-free path by taking into account the obstacles, but ignoring the presence of other robots. We first compute the domain swept by each robot when moving along its path - such a domain is called a trace. Then the algorithm computes the coordination configurations for one robot with respect to the others, i.e. the configurations along the path where the robot enters the traces of the other robots or exits from them. This information may be exploited to coordinate the motions of all the robots.Keywords
This publication has 6 references indexed in Scilit:
- Collision detection algorithms for motion planningPublished by Springer Nature ,2005
- Using skeletons for nonholonomic path planning among obstaclesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Coordinated motion planning for multiple car-like robots using probabilistic roadmapsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A motion planner for nonholonomic mobile robotsIEEE Transactions on Robotics and Automation, 1994
- Optimal paths for a car that goes both forwards and backwardsPacific Journal of Mathematics, 1990
- Reducing Multiple Object Motion Planning to Graph SearchingSIAM Journal on Computing, 1986