An information theoretic based integer linear programming approach for the discrete search path planning problem.
Jean BergerNassirou LoAbdeslem BoukhtoutaMartin NoëlPublished in: Optim. Lett. (2015)
Keyphrases
- information theoretic
- path planning
- integer linear programming
- mutual information
- information theory
- mobile robot
- theoretic framework
- path planning algorithm
- path finding
- dynamic environments
- search algorithm
- collision avoidance
- symmetry breaking
- multi robot
- obstacle avoidance
- potential field
- information theoretic measures
- dead ends
- jensen shannon divergence
- motion planning
- robot path planning
- information bottleneck
- optimal path
- autonomous vehicles
- dynamic and uncertain environments
- multiple robots
- collision free
- search space
- configuration space
- column generation
- search strategies
- aerial vehicles
- search methods
- lower bound