Urban traffic congestion remains a pressing chal-lenge in our rapidly expanding cities, despite the abundance of available data and the efforts of policymakers. By leveraging behavioral system theory and data-driven control, this paper exploits the Data-enabled Predictive Control (DeePC) algorithm in the context of urban traffic control performed via dynamic traffic lights. To validate our approach, we consider a high-fidelity case study using the state-of-the-art simulation software package Simulation of Urban MObility (SUMO). Preliminary results indicate that DeePC outperforms existing approaches across various key metrics, including travel time and CO₂ emissions, demonstrating its potential for effective traffic management.

In this paper, we propose the METANET with service station (METANET-s) model, a second-order macro-scopic traffic model that, compared to the classical METANET, incorporates the dynamics of service stations on highways. Specifically, we employ the (so-called) store-and-forward links to model the stop of vehicles and the possible queue forming in the process of merging back into the highway mainstream. We explore the capability of the METANET-s to capture well both traffic back propagation and capacity drops, which are typically caused by the presence of vehicles joining again the mainstream traffic from the service station. Therefore, capturing these effects is crucial to improving the model's predictive capabilities. Finally, we perform a comparative analysis with the Cell Transmission Model with service station (CTM-s), showcasing that the METANET-s describes the traffic evolution much better than its first-order counterpart.

In this article, we consider a dc microgrid composed of distributed generation units (DGUs) trading energy among each other, where the energy price depends on the total current generated by all the DGUs. We then use a Cournot aggregative game to describe the self-interested interaction among the DGUs, where each DGU aims at minimizing the deviation with respect to the given reference signals and maximizing the revenue from the sale of the generated power. Thus, we design a fully distributed continuous-time equilibrium-seeking algorithm to compute the generalized Nash equilibrium (GNE) of the game. We interconnect the designed decision-making algorithm with the dynamics of the microgrid in a passive way, and, by leveraging passivity theory, we prove the convergence of the closed-loop system trajectory to a feasible operating point that is also a Nash equilibrium of the collective aggregative game. Finally, we present extensive simulation results that validate the proposed distributed optimal control scheme, showing excellent performance.

Hierarchical decision making problems, such as bilevel programs and Stackelberg games, are attracting increasing interest in both the engineering and machine learning communities. Yet, existing solution methods lack either convergence guarantees or computational efficiency, due to the absence of smoothness and convexity. In this work, we bridge this gap by designing a first-order hypergradient-based algorithm for Stackelberg games and mathematically establishing its convergence using tools from nonsmooth analysis. To evaluate the hypergradient, namely, the gradient of the upper-level objectve, we develop an online scheme that simultaneously computes the lower level equilibrium and its Jacobian. Crucially, this scheme exploits and preserves the original hierarchical and distributed structure of the problem, which renders it scalable and privacy-preserving. We numerically verify the computational efficiency and scalability of our algorithm on a large-scale hierarchical demand-response model.

A popular remedy for the morning commute bottleneck congestion is to split the highway capacity into a managed lane that is kept in free-flow and a general purpose lane that is subject to congestion. A classical theoretical result is that the more capacity is allocated to the managed lane the less the resulting congestion. However, existing approaches to restrict access to the managed lane are primarily monetary, e.g., tolls, which severely limits the public willingness to accept them due to equity concerns. Following up on recent work which introduces karma as a completely non-monetary credit used to control access to a so-called Karma Priority (KP) lane, we first review the strategic problem of the commuters which is modeled as a dynamic population game. We then numerically investigate the effect of varying the KP lane capacity. The karma scheme is equitable with respect to different income classes irrespective of the capacity split, meanwhile achieving near-optimal traffic reduction. Thus, managing a larger fraction of the bottleneck could be more socially feasible under a karma scheme than a monetary scheme.

The morning commute bottleneck congestion problem has classically been modelled as a static game in which commuters act strategically based on their immediate Value of Time (VOT). This has restricted existing congestion mitigation techniques to rely on essentially monetary incentives to affect the static costs of the commuters. In contrast, a dynamic model enables characterizing the strategic tradeoff between immediate and future resource access rights and inspires the design of new classes of fair, non-monetary congestion mitigation schemes. In this paper, we show how the recently proposed Dynamic Population Game (DPG) framework can be leveraged to study a non-monetary economy for bottleneck congestion management based on karma, a non-tradable mobility credit. Our DPG model allows to consider an elastic demand of commuters that only travel if congestion is reduced, and we show that a Stationary Nash Equilibrium (SNE) is guaranteed to exist despite of the dynamic participation of these commuters. Through numerical case studies we illustrate how our tools can assist policy makers in taking informed decisions about complex policy outcomes. In particular, we show how the dynamic karma scheme is robust to a potentially detrimental rebound effect that would manifest in a static monetary scheme.

