Efficient Scheduling Algorithms for Robot Inverse Dynamics Computation on a Multiprocessor System

IEEE Transactions on Systems, Man and Cybernetics

Volumn 18, Issue 5, 1988, Pages 729-743

  Lee, C S George ^a   Hou, Edwin S H ^a   Chen, Chun Lung ^b  

^a PURDUE UNIVERSITY   (United States)

^b INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--PARALLEL PROCESSING; CONTROL SYSTEMS, NONLINEAR; CONTROL SYSTEMS, OPTIMAL; EQUATIONS OF MOTION; SYSTEMS SCIENCE AND CYBERNETICS--HEURISTIC PROGRAMMING;

HEURISTIC SEARCH ALGORITHM; NEWTON-EULER TASK GRAPH; ROBOT INVERSE DYNAMICS;

ROBOTS, INDUSTRIAL;

EID: 0024078868     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.21600     Document Type: Article

References (21)

1. J. Y. S. Luh, M. W. Walker, and R. P. Paul, “Online computational scheme for mechanical manipulator,” Trans. ASME, J. D-vnam. Sysr. Mens. Conrr., vol. 120, pp. 69-76, June 198
2. D. E. Orin, R. B. MaChee, M. Vukobratovic, and G. Hartoch, “Kinematics and kinetic analysis of open-chain linkages utilizing Newton-Euler methods,” Math. Biosci., vol. 43, pp. 107–130, 1979.
3. C. S. G. Lee, T. N. Mudge, and J. L. Turney, “Hierarchical control structure using special purpose processor for the control of robot arm,” in Proc. 1982 Conf. Pattern Recog. Image Proc., June 1982, pp. 634–640.
4. R. Nigam and C. S. G. Lee, “A multiprocessor-based controller for control of mechanical manipulators,” IEEE J. Robotics Automat., vol. RA-1, no. 4, pp. 173–182, Dec. 1985.
5. T. Kanade, P. K. Khosla, and N. Tanaka, “Real-time control of the CMU direct arm II using customized inverse dynamics, in Proc. IEEE Conf. Decision and Control, Dec. 1984, pp. 1345–1352.
6. L. H. Lathrop, “Parallelism in manipulator dynamics,” Int. J. Robotics Res., vol. 4, no. 2, pp. 80–102, Summer 1985.
7. C. S. G. Lee and P. R. Chang, “Efficient parallel algorithm for robot inverse dynamics computation,” IEEE Trans. Syst. Man Cybern., vol. SMC-16, no. 4, pp. 532–542, July 1986.
8. J. Y. S. Luh and C. S. Lin, “Scheduling of parallel computer for a computer-controlled mechanical manipulator,” IEEE Trans. Syst. Man Cybern., vol. SMC-12, pp. 214–234, 1982.
9. H. Kasahara and S. Narita, “Parallel processing of robot-arm control computation on a multiprocessor system,” IEEE J. Robotics Automat., vol. RA-1, no. 2, pp. 104–113, June 1985.
10. J. Barhen, “Robot inverse dynamics on a concurrent computation ensemble,” in Proc. 1985 ASME Int. Conf. Computers in Engineering, 1985, vol. 3, pp. 415–429.
11. E. G. Coffman, Computer and Job-Shop Scheduling Theory. New York: 1976.
12. J. K. Lenstra and A. H. G. R. Kan, “Complexity of scheduling under precedence constraints,” Oper. Res., vol. 26, pp. 25–35, Jan. 1978.
13. M. J. Gonzalez, Jr., “Deterministic processor scheduling,” Computing Surveys, vol. 9, no. 3, pp. 173–204, Sept. 1977.
14. M. R. Garey, R. L. Graham, and D. J. Johnson, “Performance guarantees for scheduling algorithm,” Oper. Res., vol. 26, pp. 3–21, Jan. 1978.
15. C. V. Ramamoorthy, K. M. Chandy, and M. J. Gonzalez, “Optimal scheduling strategies in a multiprocessor system,” IEEE Trans. Comput., vol. C-21, pp. 137–146, Feb. 1972.
16. T. L. Adam, K. M. Chandy, and J. R. Dickson, “A comparison of list schedules for parallel processing systems,” Commun. ACM, vol. 17, pp. 685–690, Dec. 1974.
17. H. Kasahara and S. Narita, “Practical multiprocessor scheduling algorithms for efficient parallel processing,” IEEE Trans. Comput., vol. C-33, pp. 1023–1029, Nov. 1984.
18. N. J. Nilsson, Principle of Artificial Intelligence. Palo Alto, CA: Tioga, 1980.
19. C. L. Chen, C. S. G. Lee, and E. S. H. Hou, “Efficient scheduling algorithms of robot inverse dynamics computation on a multiprocessor system,” School of Electrical Engineering, Purdue University, West Lafayette, IN, Tech. Rep. TR-EE-87-27, July 1987.
20. P. H. Winston, Artificial Intelligence. Reading, MA: Addison-Wesley, 1984.
21. E. B. Fernandez and B. Bussell, “Bound on the number of processors and time for multiprocessor optimal schedules,” IEEE Trans. Comput., vol. C-22, pp. 745–751, Aug. 1973.