pwc-archive/papers-with-abstracts huggingface dataset:
Regulating Spatial Fairness in a Tripartite Micromobility Sharing System via Reinforcement Learning
Authors: Matteo Cederle, Marco Fabris, Gian Antonio Susto
Date: 2025-04-03 00:00:00
Tasks: Fairness

In the growing field of Shared Micromobility Systems, which holds great potential for shaping urban transportation, fairness-oriented approaches remain largely unexplored. This work addresses such a gap by investigating the balance between performance optimization and algorithmic fairness in Shared Micromobility Services using Reinforcement Learning. Our methodology achieves equitable outcomes, measured by the Gini index, across central, peripheral, and remote station categories. By strategically rebalancing vehicle distribution, it maximizes operator performance while upholding fairness principles. The efficacy of our approach is validated through a case study using synthetic data.
Assessing Geographical and Seasonal Influences on Energy Efficiency of Electric Drayage Trucks
Authors: Ankur Shiledar, Manfredi Villani, Joseph N. E. Lucero, Ruixiao Sun, Vivek A. Sujan, Simona Onori, Giorgio Rizzoni
Date: 2025-04-03 00:00:00

The electrification of heavy-duty vehicles is a critical pathway towards improved energy efficiency of the freight sector. The current battery electric truck technology poses several challenges to the operations of commercial vehicles, such as limited driving range, sensitivity to climate conditions, and long recharging times. Estimating the energy consumption of heavy-duty electric trucks is crucial to assess the feasibility of the fleet electrification and its impact on the electric grid. This paper focuses on developing a model-based simulation approach to predict and analyze the energy consumption of drayage trucks used in ports logistic operations, considering seasonal climate variations and geographical characteristics. The paper includes results for three major container ports within the United States, providing region-specific insights into driving range, payload capacity, and charging infrastructure requirements, which will inform decision-makers in integrating electric trucks into the existing drayage operations and plan investments for electric grid development.
MAD: A Magnitude And Direction Policy Parametrization for Stability Constrained Reinforcement Learning
Authors: Luca Furieri, Sucheth Shenoy, Danilo Saccani, Andrea Martin, Giancarlo Ferrari Trecate
Date: 2025-04-03 00:00:00
Tasks: Reinforcement Learning (RL)

We introduce magnitude and direction (MAD) policies, a policy parameterization for reinforcement learning (RL) that preserves Lp closed-loop stability for nonlinear dynamical systems. Although complete in their ability to describe all stabilizing controllers, methods based on nonlinear Youla and system-level synthesis are significantly affected by the difficulty of parameterizing Lp-stable operators. In contrast, MAD policies introduce explicit feedback on state-dependent features - a key element behind the success of RL pipelines - without compromising closed-loop stability. This is achieved by describing the magnitude of the control input with a disturbance-feedback Lp-stable operator, while selecting its direction based on state-dependent features through a universal function approximator. We further characterize the robust stability properties of MAD policies under model mismatch. Unlike existing disturbance-feedback policy parameterizations, MAD policies introduce state-feedback components compatible with model-free RL pipelines, ensuring closed-loop stability without requiring model information beyond open-loop stability. Numerical experiments show that MAD policies trained with deep deterministic policy gradient (DDPG) methods generalize to unseen scenarios, matching the performance of standard neural network policies while guaranteeing closed-loop stability by design.
Probabilistic Simulation of Aircraft Descent via a Hybrid Physics-Data Approach
Authors: Amy Hodgkin, Nick Pepper, Marc Thomas
Date: 2025-04-03 00:00:00

