Abstract:
This paper presents a thorough theoretical analysis of a recently developed anytime incremental planning algorithm called Anytime Dynamic A* (AD*). The analysis includes proofs for the correctness of the algorithm and as well as the proofs for several properties of the algorithm related to its efficiency.
copied = false, 2000);
">
@techreport{Likhachev-2005-9171,
author = {Maxim Likhachev And David Ferguson And Geoffrey Gordon And Anthony (Tony) Stentz And Sebastian Thrun},
title = {Anytime Dynamic A*: The Proofs},
year = {2005},
month = {May},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-05-12},
keywords = {search, planning, anytime planning, incremental planning, re-planning, anytime incremental planning},
}
author = {Maxim Likhachev And David Ferguson And Geoffrey Gordon And Anthony (Tony) Stentz And Sebastian Thrun},
title = {Anytime Dynamic A*: The Proofs},
year = {2005},
month = {May},
institute = {Carnegie Mellon University},
address = {Pittsburgh, PA},
number = {CMU-RI-TR-05-12},
keywords = {search, planning, anytime planning, incremental planning, re-planning, anytime incremental planning},
}