Informative path planning as a maximum traveling salesman problem with submodular rewards.
Syed Talha JawaidStephen L. SmithPublished in: Discret. Appl. Math. (2015)
Keyphrases
- path planning
- traveling salesman problem
- path planning algorithm
- mobile robot
- ant colony optimization
- combinatorial optimization
- dynamic environments
- obstacle avoidance
- motion planning
- optimization problems
- reinforcement learning
- collision avoidance
- optimal path
- multi robot
- valid inequalities
- traveling salesman
- dynamic and uncertain environments
- markov decision processes
- objective function
- collision free
- multiple robots
- potential field
- robot path planning
- degrees of freedom
- energy minimization
- autonomous vehicles
- path planner
- genetic local search
- neural network
- cost function
- hamiltonian cycle
- image segmentation
- aerial vehicles