Polynomial-time optimal liveness enforcement for guidepath-based transport systems

DOI10.1016/j.nahs.2021.101058OpenAlexW3163105975MaRDI QIDQ2665316

Tomáš Masopust, Spyros A. Reveliotis, Michael Nawar Ibrahim

Publication date: 19 November 2021

Published in: Nonlinear Analysis. Hybrid Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.nahs.2021.101058

zbMATH Keywords

deadlock avoidancediscrete event systemsguidepath-based transport systemstraffic liveness and its enforcement

Mathematics Subject Classification ID

Computer science (68-XX) Systems theory; control (93-XX)

Cites Work

• Unnamed Item
• On-line compositional controller synthesis for AGV
• A linear-time algorithm for the feasibility of pebble motion on trees
• Design and operational issues in AGV-served manufacturing systems
• A note on finding the bridges of a graph
• Graph puzzles, homotopy, and the alternating group
• On the state liveness of some classes of guidepath-based transport systems and its computational complexity
• Survey of research in the design and control of automated guided vehicle systems
• Deadlock Prediction: Easy and Difficult Cases
• 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

This page was built for publication: Polynomial-time optimal liveness enforcement for guidepath-based transport systems