Parallel processing of robot-arm control computation on a multimicroprocessor system
- 1 June 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Journal on Robotics and Automation
- Vol. 1 (2), 104-113
- https://doi.org/10.1109/jra.1985.1087004
Abstract
A parallel-processing scheme is described for robot-arm control computation on any number of parallel processors. The scheme employs two multiprocessor scheduling algorithms called, respectively, depth first/implicit heuristic search (DF/IHS) and critical path/most immediate successors first (CP/MISF); these were recently developed by the authors. The scheme is applied to the parallel processing of dynamic control computation for the Stanford manipulator. In particular, the proposed algorithms are applied to the computation of the Newton-Euler equations of motion for the Stanford manipulator and implemented on a multimicroprocessor system. The test result was so successful that the use of six processor pairs in parallel could attain the processing time of 5.37 ms. It is also shown that the proposed parallel-processing scheme is applicable to an arbitrary number of processors.Keywords
This publication has 10 references indexed in Scilit:
- Practical Multiprocessor Scheduling Algorithms for Efficient Parallel ProcessingIEEE Transactions on Computers, 1984
- Parallel processing scheme for robot control computation using multi-processor scheduling algorithm.Journal of the Robotics Society of Japan, 1984
- Present State and Future of Manipulation TechnologyJournal of the Robotics Society of Japan, 1983
- Redundancy Analysis of Articulated Robot Arms and Its Utilization for Tasks with PriorityTransactions of the Society of Instrument and Control Engineers, 1983
- Scheduling of Parallel Computation for a Computer-Controlled Mechanical ManipulatorIEEE Transactions on Systems, Man, and Cybernetics, 1982
- Scheduling of Distributed Computer Control Systems for Industrial Robots *IFAC Proceedings Volumes, 1981
- On-Line Computational Scheme for Mechanical ManipulatorsJournal of Dynamic Systems, Measurement, and Control, 1980
- A comparison of list schedules for parallel processing systemsCommunications of the ACM, 1974
- Characterization and Theoretical Comparison of Branch-and-Bound Algorithms for Permutation ProblemsJournal of the ACM, 1974
- Bounds on the Number of Processors and Time for Multiprocessor Optimal SchedulesIEEE Transactions on Computers, 1973