Scheduling of Parallel Computation for a Computer-Controlled Mechanical Manipulator

IEEE Transactions on Systems, Man and Cybernetics

Volumn 12, Issue 2, 1982, Pages 214-234

  Luh, J Y S ^a   Lin, C S ^a  

^a PURDUE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATERIALS HANDLING;

EID: 0020101696     PISSN: 00189472     EISSN: 21682909     Source Type: Journal    
DOI: 10.1109/TSMC.1982.4308805     Document Type: Article

References (18)

1. J. Y. S. Luh and C. S. Lin, “Optimum path planning for mechanical manipulators,” ASME Trans. J. Dynamic Syst., Measurement and Control, vol. 103, no. 2, pp. 142-151, June 1981.
2. D. E. Whitney, “Resolved motion rate control of manipulators and human prostheses,” IEEE Trans. Man-Mach. Syst., vol. MMS-10, no. 2, pp. 47-53, June 1969.
3. R. C. Paul, Modeling, Trajectory Calculation and Servoing of a Computer Controlled Arm, A.I. Memo 177, Stanford Artificial Intelligence Lab., Stanford Univ., Sept. 1972.
4. B. R. Markiewicz, Analysis of the Computed Torque Drive Method and Comparison with Conventional Position Servo for a Computer-Controlled Manipulator, Tech. Memo 33-601, Jet Propulsion Lab., Mar. 1973.
5. A. K. Bejczy, Robot Arm Dynamics and Control, Tech. Memo 33-669, Jet Propulsion Lab., Feb. 1974.
6. J. Y. S. Luh, M. W. Walker, and R. P. C. Paul, “Resolved-acceleration control of mechanical manipulators,” IEEE Trans. Automat. Contr., vol. 25, no. 3, pp. 468-474, June 1980.
7. J. M. Hollerback, “A recursive Lagrangian formulation of manipulator dynamics and a comperative study of dynamics formulation complexity,” IEEE Trans. Syst., Man Cybern., vol. 10, no. 11, pp. 730-736, Nov. 1980.
8. J. Y. S. Luh, M. W. Walker, and R. P. C. Paul, “On-line computational scheme for mechanical manipulators,” ASME Trans. J. Dynamic Syst., Measurement and Contr., vol. 102, no. 2, pp. 69-76, June 1980.
9. E. L. Lawler and D. E. Wood, “Branch-and-bound methods: A survey,” Oper. Res., vol. 14, no. 4, pp. 699-719, July-Aug. 1966.
10. D. J. Kuck, “A survey of parallel machine organization and programming,” Computing Surveys (ACM), vol. 9, no. 1, pp. 29-59, Mar. 1977.
11. J. K. Lenstra and A. H. G. Rinnooy Kan, “Complexity of scheduling under precedence constraints,” Oper. Res., vol. 26, no. 1, pp. 22-35, Jan.-Feb. 1978.
12. R. L. Ackoff and M. W. Sasieni, Fundamentals of Operations Research. New York: Wiley, 1968, pp. 275-383.
13. B. E. Gillett, Introduction to Operations Research. New York: McGraw-Hill, 1976, pp. 434-453.
14. C. L. Liu and J. W. Layland, “Scheduling algorithms for multiprogramming in a hard-real-time environment,” J. Ass. Comput. Mach., vol. 20, no. 1, pp. 46-61, Jan. 1973.
15. K. R. Baker and L. E. Schrage, “Finding an optimal sequence by dynamic programming: An extension to precedence-related tasks,” Oper. Res., vol. 26, no. 1, pp. 111-120, Jan.-Feb. 1978.
16. S. K. Dhall and C. L. Liu, “On a real-time scheduling problem,” ibid., pp. 127-140.
17. H. M. Abdel-Wahab and T. Kameda, “Scheduling to minimize maximum cumulative cost subject to series-parallel precedence constraints,” ibid., pp. 141-158.
18. J. E. Hopcroft and J. D. Ullman, Formal Languages and Their Relation to Automata. Addison-Wesley, 1969, p. 68.