This paper analyzes how the presence of service stations on highways affects traffic congestion. We focus on the problem of optimally designing a service station to achieve beneficial effects in terms of total traffic congestion and peak traffic reduction. We propose a genetic algorithm based on the recently proposed Cell Transmission Model with service station (CTM-s), that efficiently describes the dynamics of a service station. Then, we leverage the algorithm to train a neural network capable of solving the same problem, avoiding to implement the CTM-s. Finally, we validate the performance of our algorithms by using real data from Dutch highways.

We study the problem of routing plug-in electric and conventional fuel vehicles on a city scale using incentives. In our model, commuters selfishly aim to minimize a local cost that combines travel time and the financial expenses of using city facilities, i.e., parking and service stations. The traffic authority can influence the commuters' routing choice via personalized discounts on parking tickets and on the energy price at service stations. We formalize the problem of optimally designing these monetary incentives to induce traffic decongestion as a large-scale bilevel game, where constraints arise at both levels due to the finite capacities of city facilities and incentives budget. Then, we develop an efficient scalable solution scheme with convergence guarantees based on BIG Hype, a recently-proposed hypergradient-based algorithm for bilevel games. Finally, we validate our approach via numerical simulations over the Anaheim's traffic network, showcasing its advantages in terms of traffic decongestion and scalability.

In this letter, our objective is to explore how two well-known projection dynamics can be used as dynamic controllers for stabilization of nonlinear systems. Combining the properties of projection operators, Lyapunov stability theory and LaSalle's theorem, we confirm that the projection dynamics on the feasible set and tangent cone are Krasovskii passive. To show the effectiveness of the proposed approach, we use the projection dynamics on the tangent cone for stabilizing boost converters in a DC microgrid while satisfying predefined input constraints.

This paper studies the capacity drops phenomena on a macroscopic, first-order model for freeway traffic. In particular, we focus on the effect that a Service Station (ST) has on the mainstream traffic evolution. We propose a modified formulation of the Cell Transmission Model with service station (CTM-s) that considers this important phenomenon, and use a micro-simulation based on Aimsun Next to identify the model parameters via a structured identification procedure. Finally, we validate the ability of the CTM-s with capacity drops to better describe the traffic evolution with respect to the classical formulation.

We propose an incentive-based traffic demand management policy to alleviate traffic congestion on a road stretch that creates a bottleneck for the commuters. The incentive targets electric vehicles owners by proposing a discount on the energy price they use to charge their vehicles if they are flexible in their departure time. We show that, with a sufficient monetary budget, it is possible to completely eliminate the traffic congestion and we compute the optimal discount. We analyse also the case of limited budget, when the congestion cannot be completely eliminated. We compute analytically the policy minimising the congestion and estimate the level of inefficiency for different budgets. We corroborate our theoretical findings with numerical simulations that allow us to highlight the power of the proposed method in providing practical advice for the design of policies.

In this paper, we propose a novel model that describes how the traffic evolution on a highway stretch is affected by the presence of a service station. The presented model enhances the classical Cell Transmission Model (CTM) dynamics by adding the dynamics associated with the service stations, where the vehicles may stop before merging back in the main stream. We name it Cell Transmission Model with service station (CTM-s). We discuss its flexibility in describing different complex scenarios where multiple stations are characterized by different drivers' average stopping times corresponding to different services. The model has been developed to help designing control strategies aimed to decrease traffic congestion. Thus, we discuss how classical control schemes can interact with the proposed CTM-s. Finally, we demonstrate the proposed model through numerical simulations and assess the effects of service stations on traffic evolution, which appear to be beneficial especially for relatively short congested periods.

In this paper we propose an original distributed control framework for DC microgrids. We first formulate the (optimal) control objectives as an aggregative game suitable for the energy trading market. Then, based on duality, we analyze the equivalent distributed optimal condition for the proposed aggregative game and design a distributed control scheme to solve it. By interconnecting the DC microgrid and the designed distributed control system in a power preserving way, we steer the DC microgrid's state to the desired optimal equilibrium, satisfying a predefined set of local and coupling constraints. Finally, based on singular perturbation system theory, we analyze the convergence of the closed-loop system. The simulation results show excellent performance of the proposed control framework.

