Path assignment and resource allocation control in reconfigurable multi-vehicle system

In this paper we study control of reconfigurable multi-vehicle system. Our method builds upon an existing deadlock-free resource allocation control method that is based on the identification of higher-level deadlocks. We identify a smaller set of cyclic circular waits to be controlled, and provide an algorithm for determination of such cyclic circular waits. Furthermore, we propose a path assignment algorithm that aims at lowering the structural complexity of the corresponding resource allocation system, while taking into account path length. Methods are tested in a simulation environment and results show their efficiency.