A Driving Risk Prediction Approach Based on Generative Adversarial Networks and VANET for Autonomous Trams

Wenjiang Ji, Jiangcheng Yang, Yichuan Wang, Lei Zhu, Yuan Qiu, Xinhong Hei
{"title":"A Driving Risk Prediction Approach Based on Generative Adversarial Networks and VANET for Autonomous Trams","authors":"Wenjiang Ji, Jiangcheng Yang, Yichuan Wang, Lei Zhu, Yuan Qiu, Xinhong Hei","doi":"10.1109/NaNA53684.2021.00096","DOIUrl":null,"url":null,"abstract":"Driving safety is an essential prerequisite to the rapid development of autonomous trams. However, the relationship of driving risk factors is nonlinear, which makes modeling difficult. To improve the accuracy of driving risk prediction, a data driven approach based on Generative Adversarial Networks was proposed. First of all, a communication and alarming scenario of Vehicular Ad-hoc Networks was demonstrated, in which the original data sets can be collected and transmitted by the help of sensors and Road Side Units. Then the RFE feature selection algorithm was used to keep the key features. To deal the sample asymmetry problem, a DCGAN model was designed for sparse samples expansion. At last, the XGBoost algorithm was used to classification and output the risk prediction result. During the experiment implemented with the public and real data sets, the risk prediction accuracy of proposed approach can up to 97.24%, for which takes the advantages in generating of the sparse samples.","PeriodicalId":414672,"journal":{"name":"2021 International Conference on Networking and Network Applications (NaNA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Networking and Network Applications (NaNA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NaNA53684.2021.00096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Driving safety is an essential prerequisite to the rapid development of autonomous trams. However, the relationship of driving risk factors is nonlinear, which makes modeling difficult. To improve the accuracy of driving risk prediction, a data driven approach based on Generative Adversarial Networks was proposed. First of all, a communication and alarming scenario of Vehicular Ad-hoc Networks was demonstrated, in which the original data sets can be collected and transmitted by the help of sensors and Road Side Units. Then the RFE feature selection algorithm was used to keep the key features. To deal the sample asymmetry problem, a DCGAN model was designed for sparse samples expansion. At last, the XGBoost algorithm was used to classification and output the risk prediction result. During the experiment implemented with the public and real data sets, the risk prediction accuracy of proposed approach can up to 97.24%, for which takes the advantages in generating of the sparse samples.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于生成对抗网络和VANET的自动有轨电车驾驶风险预测方法
驾驶安全是自动驾驶有轨电车快速发展的重要前提。然而,驱动风险因素之间的关系是非线性的,这给建模带来了困难。为了提高驾驶风险预测的准确性,提出了一种基于生成式对抗网络的数据驱动方法。首先,演示了一种车载自组织网络的通信报警场景,在该场景中,传感器和路侧单元可以收集和传输原始数据集。然后使用RFE特征选择算法保留关键特征;为了解决样本不对称问题,设计了一种稀疏样本展开的DCGAN模型。最后,利用XGBoost算法对风险预测结果进行分类并输出。在公开数据集和真实数据集的实验中,该方法的风险预测准确率可达97.24%,具有稀疏样本生成的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Covert Communication in D2D Underlaying Cellular Network Online Scheduling of Machine Learning Jobs in Edge-Cloud Networks Dual attention mechanism object tracking algorithm based on Fully-convolutional Siamese network Fatigue Detection Technology for Online Learning The Nearest Neighbor Algorithm for Balanced and Connected k-Center Problem under Modular Distance
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1