SearcharxivSearch

arXiv subjects

Carlo Cenedese

Publications and source records attributed to Carlo Cenedese.

At least 19 recordsLinked to original sources

A modular state-space model of human perception, cognition, and decision dynamics

Human-centered adaptive systems require behavioral models that are both psychologically interpretable and mathematically analyzable. Many existing predictors either operate as black-box input-output mappings or provide limited access to latent internal dynamics. This paper addresses this gap by modeling behavior as a perception-cognition-decision pipeline. We propose a modular state-space model in which attentional selection, predictive inference, cognitive-state evolution, intention formation, and action selection are represented by coupled mathematical mappings. The model links sensory inputs to observable behavior through latent internal states while retaining interpretable connections to neuro-cognitive mechanisms. We establish sufficient conditions for boundedness, Lipschitz regularity, forward invariance, contraction of perceptual inference under constant input, and input-to-state stability of the cognitive state dynamics. Numerical sensitivity analyses show that the model yields interpretable changes in perceptual tracking, cognitive amplification, intention expression, and action decisiveness. We further demonstrate a closed-loop rehabilitation case study in which a receding-horizon controller uses the model to adapt movement difficulty from partial feedback. In this proof-of-concept setting, the model-based controller sustains simulated task participation and achieves lower realized cumulative cost than target-following and random baselines. Overall, the framework provides a white-box dynamical structure for estimation, validation, and model-based control in human-centered settings.

eess.SY

Data-driven generalized perimeter control: Z\"urich case study

Urban traffic congestion is a key challenge for the development of modern cities, requiring advanced control techniques to optimize existing infrastructures usage. Despite the extensive availability of data, modeling such complex systems remains an expensive and time consuming step when designing model-based control approaches. On the other hand, machine learning approaches require simulations to bootstrap models, or are unable to deal with the sparse nature of traffic data and enforce hard constraints. We propose a novel formulation of traffic dynamics based on behavioral systems theory and apply data-enabled predictive control to steer traffic dynamics via dynamic traffic light control. A high-fidelity simulation of the city of Z\"urich, the largest closed-loop microscopic simulation of urban traffic in the literature to the best of our knowledge, is used to validate the performance of the proposed method in terms of total travel time and CO2 emissions.

eess.SY

Split-as-a-Pro: behavioral control via operator splitting and alternating projections

The paper introduces Split-as-a-Pro, a control framework that integrates behavioral systems theory, operator splitting methods, and alternating projection algorithms. The framework reduces dynamic optimization problems - arising in both control and estimation - to efficient projection computations. Split-as-a-Pro builds on a non-parametric formulation that exploits system structure to separate dynamic constraints imposed by individual subsystems from external ones, such as interconnection constraints and input/output constraints. This enables the use of arbitrary system representations, as long as the associated projection is efficiently computable, thereby enhancing scalability and compatibility with gray-box modeling. We demonstrate the effectiveness of Split-as-a-Pro by developing a distributed algorithm for solving finite-horizon linear quadratic control problems and illustrate its use in predictive control. Our numerical case studies show that algorithms obtained using Split-as-a-Pro significantly outperform their centralized counterparts in runtime and scalability across various standard graph topologies, while seamlessly leveraging both model-based and data-driven system representations.

math.OC

Iterative Learning Control for Ramp Metering on Service Station On-ramps

Congestion on highways has become a significant social problem due to the increasing number of vehicles, leading to considerable waste of time and pollution. Regulating the outflow from the Service Station can help alleviate this congestion. Notably, traffic flows follow recurring patterns over days and weeks, allowing for the application of Iterative Learning Control (ILC). Building on these insights, we propose an ILC approach based on the Cell Transmission Model with service stations (CTM-s). It is shown that ILC can effectively compensate for potential inaccuracies in model parameter estimates by leveraging historical data.

eess.SY

BIG Hype: Best Intervention in Games via Distributed Hypergradient Descent

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 \textit{hypergradient}, namely, the gradient of the upper-level objective, 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.

math.OC

A new control-oriented METANET model to encompass service stations on highways

In this paper, we propose the METANET with service station (METANET-s) model, a second-order macroscopic 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.

eess.SY

Urban traffic congestion control: a DeePC change

Urban traffic congestion remains a pressing challenge 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 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$_2$ emissions, demonstrating its potential for effective traffic management

eess.SY

CARMA: Fair and efficient bottleneck congestion management via non-tradable karma credits

This paper proposes a non-monetary traffic demand management scheme, named CARMA, as a fair solution to the morning commute congestion. We consider heterogeneous commuters traveling through a single bottleneck that differ in both the desired arrival time and Value of Time (VOT). We consider a generalized notion of VOT by allowing it to vary dynamically on each day (e.g., according to trip purpose and urgency), rather than being a static characteristic of each individual. In our CARMA scheme, the bottleneck is divided into a fast lane that is kept in free flow and a slow lane that is subject to congestion. We introduce a non-tradable mobility credit, named karma, that is used by commuters to bid for access to the fast lane. Commuters who get outbid or do not participate in the CARMA scheme instead use the slow lane. At the end of each day, karma collected from the bidders is redistributed, and the process repeats day by day. We model the collective commuter behaviors under CARMA as a Dynamic Population Game (DPG), in which a Stationary Nash Equilibrium (SNE) is guaranteed to exist. Unlike existing monetary schemes, CARMA is demonstrated, both analytically and numerically, to achieve a) an equitable traffic assignment with respect to heterogeneous income classes and b) a strong Pareto improvement in the long-term average travel disutility with respect to no policy intervention. With extensive numerical analysis, we show that CARMA is able to retain the same congestion reduction as an optimal monetary tolling scheme under uniform karma redistribution and even outperform tolling under a well-designed redistribution scheme. We also highlight the privacy-preserving feature of CARMA, i.e., its ability to tailor to the private preferences of commuters without centrally collecting the information.

