Abstract
The establishment of collision-free and live vehicle motion is a prominent problem for many traffic systems. Past work studying this problem in the context of guidepath-based and free-range vehicular systems has implicitly assumed that its resolution through maximally permissive supervision is NP-hard, and therefore, it has typically pursued suboptimal (i.e., more restrictive) solutions. The work presented in this technical note offers formal proof to this implicit assumption, closing the apparent gap in the existing literature. In the process, it also derives an alternative proof for the NP-hardness of maximally permissive liveness-enforcing supervision in Linear, Single-Unit Resource Allocation Systems, that is more concise and more lucid than the currently existing proof.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
