A Tight Lower Bound for the Complexity of Path-Planning for a Disc.
Colm Ó'DúnlaingPublished in: Inf. Process. Lett. (1988)
Keyphrases
- path planning
- lower bound
- worst case
- upper bound
- mobile robot
- path planning algorithm
- obstacle avoidance
- dynamic environments
- collision avoidance
- motion planning
- multi robot
- indoor environments
- branch and bound algorithm
- degrees of freedom
- autonomous vehicles
- potential field
- robot path planning
- dynamic and uncertain environments
- optimal path
- np hard
- objective function
- path finding
- branch and bound
- optimal solution
- multiple robots
- unknown environments
- autonomous navigation
- trajectory planning
- search and rescue
- path planner
- landmark recognition
- navigation tasks
- collision free
- configuration space
- genetic algorithm
- multi agent systems
- pose estimation
- approximation algorithms