Linear dimensionality reduction in random motion planning

International Journal of Robotics Research

Volumn 30, Issue 12, 2011, Pages 1461-1476

  Dalibard, Sébastien ^a   Laumond, Jean Paul ^a  

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

computer animation; dimensionality reduction; Motion planning; principal component analysis

Indexed keywords

COMPUTER ANIMATION; CONFIGURATION SPACE; DIMENSIONALITY REDUCTION; FREE SPACE; HIGH-DIMENSIONAL; LINEAR DIMENSIONALITY REDUCTION; MOTION PLANNERS; MOTION PLANNING ALGORITHMS; PRINCIPAL COMPONENTS; RANDOM SAMPLING;

ALGORITHMS; ANIMATION; PRINCIPAL COMPONENT ANALYSIS;

MOTION PLANNING;

EID: 80054734758     PISSN: 02783649     EISSN: 17413176     Source Type: Journal    
DOI: 10.1177/0278364911403335     Document Type: Article

References (30)

1. Burns B, Brock O. Toward optimal configuration space sampling. Robotics: Science and Systems I. 2005 ;:
2. Choset H, Lynch KM, Hutchinson S, Kantor GA, Burgard W, Kavraki LE, et al Principles of Robot Motion: Theory, Algorithms, and Implementation. Cambridge, MA: MIT Press ; 2005 :
3. Cortes J, Simeon T, Laumond JP. A random loop generator for planning the motions of closed kinematic chains using PRM methods. Proceedings IEEE International Conference on Robotics and Automation, 2002 (ICRA'02) ; ;..
4. Dalibard S, Laumond JP. Control of probabilistic diffusion in motion planning. Algorithmic Foundation of Robotics VIII. 2009 ;: 467-481
5. Erdogmus D, Rao YN, Peddaneni H, Hegde A, Principe JC. Recursive principal components analysis using eigenvector matrix perturbation. EURASIP Journal on Applied Signal Processing. 2004 ; 13: 2034-2041
6. Ferre E, Laumond JP. An iterative diffusion algorithm for part disassembly. 2004 International Conference on Robotics and Automation (ICRA'2004) ; ;. 3149.
7. Geraerts R, Overmars MH. Sampling techniques for probabilistic roadmap planners. ; 2004 ; 2004..
8. Han L, Amato NM. A kinematics-based probabilistic roadmap method for closed chain systems. Algorithmic and Computational Robotics: New Directions. The Fourth Workshop on the Algorithmic Foundations of Robotics. 2000 ;: 233-245
9. Hotelling H. Analysis of a complex of statistical variables into principal components. Psychology. 1933 ; 24: 417-441
10. Hsu D, Latombe JC, Motwani R. Path planning in expansive configuration spaces. International Journal of Computational Geometry and Applications ; ;. 495.
11. Hsu D, Latombe JC, Kurniawati H. On the probabilistic foundations of probabilistic roadmap planning. The International Journal of Robotics Research. 2006 ; 25: 627
12. Jolliffe IT Principal Component Analysis. Berlin: Springer ; 2002 :
13. Kavraki LE, Svestka P, Latombe JC, Overmars MH. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation ; ;. 566.
14. Kavraki LE, Kolountzakis MN, Latombe JC. Analysis of probabilistic roadmaps for path planning. IEEE Transactions on Robotics and Automation. 1998 ; 14: 166-171 (Pubitemid 128742164)
15. Kuffner J, LaValle S. RRT-Connect: an efficient approach to single-query path planning. Proceedings IEEE International Conference on Robotics and Automation (ICRA'2000) ; San Francisco, CA ;..
16. Latombe JC Robot Motion Planning. Dordrecht: Kluwer Academic Publishers ; 1991 :
17. Laumond JP. Kineo CAM: a success story of motion planning algorithms. IEEE Robotics and Automation Magazine. 2006 ; 13 :
18. Laumond JP, Simeon T. Notes on visibility roadmaps and path planning. Algorithmic and Computational Robotics: New Directions: the Fourth Workshop on the Algorithmic Foundations of Robotics. 2001 ;:
19. LaValle SM Rapidly-Exploring Random Trees: A New Tool for Path Planning. Computer Science Department, Iowa State University ; 1998 :
20. LaValleSM (2006) Planning Algorithms. Cambridge: Cambridge University Press. Available at http://planning.cs.uiuc.edu/.
21. Pearson K. On lines and planes of closest fit to systems of points in space. Philosophical Magazine. 1901 ; 2: 559-572
22. Reeds JA, Shepp LA. Optimal paths for a car that goes both forwards and backwards. Pacific Journal of Mathematics. 1990 ; 145: 367-393
23. Rodriguez S, Tang X, Lien JM, Amato NM. An obstacle-based rapidly-exploring random tree. Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006 (ICRA 2006) ; ;. 895.
24. Roweis ST, Saul LK. Nonlinear dimensionality reduction by locally linear embedding. Science. 2000 ; 290: 2323-2326 (Pubitemid 32041578)
25. Schoelkopf B, Smola AJ, Mueller KR Advances in kernel methods. Cambridge, USA: MIT Press ; 1999: 327-352.
26. Siméon T, Laumond JP, Nissoux C. Visibility-based probabilistic roadmaps for motion planning. Advanced Robotics. 2000 ; 14: 477-493 (Pubitemid 32432058)
27. Tenenbaum JB, de Silva V, Langford JC. A global geometric framework for nonlinear dimensionality reduction. Science. 2000 ; 290: 2319-2323 (Pubitemid 32041577)
28. Teodoro ML, Phillips GN, Kavraki LE. A dimensionality reduction approach to modeling protein flexibility. RECOMB '02: Proceedings of the Sixth Annual International Conference on Computational Biology ; New York: ACM Press ;. 299.
29. Yershova A, Jaillet L, Simeon T, LaValle SM. Dynamic-domain RRTs: efficient exploration by controlling the sampling domain. Proceedings of the 2005 IEEE International Conference on Robotics and Automation ; 2005 ; 2005. 3856.
30. Zwald L, Blanchard G. On the convergence of eigenspaces in kernel principal component analysis. Neural Information Processing Systems. 2005 ;: