Sensor-based exploration: The hierarchical generalized Voronoi graph

International Journal of Robotics Research

Volumn 19, Issue 2, 2000, Pages 96-125

  Choset, Howie ^a   Burdick, Joel ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b CALIFORNIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MOTION CONTROL; MOTION PLANNING; SENSORS; SET THEORY;

HIERARCHICAL GENERALIZED VORONOI GRAPH (HGVG); SENSOR-BASED EXPLORATION;

MOBILE ROBOTS;

EID: 0033886967     PISSN: 02783649     EISSN: None     Source Type: Journal    
DOI: 10.1177/02783640022066770     Document Type: Article

References (22)

1. Abraham, R., Marsden, J. E., and Ratiu, T. 1988. Manifolds, Tensor Analysis, and Applications. 2d ed. New York: Springer-Verlag.
2. Aurenhammer, F. 1991. Voronoi diagrams - A survey of a fundamental geometric structure. ACM Computing Surveys 23:345-405.
3. Avis, D., and Bhattacharya, B. K. 1983. Algorithms for computing D-dimensional Voronoi diagrams and their duals. Advances in Computing Research 1:159-180.
4. Brooks, R. A. 1986. A robust layered control system for a mobile robot. IEEE Journal on Robotics and Automation RA-2(March).
5. Canny, J. F. 1988. The Complexity of Robot Motion Planning. Cambridge, MA: MIT Press.
6. Canny, J. F., and Lin, M. C. 1993. An opportunistic global path planner. Algorithmica 10:102-120.
7. Choset, H. 1998. Nonsmooth analysis, convex analysis, and their applications to motion planning. Special issue of Int. J. Comp. Geom. and Apps. To appear.
8. Choset, H., and Burdick, J. 2000. Sensor based exploration: Incremental construction of the hierarchical generalized Voronoi graph. International Journal of Robotics Research 19:96-118.
9. Choset, H., and Burdick, J. W. 1994. Sensor based planning and nonsmooth analysis. Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA, pp. 3034-3041.
10. Choset, Howie. 1996. Sensor based motion planning: The hierarchical generalized Voronoi graph. Ph.D. thesis, California Institute of Technology, Pasadena.
11. Clarke, F. H. 1990. Optimization and Nonsmooth Analysis. Philadelphia, PA: Society of Industrial and Applied Mathematics.
12. Gat, E., and Dorais, G. 1994 (May). Robot Navigation by Conditional Sequencing. Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA, pp. 1293-1299.
13. Kutulakos, K. N., Dyer, C. R., and Lumelsky, V. J. 1994 (May). Provable strategies for vision-guided exploration in three dimensions. IEEE Int. Conf. on Robotics and Automation, San Diego, CA.
14. Latombe, J. C. 1991. Robot Motion Planning. Boston, MA: Kluwer Academic.
15. Lumelsky, V., and Stepanov, A. 1987. Path planning strategies for point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica 2:403-430.
16. Ó'Dunlaing, C., and Yap, C. K. 1985. A "retraction" method for planning the motion of a disc. Algorithmica 6:104-111.
17. Rao, N.S.V., Kareti, S., Shi, W., and Iyenagar, S. S. 1993. Robot navigation in unknown terrains: Introductory survey of non-heuristic algorithms. Oak Ridge National Laboratory Technical Report ORNL/TM-12410(July):1-58.
18. Rao, N.S.V., Stolzfus, N., and Iyengar, S. S. 1991. A retraction method for learned navigation in unknown terrains for a circular robot. IEEE Transactions on Robotics and Automation 7(October):699-707.
19. Rimon, E., and Canny, J. F. 1994. Construction of C-space roadmaps using local sensory data - What should the sensors look for? Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA, pp. 117-124.
20. Rowat, P. F. 1979. Representing the spatial experience and solving spatial problems in a simulated robot environment. Ph.D. thesis, University of British Columbia.
21. Scheimberg, S., and Oliveira, P. R. 1992. Descent algorithm for a class of convex nondifferentiable functions. Journal of Optimization Theory and Applications 72(February):269-297.
22. Schwartz, J. T., and Yap, C. K., eds. 1987. Advances in Robotics: Algorithmic and Geometric Aspects of Robotics. Vol. 1. Hillsdale, NJ: Lawrence Erlbaum.