Information Theoretic Construction of Probabilistic Roadmaps

IEEE International Conference on Intelligent Robots and Systems

Volumn 1, Issue , 2003, Pages 650-655

  Burns, Brendan ^a   Brock, Oliver ^a  

^a Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GUIDED APPROACHES; PROBABILISTIC ROADMAPS (PRM);

ALGORITHMS; COLLISION AVOIDANCE; COSTS; DEGREES OF FREEDOM (MECHANICS); GAIN MEASUREMENT; MAPS; ROADS AND STREETS; SET THEORY;

MOTION PLANNING;

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

References (12)

1. N. Amato, B. Bayazid, L. Dale, C. Jones, and D. Vallejo. OBPRM: An obstacle-based PRM for 3D workspaces. In Robotics: The Algorithmic Perspective. AK Peters, 1998.
2. M. S. Branicky, S. M. LaValle, K. Olson, and L. Yang. Quasi-randomized path planning. In Proceedings of the International Conference on Robotics and Automation, pages 1481-1487, Seoul, Korea, 2001.
3. M. S. Branicky, S. M. LaValle, K. Olson, and L. Yang. Deterministic vs. probabilistic roadmaps. Manuscript, 2002.
4. D. Hsu, J.-C. Latombe, and R. Motwani. Path planning in expansive configuration spaces. In Proceedings of the International Conference on Robotics and Automation, volume 3, pages 2719-2726, 1997.
5. L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. H. Overmars. Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation, 12(4):566-580, 1996.
6. J. H. Reif. Complexity of the mover's problem and generalizations. In Proceedings of the Symposium on Foundations of Computer Science, pages 421-427, 1979.
7. C. E. Shannon. A mathemtatical theory of communication. Bell System Technical Journal, 27:379-423, July 1948.
8. C. E. Shannon. A mathemtatical theory of communication. Bell System Technical Journal, 27:623-656, October 1948.
9. A. G. Sukharev. Optimal strategies of the search for an extremum. U.S.S.R. Computational Mathematics and Mathematical Physics, 11(4):119-137, 1971. Translated from Russian, Zh. Vychisl. Mt. i Mat. Fiz, 11(4):910-924.
10. A. G. Sukharev. Optimal strategies of the search for an extremum. U.S.S.R. Computational Mathematics and Mathematical Physics, 11(4):119-137, 1971. Translated from Russian, Zh. Vychisl. Mt. i Mat. Fiz, 11(4):910-924.
11. P. Wang and K. Gupta. View planning via maximal entropy reduction. In Proceedings of the Workshop on the Algorithmic Foundations of Robotics, 2002.
12. Y. Yu and K. Gupta. An information theoretic approach to viewpoint planning for motion planning of eye-in-hand systems. In Proceedings of the International Symposium on Industrial Robotics, 2000.