https://scholars.lib.ntu.edu.tw/handle/123456789/607143
DC 欄位 | 值 | 語言 |
---|---|---|
dc.contributor.author | Lin S.-C | en_US |
dc.contributor.author | Kung C.-C | en_US |
dc.contributor.author | Lin L | en_US |
dc.contributor.author | CHUNG-WEI LIN | en_US |
dc.contributor.author | HUI-RU JIANG | en_US |
dc.creator | Lin S.-C;Kung C.-C;Lin L;Lin C.-W;Jiang I.H.-R. | - |
dc.date.accessioned | 2022-04-25T06:42:26Z | - |
dc.date.available | 2022-04-25T06:42:26Z | - |
dc.date.issued | 2021 | - |
dc.identifier.issn | 15502252 | - |
dc.identifier.uri | https://www.scopus.com/inward/record.uri?eid=2-s2.0-85122993813&doi=10.1109%2fVTC2021-Fall52928.2021.9625514&partnerID=40&md5=b80c2d688e7c34efe439906f08bc784b | - |
dc.identifier.uri | https://scholars.lib.ntu.edu.tw/handle/123456789/607143 | - |
dc.description.abstract | In a mandatory lane-changing scenario, vehicles need to move to their target lanes before the end of a road segment. Mandatory lane changing usually happens near a highway ramp, and it is one major source of traffic congestion and delay. The advance of connected and autonomous vehicles supports to solve the problem in a centralized and precise way. We formulate a mandatory lane-changing problem and propose a Mixed-Integer Linear Programming (MILP) approach to find an optimal solution. We then propose an MILP-based incremental-window algorithm to solve the problem efficiently. Experimental results show that the MILP-based incremental-window algorithm can take much less computation time and achieve almost the same solution quality, compared with the original MILP approach. The advantage of efficiency yet sufficient effectiveness matches the need of high-level control (decision of passing order) well. ? 2021 IEEE. | - |
dc.relation.ispartof | IEEE Vehicular Technology Conference | - |
dc.subject | Computational efficiency | - |
dc.subject | Integer programming | - |
dc.subject | Intelligent vehicle highway systems | - |
dc.subject | Traffic congestion | - |
dc.subject | Autonomous Vehicles | - |
dc.subject | Centralised | - |
dc.subject | Computation time | - |
dc.subject | Integer Linear Programming | - |
dc.subject | Lane changing | - |
dc.subject | Mixed integer linear | - |
dc.subject | Optimal solutions | - |
dc.subject | Road segments | - |
dc.subject | Solution quality | - |
dc.subject | Window algorithm | - |
dc.subject | Autonomous vehicles | - |
dc.subject.classification | [SDGs]SDG9 | - |
dc.title | Efficient Mandatory Lane Changing of Connected and Autonomous Vehicles | en_US |
dc.type | conference paper | en |
dc.identifier.doi | 10.1109/VTC2021-Fall52928.2021.9625514 | - |
dc.identifier.scopus | 2-s2.0-85122993813 | - |
dc.relation.journalvolume | 2021-September | - |
item.fulltext | no fulltext | - |
item.cerifentitytype | Publications | - |
item.openairecristype | http://purl.org/coar/resource_type/c_5794 | - |
item.grantfulltext | none | - |
item.openairetype | conference paper | - |
crisitem.author.dept | Computer Science and Information Engineering | - |
crisitem.author.dept | Networking and Multimedia | - |
crisitem.author.dept | Electrical Engineering | - |
crisitem.author.dept | Electronics Engineering | - |
crisitem.author.orcid | 0000-0001-8309-7028 | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
crisitem.author.parentorg | College of Electrical Engineering and Computer Science | - |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。