MétaCan
Menu
Back to cohort
Record W4406171015 · doi:10.1109/tase.2025.3527327

Behaviorally-Aware Multi-Agent RL With Dynamic Optimization for Autonomous Driving

2025· article· en· W4406171015 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 · 2025
Typearticle
Languageen
FieldComputer Science
TopicReinforcement Learning in Robotics
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer scienceAutonomous agentVehicle dynamicsControl engineeringEngineeringArtificial intelligenceAutomotive engineering

Abstract

fetched live from OpenAlex

This study presents a novel Multi-Agent Reinforcement Learning (MURL) architecture for autonomous vehicle (AV) navigation in complex urban traffic environments. By integrating a Social Value Orientation (SVO) model into a model-free SARSA reinforcement learning framework, our approach effectively balances individual agents’ social preferences with safety and performance objectives. A logistic regression-based risk assessment module evaluates collision probabilities in real time by analyzing spatiotemporal dynamics such as distances and velocities. Additionally, a dynamic optimizer adapts the learning rate and exploration strategies of the SARSA algorithm to provide efficient convergence to optimal policies. Extensive simulation experiments demonstrate that the proposed method significantly enhances safety and efficiency, achieving a 55.6% reduction in collision risk and increasing average rewards per episode by 2.1 compared to traditional SARSA without SVO. Furthermore, the optimized policy reduces average episode length, indicating the framework’s effectiveness in providing robust decision-making and adaptability across various traffic 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: Methods · Consensus signal: none
Teacher disagreement score0.738
Threshold uncertainty score0.473

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.001
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.011
GPT teacher head0.256
Teacher spread0.245 · 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