A heuristic approach to task assignment and control for robotic networks

Operating a robotic network involves addressing feedback control, task planning and dynamic resource assignment. Ideally, these issues should be tackled in an integrated way, although this poses a number of complex challenges involving combinatorial complexity, computational requirements and implementation efforts. This paper presents a novel dynamic task assignment algorithm integrated in a discrete event formalism, which is able to fully characterize the dynamics of the network and incorporate robots allocation, conflict resolution and task assignment policies. After providing a brief introduction to the main characteristics of the network model and control framework, this paper focuses on the task scheduling algorithm. The effects of the various configuration parameters, along with the strengths and limitations of the proposed approach are assessed by means of an extensive simulation study considering robotic networks of various sizes and characteristics.