ARA*: Anytime A* with provable bounds on sub-optimality

Advances in Neural Information Processing Systems

Volumn , Issue , 2004, Pages

  Likhachev, Maxim ^a   Gordon, Geoff ^a   Thrun, Sebastian ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME HEURISTIC SEARCHES; DYNAMIC PATH PLANNING; FEASIBLE SOLUTION; OPTIMAL SOLUTIONS; PERFORMANCE BOUNDS; REAL-WORLD PLANNING PROBLEM; SIMULATED ROBOT; SUBOPTIMAL SOLUTION;

HEURISTIC ALGORITHMS;

EID: 80052250542     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. B. Bonet and H. Geffner. Planning as heuristic search. Artificial Intelligence, 129(1- 2):5-33, 2001.
2. T. L. Dean and M. Boddy. An analysis of time-dependent planning. In Proc. of the National Conference on Artificial Intelligence (AAAI), 1988.
3. D. Haehnel. Personal communication, 2003.
4. S. Koenig and M. Likhachev. Incremental A*. In Advances in Neural Information Processing Systems (NIPS) 14. Cambridge, MA: MIT Press, 2002.
5. R. E. Korf. Linear-space best-first search. Artificial Intelligence, 62:41-78, 1993.
6. M. Likhachev, G. Gordon, and S. Thrun. ARA*: Formal Analysis. Tech. Rep. CMUCS- 03-148, Carnegie Mellon University, Pittsburgh, PA, 2003.
7. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, 1984.
8. R. Zhou and E. A. Hansen. Multiple sequence alignment using A*. In Proc. of the National Conference on Artificial Intelligence (AAAI), 2002. Student abstract.
9. S. Zilberstein and S. Russell. Approximate reasoning using anytime algorithms. In Imprecise and Approximate Computation. Kluwer Academic Publishers, 1995.