Use of relaxation methods in sampling-based algorithms for optimal motion planning

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2013, Pages 2421-2428

  Arslan, Oktay ^a   Tsiotras, Panagiotis ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC OPTIMALITY; ASYMPTOTICALLY OPTIMAL; HIGH-QUALITY SOLUTIONS; MOTION PLANNING PROBLEMS; OPTIMAL MOTION PLANNING; RELAXATION METHODS; SAMPLING-BASED ALGORITHMS; SAMPLING-BASED MOTION PLANNING;

GRAPH THEORY; MOTION PLANNING; OPTIMAL SYSTEMS; OPTIMIZATION; ROBOTICS; SAMPLING;

ALGORITHMS;

EID: 84887295192     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICRA.2013.6630906     Document Type: Conference Paper

References (16)

1. O. Arslan and P. Tsiotras. An efficient sampling-based algorithm for motion planning with optimality guarantees. Technical Report DCSL-12-09-010, Georgia Institute of Technology. School of Aerospace Engineering. September 2012.
2. D. P. Bertsekas and J. Tsitsiklis. Parallel and Distributed Computation: Numerical Methods. Athena Scientific. Belmont. Massachusetts. January 1997.
3. H. Choset. K. Lynch, S. Hutchinson, G. Kantor, W. Burgard. L. Kavraki. and S. Thrun. Principles of Robot Motion: Theory. Algorithms, and Implementations. The MIT Press, 2005.
4. T. H. Cormen.C E. Leiserson, R. L. Rivest.a nd C. Stein. Introduction to Algorithms. MIT Press and McGraw-Hill. Cambridge, MA, 2nd edition, 2001.
5. L. R. Ford. Network flow theory. Technical report. RAND Corporation. Santa Monica. CA, 1956.
6. M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery, 34(3):596-615. 1987.
7. S. Karaman and E. Frazzoli. Sampling-based motion planning with deterministic J.l-calculus specifications. In IEEE International Conference on Decision and Control. pages 2222-2229, 2009.
8. S. Karaman and E. Frazzoli. Sampling-based algorithms for optimal motion planning. International Journal of Robotics Research. 30(7):846-894. 2011.
9. S. Karaman.M.R. Walter.A Perez, E. Frazzoli, and S. Teller. Anytime motion planning using the rrt In Robotics and Automation (ICRA), 2011 IEEE International Conference on, pages 1478-1483. IEEE. 2011.
10. S. Koenig and M. Likhachev. D lite. In Eighteenth National Conference on ArtificialI ntelligence, pages 476-483.M enlo Park.C A, 2002. American Association for Artificial Intelligence.
11. S. Koenig. M. Likhachev. and D. Furcy. Lifelong planning A ArtijicialIntelligence Journal. 155(1-2):93-146.2004.
12. S. M. LaValle. Planning Algorithms. Cambridge University Press. 2006.
13. S. M. LaValle and J. J. Kuffner. Jr. Rapidly-exploring random trees: Progress and prospects. In B. R. Donald, K. Lynch. and D. Rus. editors, New Directions in Algorithmic and Computational Robotics, pages 293-308. 2001.
14. N. J. Nilsson. Problem Solving Methods in Artificial Intelligence. McGraw-Hill Inc.• 1971.
15. J. Pearl. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley Pub (Sd), 1984.
16. M. Rickert. O. Brock, and A. Knoll. Balancing exploration and exploitation in motion planning. In IEEE International Conference on Robotics and Automation. pages 2812-2817. 2008