Residential College | false |
Status | 已發表Published |
Toward Collision-Free and Efficient Coordination for Automated Vehicles at Unsignalized Intersection | |
Qian,Bo1; Zhou,Haibo1,2; Lyu,Feng2; Li,Jinglin3; Ma,Ting4; Hou,Fen5,6 | |
2019-12-01 | |
Source Publication | IEEE Internet of Things Journal |
ISSN | 2327-4662 |
Volume | 6Issue:6Pages:10408-10420 |
Abstract | With the significant advance of vehicle-to-everything (V2X) techniques, unsignalized intersection coordination has been widely recognized to facilitate the development of automated vehicles (AVs) for the intelligent transportation system. However, how to guarantee driving safety while improving the unsignalized intersection management efficiency is a challenging issue. In this article, we investigate the collision-free and efficient V2X-enabled AV scheduling problem at unsignalized intersections. First, by dividing the intersection zone into different collision sections (CSs), we formulate the intersection collision-free model into an absolute value programming (AVP) problem, which is proved to be NP-hard. We consider both nonplatoon and platoon traffic scenarios, and unlike previous algorithms, which require to control all the AVs at each scheduling step with computational intractability, our scheduling algorithm can assign a feasible time for each arriving AV with low complexity. Further, we propose an alternately iterative descent method (AIDM) to solve the AVP problem by assigning the optimal entering time for each arriving AV. Through extensive simulations with various traffic data generated by SUMO, we demonstrate that our proposed AIDM algorithm can significantly enhance the scheduling performance in terms of passing delay and scheduling throughput. Even though the AIDM algorithm achieves the same level of transportation performances with the state-of-the-art algorithm, it advances dramatically in computational complexity and communication overhead, which is easier to be implemented in practice. |
Keyword | Absolute Value Programming (Avp) Automated Vehicle (Av) Scheduling Unsignalized Intersection Vehicle-to-everything (V2x) |
DOI | 10.1109/JIOT.2019.2939180 |
URL | View the original |
Indexed By | SCIE |
Language | 英語English |
WOS Research Area | Computer Science ; Engineering ; Telecommunications |
WOS Subject | Computer Science, Information Systems ; Engineering, Electrical & Electronic ; Telecommunications |
WOS ID | WOS:000503985700096 |
Publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 445 HOES LANE, PISCATAWAY, NJ 08855-4141 |
Scopus ID | 2-s2.0-85076791705 |
Fulltext Access | |
Citation statistics | |
Document Type | Journal article |
Collection | DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING |
Corresponding Author | Zhou,Haibo |
Affiliation | 1.School of Electronic Science and Engineering,Nanjing University,Nanjing,210023,China 2.Department of Computer Science and Engineering,Shanghai Jiao Tong University,Shanghai,210023,China 3.State Key Laboratory of Networking and Switching Technology,Beijing University of Posts and Telecommunications,Beijing,200240,China 4.College of Mathematics,Sichuan University,Chengdu,100876,China 5.State Key Laboratory of IoT for Smart City,University of Macau,610065,Macao 6.Department of Electrical and Computer Engineering,University of Macau,Macao |
Recommended Citation GB/T 7714 | Qian,Bo,Zhou,Haibo,Lyu,Feng,et al. Toward Collision-Free and Efficient Coordination for Automated Vehicles at Unsignalized Intersection[J]. IEEE Internet of Things Journal, 2019, 6(6), 10408-10420. |
APA | Qian,Bo., Zhou,Haibo., Lyu,Feng., Li,Jinglin., Ma,Ting., & Hou,Fen (2019). Toward Collision-Free and Efficient Coordination for Automated Vehicles at Unsignalized Intersection. IEEE Internet of Things Journal, 6(6), 10408-10420. |
MLA | Qian,Bo,et al."Toward Collision-Free and Efficient Coordination for Automated Vehicles at Unsignalized Intersection".IEEE Internet of Things Journal 6.6(2019):10408-10420. |
Files in This Item: | There are no files associated with this item. |
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment