DDM*: Fast Near-Optimal Multi-Robot Path Planning using Diversified-Path and Optimal Sub-Problem Solution Database Heuristics.
Shuai D. HanJingjin YuPublished in: CoRR (2019)
Keyphrases
- robot path planning
- database
- optimal solution
- optimal path
- path planner
- greedy heuristic
- finding the optimal solution
- closed form
- minimum cost
- optimal or near optimal
- np hard
- path planning
- solution path
- dynamic programming
- route planning
- optimal control
- shortest path
- spatial reasoning
- data management
- search algorithm
- real world