DocumentCode
3024283
Title
Establishing the NP-hardness of maximally permissive RAS-based approaches to multi-vehicle system safety
Author
Roszkowska, Elzbieta ; Reveliotis, Spyros
Author_Institution
Inst. of Comput. Eng., Wroclaw Univ. of Technol., Wroclaw, Poland
fYear
2010
fDate
3-7 May 2010
Firstpage
322
Lastpage
327
Abstract
The safety problem in multi-vehicle systems seeks to establish collision-free and live vehicle motion, and it is a prominent problem for many configurations of these environments. Past work studying this problem in the context of free-range vehicular systems through abstractions based on Resource Allocation System (RAS) theory, 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 paper offers formal proof to this implicit assumption, closing the apparent gap in the existing literature.
Keywords
collision avoidance; computational complexity; multi-robot systems; optimisation; resource allocation; safety; NP-hard problem; collision free system; free range vehicular system; maximally permissive RAS based approach; multivehicle system safety; resource allocation system theory; Control systems; Distributed computing; Mobile agents; Motion control; Resource management; Robotics and automation; Space vehicles; System recovery; USA Councils; Vehicle safety;
fLanguage
English
Publisher
ieee
Conference_Titel
Robotics and Automation (ICRA), 2010 IEEE International Conference on
Conference_Location
Anchorage, AK
ISSN
1050-4729
Print_ISBN
978-1-4244-5038-1
Electronic_ISBN
1050-4729
Type
conf
DOI
10.1109/ROBOT.2010.5509746
Filename
5509746
Link To Document