In modern buildings renewable energy generators and storage devices are spreading, and consequently the role of the users in the power grid is shifting from passive to active. We design a demand response scheme that exploits the prosumers' flexibility to provide ancillary services to the main grid. We propose a hierarchical scheme to coordinate the interactions between the distribution system operator and a community of smart prosumers. The framework inherits characteristics from price-based and incentive-based schemes and it retains the advantages of both. We cast the problem as a Stackelberg game with the prosumers as followers and the distribution system operator as leader. We solve the resulting bilevel optimization program via a KKT reformulation, proving the existence and the convergence to a local Stackelberg equilibrium.

Understanding how to effectively control an epidemic spreading on a network is a problem of paramount importance for the scientific community. The ongoing COVID-19 pandemic has highlighted the need for policies that mitigate the spread, without relying on pharmaceutical interventions. These policies typically entail lockdowns and mobility restrictions, having thus nonnegligible socio-economic consequences for the population. We focus on the problem of finding the optimum policies that "flatten the epidemic curve"while limiting the negative consequences for the society, and formulate it as a nonlinear control problem over a finite prediction horizon. We utilize the model predictive control theory to design a strategy to effectively control the disease, balancing safety and normalcy. An explicit formalization of the control scheme is provided for the susceptible-infected-susceptible epidemic model over a network. Its performance and flexibility are demonstrated by means of numerical simulations.

This paper considers a deterministic Susceptible-Infected-Susceptible (SIS) metapopulation model for the spread of a disease in a strongly connected network, where each node represents a large population. Individuals can travel between the nodes (populations). We derive a necessary and sufficient condition for the healthy equilibrium to be the unique equilibrium of the system, and then in fact it is asymptotically stable for all initial conditions (a sufficient condition for exponential stability is also given). If the condition is not satisfied, then there additionally exists a unique endemic equilibrium which is exponentially stable for all nonzero initial conditions. We then consider time-delay in the travel between nodes, and further investigate the role of the mobility rate that governs the flow of individuals between nodes in determining the convergence properties. We find that sometimes, increasing mobility helps the system converge to the healthy equilibrium.

The use of dynamic driving simulators is nowadays common practice in the automotive industry. The effectiveness of such devices is strongly related to their capabilities of well reproducing the driving sensations, hence it is crucial that the motion control strategies generate both realistic and feasible inputs to the platform. Such strategies are called Motion Cueing Algorithms (MCAs). Model Predictive Control (MPC) has been successfully applied to MCAs, being well suited to solve constrained optimal control problems. However, the predictive aspect of the algorithm has not been exploited effectively yet, mainly due to the hard real-time requirement when using a significantly long prediction window. In this paper, a real time implementation of the so called Look-Ahead (LA) strategy is presented, that is based on an effective manipulation of the reference along the prediction horizon, and on an on-line switching policy to a Non-Look-Ahead strategy when the expected driver behavior is not reliable. An optimal tuning of the MCA is computed by means of a multi-objective optimization, where both performance improvement due to the prediction exploitation, and robustness to varying driver behavior are taken into account. Finally, a characterization of the driver skill level is proposed and validated in experimental environment.

Driving simulators are nowadays a widely used tool in the automotive industry. In particular, the need for safe and repeatable conditions in automated driving testing is now defining a new challenge: to extend the use of the tool to nonprofessional drivers. Quality of the motion control strategies in generating both realistic and feasible inputs to the driver is therefore, more than ever, a crucial aspect. The motion strategies are implemented in the so-called motion cueing algorithms (MCAs). A recently proposed effective approach to MCA is based on model predictive control (MPC), as it is well suited to solve constrained optimal control problems and to take advantage of models of the human sensing system. However, the predictive aspect of the algorithm has not been exploited yet, due to the hard real-Time requirement when using long prediction windows. In this paper, a real-Time implementation of an MPC-based MCA with predictive feature is presented, endowed with an on-line switching policy to a nonpredictive algorithm when the expected driver behavior is considered unreliable. The motion action based on the actual driver behavior and the expected one are considered in the same procedure, thus fully exploiting the availability of a perceptive model. An optimal tuning procedure is also proposed, based on a multiobjective optimization, where both performance improvement due to the prediction exploitation, and robustness to varying driver behaviour are considered. Finally, a characterization of the driver skill level is proposed and validated in an experimental environment for the specific case of the vertical DOF.