Shortest distance problems in graphs using history-dependent transition costs with application to kinodynamic path planning.
Raghvendra V. CowlagiPanagiotis TsiotrasPublished in: ACC (2009)
Keyphrases
- path planning
- mobile robot
- collision avoidance
- obstacle avoidance
- path finding
- motion planning
- multi robot
- dynamic environments
- optimization problems
- shortest distance
- dynamic and uncertain environments
- shortest path
- path planning algorithm
- aerial vehicles
- robot path planning
- directed graph
- optimal path
- computer vision
- autonomous vehicles
- configuration space
- multiple robots
- dead ends