A Hierarchical Strategy for Path Planning Among Moving Obstacles

IEEE Transactions on Robotics and Automation

Volumn 5, Issue 1, 1989, Pages 61-69

  Fujimura, Kikuo ^a   Samet, Hanan ^a  

^a UNIVERSITY OF MARYLAND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONTROL SYSTEMS, OPTIMAL; VEHICLES--NAVIGATION SYSTEMS;

HIERARCHICAL PATH PLANNING; MOBILE ROBOT; MOVING OBSTACLES; PATH PLANNING; TIME OPTIMAL PATH PLANNING;

ROBOTS, INDUSTRIAL;

EID: 0024612407     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.88018     Document Type: Article

References (27)

1. D. Ayala, P. Brunet, and I. Navazo, “Object representation by means of nonminimal division quadtrees and octrees”, ACM Trans. Graphics Vol.4, no. 1, pp. 41-59, Jan. 1985.
2. R. C. Bolles and H. H. Baker, “Epipolar-plane image analysis: A technique for analyzing motion sequences,” in Proc. 3rd Workshop on Computer Vision: Representation and Control (Bellaire, MI, Oct. 1985), pp. 168–178.
3. R. A. Brooks, “Solving the find-path problem by good representation of free space,” IEEE Trans. Systems, Man, Cybern., vol. SMC-13, pp. 190–197, Mar./Apr. 1983.
4. R. A. Brooks, “A robust layered control system for a mobile robot.” IEEE J. Robotics Automat., vol. RA-2, no. 1, pp. 14–23, Mar. 1986.
5. J. Canny, “Collision detection for moving polyhedra,” IEEE Trans. Pattern Anal. Mach. Intell., vol. PAMI-8, pp. 200–209, Mar. 1986.
6. J. Canny and J. Reif, “New lower bound techniques for robot motion planning problems,” in Proc. 27th IEEE Symp. on Foundations of Computer Science (Los Angeles, CA, Oct. 1987), pp. 49–60.
7. I. Carlbom, I. Chakravarty, and D. Vanderschel, “A hierarchical data structure for representing the spatial decomposition of 3-D objects,” IEEE Comput. Graph. Appl., vol. 5, no. 4, pp. 24–31, Apr. 1985.
8. J. L. Crowley, “Navigation for an intelligent mobile robot,” IEEE J. Robotics Automat., vol. RA-1, no. 1, pp. 31–41, Mar. 1985.
9. L. S. Davis, F. Andersen, R. Eastman, and S. Kambhampati, “Visual algorithms for autonomous navigation,” in Proc. IEEE Int. Conf. on Robotics and Automation (St. Louis, MO, Mar. 1985), pp. 856–861.
10. M. Erdmann and T. Lozano-Perez, “On multiple moving objects,” Algorithmica, vol. 2, no. 4, pp. 477–522, 1987.
11. D. M. Esterling and J. Van Rosendale, “An intersection algorithm for moving parts,” in Proc. NASA Symp. on Computer Aided Geometry Modeling (Hampton, VA, Apr. 1983), pp. 119–123.
12. K. Fujimura and T. L. Kunii, “A hierarchical space indexing method,” in Computer Graphics: Visual Technology and Art, T. L. Kunii, Ed. New York, NY: Springer-Verlag, pp. 21–31.
13. M. Herman, “Fast, three-dimensional, collision-free motion planning,” in Proc. IEEE Int. Conf. on Robotics and Automation (San Francisco, CA, Apr. 1986), pp. 1056–1063.
14. S. Kambhampati and L. S. Davis, “Multiresolution path planning for mobile robots,” IEEE J. Robotics Automat., vol. RA-2, no. 3, pp. 135–145, Sept. 1986.
15. K. Kant and S. W. Zucker, “Toward efficient planning: The path-velocity decomposition,” Int. J. Robotics Res., vol. no. 5, pp. 72–89, Fall 1986.
16. T. Lozano-Perez and M. A. Wesley, “An algorithm for planning collision free paths among polyhedral obstacles,” Commun. ACM, vol. 22, no. 10, pp. 560–570, Oct. 1979.
17. T. Lozano-Perez, “Automatic planning of manipulator transfer movements,” IEEE Trans. Syst., Man. Cybern., vol. SMC-11, no. 10, pp. 681–698, Oct. 1981.
18. H. P. Moravec, “The Stanford cart and the CMU rover,” Proc. IEEE, vol. 71, no. 7, pp. 872–884, July 1983.
19. N. J. Nilsson, Principles of Artificial Intelligence. Palo Alto, CA: Tioga Press, 1980, ch. 2.
20. C. O’Dunlaing, “Motion planning with inertial constraints,” Algorithmica, vol. 2, no. 4, pp. 431–476, 1987.
21. A. A. G. Requicha and H. B. Voelcker, “Solid modeling: A historical summary and contemporary assessment,” IEEE Comput. Graph. Appl., vol. 2, no. 6, pp. 9–24, June 1982.
22. J. Reif and M. Sharir, “Motion planning in the presence of moving obstacles,” in Proc. 25th IEEE Symp. on Foundations of Computer Science (Portland, OR, Oct. 1985), pp. 144–154.
23. R. Ruff and N. Ahuja, “Path planning in a three-dimensional environment,” in Proc. 7th Int. Conf. on Pattern Recognition (Montreal, Que,. Canada, July 1984), pp. 188–191.
24. H. Samet, “Neighbor finding techniques for images represented by quadtrees,” Comput. Graph. Image Processing, vol. no. 18, no. 1, pp. 37–57, Jan. 1982.
25. H. Samet and M. Tamminen, “Bintrees, CSG trees, and time,” Computer Graphics, vol. 20, pp. 121–130, July 1985. Also in Proc. Siggraph ’85 Conf. (San Francisco, CA, July 1985).
26. H. Samet and R. E. Webber, “Storing a collection of polygons using quadtrees,” ACM Trans. Graphics, vol. 2, no. 3, pp. 182–222, July 1985.
27. M. Yau and S. N. Srihari, “A hierarchical data structure for multidimensional digital images,” Commun. ACM, vol. 26, no. 7, pp. 504–515, July 1983.