Learning dimensional descent for optimal motion planning in high-dimensional spaces

Proceedings of the National Conference on Artificial Intelligence

Volumn 2, Issue , 2011, Pages 1126-1132

  Vernaza, Paul ^a   Lee, Daniel D ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Holonomic motion planning; Motion and path planning; Optimal control; Robot arm planning; Robotics; Subspace representations

Indexed keywords

HOLONOMIC MOTION PLANNING; OPTIMAL CONTROL; PATH-PLANNING; ROBOT ARM PLANNING; SUBSPACE REPRESENTATION;

ARTIFICIAL INTELLIGENCE; MOTION PLANNING; OPTIMIZATION; PROFITABILITY;

ROBOT PROGRAMMING;

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

References (17)

1. Arnold, V. I. 1989. Mathematical Methods of Classical Mechanics. Springer-Verlag.
2. Barraquand, J., and Ferbach, P. 1994. Path planning through variational dynamic programming. In IEEE International Conference on Robotics and Automation, 1839-1846. IEEE.
3. Berenson, D.; Srinivasa, S.; Ferguson, D.; Collet, A.; and Kuffner, J. 2009. Manipulation planning with workspace goal regions. In ICRA, 618-624. IEEE.
4. Brock, O., and Kavraki, L. 2001. Decomposition-based motion planning: a framework for real-time motion planning in high-dimensional configuration spaces. In ICRA.
5. Dalibard, S., and Laumond, J. 2009. Control of probabilistic diffusion in motion planning. Algorithmic Foundation of Robotics VIII 467-481.
6. Diankov, R.; Ratliff, N.; Ferguson, D.; Srinivasa, S.; and Kuffner, J. 2008. Bispace planning: Concurrent multi-space exploration. RSS.
7. Hsu, D.; Latombe, J.-C.; and Motwani, R. 1999. Path planning in expansive configuration spaces. International Journal Computational Geometry & Applications 4:495-512.
8. Karaman, S., and Frazzoli, E. 2010. Incremental sampling-based algorithms for optimal motion planning. In RSS.
9. Kavraki, L.; Svestka, P.; Latombe, J.-C.; and Overmars, M. 1996. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation.
10. Kuffner, J., and LaValle, S. 2000. RRT-connect: An efficient approach to single-query path planning. In ICRA.
11. Likhachev, M., and Stentz, A. 2008. R*search. In AAAI.
12. Likhachev, M.; Gordon, G.; and Thrun, S. 2004. ARA*: Anytime A*with provable bounds on sub-optimality. In NIPS.
13. Sánchez, G., and Latombe, J.-C. 2001. A single-query bi-directional probabilistic roadmap planner with lazy collision checking. In Proceedings International Symposium on Robotics Research.
14. Sethian, J. A. 1996. A fast marching level set method for monotonically advancing fronts. PNAS 93(4):1591-1595. (Pubitemid 26075170)
15. Shkolnik, A., and Tedrake, R. 2009. Path planning in 1000+ dimensions using a task-space Voronoi bias. In ICRA.
16. Sucan, I. A., and Kavraki, L. E. 2008. Kinodynamic motion planning by interior-exterior cell exploration. In WAFR.
17. Vernaza, P., and Lee, D. D. 2011. Efficient dynamic programming for high-dimensional, optimal motion planning by spectral learning of approximate value function symmetries. In ICRA.