This paper presents a method for generating probabilistic descent trajectories in simulations of real-world airspace. A dataset of 116,066 trajectories harvested from Mode S radar returns in UK airspace was used to train and test the model. Thirteen aircraft types with varying performance characteristics were investigated. It was found that the error in the mean prediction of time to reach the bottom of descent for the proposed method was less than that of the the Base of Aircraft Data (BADA) model by a factor of 10. Furthermore, the method was capable of generating a range of trajectories that were similar to the held out test dataset when analysed in distribution. The proposed method is hybrid, with aircraft drag and calibrated airspeed functions generated probabilistically to parameterise the BADA equations, ensuring the physical plausibility of generated trajectories.
Beyond Asymptotics: Targeted exploration with finite-sample guarantees
Authors: Janani Venkatasubramanian, Johannes Köhler, Frank Allgöwer
Date: 2025-04-03 00:00:00

In this paper, we introduce a targeted exploration strategy for the non-asymptotic, finite-time case. The proposed strategy is applicable to uncertain linear time-invariant systems subject to sub-Gaussian disturbances. As the main result, the proposed approach provides a priori guarantees, ensuring that the optimized exploration inputs achieve a desired accuracy of the model parameters. The technical derivation of the strategy (i) leverages existing non-asymptotic identification bounds with self-normalized martingales, (ii) utilizes spectral lines to predict the effect of sinusoidal excitation, and (iii) effectively accounts for spectral transient error and parametric uncertainty. A numerical example illustrates how the finite exploration time influence the required exploration energy.
Data-Driven Nonconvex Reachability Analysis using Exact Multiplication
Authors: Zhen Zhang, M. Umar B. Niazi, Michelle S. Chong, Karl H. Johansson, Amr Alanwar
Date: 2025-04-02 00:00:00

This paper addresses a fundamental challenge in data-driven reachability analysis: accurately representing and propagating non-convex reachable sets. We propose a novel approach using constrained polynomial zonotopes to describe reachable sets for unknown LTI systems. Unlike constrained zonotopes commonly used in existing literature, constrained polynomial zonotopes are closed under multiplication with constrained matrix zonotopes. We leverage this property to develop an exact multiplication method that preserves the non-convex geometry of reachable sets without resorting to approximations. We demonstrate that our approach provides tighter over-approximations of reachable sets for LTI systems compared to conventional methods.
Towards Enabling Learning for Time-Varying finite horizon Sequential Decision-Making Problems*
Authors: Dhananjay Tiwari, Salar Basiri, Srinivasa Salapaka
Date: 2025-04-02 00:00:00
Tasks: Decision Making, Sequential Decision Making

Parameterized Sequential Decision Making (Para-SDM) framework models a wide array of network design applications spanning supply-chain, transportation, and sensor networks. These problems entail sequential multi-stage optimization characterized by states, control actions, and cost functions dependent on designable parameters. The challenge is to determine both the sequential decision policy and parameters simultaneously to minimize cumulative stagewise costs. Many Para-SDM problems are NP-hard and often necessitate time-varying policies. Existing algorithms tackling finite-horizon time-varying Para-SDM problems struggle with scalability when faced with a large number of states. Conversely, the sole algorithm addressing infinite-horizon Para-SDM assumes time (stage)-invariance, yielding stationary policies. However, this approach proves scalable for time-invariant problems by leveraging deep neural networks to learn optimal stage-invariant state-action value functions, enabling handling of large-scale scenarios. This article proposes a novel approach that reinterprets finite-horizon, time-varying Para-SDM problems as equivalent time-invariant problems through topography lifting. Our method achieves nearly identical results to the time-varying solution while exhibiting improved performance times in various simulations, notably in the small cell network problem. This fresh perspective on Para-SDM problems expands the scope of addressable issues and holds promise for future scalability through the integration of learning methods.
Orthodromic Routing and Forwarding for Large Satellite Constellations
Authors: Peter Ashwood-Smith, Bill McCormick
Date: 2025-04-02 00:00:00

