On the state liveness of some classes of guidepath-based transport systems and its computational complexity
From MaRDI portal
Publication:2173958
DOI10.1016/j.automatica.2019.108777zbMath1440.93152MaRDI QIDQ2173958
Publication date: 17 April 2020
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2019.108777
93C95: Application models in control theory
93C65: Discrete event control/observation systems
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Related Items
Uses Software
Cites Work
- Unnamed Item
- On-line compositional controller synthesis for AGV
- Graph puzzles, homotopy, and the alternating group
- Introduction to Discrete Event Systems
- On the Liveness of Guidepath-Based, Zone-Controlled Dynamically Routed, Closed Traffic Systems
- On the Complexity of Maximally Permissive Deadlock Avoidance in Multi-Vehicle Traffic Systems
- Efficient Liveness Assessment for Traffic States in Open, Irreversible, Dynamically Routed, Zone-Controlled Guidepath-Based Transport Systems