MétaCan
Menu
Back to cohort
Record W4391305615 · doi:10.1109/tase.2023.3347264

Socially Intelligent Reinforcement Learning for Optimal Automated Vehicle Control in Traffic Scenarios

2024· article· en· W4391305615 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Automation Science and Engineering · 2024
Typearticle
Languageen
FieldEngineering
TopicTraffic control and management
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsReinforcement learningControl (management)Computer scienceIntelligent transportation systemEngineeringReinforcementControl engineeringArtificial intelligenceTransport engineering

Abstract

fetched live from OpenAlex

In this paper, a novel approach is presented for modeling the interaction dynamics between an ego car and a bicycle in a traffic scenario using a hybrid reinforcement learning framework combined with a social value orientation (SVO) model. The proposed framework leverages the SARSA algorithm to learn the optimal policy for the ego vehicle while incorporating risk cost as the negative log-likelihood of collision. Additionally, a customized SVO model is introduced to capture the social preferences of the ego car and the bicycle, defining the SVO of each agent as a continuous variable between egoistic and cooperative orientations. Furthermore, a weight parameter is incorporated in the framework to regulate the influence of the SVO model on the learning process. We demonstrate the effectiveness of our approach through extensive simulations, showing that the ego car can balance between maximizing its reward and avoiding collisions while considering the social preferences of the agents. The obtained results are compared to other models in the literature, and it is shown that the proposed method contributes to the development of safe and efficient autonomous driving systems that interact with human-driven vehicles in a socially intelligent manner <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">Note to Practitioners</i> —This proposed framework is motivated by the pressing challenge of navigation for autonomous cars in complex urban driving scenarios and mixed traffic situations. With the increasing prevalence of autonomous vehicles on roads, developing intelligent navigation systems that can effectively interact with other road users has become essential. Our novel framework addresses this need by leveraging the SARSA algorithm to learn the optimal policy for the ego vehicle while incorporating risk cost as the negative log-likelihood of collision. Additionally, a customized SVO model is introduced to capture the social preferences of the ego car and the bicycle, defining the SVO of each agent as a continuous variable between egoistic and cooperative orientations. This enables autonomous vehicles to make informed decisions and navigate safely and efficiently. Our framework can enormously help the field of autonomous vehicle navigation and contribute significantly to developing safe, human-centric, and reliable transportation systems. The versatility of our approach is evident in its potential to support a network of autonomous vehicles interacting with multiple road users, thereby enhancing scalability. By leveraging the power of machine learning, our solution provides a robust and adaptable approach that can handle the diverse and ever-changing conditions of urban driving scenarios.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.863
Threshold uncertainty score0.579

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.009
GPT teacher head0.228
Teacher spread0.219 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it