Remote driving, as a backup system for automated vehicles, can play a vital role in their commercialization. However, delay is one of the major challenges in the practical application of remote driving. It not only degrades the stability of remote driven vehicles (RDVs) but also introduces delayed driving feedback, such as motion cueing feedback, to remote drivers. This can result in an unpleasant driving experience. This study proposes a square root cubature Kalman filter-based predictor (SRCKP)to compensate for driving feedback delays in remote driving. The SRCKP reduces the limitations of both model-based and model-free predictors (MFPs). Additionally, this paper presents an overshoot compensator to address the overshoot problem associated with traditional MFPs. Furthermore, a packet loss predictor (PLP) is designed to mitigate the influence of packet loss during data transmission. Both simulation and hardware-in-the loop(HIL) experiments during comprehensive driving scenarios are conducted to verify the effectiveness and robustness of theproposed method. The findings indicate that, compared to MFPs, the SRCKP reduces the L2-norm error by up to 81.2% in simulations and by up to 54.0% in HIL experiments for the best-case conditions.

The electrification of long-haul freight transport introduces several new challenges, such as the limited capacity and congestion at en-route charging infrastructure. To reduce waiting times during peak periods, this paper proposes a framework for coordinated charging scheduling. The approach employs a mixed-integer formulation to optimize charging-related costs across charging, operation, battery degradation, and congestion delay, considering a range of scenarios. The results demonstrate that coordinated scheduling yields substantial cost savings up to 36% compared to uncoordinated scheduling, particularly by reducing battery degradation and delay costs.

Modern traffic control strategies require knowledge of the vehicles’ density. However, when such data is available through sensors or cameras, it often lacks accuracy and completeness. In this context, we propose an enhanced cellular automaton that can provide labeled data in accordance with the three-phase traffic flow theory. This study leverages such model to address traffic state classification, which is valuable for adaptive traffic control. Specifically, the effectiveness of the graph neural network in using three-phase labeled data for traffic classification will be demonstrated by achieving high accuracy. This ensures a clear distinction between traffic phases and paves the way for further research on the factors affecting the traffic cellular automaton model1.

Walkability is a key component of sustainable urban development. In walkability studies, collecting detailed pedestrian infrastructure data remains challenging due to the high costs and limited scalability of traditional methods. Sidewalk delivery robots, increasingly deployed in urban environments, offer a promising solution to these limitations. This paper explores how these robots can serve as mobile data collection platforms, capturing sidewalk-level features related to walkability in a scalable, automated, and real-time manner. A sensor-equipped robot was deployed on a sidewalk network at KTH in Stockholm, completing 101 trips covering 900 segment records. From the collected data, different typologies of features are derived, including robot trip characteristics (e.g., speed, duration), sidewalk conditions (e.g., width, surface unevenness), and sidewalk utilization (e.g., pedestrian density). Their walkability-related implications were investigated with a series of analyses. The results demonstrate that pedestrian movement patterns are strongly influenced by sidewalk characteristics, with higher density, reduced width, and surface irregularity associated with slower and more variable trajectories. Notably, robot speed closely mirrors pedestrian behavior, highlighting its potential as a proxy for assessing pedestrian dynamics. The proposed framework enables continuous monitoring of sidewalk conditions and pedestrian behavior, contributing to the development of more walkable, inclusive, and responsive urban environments.

In this note, we consider infinite horizon optimal control problems with deterministic systems. Since exact solutions to these problems are often intractable, we propose a parallel model predictive control (MPC) method that provides an approximate solution. Our method computes multiple lookahead minimization problems at each time, where each minimization may involve a different number of lookahead steps, and terminal cost and constraint. The policy computed via parallel MPC applies the first control of the lookahead minimization with the lowest cost. We show that the proposed method can harnesses the power of multiple computing units. Moreover, we prove that the policy computed via parallel MPC has better performance guarantee than that computed via the single lookahead minimization involved in parallel MPC.

