Planning of collision-free paths for a reconfigurable dual manipulator equipped mobile robot

Journal of Intelligent and Robotic Systems: Theory and Applications

Volumn 17, Issue 3, 1996, Pages 223-242

  Xue, Qing ^a   Sheu, Philip C Y ^b   Maciejewski, Anthony A ^c   Chien, Stanley Y P ^a  

^a INDIANA UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c PURDUE UNIVERSITY   (United States)

Author keywords

Artificial intelligence; Path planning; Reconfigurable robot

Indexed keywords

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COLLISION AVOIDANCE; GRAPH THEORY; MANIPULATORS; MOTION PLANNING;

GRAPH SEARCH METHOD; RECONFIGURABLE ROBOT;

MOBILE ROBOTS;

EID: 0030290699     PISSN: 09210296     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF00339662     Document Type: Article

References (13)

1. Lozano-Perez, T.: Automatic planning of manipulator transfer movements, IEEE Trans. Systems, Man, and Cybernetics SMC-11(1) (1981), 681-698.
2. Gouzenes, L.: Strategies for solving collision-free trajectories problems for mobile and manipulator robots, Int. J. Robotics Res. 3(4) (1984), 51-65.
3. Bajaj, C. and Kim, M.-S.: Generation of configuration space obstacles, I. The case of a moving sphere, Technical Report CSD-TR-565, Department of Computer Science, Purdue University, West Lafayette, IN, December 1985.
4. Erdmann, M. and Lozano-Perez, T.: On multiple moving objects, in Proc. IEEE Int. Conf. Robotics and Automation, 1986, pp. 1419-1424.
5. Lozano-Perez, T.: A simple motion-planning algorithm for general robot manipulators, IEEE J. Robotics and Automation RA-3(3) (1987), 224-238.
6. Schwartz, J. T. and Sharir, M.: On the piano movers' problem, III. Coordinating the motion of several independent bodies: The special case of circular bodies moving amidst polygonal barriers, Int. J. Robotics Res. 2(3) (1983), 46-75.
7. Kedem, K. and Sharir, M.: An efficient motion planning algorithm for a convex polygonal object in two-dimentional polygonal space, Technical Report No. 253, Computer Science Department, Courant Institute, October 1986.
8. Brooks, R. A.: Solving the find-path problem by good representation of free space, IEEE Trans. System, Man, and Cybernetics SMC-13 (1983), 190-197.
9. Khatib, O.: Real time obstacle advoidance for manipulators and mobile robots, Int. J. Robotics Res. 5(1) (1986), 90-98.
10. Hwang, Y. K. and Ahuja, N.: Robot path planning using a potential field representation, in Proc. of IEEE Computer Soc. Conf. on Computer Vision and Pattern Recognition, San Diego, June 1989.
11. Carriker, W., Khosla, P. and Krogh, B.: The use of simulated annealing to solve the mobile manipulator path planning problem, in IEEE Int. Conf. Robotics and Automation, March 1986, pp. 204-209.
12. Wong, E. K. and Fu, K. S.: A hierarchical orthogonal space approach to three-dimensional paht planning, IEEE J. Robotics and Automation (March 1986), 42-53.
13. Xue, Q., Sheu, P. C.-Y. and Maciejewski, A. A.: Determining the collision-free joint space graph for two cooperating robot manipulators, IEEE Trans. Systems, Man, and Cybernetics 23(1) (1993), 285-294.