AMRA*: Anytime Multi-Resolution Multi-Heuristic A*
Dhruv Mauria Saxena,Tushar Kusnur,Maxim Likhachev,Dhruv Mauria Saxena,Tushar Kusnur,Maxim Likhachev
Heuristic search-based motion planning algorithms typically discretise the search space in order to solve the shortest path problem. Their performance is closely related to this discretisation. A fine discretisation allows for better approximations of the continuous search space, but makes the search for a solution more computationally costly. A coarser resolution might allow the algorithms to fin...
