A morphological approach to shortest path planning for rotating objects

Pattern Recognition

Volumn 31, Issue 8, 1998, Pages 1127-1138

  Pei, Soo Chang ^a,c   Lai, Chin Lun ^a   Shih, Frank Y ^b  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^b NEW JERSEY INSTITUTE OF TECHNOLOGY   (United States)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Continuous turning angle; Distance transformation; Mathematical morphology; Motion planning; Rotational morphology

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTER SIMULATION; MATHEMATICAL MORPHOLOGY; MOTION PLANNING; PROBLEM SOLVING;

CONTINUOUS TURNING ANGLE; DISTANCE TRANSFORMATION; RELATIONAL MORPHOLOGY;

OBJECT RECOGNITION;

EID: 0032140027     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0031-3203(97)00141-6     Document Type: Article

References (17)

1. J. Latombe, Robot Motion Planning. Kluwer, Dordrecht (1991).
2. Y. K. Hwang and N. Ahuja, Gross motion planning - a survey, ACM Comput. Surveys 24(3), 219-290 (1992).
3. T. Lozano-Perez and M. A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles, Comm. ACM 22(10), 560-570 (1979).
4. T. Lozano-Perez, Spatial planning: a configuration space approach, IEEE Trans. Comput. c-32, 108-120 (1983).
5. T. Lozano-Perez, A simple motion planning algorithm for general robot manipulators, IEEE Trans. Robotics Automat. RA-3(3), 224-238 (1987).
6. P. K. Ghosh, A solution of polygon containment, spatial planning, and other related problems using Minkowski operations, Comput. Vision Graphics Image Process. 49, 1-35 (1990).
7. P. L. Lin and S. Chang, A shortest path algorithm for a nonrotating object among obstacles of arbitrary shapes, IEEE Trans. Systems Man Cybernet. 23(3), 825-833 (1993).
8. V. Lumelsky, Algorithmic and complexity issues of robot motion planning in an uncertain environment, Journal of Complexity 3, 146-182 (1987).
9. R. A. Brooks, Solving the find-path problem by good representation of free space, IEEE Trans. Systems, Man Cybernet. 13(3), 190-197 (1983).
10. S. K. Kambhampati and L. S. Davis, Multiresolution path planning for mobile robots, IEEE Trans. Robotics Automat. 2(3), 135-145 (1994).
11. G. Matheron, Random Sets and Integral Geometry. Wiley, New York (1975).
12. J. Serra, Image Analysis and Mathematical Morphology. Academic, New York (1982).
13. F. Y. Shih, S. C. Pei and J. H. Horng, Edge linking using adaptive morphology, Pattern Recognition (submitted).
14. J. Piper and E. Granum, Computing distance trans formation in convex and non-convex domains, Pattern Recognition 20(6), 599-615 (1987).
15. C. L. Lai, The implementation of 8 × 8 DCT-based codec by using fast algorithms on digital signal processor, Master thesis, EE Department of Tatung Institute of Technology (1993).
16. J. A. Reeds and R. A. Shepp, Optimal paths for a car that goes both forward and backwards, Pacific J. Math. 145(2), 367-393 (1990).
17. J. P. Laumond, P. E. Jacobs, M. Taix and R. M. Murray, A motion planner for nonholonomic mobile robots, IEEE Trans. Robotics Automat. 10(5), 577-593 (1994).