Randomized planning for short inspection paths

Proceedings - IEEE International Conference on Robotics and Automation

Volumn 2, Issue , 2000, Pages 971-976

  Danner, Tim ^a   Kavraki, Lydia E ^a  

^a RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANGLE OF INCIDENCE; AUTONOMOUS INSPECTION; PLANAR WORKSPACES; VISIBILITY CONSTRAINT;

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER VISION; CONSTRAINT THEORY; MOBILE ROBOTS; SENSORS;

MOTION PLANNING;

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

References (15)

1. E Brooks et al. Six generations of building Walkthrough. Report TR92-026, Dept. of Computer Science, Univ. of North Carolina, Chapel Hill, NC, 1992.
2. W.-P. Chin and S. Ntafos. Optimum watchman routes. Information Processing Letters, 28:394,1988.
3. H. Choset, R. Knepper, J. Flasher, S. Walker, A. Alford, D. Jackson, D. Kortenkamp, R. Bumdge, and J. Femandez. Path planning and control for aercam, a free-flying inspection robot in space. In Proc. IEEE Int. Conf Robotics and Automation, pages 1396-1403, Detroit, MI, 1999.
4. H. Choset and D. Kortenkamp. Path planning and control for aercam, a free-flying inspection robot in space. ASCE Journal of Aerospace Engineering, 1999.
5. T. Connen, C. hiserson, and R. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990.
6. M. de Berg, M. van Kreveld, M. Overmars, and O. Schwarzkopf. Computation Geometry: Algorithms and Applications. Springer, 1997.
7. J. Foley, A. van Dam, S. Feiner, and J. Hughes. Computer Graphics: Principles and Practice. Addison-Wesley, Reading, MA, 1990.
8. M. Garey and D. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, New York, NY, 1979.
9. S. Ghosh and J. Burdick. Exploring an unknown polygon environment with a sensor based strategy. Technical Report TCS-97/2, Tata Institute of Fundamental Research, April 1997.
10. H. González-Baños, L. Guibas, J.-C. Latombe, S. LaValle, D. Lin, R. Motwani, and C. Tomasi. Motion planning with visibility constraints: Building autonomous observers. In Y. Shirai and S. Hirose, editors, In Robotics Research - The Eighth International Symposium, pages 95-101,1998.
11. H. González-Ba ños and J.-C. Latombe. Planning robot motions for range-image acquisition and automatic 3D model construction. In Proc. AAA1 Fall Symposium Series, 1998.
12. E Hoffmann, C. Ickling, R. Klein, and K. Kriegel. The polygon exploration problem: A new strategy and a new analysis technique. In Proc. Workshop on the Algorithmic Foundations of Robotics, pages 21 1-222,1998.
13. L. E. Kavraki, P. Švestka, J.-C. Latombe, and M. Overmars. Probabilistic roadmaps for fast path planning in high dimensional configuration spaces. IEEE TK on Rob. and Autom., 12566580,1996.
14. J.-C. Latombe. Robot Motion Planning. Kluwer, Boston, MA, 1991.
15. J. O'Rourke. Art Gallery Theorems and Algorithms. Oxford University Press, NY, 1987.