Path planning and optimization in the traveling salesman problem: Nearest neighbor vs. region-based strategies.
Jan Malte WienerNicole N. EhbauerHanspeter A. MallotPublished in: Spatial Cognition: Specialization and Integration (2005)
Keyphrases
- path planning
- traveling salesman problem
- nearest neighbor
- optimization problems
- combinatorial optimization
- mobile robot
- path planning algorithm
- collision avoidance
- dynamic environments
- ant colony optimization
- obstacle avoidance
- knn
- hamiltonian cycle
- dynamic and uncertain environments
- multi robot
- autonomous vehicles
- robot path planning
- metaheuristic
- evolutionary algorithm
- traveling salesman
- high dimensional
- motion planning
- optimal path
- vehicle routing problem
- global optimization
- potential field
- knapsack problem
- multiple robots
- nearest neighbor search
- configuration space
- collision free
- branch and bound
- branch and bound algorithm
- distance function
- simulated annealing
- genetic local search
- image segmentation