Low earth orbit satellite constellations with intersatellite links (ISLs) are currently being developed and deployed. The availability of ISLs provides the capability to route across the satellite constellation, rather than using the satellite as a single hop in a bent-pipe configuration. We present a fully distributed solution to routing and forwarding which we call Orthodromic Routing (OR(r) ). OR(r) routing is built on a foundation of both geographic and link state routing to create a hybrid protocol which scales to enormous constellations with excellent failure handling. Our work includes an addressing and forwarding plane for OR(r)which can be implemented in hardware in a highly parallel manner to achieve line rates while only requiring a bounded number of forwarding table entries.
An Integrated Transportation Network and Power Grid Simulation Approach for Assessing Environmental Impact of Electric Vehicles
Authors: Diana Wallison, Jessica Wert, Farnaz Safdarian, Komal Shetye, Thomas J. Overbye, Jonathan M. Snodgrass, Yanzhi Xu
Date: 2025-04-02 00:00:00

This study develops an integrated approach that includes EV charging and power generation to assess the complex cross-sector interactions of vehicle electrification and its environmental impact. The charging load from on-road EV operation is developed based on a regional-level transportation simulation and charging behavior simulation, considering different EV penetration levels, congestion levels, and charging strategies. The emissions from EGUs are estimated from a dispatch study in a power grid simulation using the charging load as a major input. A case study of Austin, Texas is performed to quantify the environmental impact of EV adoption on both on-road and EGU emission sources at the regional level. The results demonstrate the range of emission impact under a combination of factors.
Distributed Resource Allocation for Human-Autonomy Teaming under Coupled Constraints
Authors: Yichen Yao, Ryan Mbagna Nanko, Yue Wang, Xuan Wang
Date: 2025-04-02 00:00:00

This paper studies the optimal resource allocation problem within a multi-agent network composed of both autonomous agents and humans. The main challenge lies in the globally coupled constraints that link the decisions of autonomous agents with those of humans. To address this, we propose a reformulation that transforms these coupled constraints into decoupled local constraints defined over the system's communication graph. Building on this reformulation and incorporating a human response model that captures human-robot interactions while accounting for individual preferences and biases, we develop a fully distributed algorithm. This algorithm guides the states of the autonomous agents to equilibrium points which, when combined with the human responses, yield a globally optimal resource allocation. We provide both theoretical analysis and numerical simulations to validate the effectiveness of the proposed approach.
Path planning with moving obstacles using stochastic optimal control
Authors: Seyyed Reza Jafari, Anders Hansson, Bo Wahlberg
Date: 2025-04-02 00:00:00

Navigating a collision-free, optimal path for a robot poses a perpetual challenge, particularly in the presence of moving objects such as humans. In this study, we formulate the problem of finding an optimal path as a stochastic optimal control problem. However, obtaining a solution to this problem is nontrivial. Therefore, we consider a simplified problem, which is more tractable. For this simplified formulation, we are able to solve the corresponding Bellman equation. However, the solution obtained from the simplified problem does not sufficiently address the original problem of interest. To address the full problem, we propose a numerical procedure where we solve an optimization problem at each sampling instant. The solution to the simplified problem is integrated into the online formulation as a final-state penalty. We illustrate the efficiency of the proposed method using a numerical example.
Orbit Determination through Cosmic Microwave Background Radiation
Authors: Pedro K de Albuquerque, Andre R Kuroswiski, Annie S. Wu, Willer G. dos Santos, Paulo Costa
Date: 2025-04-03 00:00:00
Tasks: Position

This research explores the use of Cosmic Microwave Background (CMB) radiation as a reference signal for Initial Orbit Determination (IOD). By leveraging the unique properties of CMB, this study introduces a novel method for estimating spacecraft velocity and position with minimal reliance on pre-existing environmental data, offering significant advantages for space missions independent of Earth-specific conditions. Using Machine Learning (ML) regression models, this approach demonstrates the capability to determine velocity from CMB signals and subsequently determine the satellite's position. The results indicate that CMB has the potential to enhance the autonomy and flexibility of spacecraft operations.
Bayesian eco-evolutionary game dynamics
Authors: Arunava Patra, Joy Das Bairagya, Sagar Chakraborty
Date: 2025-04-03 00:00:00

