R* Search

Proceedings of the National Conference on Artificial Intelligence

Volumn 1, Issue , 2008, Pages 344-350

  Likhachev, Maxim ^a   Stentz, Anthony ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC FUNCTIONS; HEURISTIC SEARCHES; LARGE COMPLEX PROBLEMS; LOCAL MINIMUMS; OPTIMALITY; PLANNING PROBLEMS; PROBABILISTIC GUARANTEES; TRADING OFFS;

ARTIFICIAL INTELLIGENCE; BIONICS; FUNCTIONS; HEURISTIC ALGORITHMS; PROBABILITY DENSITY FUNCTION;

HEURISTIC METHODS;

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

References (16)

1. Burfoot, D.; Pineau, J.; and Dudek, G. 2006. RRT-plan: a randomized algorithm for strips planning. In Proceedings of the National Conference on Artificial Intelligence (AAAI).
2. Diankov, R., and Kuffner, J. 2007. Randomized statistical path planning. In Proceedings of IEEE/RSJ 2007 International Conference on Robots and Systems (IROS).
3. Ferguson, D., and Stentz, A. 2006. Anytime RRTs. In Proceedings of the International Conference on Intelligent Robots and Systems (IROS).
4. Furcy, D. 2004. Chapter 5 of Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search. Ph.D. Dissertation, Georgia Institute of Technology.
5. Gaschnig, J. 1979. Performance measurement and analysis of certain search algorithms. Tech. Rep. CMU-CS-79-124, Carnegie Mellon University.
6. Kavraki, L.; Svestka, P.; Latombe, J.-C; and Overmars, M. H. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4):566-580.
7. Kuffner, J., and LaValle, S. 2000. RRT-connect: An efficient approach to single-query path planning. In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA).
8. Likhachev, M., and Ferguson, D. 2008. Planning long dynamically-feasible maneuvers for autonomous vehicles. In Proceedings of Robotics: Science and Systems (RSS).
9. Likhachev, M., and Stentz, A. 2008. R* search: The proofs. Tech. Rep., University of Pennsylvania, Philadelphia, PA.
10. Likhachev, M.; Gordon, G.; and Thrun, S. 2003. ARA*: Anytime A* with provable bounds on sub-optimality. In Advances in Neural Information Processing Systems (NIPS) 16. Cambridge, MA: MIT Press.
11. Morgan, S. 2004. Sampling-based planning for discrete spaces. Ph.D. Dissertation, Case Western Reserve University.
12. Pearl, J. 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley.
13. Pohl, I. 1977. Practical and theoretical considerations in heuristic search algorithms. In Elcock, E. W., and Michie, D., eds., Machine Intelligence 8, 55-72. New York: Wiley.
14. Rabin, S. 2000. A* speed optimizations. In DeLoura, M., ed., Game Programming Gems, 272-287. Rockland, MA: Charles River Media.
15. Zhou, R., and Hansen, E. A. 2002. Multiple sequence alignment using A*. In Proceedings of the National Conference on Artificial Intelligence (AAAI). Student abstract.
16. Zhou, R., and Hansen, E. A. 2005. Beam-stack search: Integrating backtracking with beam search. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS), 90-98.