Rigorous movement of convex polygons on a path using multiple robots.
Pierre ChamounMark LanthierPublished in: ROSE (2012)
Keyphrases
- multiple robots
- path planning algorithm
- path planning
- minkowski sum
- convex hull
- multi robot
- digital convexity
- autonomous robots
- collision free
- mobile robot
- collision avoidance
- multi robot exploration
- optimal path
- ant colony
- software agents
- multiple targets
- autonomous navigation
- topological map
- path finding
- real time
- motion planning
- robotic systems
- degrees of freedom
- dynamic environments
- image sequences