The symbiotic relationship between the frameworks of classical game theory and evolutionary game theory is well-established. However, evolutionary game theorists have mostly tapped into the classical game of complete information where players are completely informed of all other players' payoffs. Of late, there is a surge of interest in eco-evolutionary interactions where the environment's state is changed by the players' actions which, in turn, are influenced by the changing environment. However, in real life, the information about the true environmental state must pass through some noisy channel (like usually imperfect sensory apparatus of the players) before it is perceived by the players: The players naturally are prone to sometimes perceive the true state erroneously. Given the uncertain perceived environment, the players may adopt bet-hedging kind of strategies in which they play different actions in different perceptions. In a population of such ill-informed players, a player would be confused about the information state of her opponent, and an incomplete information situation akin to a Bayesian game surfaces. In short, we contemplate possibility of natural emergence of symbiotic relationship between the frameworks of Bayesian games and eco-evolutionary games when the players are equipped with inefficient sensory apparatus. Herein, we illustrate this connection using a setup of infinitely large, well-mixed population of players equipped with two actions for exploiting a resource (the environment) at two different rates so that the resource state evolves accordingly. The state of the resource impacts every player's decision of playing particular action. We investigate continuous state environment in the presence of a Gaussian noisy channel. Employing the formalism of replicator dynamics, we find that noisy information can be effective in preventing resource from going extinct.
Stability of complex communities: A perspective from discrete-time dynamics
Authors: Shuaiying Wang, Yuguang Yang, Aming Li
Date: 2025-04-03 00:00:00

Understanding the stability of complex communities is a central focus in ecology, many important theoretical advancements have been made to identify drivers of ecological stability. However, previous results often rely on the continuous-time dynamics, assuming that species have overlapping generations. In contrast, numerous real-world communities consist of species with non-overlapping generations, whose quantitative behavior can only be precisely represented by discrete-time dynamics rather than continuous ones. Here, we develop a theoretical framework and propose a metric to quantify the stability of complex communities characterized by non-overlapping generations and diverse interaction types. In stark contrast to existing results for overlapping generations, we find that increasing self-regulation strength first stabilizes and then destabilizes complex communities. This pattern is further confirmed in both exploitative (E. aerogenes, P. aurantiaca, P. chlororaphis, P. citronellolis) and competitive (P. putida, P. veroni, S. marcescens) soil microbial communities. Moreover, we show that communities with diverse interaction types become the most stable, which is corroborated by empirical mouse microbial networks. Furthermore, we reveal that the prevalence of weak interactions can stabilize communities, which is consistent with findings from existing microbial experiments. Our analyses of complex communities with non-overlapping generations provide a more comprehensive understanding of ecological stability and informs practical strategies for ecological restoration and control.
Universally applicable and tunable graph-based coarse-graining for Machine learning force fields
Authors: Christoph Brunken, Sebastien Boyer, Mustafa Omar, Martin Maarand, Olivier Peltre, Solal Attias, Bakary N'tji Diallo, Anastasia Markina, Olaf Othersen, Oliver Bent
Date: 2025-03-24 00:00:00

