-- Urban driving with connected and automated vehicles (CA Vs) offers potential for energy savings, yet most eco-driving strategies focus solely on longitudinal speed control within a single lane. T o address this gap, we propose a novel energy-aware motion planning framework that jointly optimizes longitudinal speed and lateral lane-change decisions using vehicle-to-infrastructure (V2I) communication. Our approach estimates long-term energy costs using a graph-based approximation and solves short-horizon optimal control problems under traffic constraints. Using a data-driven energy model calibrated to an actual battery electric vehicle, we demonstrate with vehicle-in-the-loop experiments that our method reduces motion energy consumption by up to 24% compared to a human driver, highlighting the potential of connectivity-enabled planning for sustainable urban autonomy. Connected and Automated V ehicles (CA Vs) provide benefits in road safety, traffic efficiency, and energy efficiency [1]. Using vehicle-to-infrastructure (V2I) and vehicle-to-vehicle (V2V) communications, CA Vs can coordinate with traffic signals and neighboring vehicles to optimize their motion in ways human drivers are incapable of [2]. Prior studies have shown that by optimizing longitudinal behavior using Signal Phase and Timing (SPaT) data from connected traffic lights, a single CA V can adjust its cruising speed to avoid unnecessary stops, yielding substantial energy savings (11.35 % to 16.4%) [3], [4].

We introduce an Implicit Game-Theoretic MPC (IGT-MPC), a decentralized algorithm for two-agent motion planning that uses a learned value function that predicts the game-theoretic interaction outcomes as the terminal cost-to-go function in a model predictive control (MPC) framework, guiding agents to implicitly account for interactions with other agents and maximize their reward. This approach applies to competitive and cooperative multi-agent motion planning problems which we formulate as constrained dynamic games. Given a constrained dynamic game, we randomly sample initial conditions and solve for the generalized Nash equilibrium (GNE) to generate a dataset of GNE solutions, computing the reward outcome of each game-theoretic interaction from the GNE. The data is used to train a simple neural network to predict the reward outcome, which we use as the terminal cost-to-go function in an MPC scheme. We showcase emerging competitive and coordinated behaviors using IGT-MPC in scenarios such as two-vehicle head-to-head racing and un-signalized intersection navigation. IGT-MPC offers a novel method integrating machine learning and game-theoretic reasoning into model-based decentralized multi-agent motion planning.

Abstract-- We propose a hierarchical architecture designed for scalable real-time Model Predictive Control (MPC) in complex, multi-modal traffic scenarios. This architecture comprises two key components: 1) RAID-Net, a novel attention-based Recurrent Neural Network that predicts relevant interactions along the MPC prediction horizon between the autonomous vehicle and the surrounding vehicles using Lagrangian duality, and 2) a reduced Stochastic MPC problem that eliminates irrelevant collision avoidance constraints, enhancing computational efficiency. Our approach is demonstrated in a simulated traffic intersection with interactive surrounding vehicles, showcasing a 12x speed-up in solving the motion planning problem. While this approach showcases robust navigation to heterogeneous traffic agents: human-driven and autonomous capabilities in multi-modal traffic scenarios, it focuses on vehicles navigating and making their own decisions. The game theoretic approaches in In urban driving scenarios, the motion planning for autonomous (ii) are generally computationally intractable for traffic scenarios vehicles in the presence of uncertain, multi-modal with many vehicles/agents, which is further exacerbated human-driven and autonomous vehicles poses a significant when the games are multi-modal/mixed.

A distributed coordination method for solving multi-vehicle lane changes for connected autonomous vehicles (CAVs) is presented. Existing approaches to multi-vehicle lane changes are passive and opportunistic as they are implemented only when the environment allows it. The novel approach of this paper relies on the role of a facilitator assigned to a CAV. The facilitator interacts with and modifies the environment to enable lane changes of other CAVs. Distributed MPC path planners and a distributed coordination algorithm are used to control the facilitator and other CAVs in a proactive and cooperative way. We demonstrate the effectiveness of the proposed approach through numerical simulations. In particular, we show enhanced feasibility of a multi-CAV lane change in comparison to the simultaneous multi-CAV lane change approach in various traffic conditions generated by using a data-set from real-traffic scenarios.