ログイン 新規登録
言語:

WEKO3

  • トップ
  • ランキング
To
lat lon distance
To

Field does not validate



インデックスリンク

インデックスツリー

メールアドレスを入力してください。

WEKO

One fine body…

WEKO

One fine body…

アイテム

  1. シンポジウム
  2. シンポジウムシリーズ
  3. マルチメディア、分散、協調とモバイルシンポジウム(DICOMO)
  4. 2020

Investigation of a Scheduling Scheme for Cooperative Merging at a Highway On-Ramp with Maximizing Average Speed of Automated Vehicles

https://ipsj.ixsq.nii.ac.jp/records/210928
https://ipsj.ixsq.nii.ac.jp/records/210928
39ef45f1-a9b0-4dce-9046-7bd48069e68b
名前 / ファイル ライセンス アクション
IPSJ-DICOMO2020215.pdf IPSJ-DICOMO2020215.pdf (8.8 MB)
Copyright (c) 2020 by the Information Processing Society of Japan
オープンアクセス
Item type Symposium(1)
公開日 2020-06-17
タイトル
タイトル Investigation of a Scheduling Scheme for Cooperative Merging at a Highway On-Ramp with Maximizing Average Speed of Automated Vehicles
タイトル
言語 en
タイトル Investigation of a Scheduling Scheme for Cooperative Merging at a Highway On-Ramp with Maximizing Average Speed of Automated Vehicles
言語
言語 eng
キーワード
主題Scheme Other
主題 クラウドコンピューティング
資源タイプ
資源タイプ識別子 http://purl.org/coar/resource_type/c_5794
資源タイプ conference paper
著者所属
Dept. of Information and Computer Science, Keio University
著者所属
Dept. of Information and Computer Science, Keio University
著者所属
Dept. of Information and Computer Science, Keio University
著者所属
Dept. of Information and Computer Science, Keio University
著者所属(英)
en
Dept. of Information and Computer Science, Keio University
著者所属(英)
en
Dept. of Information and Computer Science, Keio University
著者所属(英)
en
Dept. of Information and Computer Science, Keio University
著者所属(英)
en
Dept. of Information and Computer Science, Keio University
著者名 Masashi, Yoshida

× Masashi, Yoshida

Masashi, Yoshida

Search repository
Hiromu, Asahina

× Hiromu, Asahina

Hiromu, Asahina

Search repository
Hiroshi, Shigeno

× Hiroshi, Shigeno

Hiroshi, Shigeno

Search repository
Iwao, Sasase

× Iwao, Sasase

Iwao, Sasase

Search repository
著者名(英) Masashi, Yoshida

× Masashi, Yoshida

en Masashi, Yoshida

Search repository
Hiromu, Asahina

× Hiromu, Asahina

en Hiromu, Asahina

Search repository
Hiroshi, Shigeno

× Hiroshi, Shigeno

en Hiroshi, Shigeno

Search repository
Iwao, Sasase

× Iwao, Sasase

en Iwao, Sasase

Search repository
論文抄録
内容記述タイプ Other
内容記述 Recently, connected and automated vehicles have potential to mitigate traffic congestion and improve traffic efficiency at a highway on-ramp. The state-of-the-art scheme improves traffic efficiency by assigning timing of merging to automated vehicles on roads by minimizing total travel time of them. The scheme, however, causes traffic congestion when inflow traffic becomes high because of the characteristic that the scheme makes groups of vehicles on the same road. Since length of the groups of vehicles becomes too long as inflow traffic becomes high, this length should be short by decreasing density of vehicles on roads in order to mitigate traffic congestion. In this paper, we show investigation of a scheduling scheme for cooper- ative merging at a highway on-ramp with maximizing average speed of automated vehicles. Based on traffic model that density and speed of vehicles have a negative correlation, we maximize speed of vehicles in order to decrease density of vehicles. Furthermore, we consider fairness between both the main and ramp road in terms of traffic efficiency by utilizing difference of average speed of vehicles on both the main and ramp road. Simulation result shows that the proposed scheme increases outflow traffic from a highway on-ramp by 400 (veh/h) at most in comparison with related schemes when inflow traffic becomes 2000 (veh/h). Furthermore, simulation result shows that the proposed scheme decreases density of vehicles.
論文抄録(英)
内容記述タイプ Other
内容記述 Recently, connected and automated vehicles have potential to mitigate traffic congestion and improve traffic efficiency at a highway on-ramp. The state-of-the-art scheme improves traffic efficiency by assigning timing of merging to automated vehicles on roads by minimizing total travel time of them. The scheme, however, causes traffic congestion when inflow traffic becomes high because of the characteristic that the scheme makes groups of vehicles on the same road. Since length of the groups of vehicles becomes too long as inflow traffic becomes high, this length should be short by decreasing density of vehicles on roads in order to mitigate traffic congestion. In this paper, we show investigation of a scheduling scheme for cooper- ative merging at a highway on-ramp with maximizing average speed of automated vehicles. Based on traffic model that density and speed of vehicles have a negative correlation, we maximize speed of vehicles in order to decrease density of vehicles. Furthermore, we consider fairness between both the main and ramp road in terms of traffic efficiency by utilizing difference of average speed of vehicles on both the main and ramp road. Simulation result shows that the proposed scheme increases outflow traffic from a highway on-ramp by 400 (veh/h) at most in comparison with related schemes when inflow traffic becomes 2000 (veh/h). Furthermore, simulation result shows that the proposed scheme decreases density of vehicles.
書誌情報 マルチメディア,分散協調とモバイルシンポジウム2234論文集

巻 2020, p. 1507-1511, 発行日 2020-06-17
出版者
言語 ja
出版者 情報処理学会
戻る
0
views
See details
Views

Versions

Ver.1 2025-01-19 17:58:50.739327
Show All versions

Share

Mendeley Twitter Facebook Print Addthis

Cite as

エクスポート

OAI-PMH
  • OAI-PMH JPCOAR
  • OAI-PMH DublinCore
  • OAI-PMH DDI
Other Formats
  • JSON
  • BIBTEX

Confirm


Powered by WEKO3


Powered by WEKO3