arXiv:2606. 04167v1 Announce Type: cross Abstract: We tackle the Metro Network Expansion Problem (MNEP), a subset of the Transport Network Design Problem (TNDP), which focuses on expanding metro systems to satisfy travel demand.
By Dimitris Michailidis, Sennay Ghebreab, Fernando P. Santos
We’ve developed a hierarchical reinforcement learning algorithm that learns high-level actions useful for solving a range of tasks, allowing fast solving of tasks requiring thousands of timesteps. Our algorithm, when applied to a set of navigation problems, discovers a set of high-level actions for walking and crawling in different directions, which enables the agent to master new navigation tasks quickly.
An expert in behavioral science and transportation, Zhao combines these studies with AI and public policy to address some of the most urgent challenges facing cities.
By Maria Iacobo | School of Architecture and Planning
We’re launching a transfer learning contest that measures a reinforcement learning algorithm’s ability to generalize from previous experience.
arXiv:2604. 17456v2 Announce Type: replace Abstract: Large language model (LLM) agents have shown strong capabilities in long-horizon reasoning, tool use, and decision-making in digital environments, yet extending them to physically grounded systems remains challenging.
By Siqi Lai, Pan Zhang, Yuping Zhou, Jindong Han, Yansong Ning, Hao Liu
The paper introduces an agent‑based modeling framework that integrates a physical infrastructure layer, a V2X connectivity layer, and a decision layer using reinforcement learning and multi‑agent reinforcement learning to simulate smart freight corridors. Three scenarios—Baseline, Assisted, and Cognitive—are evaluated on throughput, congestion, energy, emissions, and robustness, with the Cognitive scenario outperforming the baseline in throughput and congestion, and the Assisted scenario achieving energy savings via platooning. Sensitivity analysis shows that the smart corridor’s throughput advantage grows under high demand and that MARL coordination better utilizes fixed charging capacity than rule‑based methods.
By Madelaine Martinez-Ferguson, Chun Wang, Mustafa Can Camur, Xueping Li
arXiv:2503. 23650v2 Announce Type: replace Abstract: Reinforcement learning (RL), with its ability to explore and optimize policies in complex, dynamic decision-making tasks, has emerged as a promising approach to addressing motion planning (MoP) challenges in autonomous driving (AD).
By Zhuoren Li, Guizhe Jin, Ran Yu, Weiqi Zhang, Zhiwen Chen, Nan Li, Lu Xiong, Ilya Kolmanovsky, Dimitar Filev, Bo Leng, Jia Hu
The paper investigates combining Reinforcement Learning (RL) with search-based path planners to accelerate flight trajectory optimization for airliners. An RL agent is trained to generate near‑optimal paths from location and atmospheric data, which then constrain a traditional solver to reduce its search space. Experiments using Airbus performance models show that fuel consumption deviates by less than 1% from an unconstrained solver while computation time improves by up to 50%.
By Alberto Luise, Michele Lombardi
arXiv:2607. 01639v1 Announce Type: new Abstract: Universal traffic laws describe recurrent patterns in congestion, mobility and driving behavior across cities, providing a scientific basis for transportation planning, management and control.
By Xingyuan Dai, Yue Liu, Xiaoyan Gong, Qinghai Miao, Junyou Shang, Yutong Wang, Chao Guo, Yonglin Tian, Yizhang Chai, Chao Xiang, Yisheng Lv, Fei-Yue Wang
The paper introduces Reinforcement Learning Enhanced LLM Agents (RLEA), a multi‑agent framework that automates the modeling of complex Vehicle Routing Problems (VRPs). RLEA employs a lightweight neural Planner trained with Soft Q‑learning to coordinate LLM‑based agents, and incorporates an evolutionary memory module and retrieval‑augmented generation to leverage experience and external solver knowledge. Experiments on 48 VRP variants show that RLEA outperforms the prior state‑of‑the‑art method, achieving a 16.67% higher success rate and significantly reducing runtime errors.
By Yi Chen, Zikang Yu, Jiahai Wang, Jinbiao Chen, Jianpeng Zhou, Zizhen Zhang
We’re releasing CoinRun, a training environment which provides a metric for an agent’s ability to transfer its experience to novel situations and has already helped clarify a longstanding puzzle in reinforcement learning. CoinRun strikes a desirable balance in complexity: the environment is simpler than traditional platformer games like Sonic the Hedgehog but still poses a worthy generalization challenge for state of the art algorithms.
arXiv:2609.07575v1 Announce Type: cross
Abstract: This work introduces an alternative view of efficient exploration and studies its theoretical and empirical implications in the absence of extrinsic...
By Mikel Malag\'on, Jon Vadillo, Josu Ceberio, Michael Bowling, Jose A. Lozano