Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic.
Karlijn FransenJoost van EekelenPublished in: Int. J. Prod. Res. (2023)
Keyphrases
- path planning
- path planning algorithm
- optimal path
- dynamic programming
- multi robot
- optimal solution
- path finding
- mobile robot
- search algorithm
- search strategy
- dynamic environments
- simulated annealing
- search space
- obstacle avoidance
- dead ends
- robot path planning
- heuristic function
- search procedure
- lower bound
- hill climbing
- collision avoidance
- multiple robots
- search and rescue
- objective function
- degrees of freedom
- ant colony optimization