On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
From MaRDI portal
Publication:4978874
DOI10.1109/TAC.2010.2046111zbMath1368.90047OpenAlexW2156553949MaRDI QIDQ4978874
Elzbieta Roszkowska, Spyros A. Reveliotis
Publication date: 25 August 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tac.2010.2046111
Related Items
On the state liveness of some classes of guidepath-based transport systems and its computational complexity ⋮ Polynomial-time optimal liveness enforcement for guidepath-based transport systems ⋮ Event‐triggered model predictive control for multi‐vehicle systems with collision avoidance and obstacle avoidance ⋮ Multi-level control for multiple mobile robot systems ⋮ Efficient generation of performance bounds for a class of traffic scheduling problems