Coarse-grained (CG) force field methods for molecular systems are a crucial tool to simulate large biological macromolecules and are therefore essential for characterisations of biomolecular systems. While state-of-the-art deep learning (DL)-based models for all-atom force fields have improved immensely over recent years, we observe and analyse significant limitations of the currently available approaches for DL-based CG simulations. In this work, we present the first transferable DL-based CG force field approach (i.e., not specific to only one narrowly defined system type) applicable to a wide range of biosystems. To achieve this, our CG algorithm does not rely on hard-coded rules and is tuned to output coarse-grained systems optimised for minimal statistical noise in the ground truth CG forces, which results in significant improvement of model training. Our force field model is also the first CG variant that is based on the MACE architecture and is trained on a custom dataset created by a new approach based on the fragmentation of large biosystems covering protein, RNA and lipid chemistry. We demonstrate that our model can be applied in molecular dynamics simulations to obtain stable and qualitatively accurate trajectories for a variety of systems, while also discussing cases for which we observe limited reliability.
Cryptocurrency Time Series on the Binary Complexity-Entropy Plane: Ranking Efficiency from the Perspective of Complex Systems
Authors: Erveton P. Pinto, Marcelo A. Pires, Rone N. da Silva, Sílvio M. Duarte Queirós
Date: 2025-03-24 00:00:00
Tasks: Time Series

We report the first application of a tailored Complexity-Entropy Plane designed for binary sequences and structures. We do so by considering the daily up/down price fluctuations of the largest cryptocurrencies in terms of capitalization (stable-coins excluded) that are worth $circa \,\, 90 \%$ of the total crypto market capitalization. With that, we focus on the basic elements of price motion that compare with the random walk backbone features associated with mathematical properties of the Efficient Market Hypothesis. From the location of each crypto on the Binary Complexity-Plane (BiCEP) we define an inefficiency score, $\mathcal I$, and rank them accordingly. The results based on the BiCEP analysis, which we substantiate with statistical testing, indicate that only Shiba Inu (SHIB) is significantly inefficient, whereas the largest stake of crypto trading is reckoned to operate in close-to-efficient conditions. Generically, our $\mathcal I$-based ranking hints the design and consensus architecture of a crypto is at least as relevant to efficiency as the features that are usually taken into account in the appraisal of the efficiency of financial instruments, namely canonical fiat money. Lastly, this set of results supports the validity of the binary complexity analysis.
Quantum Deep Sets and Sequences
Authors: Vladimir Vargas-Calderón
Date: 2025-04-03 00:00:00
Tasks: Density Estimation, Quantum Machine Learning

This paper introduces the quantum deep sets model, expanding the quantum machine learning tool-box by enabling the possibility of learning variadic functions using quantum systems. A couple of variants are presented for this model. The first one focuses on mapping sets to quantum systems through state vector averaging: each element of the set is mapped to a quantum state, and the quantum state of the set is the average of the corresponding quantum states of its elements. This approach allows the definition of a permutation-invariant variadic model. The second variant is useful for ordered sets, i.e., sequences, and relies on optimal coherification of tristochastic tensors that implement products of mixed states: each element of the set is mapped to a density matrix, and the quantum state of the set is the product of the corresponding density matrices of its elements. Such variant can be relevant in tasks such as natural language processing. The resulting quantum state in any of the variants is then processed to realise a function that solves a machine learning task such as classification, regression or density estimation. Through synthetic problem examples, the efficacy and versatility of quantum deep sets and sequences (QDSs) is demonstrated.
HQCC: A Hybrid Quantum-Classical Classifier with Adaptive Structure
Authors: Ren-xin Zhao, Xinze Tong, Shi Wang
Date: 2025-04-02 00:00:00
Tasks: Quantum Machine Learning

Parameterized Quantum Circuits (PQCs) with fixed structures severely degrade the performance of Quantum Machine Learning (QML). To address this, a Hybrid Quantum-Classical Classifier (HQCC) is proposed. It opens a practical way to advance QML in the Noisy Intermediate-Scale Quantum (NISQ) era by adaptively optimizing the PQC through a Long Short-Term Memory (LSTM) driven dynamic circuit generator, utilizing a local quantum filter for scalable feature extraction, and exploiting architectural plasticity to balance the entanglement depth and noise robustness. We realize the HQCC on the TensorCircuit platform and run simulations on the MNIST and Fashion MNIST datasets, achieving up to 97.12\% accuracy on MNIST and outperforming several alternative methods.