CHOMP: Gradient optimization techniques for efficient motion planning

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2009, Pages 489-494

  Ratliff, Nathan ^a   Zucker, Matt ^a   Andrew Bagnell, J ^a   Srinivasa, Siddhartha ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AGRICULTURAL ROBOTS; MOTION PLANNING; OPTIMIZATION; PLANNING; ROBOTICS;

GRADIENT OPTIMIZATION; HIGHER-ORDER DYNAMICS; MANIPULATION PLANNING; MOTION PLANNING ALGORITHMS; OPTIMIZATION TECHNIQUES; PATH OPTIMIZATIONS; REAL-WORLD PLANNING; TRAJECTORY GENERATION;

ROBOT PROGRAMMING;

EID: 85096785591     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2009.5152817     Document Type: Conference Paper

References (29)

1. S. Amari and H. Nagaoka. Methods of Information Geometry. Oxford University Press, 2000.
2. J. A. Bagnell and J. Schneider. Covariant policy search. In Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), August 2003.
3. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge University Press, 2004.
4. O. Brock and O. Khatib. Elastic Strips: A Framework for Motion Generation in Human Environments. The International Journal of Robotics Research, 21(12):1031, 2002.
5. P. Chen and Y. Hwang. SANDROS: a dynamic graph search algorithm for motion planning. Robotics and Automation, IEEE Transactions on, 14(3):390-403, 1998.
6. J. Chestnutt. Navigation Planning for Legged Robots. PhD thesis, Robotics Institute, Carnegie Mellon University, Pittsburgh, PA, December 2007.
7. R. Courant and D. Hilbert. Methods of Mathematical Physics. Interscience, 1953. Repulished by Wiley in 1989.
8. M. P. do Carmo. Differential geometry of curves and surfaces. Prentice-Hall, 1976.
9. M. Earl, R. Technol, B. Syst, and M. Burlington. Iterative MILP methods for vehicle-control problems. IEEE Transactions on Robotics, 21(6):1158-1167, 2005.
10. P. Felzenszwalb and D. Huttenlocher. Distance Transforms of Sampled Functions. Technical Report TR2004-1963, Cornell University, 2004.
11. R. Geraerts and M. Overmars. Creating High-quality Roadmaps for Motion Planning in Virtual Environments. IEEE/RSJ International Conference on Intelligent Robots and Systems, pages 4355-4361, 2006.
12. E. Hazan, A. Agarwal, and S. Kale. Logarithmic regret algorithms for online convex optimization. In In COLT, pages 499-513, 2006.
13. S. Kajita, F. Kanehiro, K. Kaneko, K. Fujiwara, K. Harada, K. Yokoi, and H. Hirukawa. Biped walking pattern generation by using preview control of zero-moment point. In IEEE International Conference on Robotics and Automation, 2003.
14. L. Kavraki and J. Latombe. Probabilistic roadmaps for robot path planning. Practical Motion Planning in Robotics: Current Approaches and Future Directions, 53, 1998.
15. L. Kavraki, P. Švestka, J. C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration space. IEEE Trans. on Robotics and Automation, 12(4):566-580, 1996.
16. J. Kuffner and S. LaValle. RRT-Connect: An efficient approach to single-query path planning. In IEEE International Conference on Robotics and Automation, pages 995-1001, San Francisco, CA, Apr. 2000.
17. C. Ma, R. Miller, N. Syst, and C. El Segundo. MILP optimal path planning for real-time applications. In American Control Conference, 2006, page 6, 2006.
18. R. M. Neal. Probabilistic Inference Using Markov Chain Monte Carlo Methods. Technical Report CRG-TR-93-1, University of Toronto, Dept. of Computer Science, 1993.
19. S. Quinlan. The Real-Time Modification of Collision-Free Paths. PhD thesis, Stanford University, 1994.
20. S. Quinlan and O. Khatib. Elastic bands: connecting path planning and control. In IEEE International Conference on Robotics and Automation, pages 802-807, 1993.
21. N. Ratliff, J. A. Bagnell, and M. Zinkevich. Maximum margin planning. In Twenty Second International Conference on Machine Learning (ICML06), 2006.
22. N. Ratliff, J. D. Bagnell, and M. Zinkevich. (online) subgradient methods for structured prediction. In Eleventh International Conference on Artificial Intelligence and Statistics (AIStats), March 2007.
23. N. Ratliff, D. Bradley, J. A. Bagnell, and J. Chestnutt. Boosting structured prediction for imitation learning. In NIPS, Vancouver, B.C., December 2006.
24. T. Schouwenaars, B. De Moor, E. Feron, and J. How. Mixed integer programming for multi-vehicle path planning. In European Control Conference, pages 2603-2608, 2001.
25. Z. Shiller and S. Dubowsky. On computing the global time-optimal motions of robotic manipulators in the presence of obstacles. IEEE Transactions on Robotics and Automation, 7(6):785-797, 1991.
26. S. Sundar, Z. Shiller, A. Inc, and C. Santa Clara. Optimal obstacle avoidance based on the Hamilton-Jacobi-Bellmanequation. Robotics and Automation, IEEE Transactions on, 13(2):305-310, 1997.
27. M. Vitus, V. Pradeep, G. Hoffmann, S. Waslander, and C. Tomlin. Tunnel-milp: Path planning with sequential convex polytopes. In AIAA Guidance, Navigation, and Control Conference, 2008.
28. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In In Proceedings of the Twentieth International Conference on Machine Learning, pages 928-936, 2003.
29. M. Zlochin and Y. Baram. Manifold stochastic dynamics for bayesian learning. Neural Comput., 13(11):2549-2572, 2001.