Minimum distance collision-free path planning for industrial robots with a prismatic joint

作者: J. Luh , C. Campbell

DOI: 10.1109/TAC.1984.1103640

关键词:

摘要: A collision-free path is a which an industrial robot can physically take while traveling from one location to another in environment containing obstacles. Usually the obstacles are expanded compensate for body width of robot. For robots with prismatic joint, allows only translational motion along its axis, additional problems created by long boom handled means pseudoobstacles generated real obstacle's edges and faces. The then modified inclusion contribute forbidden regions. This process itself again be represented point specifying end effector space. An algorithm determining shortest distance given sequence traversed has been developed case stationary

参考文章(7)
Rodney A. Brooks, Solving the find-path problem by good representation of free space national conference on artificial intelligence. pp. 381- 386 ,(1982)
M. J. D. Powell, A Survey of Numerical Methods for Unconstrained Optimization SIAM Review. ,vol. 12, pp. 79- 97 ,(1970) , 10.1137/1012004
Robert L. Graves, A Principal Pivoting Simplex Algorithm for Linear and Quadratic Programming Operations Research. ,vol. 15, pp. 482- 494 ,(1967) , 10.1287/OPRE.15.3.482
Tomas Lozano-Perez, Automatic Planning of Manipulator Transfer Movements IEEE Transactions on Systems, Man, and Cybernetics. ,vol. 11, pp. 681- 698 ,(1981) , 10.1109/TSMC.1981.4308589
Lozano-Perez, Spatial Planning: A Configuration Space Approach IEEE Transactions on Computers. ,vol. 32, pp. 108- 120 ,(1983) , 10.1109/TC.1983.1676196
C. E. Lemke, Bimatrix Equilibrium Points and Mathematical Programming Management Science. ,vol. 11, pp. 681- 689 ,(1965) , 10.1287/MNSC.11.7.681
Tomás Lozano-Pérez, Michael A. Wesley, An algorithm for planning collision-free paths among polyhedral obstacles Communications of the ACM. ,vol. 22, pp. 560- 570 ,(1979) , 10.1145/359156.359164