Mixed Integer Programming for Time-Optimal Multi-Robot Coverage Path Planning with Efficient Heuristics (Extended Abstract).
Jingtao TangHang MaPublished in: SOCS (2024)
Keyphrases
- extended abstract
- path planning
- mixed integer programming
- optimal path
- mobile robot
- path planning algorithm
- dynamic environments
- collision avoidance
- multi robot
- motion planning
- dynamic and uncertain environments
- dead ends
- column generation
- obstacle avoidance
- collision free
- multiple robots
- potential field
- aerial vehicles
- robot path planning
- genetic algorithm
- mixed integer
- autonomous vehicles
- dynamic programming
- heuristic search
- multistage
- worst case