Anytime Dynamic A*: The Proofs
Tech. Report, CMU-RI-TR-05-12, Robotics Institute, Carnegie Mellon University, May, 2005
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.
BibTeX
@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},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.