Control of probabilistic diffusion in motion planning

Springer Tracts in Advanced Robotics

Volumn 57, Issue , 2010, Pages 467-481

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

^a UNIVERSITÉ DE TOULOUSE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIGURATION SPACE; DIFFUSION ALGORITHM; FREE SPACE; MOTION PLANNING ALGORITHMS;

ALGORITHMS; DIFFUSION; NAVIGATION; ROBOTICS; ROBOTS;

MOTION PLANNING;

EID: 77949871461     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-642-00312-7_29     Document Type: Conference Paper

References (21)

1. Choset, H., Lynch, K., Hutchinson, S., Kantor, G., Burgard, W., Kavraki, L., Thrun, S.: Principles of Robot Motion: theory, algorithms, and implementation. MIT Press, Cambridge (2005)
2. Cortes, J., Simeon, T., Laumond, J.: A random loop generator for planning the motions of closed kinematic chains using PRM methods. In: IEEE International Conference on Robotics and Automation, ICRA 2002. Proceedings, vol. 2 (2002)
3. Erdogmus, D., Rao, Y.N., Peddaneni, H., Hegde, A., Principe, J.C.: Recursive principal components analysis using eigenvector matrix perturbation. EURASIP Journal on Applied Signal Processing 2004(13), 2034-2041 (2004)
4. Hotelling, H.: Analysis of a Complex of Statistical Variables into principal components. J. Ed Psychology 24, 417-441 (1933)
5. Hsu, D., Latombe, J., Motwani, R.: Path planning in expansive configuration spaces. Int. J. Computational Geometry & Applications 9(4-5), 495-512 (1999)
6. Jolliffe, I.T.: Principal Component Analysis. Springer, Heidelberg (2002)
7. Kavraki, L., Kolountzakis, M., Latombe, J.: Analysis of probabilistic roadmaps for path planning. IEEE Transactions on Robotics and Automation 14(1), 166-171 (1998)
8. Kavraki, L., Svestka, P., Latombe, J., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566-580 (1996)
9. Kuffner, J., LaValle, S.: RRT-connect: An efficient approach to single-query path planning. In: Proc. IEEE Int'l Conf. on Robotics and Automation (ICRA 2000), San Francisco, CA (April 2000)
10. Latombe, J.: Robot Motion Planning. Kluwer Academic Publishers, Dordrecht (1991)
11. Laumond, J., Simeon, T.: Notes on Visibility Roadmaps and Path Planning. In: Algorithmic and Computational Robotics: New Directions: the Fourth Workshop on the Algorithmic Foundations of Robotics (2001)
12. LaValle, S.M.: Rapidly-exploring random trees: A new tool for path planning. Technical Report 98-11, Computer Science Dept., Iowa State University (October 1998)
13. LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006), http://planning.cs.uiuc.edu/
14. Pearson, K.: On lines and planes of closest fit to systems of points in space. Philosophical Magazine 2(6), 559-572 (1901)
15. Rodriguez, S., Tang, X., Lien, J., Amato, N.: An obstacle-based rapidly-exploring random tree. In: Proceedings 2006 IEEE International Conference on Robotics and Automation, ICRA 2006, pp. 895-900 (2006)
16. Roweis, S.T., Saul, L.K.: Nonlinear Dimensionality Reduction by Locally Linear Embedding. Science 290(5500), 2323-2326 (2000)
17. Siméon, T., Laumond, J., Nissoux, C.:Visibility-based probabilistic roadmaps for motion planning. Advanced Robotics 14(6), 477-493 (2000)
18. Tenenbaum, J.B., Silva, V.d., Langford, J.C.: A Global Geometric Framework for Nonlinear Dimensionality Reduction. Science 290(5500), 2319-2323 (2000)
19. Teodoro, M.L., George, J., Phillips, N., Kavraki, L.E.: A dimensionality reduction approach to modeling protein flexibility. In: RECOMB 2002: Proceedings of the sixth annual international conference on Computational biology, pp. 299-308. ACM Press, New York (2002)
20. Yershova, A., Jaillet, L., Simeon, T., LaValle, S.: Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain. In: Proceedings of the 2005 IEEE International Conference on Robotics and Automation, pp. 3856-3861 (2005)
21. Zwald, L., Blanchard, G.: On the convergence of eigenspaces in kernel principal component analysis. In: Neural Information Processing Systems (2005)