Fully distributed traffic control strategies for many-AGV systems

A model for studying fully distributed traffic control strategies for many-AGV systems in an operating field of a network of stations and passages is proposed. As a basic operating primitive, distributed mutual exclusion on a resource of capacity M (0<M⩽N, where N is the number of potential competitors) under this model is presented along with an algorithm that solves the fully distributed traffic control problem for a special case, where the capacity of stations is ∞. Research problems in such a system including deadlock detection and deadlock resolution are also discussed