An approach to determination of simple circular waits in reconfigurable multi-vehicle systems

Resource allocation systems are used for modeling and control of flexible manufacturing systems, multi-vehicle systems, traffic networks, etc. Methods for control of these systems are often based on the identification of a special structural property, simple circular wait of resources, and interrelations between simple circular waits. In this paper we study reconfigurable resource allocation systems, which require that control algorithm is modified online and, therefore, has low running time. In this paper we propose dynamical algorithms for determination of simple circular waits in reconfigurable systems, which are based on Johnson´s algorithm, and aim at identifying only changes in the set of simple circular waits. Running time of the proposed algorithms is lower than running time of standard static methods. Algorithms are tested for a family of multi-vehicle systems and results confirm the advantages of using the dynamic algorithms.