eess.SY

Designing Optimal Personalized Incentive for Traffic Routing using BIG Hype algorithm

We study the problem of optimally routing plug-in electric and conventional fuel vehicles on a city level. In our model, commuters selfishly aim to minimize a local cost that combines travel time, from a fixed origin to a desired destination, and the monetary cost of using city facilities, parking or service stations. The traffic authority can influence the commuters' preferred routing choice by means of personalized discounts on parking tickets and on the energy price at service stations. We formalize the problem of designing these monetary incentives optimally 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 decentralized solution scheme with convergence guarantees based on BIG Hype, a recently-proposed hypergradient-based algorithm for hierarchical games. Finally, we validate our model via numerical simulations over the Anaheim's network, and show that the proposed approach produces sensible results in terms of traffic decongestion and it is able to solve in minutes problems with more than 48000 variables and 110000 constraints.

math.OC

A Distributed control framework for the optimal operation of DC microgrids

In this paper we propose an original distributed control framework for DC mcirogrids. We first formulate the (optimal) control objectives as an aggregative game suitable for the energy trading market. Then, based on the dual theory, 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 mcirogrid 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 the singular perturbation system theory, we analyze the convergence of the closed-loop system. The simulation results show excellent performance of the proposed control framework.

eess.SY

Optimal service station design for traffic mitigation via genetic algorithm and neural network

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. Microsimulators cannot be used for this task due to their computational inefficiency. We propose a genetic algorithm based on the recently proposed CTMs, 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 implementing the CTMs. Finally, we examine two case studies to validate the capabilities and performance of our algorithms. In these simulations, we use real data extracted from Dutch highways.

eess.SY

A Stackelberg game for incentive-based demand response in energy markets

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. Finally, we provide numerical simulations to corroborate our claims on the benefits of the proposed framework.

eess.SY

A Novel Control-Oriented Cell Transmission Model Including Service Stations on Highways

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 CTM dynamics by adding the dynamics associated with the service stations, where the vehicles may stop before merging back into the mainstream. We name it CTMs. 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 design control strategies aimed at decreasing traffic congestion. Thus, we discuss how classical control schemes can interact with the proposed \gls{CTMs}. Finally, we validate 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.

eess.SY

Incentive-Based Electric Vehicle Charging for Managing Bottleneck Congestion

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.

math.OC

Optimal policy design to mitigate epidemics on networks using an SIS model

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, that is, without the medical assurance of the recovery process. These policies typically entail lockdowns and mobility restrictions, having thus nonnegligible socio-economic consequences for the population. In this paper, 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.

q-bio.PE

Highway Traffic Control via Smart e-Mobility -- Part I: Theory

In this paper, we study how to alleviate highway traffic congestion by encouraging plug-in hybrid and electric vehicles to stop at a charging station around peak congestion times. Specifically, we design a pricing policy to make the charging price dynamic and dependent on the traffic congestion, predicted via the cell transmission model, and the availability of charging spots. Furthermore, we develop a novel framework to model how this policy affects the drivers' decisions by formulating a mixed-integer potential game. Technically, we introduce the concept of "road-to-station" (r2s) and "station-to-road" (s2r) flows, and show that the selfish actions of the drivers converge to charging schedules that are individually optimal in the sense of Nash. In the second part of this work, submitted as a separate paper (Part II: Case Study), we validate the proposed strategy on a simulated highway stretch between The Hague and Rotterdam, in The Netherlands.

eess.SY

Highway Traffic Control via Smart e-Mobility -- Part II: Dutch A13 Case Study

In this paper, we study how to alleviate highway traffic congestions by encouraging plug-in electric and hybrid vehicles to stop at charging stations around peak congestion times. Specifically, we focus on a case study and simulate the adoption of a dynamic charging price depending on the traffic congestion. We use real traffic data of the A13 highway stretch between The Hague and Rotterdam, in The Netherlands, to identify the Cell Transmission Model. Then, we apply the algorithm proposed in (Part I: Theory) to different scenarios, validating the theoretical results and showing the benefits of our strategy in terms of traffic congestion alleviation. Finally, we carry out a sensitivity analysis of the proposed algorithm and discuss how to optimize its performance.

eess.SY

An asynchronous distributed and scalable generalized Nash equilibrium seeking algorithm for strongly monotone games

In this paper, we present three distributed algorithms to solve a class of generalized Nash equilibrium (GNE) seeking problems in strongly monotone games. The first one (SD-GENO) is based on synchronous updates of the agents, while the second and the third (AD-GEED and AD-GENO) represent asynchronous solutions that are robust to communication delays. AD-GENO can be seen as a refinement of AD-GEED, since it only requires node auxiliary variables, enhancing the scalability of the algorithm. Our main contribution is to prove converge to a variational GNE of the game via an operator-theoretic approach. Finally, we apply the algorithms to network Cournot games and show how different activation sequences and delays affect convergence. We also compare the proposed algorithms to the only other in the literature (ADAGNES), and observe that AD-GENO outperforms the alternative.

cs.GT