Fast and Optimal Planner for the Discrete Grid-Based Coverage Path-Planning Problem.
Jaël Champagne GareauÉric BeaudryVladimir MakarenkovPublished in: IDEAL (2021)
Keyphrases
- path planning
- path planner
- optimal path
- mobile robot
- path finding
- path planning algorithm
- collision avoidance
- obstacle avoidance
- multi robot
- dynamic environments
- robot path planning
- motion planning
- indoor environments
- degrees of freedom
- initially unknown
- collision free
- potential field
- dynamic and uncertain environments
- cellular automata
- search and rescue
- dynamic programming
- trajectory planning
- navigation tasks
- landmark recognition
- autonomous navigation
- route planning
- multiple robots
- planning domains
- domain independent
- shortest path
- dead ends
- evolutionary algorithm