EFFICIENT SCHEDULING ALGORITHMS FOR ROBOT INVERSE DYNAMICS COMPUTATION ON A MULTIPROCESSOR SYSTEM

The problem of scheduling the robot inverse dynamics computation consisting of m computational modules to be executed on a multiprocessor system consisting of p identical homogeneous processors to achieve a minimum-schedule length is examined. This scheduling problem is known to be NP-complete. To achieve the minimum computation time, the Newton-Euler equations of motion are expressed in the homogeneous linear recurrence form that results in achieving maximum parallelism. To speed up the searching for a solution, a heuristic search algorithm called dynamical highest-level-first/most-immediate-successors-first (DHLF/MISF) is first proposed to find a fast but suboptimal schedule. For an optimal schedule the minimum-schedule-length problem can be solved by a state-space search method - the A* algorithm coupled with an efficient heuristic function derived from the Fernandez and Bussell bound. An objective function is defined in terms of the task execution time, and the optimization of the objective function is based on the minimax of the execution time. The proposed optimization algorithm solves the minimum-schedule-length problem in pseudopolynomial time and can be used to solve various large-scale problems in a reasonable time.