V2C和V2V充电的协同:减少里程焦虑,增加电动汽车的充电量

O. Kim, Nguyen H. Tran, Vandung Nguyen, Sun Moo Kang, C. Hong
{"title":"V2C和V2V充电的协同:减少里程焦虑,增加电动汽车的充电量","authors":"O. Kim, Nguyen H. Tran, Vandung Nguyen, Sun Moo Kang, C. Hong","doi":"10.1109/ICOIN.2018.8343205","DOIUrl":null,"url":null,"abstract":"Recent years have witnessed a rapidly growth in the number of vehicles on road. It causes environment pollution. Both scientist and companies have paid attention to electric vehicles (EVs) as a clean energy to reduce the oil demands and gas emissions. On the other hand, autonomous electric vehicles have been seen as cutting-edge technology. Self-driving vehicles, and vehicle ride-sharing offered by autonomous EVs are transportation services that have surged quickly. However, use of EVs spread steadily these days because of range anxiety problem and limited charging spots. To overcome these problems, we introduce a novel algorithm for charging problem. Unlike current works, charging strategies are tackled to make the cooperation between V2C and V2V efficiently by proposing an algorithm developed based on the matching theory, then it can offer the sufficient supplier for EVs requested charging service. Simulation results show that the proposed matching based algorithm outperforms the V2C and V2V approaches by 50 % in term of the number of charged EVs. In addition, the range anxiety under our proposal is halved compared with two charging mechanism V2C approach.","PeriodicalId":228799,"journal":{"name":"2018 International Conference on Information Networking (ICOIN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"Cooperative between V2C and V2V charging: Less range anxiety and more charged EVs\",\"authors\":\"O. Kim, Nguyen H. Tran, Vandung Nguyen, Sun Moo Kang, C. Hong\",\"doi\":\"10.1109/ICOIN.2018.8343205\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Recent years have witnessed a rapidly growth in the number of vehicles on road. It causes environment pollution. Both scientist and companies have paid attention to electric vehicles (EVs) as a clean energy to reduce the oil demands and gas emissions. On the other hand, autonomous electric vehicles have been seen as cutting-edge technology. Self-driving vehicles, and vehicle ride-sharing offered by autonomous EVs are transportation services that have surged quickly. However, use of EVs spread steadily these days because of range anxiety problem and limited charging spots. To overcome these problems, we introduce a novel algorithm for charging problem. Unlike current works, charging strategies are tackled to make the cooperation between V2C and V2V efficiently by proposing an algorithm developed based on the matching theory, then it can offer the sufficient supplier for EVs requested charging service. Simulation results show that the proposed matching based algorithm outperforms the V2C and V2V approaches by 50 % in term of the number of charged EVs. In addition, the range anxiety under our proposal is halved compared with two charging mechanism V2C approach.\",\"PeriodicalId\":228799,\"journal\":{\"name\":\"2018 International Conference on Information Networking (ICOIN)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 International Conference on Information Networking (ICOIN)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOIN.2018.8343205\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information Networking (ICOIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOIN.2018.8343205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

近年来,道路上的车辆数量迅速增长。它造成环境污染。科学家和公司都关注电动汽车(ev)作为一种清洁能源,以减少石油需求和天然气排放。另一方面,自动驾驶电动汽车一直被视为尖端技术。自动驾驶汽车和自动驾驶电动汽车提供的车辆共享服务是迅速增长的交通服务。然而,由于里程焦虑问题和有限的充电点,电动汽车的使用近年来稳步普及。为了克服这些问题,我们引入了一种新的充电算法。与现有研究不同,本文提出了一种基于匹配理论的充电策略算法,解决了V2C和V2V之间高效合作的充电策略问题,从而为电动汽车提供充足的充电服务。仿真结果表明,基于匹配的算法在充电电动汽车数量上比V2C和V2V方法高出50%。此外,与V2C两种充电机制相比,我们提出的方案将里程焦虑降低了一半。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Cooperative between V2C and V2V charging: Less range anxiety and more charged EVs
Recent years have witnessed a rapidly growth in the number of vehicles on road. It causes environment pollution. Both scientist and companies have paid attention to electric vehicles (EVs) as a clean energy to reduce the oil demands and gas emissions. On the other hand, autonomous electric vehicles have been seen as cutting-edge technology. Self-driving vehicles, and vehicle ride-sharing offered by autonomous EVs are transportation services that have surged quickly. However, use of EVs spread steadily these days because of range anxiety problem and limited charging spots. To overcome these problems, we introduce a novel algorithm for charging problem. Unlike current works, charging strategies are tackled to make the cooperation between V2C and V2V efficiently by proposing an algorithm developed based on the matching theory, then it can offer the sufficient supplier for EVs requested charging service. Simulation results show that the proposed matching based algorithm outperforms the V2C and V2V approaches by 50 % in term of the number of charged EVs. In addition, the range anxiety under our proposal is halved compared with two charging mechanism V2C approach.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信