File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

AuTsz-Chiu

Au, Tsz-Chiu
Agents & Robotic Transportation Lab.
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Batch Reservations in Autonomous Intersection Management

Author(s)
Shahidi, N.Au, Tsz-ChiuStone, P.
Issued Date
2011-05-02
URI
https://scholarworks.unist.ac.kr/handle/201301/34456
Fulltext
http://www.scopus.com/inward/record.url?eid=2-s2.0-84899454807&partnerID=40&md5=126a8975bc58a165d83b4b7fd835565e
Citation
Tenth International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2011), pp.1155 - 1156
Abstract
The recent robot car competitions and demonstrations have convincingly shown that fully autonomous vehicles are feasible with current or near-future intelligent vehicle technology. Looking ahead to the time when such autonomous cars will be common, Dresner and Stone proposed a new intersection control protocol called Autonomous Intersection Management (AIM) and showed that by leveraging the capacities of autonomous vehicles we can devise a reservation-based intersection control protocol that is much more efficient than traffic signals and stop signs. Their proposed protocol, however, handles reservation requests one at a time and does not prioritize reservations according to their relative importance and vehicles' waiting times, causing potentially large inequalities in granting reservations. For example, at an intersection between a main street and an alley, vehicles from the alley can take a very long time to get reservations to enter the intersection. In this research, we introduce a prioritization scheme to prevent uneven reservation assignments in unbalanced traffic. Our experimental results show that our prioritizing scheme outperforms previous intersection control protocols in unbalanced traffic.
Publisher
AAMAS

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.