This paper models a platooning system consisting of trucks and a third-party service provider (TPSP), which performs platoon coordination, distributes the platooning profit in platoons, and charges trucks in exchange for the services. Government subsidies used to incentivize platooning are also considered. We propose a pricing rule for the TPSP, which keeps part of the platooning profit including the subsidy each time a platoon is formed. In addition, a platoon coordination solution based on the distributed model predictive control (MPC) is proposed, in which the pricing rule under government subsidies is integrated. We perform a realistic simulation over the Swedish road network to evaluate the impact of the pricing rule and subsidies on the achieved profits and fuel savings. Our results show that subsidies are an effective mean to boost fuel savings from platooning. Moreover, the simulation study indicates that high pricing corresponds to a low platooning rate of the system, as trucks' incentives for platooning decrease.

Accurate and robust localization is critical for the safe operation of Connected and Automated Vehicles (CAVs), especially in complex urban environments where Global Navigation Satellite System (GNSS) signals are unreliable. This paper presents a novel vision-based cooperative localization algorithm that leverages onboard cameras and Vehicle-to-Everything (V2X) communication to enable CAVs to estimate their poses, even in occlusion-heavy scenarios such as busy intersections. In particular, we propose a novel decentralized observer for a group of connected agents that includes landmark agents (static or moving) in the environment with known positions and vehicle agents that need to estimate their poses (both positions and orientations). Assuming that (i) there are at least three landmark agents in the environment, (ii) each vehicle agent can measure its own angular and translational velocities as well as relative bearings to at least three neighboring landmarks or vehicles, and (iii) neighboring vehicles can communicate their pose estimates, each vehicle can estimate its own pose using the proposed decentralized observer. We prove that the origin of the estimation error is locally exponentially stable under the proposed observer, provided that the minimal observability conditions are satisfied. Moreover, we evaluate the proposed approach through experiments with real 1/10th-scale connected vehicles and large-scale simulations, demonstrating its scalability and validating the theoretical guarantees in practical scenarios.

In this work, we address the problem of charging coordination between electric trucks and charging stations. The problem arises from the tension between the trucks’ nontrivial charging times and the stations’ limited charging facilities. Our goal is to reduce the trucks’ waiting times at the stations while minimizing individual trucks’ operational costs. We propose a distributed coordination framework that relies on computation and communication between the stations and the trucks, and handles uncertainties in travel times and energy consumption. Within the framework, the stations assign a limited number of charging ports to trucks according to the first-come, first-served rule. In addition, each station constructs a waiting time forecast model based on its historical data and provides its estimated waiting times to trucks upon request. When approaching a station, a truck sends its arrival time and estimated arrival-time windows to the nearby station and the distant stations, respectively. The truck then receives the estimated waiting times from these stations in response, and updates its charging plan accordingly while accounting for travel uncertainties. We performed simulation studies for 1,000 trucks traversing the Swedish road network for 40 days, using realistic traffic data with travel uncertainties. The results show that our method reduces the average waiting time of the trucks by 46.1% compared to offline charging plans computed by the trucks without coordination and update, and by 33.8% compared to the coordination scheme assuming zero waiting times at distant stations.

The explosive growth in wireless data traffic and connected devices calls for sophisticated approaches to radio spectrum and energy utilization. A key challenge lies in jointly managing user association and resource allocation, which directly determine how users connect to base stations and how power and bandwidth are distributed among them. While prior work has introduced various optimization and heuristic methods, many formulations simplify the problem by neglecting intercell interference, often by artificially limiting bandwidth or assuming fixed user rates. In this paper, we propose a novel interference-aware framework that explicitly incorporates intercell interference into the joint optimization of user association and resource allocation. Unlike prior approaches that avoid interference by restricting resources, we jointly optimize base station association, power control, and bandwidth allocation while accounting for inter-cell interference. Our method combines a heuristic association strategy with a barrier-method-based iterative solver for resource allocation. Simulation results show that explicitly modeling interference improves the achievable network throughput by up to 50% compared to interference-agnostic baselines, while maintaining rate feasibility under higher load. However, these gains come with a 10-15% increase in total power expenditure and a noticeable reduction in fairness (Jain’s index dropping from about 1.0 to 0.57), highlighting the trade-offs between throughput, energy efficiency, and user fairness in interference-aware resource management.