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

IEEE Transactions on Systems, Man and Cybernetics

Volumn 20, Issue 3, 1990, Pages 582-595

  Lee, C S George ^a   Chen, Chun Lung ^b  

^a PURDUE UNIVERSITY   (United States)

^b WRIGHT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SYSTEMS, DIGITAL--MULTIPROCESSING; DYNAMICS; MATHEMATICAL TECHNIQUES--GRAPH THEORY; OPTIMIZATION; SCHEDULING;

GRAPH PARTITIONING; HEURISTIC ALGORITHMS; MAPPING ALGORITHMS; MINIMAX OPTIMIZATION; ROBOT INVERSE DYNAMICS; WEIGHTED BIPARTITE MATCHING ALGORITHM;

ROBOTS;

EID: 0025431704     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/21.57271     Document Type: Article

References (29)

1. J. Y. S. Luh, M. W. Walker, and R. P. Paul, “On-line computational scheme for mechanical manipulator,” Trans. ASME J. Dynam. Syst. Meas. Contr., vol. 120, pp. 69–76, June 1980.
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. Patt. Recog. and Image Processing, 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 Autom., 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. on Decision and Contr., 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. 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 Autom., vol. RA-1, no. 2, pp. 104–113, June 1985.
10. J. Barhen, “Robot inverse dynamics on a concurrent computation ensemble,” in Proc. of 1985 ASME Int. Conf. on Computers in Engineering, vol. 3, pp. 415–429, 1985.
11. C. L. Chen, C. S. G. Lee, and E. S. H. Hou, “Efficient scheduling algorithms of robot inverse dynamics computation on a multiprocessor system,” IEEE Trans. Syst. Man Cybern., vol. 18, no. 5, pp. 729–743, Sept./Oct. 1988.
12. E. G. Coffman, Computer and Job-Shop Scheduling Theory. New York: Wiley, 1976.
13. M. R. Garey and D. S. Johnson, Computers and Interactability: A Guide to the Theory of NP Completeness. San Francisco, CA: W. H. Freeman, 1979.
14. H. S. Stone and S. H. Bokhari, “Control of distributed process,” Computer, pp. 85–93, July 1977.
15. W. W. Chu et al., “Task Allocation in Distributed Data Processing,” Computer, vol. 13, pp. 57–69, Nov. 1980.
16. K. Efe, “Heuristic models of task assignment scheduling in distributed systems,” Computer, vol. 15, pp. 50–56, July 1982.
17. S. H. Bokhari, “On the mapping problem,” IEEE Trans. Computers, vol. C-30, pp. 207–214, Mar. 1981.
18. W. W. Chu and L. M-T Lan, “Task allocation and precedence relations for distributed real-time systems,” IEEE Trans. Computers, vol. C-36, pp. 667–679, June 1987.
19. S. Y. Lee and J. K. Aggarwal, “A mapping strategy for parallel processing,” IEEE Trans. Computers, vol. C-36, pp. 433–441, Apr. 1987.
20. E. R. Barnes, “An algorithm for partitioning the nodes of a graph,” SIAM J. Alg. Disc. Math., vol. 3, no. 4, pp. 541–550, Dec. 1982.
21. W. E. Dornath and A. J. Hoffman, “Lower bounds for the partitioning of graphs,” IBM J. Res. Develop., vol. 17, pp. 420–425, Sept. 1973.
22. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graph,” Bell Syst. Tech. J., vol. 49, no. 2, pp. 291–307.
23. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization, Algorithms and Complexity. Englewood Cliffs, NJ: Prentice-Hall, 1982.
24. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983.
25. C. L. Chen, “Efficient mapping algorithms for scheduling autonomous vehicles and robotic computations,” Ph.D. dissertation, School of Electrical Engineering, Purdue University, West Lafayette, IN, Dec. 1988.
26. 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.
27. M. T. Heath, “The hypercube: A tutorial overview,” in Proc. 1st Conf. Hypercube Multiprocessors, Knoxville, TN, Sept. 1985, pp. 7–10.
28. A. Beguelin and D. J. Vasicek, “Communication between nodes of a hypercube,” in Proc. 2nd Conf. Hypercube Multiprocessors, Knoxville, TN, Sept. 1986, pp. 162–168.
29. T. H. Dunigan, “Performance of a second generation hypercube,” technical report ORNL/TM-10881, Oak Ridge National Laboratory, Nov. 1988.