On the path planning problem in the vicinity of obstacles

Cybernetics and Systems

Volumn 29, Issue 8, 1998, Pages 807-868

  Zomaya, Albert Y ^a,b   Wright, Matt R ^a   Nabham, Tarek M ^a  

^a UNIVERSITY OF WESTERN AUSTRALIA   (Australia)

^b Parallel Comp Research Laboratory   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

CONFIGURATION SPACE VECTOR PATH PLANNERS (CSVPP);

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL METHODS; COMPUTER SIMULATION; INTERPOLATION; MOBILE ROBOTS; REAL TIME SYSTEMS; VECTORS;

MOTION PLANNING;

EID: 0032293651     PISSN: 01969722     EISSN: None     Source Type: Journal    
DOI: 10.1080/019697298125416     Document Type: Article

References (21)

1. Barraquand, J., B. Langlois, and J. Latombe. 1992. Numerical potential field techniques for robot path planning. IEEE Transactions on Systems, Man, and Cybernetics 22:224-241.
2. Canny, J. F. 1988. The Complexity of Robot Motion Planning. Cambridge, MA: The MIT Press.
3. Connolly, C. I., J. B. Burns, and R. Weiss. 1990. Path planning using Laplace's equation. IEEE International Conference on Robotics and Automation, Cincinnati, OH.
4. Ge, Q. J., and J. M. McCarthy. 1990. An algebraic formulation of configuration space obstacles for spatial robots. IEEE International Conference on Robotics and Automation, Cincinnati, OH.
5. Gilbert, E. G., D. W. Johnson, and S. S. Keerthi. 1988. A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Transactions on Robotics and Automation 6:522-532.
6. Gupta, K. K. 1990. Fast collision avoidance for manipulator arms: A sequential search strategy. IEEE Transactions on Robotics and Automation 6:522-532.
7. Hwang, Y. K., and N. Ahuja. 1992a. A potential field approach to path planning. IEEE Transactions on Robotics and Automation 8:23-32.
8. Hwang, Y. K., and N. Ahuja. 1992b. Gross motion planning-A survey. Computing Surveys 24:219-291.
9. Kant, K., and S. Zucker. 1988. Planning collision-free trajectories in time-varying environments: A two level hierarchy. IEEE International Conference on Robotics and Automation, Washington, DC.
10. Kondo, K. 1991. Motion planning with six degrees of freedom by multistrategic bidrectional heuristic free-space enumeration. IEEE Transactions on Robotics and Automation 7:267-277.
11. Latombe, J.-C. 1991. Robot Motion Planning. Boston: Kluwer Academic Publishers.
12. Lozano-Perez, T. 1983. Spatial planning: A configuration space approach. IEEE Transactions on Computers 32:108-120.
13. Lozano-Perez, T. 1987. A simple motion-planning algorithm for general robot manipulators. IEEE Journal of Robotics and Automation 3:224-238.
14. Lozano-Perez, T., and M. A. Wesley. 1979. An algorithm for planning collision-free paths among polyhedral obstacles. Communications of the ACM 22:560-570.
15. Meyer, W., and P. Benedict. 1988. Path planning and the geometry of joint space obstacles. IEEE International Conference on Robotics and Automation, Philadelphia, PA.
16. Newman, W. S., and M. S. Branicky. 1991. Real-time configuration space transforms for obstacle avoidance. International Journal of Robotics Research 10:650-667.
17. Nilsson, J. N. 1980. Principles of Artificial Intelligence. Palo Alto, CA: Tioga.
18. Paden, B., A. Mees, and M. Fisher. 1989. Path planning using a Jacobian-based freespace generation algorithm. IEEE International Conference on Robotics and Automation, Scottsdale.
19. Warren, C. W. 1991. A vector based approach to robot path planning. Proceedings of the 1991 IEEE International Conference on Robotics and Automation, Sacramento, CA.
20. Zhu, D., and J. Latombe. 1991. New heuristic algorithm for efficient hierarchical path planning. IEEE Transactions on Robotics and Automation 7:9-20.
21. Zomaya, A. Y. 1992. Modelling and Simulation of Robot Manipulators: A Parallel Processing Approach. River Edge, NJ: World Scientific Publishing.