engleski

USE OF LOCAL SEARCH ALGORITHM FOR TASK ALLOCATION PROBLEM OF ROBOT DYNAMICS CALCULATION

This paper deals with application of localized random search algorithm for finding near optimal solution for placement of processes on multiple processor system. This problem is known to be NP-Complete. As an example robot’s dynamics formulation is decomposed. Results show good speedups and processor use eficiency with moderate number of schedulling algorithm iterations.

parallel processing; scheduling; robotics; allocation

nije evidentirano