Deep reinforcement learning approach for autonomous vehicle systems for maintaining security and safety using LSTM-GAN
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
The success of autonomous vehicles ( A V h s ) depends upon the effectiveness of sensors being used and the accuracy of communication links and technologies being employed. But these sensors and communication links have great security and safety concerns as they can be attacked by an adversary to take the control of an autonomous vehicle by influencing their data. Especially during the state estimation process for monitoring of autonomous vehicles' dynamics system, these concerns require immediate and effective solution. In this paper we present a new adversarial deep reinforcement learning algorithm (NDRL) that can be used to maximize the robustness of autonomous vehicle dynamics in the presence of these attacks. In this approach the adversary tries to insert defective data to the autonomous vehicle's sensor readings so that it can disrupt the safe and optimal distance between the autonomous vehicles traveling on the road. The attacker tries to make sure that there is no more safe and optimal distance between the autonomous vehicles, thus it may lead to the road accidents. Further attacker can also add fake data in such a way that it leads to reduced traffic flow on the road. On the other hand, autonomous vehicle will try to defend itself from these types of attacks by maintaining the safe and optimal distance i.e. by minimizing the deviation so that adversary does not succeed in its mission. This attacker-autonomous vehicle action reaction can be studied through the game theory formulation with incorporating the deep learning tools. Each autonomous vehicle will use Long-Short-Term-Memory (LSTM)-Generative Adversarial Network (GAN) models to find out the anticipated distance variation resulting from its actions and input this to the new deep reinforcement learning algorithm (NDRL) which attempts to reduce the variation in distance. Whereas attacker also chooses deep reinforcement learning algorithm (NDRL) and wants to maximize the distance variation between the autonomous vehicles.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium
Heusel, M., Ramsauer, H., Unterthiner, T., Nessler, B., & Hochreiter, S. (2017) · arXiv · doi:10.48550/arxiv.1706.08500 · Cited by 8,365
Rasheed, I., Hu, F., Hong, Y.-K., & Balasubramanian, B. (2021) · IEEE Transactions on Intelligent Transportation Systems · doi:10.1109/tits.2020.2973859 · Cited by 86
Self-citation
Cited by
Deep reinforcement learning for cyber security
Nguyen, T. T., & Reddi, V. J. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2021.3121870 · Cited by 620
Wang, J., Zhang, L., Huang, Y., Zhao, J., & Bella, F. (2020) · Journal of Advanced Transportation · doi:10.1155/2020/8867757 · Cited by 261
Self-citationMachine Learning for Security in Vehicular Networks: A Comprehensive Survey
Talpur, A., & Gurusamy, M. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2021.3129079 · Cited by 107
“vehicle’s dynamics control system, is proposed in [93].”
BackgroundInfluential
Metadata
- Authors
- Rasheed, I., Hu, F., & Zhang, L.
- Venue
- Vehicular Communications
- Publisher
- Elsevier BV
- Published
- 2020-12
- Volume
- 26
- Pages
- 100266
- ISSN
- 2214-2096 (ISSN-L)
- OpenAlex
- W3026911476
- Cited by
- 64
- References
- 2
- FWCI
- 3.60
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.