A framed-quadtree approach for determining euclidean shortest paths in a 2-D environment

IEEE Transactions on Robotics and Automation

Volumn 13, Issue 5, 1997, Pages 668-681

  Chen, Danny Z ^a   Szczerba, Robert J ^b   Uhran Jr , John J ^a  

^a University of Notre Dame   (United States)

^b LOCKHEED MARTIN   (United States)

Author keywords

Framed quadtrees; Quadtrees; Robotics; Shortest paths; Voronoi diagrams

Indexed keywords

ALGORITHMS; DATA STRUCTURES; GLOBAL POSITIONING SYSTEM; ROBOTICS;

ARTIFICIAL POTENTIAL FIELD; CELL DECOMPOSITION; EUCLIDEAN SHORTEST PATHS; FRAMED QUADTREE; FREE SPACE NETWORKS; VORONOI DIAGRAMS;

MOTION PLANNING;

EID: 0031259308     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.631228     Document Type: Article

References (29)

1. D. Z. Chen, R. J. Szczerba, and J. J. Uhran, Jr., "Planning conditional shortest paths through an unknown environment: A framed-quadtree approach," in IEEE Conf. Intell. Robots Syst. (IROS'95), Aug. 1995.
2. R. A. Brooks, "Solving the find-path problem by good representation of free space," IEEE Trans. Syst., Man, Cybern., vol. 13, pp. 190-197, Mar. 1983.
3. Y. K. Hwang and N. Ahuja, "Gross motion planning - A survey," ACM Comput. Surveys, vol. 24, pp. 219-291, Sept. 1992.
4. J.-C. Latombe, Robot Motion Planning. Boston, MA: Kluwer, 1991.
5. T. Lozano-Perez and M. A. Wesley, "An algorithm for planning collision-free paths among polyhedral obstacles," Commun. ACM, vol. 22, pp. 560-570, Oct. 1979.
6. J. T. Schwartz and M. Sharir, "On the piano movers problem - The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers," Commun. Pure Appl. Math., vol. 36, pp. 345-398, 1983.
7. H. Everett, "Survey of collision avoidance and ranging sensors for mobile robots," Robot. Auto. Syst., vol. 5, pp. 5-67, 1989.
8. K. Fujimura and H. Samet, "A hierarchical strategy for path planning among moving obstacles," IEEE Trans. Robot. Automat., vol. 5, pp. 61-69, Feb. 1989.
9. R. J. Szczerba, D. Z. Chen, and J. J. Uhran, Jr., "Planning conditional shortest paths in an unknown environment," in Proc. 32nd Ann. Allerton Conf. Commun., Contr. Comput., Sept. 1994, Monticello, IL, pp. 671-672.
10. R. Jarvis and J. Byrne, "Robot navigation: Touching, seeing and knowing," in Proc. 1st Australian Conf. Artif. Intell., Nov. 1986.
11. K. I. Trovato, "Differential {A*}: An adaptive search method illustrated with robot path planning for moving obstacles and goals, and an uncertain environment," Inter. J. Patt. Recog., vol. 4, no. 2, pp. 245-268, 1990.
12. J. Barraquand, B. Langlois, and J.-C. Latombe, "Numerical potential field techniques for robot path planning," IEEE Trans. Syst., Man, Cybern., vol. 22, pp. 224-241, Mar. 1992.
13. P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cyber., vol. 4, pp. 100-107, July 1968.
14. C. Alexopoulos and P. M. Griffin, "Path planning for a mobile robot," IEEE Trans. Syst., Man, Cybern., vol. 22, pp. 318-322, Mar. 1992.
15. J. Ilari and C. Torras, "Two-dimensional path planning: A configuration space heuristic approach," The Int. J. Robot. Res., vol. 9, pp. 75-91, Feb. 1990.
16. G. Borgefors, "Distance transformations in arbitrary dimensions," Comput. Vision, Graphics, Image Proc., vol. 27, pp. 321-345, 1984.
17. T. E. Boult, "Updating distance maps when objects move," Proc. SPIE, vol. 852, pp. 232-238, 1987.
18. R. Chan, P. Tam, and D. Leung, "Robot navigation in unknown terrains via multi-resolution grid maps," in Int. Conf. Indust. Elect., Cont. Instrum., 1991, pp. 1138-1143.
19. S. Kambhampati and L. S. Davis, "Multiresolution path planning for mobile robots," IEEE J. Robot. Automat., vol. RA-2, pp. 135-145, Sept. 1986.
20. R. Mehrotra and D. Krause, "Obstacle-free path planning for mobile robots," in 3rd Ann. Conf. Image Processing Applicat., 1989, pp. 431-435.
21. H. Noborio, T. Naniwa, and S. Arimoto, "A fast path-planning algorithm by synchronizing modification and search of its path graph," in Int. Workshop Artif. Intell. Ind. Applicat., 1988, pp. 351-357.
22. _, "A quadtree-based path-planning algorithm for a mobile robot," J. Robot. Syst., vol. 7, no. 4, pp. 555-574, 1990.
23. A. Zelinsky, "A mobile robot exploration algorithm," IEEE Trans. Robot. Automat., vol. 8, pp. 707-717, Dec. 1992.
24. H. Samet, "Neighbor finding techniques for images represented by quadtrees," Comput. Graphics Image Processing, vol. 18, pp. 37-57, 1982.
25. _, "An overview of quadtrees, octrees, and related hierarchical data structures," NATO ASI Series, vol. F40, pp. 51-68, 1985.
26. F. P. Preparata and M. I. Shamos, Computational Geometry - An Introduction. New York, NY: Springer-Verlag, 1985.
27. T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. New York: McGraw-Hill, 1990.
28. A. Stentz, "Optimal and efficient path planning for partially-known environments," in Proc. 1994 IEEE Int. Conf. Robot. Automat., pp. 3310-3317.
29. D. Z. Chen, R. J. Szczerba, and J. J. Uhran, Jr., " Determining conditional shortest paths in an unknown, three-dimensional environment using framed-octrees," in IEEE Int. Conf. Syst., Man, Cybern. (SMC'95), Oct. 1995, vol. 5, pp. 4101-4106.