A Shortest Path Algorithm for a Nonrotating Object Among Obstacles of Arbitrary Shapes

IEEE Transactions on Systems, Man and Cybernetics

Volumn 23, Issue 3, 1993, Pages 825-833

  Lin, P L ^a   Chang, Shyang ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; EROSION; GEOMETRY; ITERATIVE METHODS; MATHEMATICAL TECHNIQUES; MATHEMATICAL TRANSFORMATIONS; MOTION CONTROL; ROBOTS; THREE DIMENSIONAL;

CONVEX POLYGON; DILATION; GRASS FIRE ALGORITHM; MOTION PLANNING; NONROTATING OBJECT; OBSTACLES; SHAPE DECOMPOSITION; SHORTEST PATH ALGORITHM;

ALGORITHMS;

EID: 0027599090     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.256552     Document Type: Article

References (25)

1. J. T. Schwartz and M. Sharir, “A survey of motion planning and related geometric algorithms,” Artificial Intell., vol. 37, pp. 157–169, 1988.
2. G. T. Toussaint, Computational Geometry. New York: North-Holland, 1985.
3. T. Lozano-Perez and M. A. Wesley, “An algorithm for planning collision-free paths among polyhedral obstacles,” Comm. ACM, vol. 22, pp. 560–570, Oct. 1979.
4. T. Lozano-Perez, “Automatic planning of manipulator transfer movements,” IEEE Trans. Syst., Man, Cybern., vol. 11, pp. 681–698, 1981.
5. J. T. Schwartz and M. Sharir, “On the piano movers’ problem—Part I: The case of a two-dimensional rigid polygonal body moving amidst polygonal barriers,” Comm. Pure Appl. Math. 36, pp. 345–398, 1983.
6. R. A. Brooks, “Solving the find-path problem by good representation of free space,” IEEE Trans. Syst., Man, Cybern., vol. 13, pp. 190–197, 1983.
7. J. Borenstein and Y. Koren, “Real-time obstacle avoidance for fast mobile robots,” IEEE Trans. Syst., Man, Cybern., vol. 19, pp. 1179–1187, 1989.
8. D. Leven and M. Sharir, “An efficient and simple motion planning algorithm for a ladder moving in the two-dimensional space amidst polygonal barriers,” J. Algorithms, vol. 8, pp. 192–215, 1987.
9. R. T. Chien, L. Zhang, and B. Zhang, “Planning collision-free paths for robotic arm among obstacles,” IEEE Trans. Pattern Anal. Machine Intell., vol. PAMI-6, pp. 91–96, Jan. 1984.
10. C. O'Dunlaing, M. Sharir, and C. Yap, “Generalized Voronoi diagrams for a ladder—Part I: Topological analysis,” Comm. Pure Appl. Math., vol. 39, pp. 423–483, 1986.
11. D. Leven and M. Sharir, “planning a purely translational motion for a convex object in two-dimensional space using generalized voronoi diagrams,” Discrete Comput. Geom., vol. 2, pp. 9–31, 1987.
12. O. Takahashi and R. J. Schilling, “Motion planning in a plane using generalized Voronoi diagrams,” IEEE Trans. Robotics Automat., vol. 5, pp. 143–150, Apr. 1989.
13. B. K. Bhattacharya and J. Zorbas, “Solving the two-dimensional findpath problem using a line-triangle representation of the robot,” J. Algorithms, vol. 9, pp. 449–469, 1988.
14. P. K. Ghosh, “A Solution of polygon containment, spatial planning, and other related problems using Minkowski pperations,” CVGIP, vol. 49, pp. 1–35, 1990.
15. C. L. Bajaj and M-S Kim, “Generation of configuration space obstacles: The case of moving algebraic curves,” Algorithmica, vol. 4, pp. 157–172, 1989.
16. 2) shortest path algorithm for a non-rotating convex body,” J. Algorithms, vol. 9, pp. 18–46, 1988.
17. M. Sharir and A. Schorr, “on shortest paths in polyhedral spaces,” SIAM J. Comput., vol. 15, pp. 193–215, Feb. 1986.
18. M. Sharir, “On shortest paths amidst convex polyhedra,” SIAM J. Comput., vol. 16, pp. 561–572, June 1987.
19. P. L. Lin and S. Chang, “Collision-free path planning among obstacles of arbitrary shapes: An approach via mathematical morphology,” IEEE Trans. Pattern Anal. Machine Intell., submitted for publication.
20. G. Matheron, Random Set and Integral Geometry. New York: Wiley, 1975.
21. J. Serra, Image Analysis and Mathematical Morphology. New York: Academic, 1982.
22. R. M. Haralick, S. R. Sternberg, and X. Zhuang, “Grayscale morphology,” in Proc. IEEE Conf. Comput. Vis. Pattern Recogn., Miami, FL, pp. 453–550, June 1986.
23. P. K. Ghosh, “A mathematical model for shape description using minkowski operators,” CVGIP, vol. 44, pp. 239–269, 1988.
24. X. Zhuang and R. M. Haralick, “Morphological structuring element decomposition,” CVGIP, vol. 35, pp. 370–382, 1986.
25. J. Xu, “Decomposition of convex polygonal morphological structuring elements into neighborhood subsets,” IEEE Trans. Pattern Anal. Machine Intell., vol. 13, pp. 153–162, Feb. 1991.