KAN-LSTM Enhanced Multi-Agent Advantage Actor-Critic Reinforcement Learning for Autonomous Ramp Merging

Autonomous ramp merging represents one of the most challenging scenarios for autonomous vehicles (AVs), re-quiring safe interaction with human-driven vehicles (HDVs) while maintaining traffic efficiency. This paper proposes a novel KL-MA2C framework, which integrates Kolmogorov-Arnold Networks (KAN) and Long Short-Term Memory (LSTM) into the Multi-Agent Advantage Actor-Critic (MA2C) algorithm. The proposed framework addresses key limitations in existing approaches to robust safety mechanisms. Our key contribution lies in the synergistic integration of KAN-LSTM within a multiagent reinforcement learning framework. KAN provides superior function approximation through adaptive spline-based activation functions, while LSTM captures temporal dependencies in human driving patterns. This combination is enhanced by an action inspector that enforces safety constraints and Model Predictive Control (MPC) that ensures smooth trajectory execution. Extensive simulations demonstrate significant safety and efficiency performance improvements over state-of-the-art methods. These results establish KL-MA2C as an effective solution for autonomous ramp merging, with potential implications for safe and efficient autonomous driving in complex multi-agent environments.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Vehicular Technology
Published
2025-08-08
DOI
https://doi.org/10.1109/tvt.2025.3593661
Citations
2
Primary Topic
Transportation and Mobility Innovations
Type
article
Field-Weighted Citation Impact
1.37

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

KAN-LSTM Enhanced Multi-Agent Advantage Actor-Critic Reinforcement Learning for Autonomous Ramp Merging

Jianglin Lan, Xianxian Zhao, Zhihao Lin
2 citations
IEEE Transactions on Vehicular Technology
Transportation and Mobility Innovations
1.37
article

KAN-LSTM Enhanced Multi-Agent Advantage Actor-Critic Reinforcement Learning for Autonomous Ramp Merging

Jianglin Lan, Xianxian Zhao, Zhihao Lin
article en
2 citations

Abstract

Autonomous ramp merging represents one of the most challenging scenarios for autonomous vehicles (AVs), re-quiring safe interaction with human-driven vehicles (HDVs) while maintaining traffic efficiency. This paper proposes a novel KL-MA2C framework, which integrates Kolmogorov-Arnold Networks (KAN) and Long Short-Term Memory (LSTM) into the Multi-Agent Advantage Actor-Critic (MA2C) algorithm. The proposed framework addresses key limitations in existing approaches to robust safety mechanisms. Our key contribution lies in the synergistic integration of KAN-LSTM within a multiagent reinforcement learning framework. KAN provides superior function approximation through adaptive spline-based activation functions, while LSTM captures temporal dependencies in human driving patterns. This combination is enhanced by an action inspector that enforces safety constraints and Model Predictive Control (MPC) that ensures smooth trajectory execution. Extensive simulations demonstrate significant safety and efficiency performance improvements over state-of-the-art methods. These results establish KL-MA2C as an effective solution for autonomous ramp merging, with potential implications for safe and efficient autonomous driving in complex multi-agent environments.

IEEE Transactions on Vehicular TechnologyVol. 75(1)
University College Dublin (IE), University of Glasgow (GB)
Sustainable Energy Authority of Ireland, China Scholarship Council
Openalex Percentile: Top 18%
Transportation and Mobility Innovations
1.37
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.