By Topic

Establishing the NP-hardness of maximally permissive RAS-based approaches to multi-vehicle system safety

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Elzbieta Roszkowska ; Institute of Computer Engineering, Control and Robotics, Wroclaw University of Technology, Poland ; Spyros Reveliotis

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.

Published in:

Robotics and Automation (ICRA), 2010 IEEE International Conference on

Date of Conference:

3-7 May 2010