By Topic

Conflict Resolution in Free-Ranging Multivehicle Systems: A Resource Allocation Paradigm

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
$31 $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)
Reveliotis, S.A. ; Sch. of Ind. & Syst. Eng., Georgia Inst. of Technol., Atlanta, GA, USA ; Roszkowska, E.

We propose a novel paradigm for conflict resolution in multivehicle traffic systems, where a number of mobile agents move freely in a finite area, with each agent following a prespecified-motion profile. The key idea behind the proposed method is the tessellation of the underlying motion area in a number of cells and the treatment of these cells as resources that must be acquired by the mobile agents for the execution of their motion profiles, according to an appropriate resource allocation protocol. We capitalize upon the existing literature on the real-time management of sequential resource allocation systems (RASs) and develop such protocols that can formally guarantee the safe and live operation of the underlying traffic system, while they remain scalable with respect to the number of the moving agents. Collective past experience with the considered policies indicates that they also provide a pretty large coverage of the RAS behavioral space that characterizes its safe and live operation. Finally, we also establish that the aforementioned approach is applicable even in traffic systems where all vehicles must be in perpetual motion until their retirement.

Published in:

Robotics, IEEE Transactions on  (Volume:27 ,  Issue: 2 )