pwc-archive/papers-with-abstracts huggingface dataset:
Estimation of Constraint Admissible Invariant Set with Neural Lyapunov Function
Authors: Dabin Kim, H. Jin Kim
Date: 2024-09-30 00:00:00
Tasks: Model Predictive Control

Constraint admissible positively invariant (CAPI) sets play a pivotal role in ensuring safety in control and planning applications, such as the recursive feasibility guarantee of explicit reference governor and model predictive control. However, existing methods for finding CAPI sets for nonlinear systems are often limited to single equilibria or specific system dynamics. This limitation underscores the necessity for a method to construct a CAPI set for general reference tracking control and a broader range of systems. In this work, we leverage recent advancements in learning-based methods to derive Lyapunov functions, particularly focusing on those with piecewise-affine activation functions. Previous attempts to find an invariant set with the piecewise-affine neural Lyapunov function have focused on the estimation of the region of attraction with mixed integer programs. We propose a methodology to determine the maximal CAPI set for any reference with the neural Lyapunov function by transforming the problem into multiple linear programs. Additionally, to enhance applicability in real-time control scenarios, we introduce a learning-based approach to train the estimator, which infers the CAPI set from a given reference. The proposed approach is validated with multiple simulations to show that it can generate a valid CAPI set with the given neural Lyapunov functions for any reference. We also employ the proposed CAPI set estimation method in the explicit reference governor and demonstrate its effectiveness for constrained control.
A Plug and Play Distributed Secondary Controller for Microgrids with Grid-Forming Inverters
Authors: Vivek Khatana, Soham Chakraborty, Murti V. Salapaka
Date: 2024-09-30 00:00:00
Tasks: Distributed Optimization

A distributed controller for secondary control problems in microgrids with grid-forming (GFM) inverter-based resources (IBRs) is developed. The controller is based on distributed optimization and is synthesized and implemented distributively enabling each GFM IBR to utilize decentralized measurements and the neighborhood information in the communication network. We present a convergence analysis establishing voltage regulation and reactive power sharing properties. A controller-hardware-in-the-loop experiment is conducted to evaluate the performance of the proposed controller. The experimental results corroborate the efficacy of the proposed distributed controller for secondary control.
A Distributed Malicious Agent Detection Scheme for Resilient Power Apportioning in Microgrids
Authors: Vivek Khatana, Soham Chakraborty, Govind Saraswat, Sourav Patel, Murti V. Salapaka
Date: 2024-09-30 00:00:00

We consider the framework of distributed aggregation of Distributed Energy Resources (DERs) in power networks to provide ancillary services to the power grid. Existing aggregation schemes work under the assumption of trust and honest behavior of the DERs and can suffer when that is not the case. In this article, we develop a distributed detection scheme that allows the DERs to detect and isolate the maliciously behaving DERs. We propose a model for the maliciously behaving DERs and show that the proposed distributed scheme leads to the detection of the malicious DERs. Further, augmented with the distributed power apportioning algorithm the proposed scheme provides a framework for resilient distributed power apportioning for ancillary service dispatch in power networks. A controller-hardware-in-the-loop (CHIL) experimental setup is developed to evaluate the performance of the proposed resilient distributed power apportioning scheme on an 8-commercial building distribution network (Central Core) connected to a 55 bus distribution network (External Power Network) based on the University of Minnesota Campus. A diversity of DERs and loads are included in the network to generalize the applicability of the framework. The experimental results corroborate the efficacy of the proposed resilient distributed power apportioning for ancillary service dispatch in power networks.
Energy Saving and Traffic Steering Use Case and Testing by O-RAN RIC xApp/rApp Multi-vendor Interoperability
Authors: Arda Akman, Peyman Tehrani, Pablo Oliver, Marcin Hoffmann, Michael Jones, Jia Li
Date: 2024-09-29 00:00:00

This paper discusses the use case of energy saving and traffic steering in O-RAN, the mechanism of multi-vendor interoperability to make it work and depict its test methodology.
Parameter Estimation in Optimal Tolling for Traffic Networks Under the Markovian Traffic Equilibrium
Authors: Chih-Yuan Chiu, Shankar Sastry
Date: 2024-09-29 00:00:00
Tasks: ARC, parameter estimation

Tolling, or congestion pricing, has emerged as an effective tool for preventing gridlock in traffic systems. However, tolls are currently mostly designed on route-based traffic assignment models (TAM), which may be unrealistic and computationally expensive. Existing approaches also impractically assume that the central tolling authority can access latency function parameters that characterize the time required to traverse each network arc (edge), as well as the entropy parameter $\beta$ that characterizes commuters' stochastic arc-selection decisions on the network. To address these issues, this work formulates an online learning algorithm that simultaneously refines estimates of linear arc latency functions and entropy parameters in an arc-based TAM, while implementing tolls on each arc to induce equilibrium flows that minimize overall congestion on the network. We prove that our algorithm incurs regret upper bounded by $O(\sqrt{T} \ln(T) |\arcsMod| \max\{|\nodesMod| \ln(|\arcsMod|/|\nodesMod|), B \})$, where $T$ denotes the total iteration count, $|\arcsMod|$ and $|\nodesMod|$ denote the total number of arcs and nodes in the network, respectively, and $B$ describes the number of arcs required to construct an estimate of $\beta$ (usually $\ll |I|$). Finally, we present numerical results on simulated traffic networks that validate our theoretical contributions.
An Enhanced Semidefinite Relaxation Model Combined with Clique Graph Merging Strategy for Efficient AC Optimal Power Flow Solution
Authors: Zhaojun Ruan, Libao Shi
Date: 2024-09-29 00:00:00

Semidefinite programming (SDP) is widely acknowledged as one of the most effective methods for deriving the tightest lower bounds of the optimal power flow (OPF) problems. In this paper, an enhanced semidefinite relaxation model that integrates tighter {\lambda}-based quadratic convex relaxation, valid inequalities, and optimality-based bound tightening algorithms derived in accordance with the branch thermal limit boundary surface into the SDP framework is presented to further tighten the lower bounds of the feasible region of OPF problems, effectively combining the advantages of these recent advancements. Additionally, the utilization of chordal decomposition in the complex matrix formulation of SDP can significantly accelerate the solution time. Notably, for the same SDP problem, different chordal decompositions can result in varying solution time. To address this problem, this paper proposes a clique graph merging strategy within the complex matrix SDP framework, which assesses clique sizes and the computational burden on interior-point solvers, as well as reducing the need for hyperparameter tuning and further enhancing the solution efficiency. Finally, the proposed hybrid relaxation model is evaluated using MATPOWER and PGLib-OPF test cases, demonstrating its effectiveness in reducing the optimality gap and validating its computational performance on test cases with up to 13659-node.
Methods for Mitigating Uncertainty in Real-Time Operations of a Connected Microgrid
Authors: Subrat Prasad Panda, Blaise Genest, Arvind Easwaran, Rémy Rigo-Mariani, Pengfeng Lin
Date: 2024-09-29 00:00:00
Tasks: Deep Reinforcement Learning, energy management

In this paper, we compare the effectiveness of a two-stage control strategy for the energy management system (EMS) of a grid-connected microgrid under uncertain solar irradiance and load demand using a real-world dataset from an island in Southeast Asia (SEA). The first stage computes a day-ahead commitment for power profile exchanged with the main grid, while the second stage focuses on real-time controls to minimize the system operating cost. Given the challenges in accurately forecasting solar irradiance for a long time horizon, scenario-based stochastic programming (SP) is considered for the first stage. For the second stage, as the most recent weather conditions can be used, several methodologies to handle the uncertainties are investigated, including: (1) the rule-based method historically deployed on EMS, (2) model predictive controller (MPC) using either an explicit forecast or scenario-based stochastic forecast, and (3) Deep Reinforcement Learning (DRL) computing its own implicit forecast through a distribution of costs. Performances of these methodologies are compared in terms of precision with a reference control assuming perfect forecast -- i.e. representing the minimal achievable operation cost in theory. Obtained results show that MPC with a stochastic forecast outperforms MPC with a simple deterministic prediction. This suggests that using an explicit forecast, even within a short time window, is challenging. Using weather conditions can, however, be more efficient, as demonstrated by DRL (with implicit forecast), outperforming MPC with stochastic forecast by 1.3\%.
Joint Trajectory Replanning for Mars Ascent Vehicle under Propulsion System Faults: A Suboptimal Learning-Based Warm-Start Approach
Authors: Kun Li, Guangtao Ran, Yanning Guo, Ju H. Park, Yao Zhang
Date: 2024-09-29 00:00:00
Tasks: Decision Making

During the Mars ascent vehicle (MAV) launch missions, when encountering a thrust drop type of propulsion system fault problem, the general trajectory replanning methods relying on step-by-step judgments may fail to make timely decisions, potentially leading to mission failure. This paper proposes a suboptimal joint trajectory replanning (SJTR) method, which formulates the joint optimization problem of target orbit and flight trajectory after a fault within a convex optimization framework. By incorporating penalty coefficients for terminal constraints, the optimization solution adheres to the orbit redecision principle, thereby avoiding complex decision-making processes and resulting in a concise and rapid solution to the replanning problem. A learning-based warm-start scheme is proposed in conjunction with the designed SJTR method. Offline, a deep neural network (DNN) is trained using a dataset generated by the SJTR method. Online, the DNN provides initial guesses for the time optimization variables based on the current fault situation, enhancing the solving efficiency and reliability of the algorithm. Numerical simulations of the MAV flight scenario under the thrust drop faults are performed, and Monte Carlo experiments and case studies across all orbit types demonstrate the effectiveness of the proposed method.
Construction of the Sparsest Maximally r-Robust Graphs
Authors: Haejoon Lee, Dimitra Panagou
Date: 2024-09-28 00:00:00

In recent years, the notion of r-robustness for the communication graph of the network has been introduced to address the challenge of achieving consensus in the presence of misbehaving agents. Higher r-robustness typically implies higher tolerance to malicious information towards achieving resilient consensus, but it also implies more edges for the communication graph. This in turn conflicts with the need to minimize communication due to limited resources in real-world applications (e.g., multi-robot networks). In this paper, our contributions are twofold. (a) We provide the necessary subgraph structures and tight lower bounds on the number of edges required for graphs with a given number of nodes to achieve maximum robustness. (b) We then use the results of (a) to introduce two classes of graphs that maintain maximum robustness with the least number of edges. Our work is validated through a series of simulations.
Combining Switching Mechanism with Re-Initialization and Anomaly Detection for Resiliency of Cyber-Physical Systems
Authors: Hao Fu, Prashanth Krishnamurthy, Farshad Khorrami
Date: 2024-09-21 00:00:00
Tasks: Anomaly Detection

Cyber-physical systems (CPS) play a pivotal role in numerous critical real-world applications that have stringent requirements for safety. To enhance the CPS resiliency against attacks, redundancy can be integrated in real-time controller implementations by designing strategies that switch among multiple controllers. However, existing switching strategies typically overlook remediation measures for compromised controllers, opting instead to simply exclude them. Such a solution reduces the CPS redundancy since only a subset of controllers are used. To address this gap, this work proposes a multi-controller switching strategy with periodic re-initialization to remove attacks. Controllers that finish re-initialization can be reused by the switching strategy, preserving the CPS redundancy and resiliency. The proposed switching strategy is designed to ensure that at each switching moment, a controller that has just completed re-initialization is available, minimizing the likelihood of compromise. Additionally, the controller's working period decreases with the number of involved controllers, reducing the controller's exposure time to attacks. An anomaly detector is used to detect CPS attacks during the controller's working period. Upon alarm activation, the current control signal is set to a predefined value, and a switch to an alternative controller occurs at the earliest switching moment. Our switching strategy is shown to be still effective even if the anomaly detector fails to detect (stealthy) attacks.
Analytical Construction of CBF-Based Safety Filters for Simultaneous State and Input Constraints (Extended Version)
Authors: Peter A. Fisher, Anuradha M. Annaswamy
Date: 2024-09-28 00:00:00

We revisit the problem explored in [1] of guaranteeing satisfaction of multiple simultaneous state constraints applied to a single-input, single-output plant consisting of a chain of n integrators subject to input limitations. For this problem setting, we derive an analytic, easy-to-implement safety filter which respects input limitations and ensures forward-invariance of all state constraints simultaneously. Additionally, we provide a straightforward extension to the multi-input, multi-output chained integrator setting, and provide an analytic safety filter guaranteeing satisfaction of arbitrarily many simultaneous hyperplane constraints on the output vector. Whereas the approach in [1] obtains maximal invariant sets, our approach trades off some degree of conservatism in exchange for a recursive safety filter which is analytic for any arbitrary n >= 1.
Implicit Euler Discrete-Time Set-Valued Admittance Control for Impact-Contact Force Control
Authors: Ke Li, Xiaogang Xiong, Anjia Wang, Ying Qu, Yunjiang Lou
Date: 2024-09-28 00:00:00

Admittance control is a commonly used strategy for regulating robotic systems, such as quadruped and humanoid robots, allowing them to respond compliantly to contact forces during interactions with their environments. However, it can lead to instability and unsafe behaviors like snapping back and overshooting due to torque saturation from impacts with unknown stiffness environments. This paper introduces a novel admittance controller that ensures stable force control after impacting unknown stiffness environments by leveraging the differentiability of impact-contact forces. The controller is mathematically represented by a differential algebraic inclusion (DAI) comprising two interdependent set-valued loops. The first loop employs set-valued first-order sliding mode control (SMC) to limit input torque post-impact. The second loop utilizes the multivariable super-twisting algorithm (MSTA) to mitigate unstable motion caused by impact forces when interacting with unknown stiffness environments. Implementing this proposed admittance control in digital settings presents challenges due to the interconnected structure of the two set-valued loops, unlike implicit Euler discretization methods for set-valued SMCs. To facilitate implementation, this paper offers a new algorithm for implicit Euler discretization of the DAI. Simulation and experimental results demonstrate that the proposed admittance controller outperforms state-of-the-art methods.
Safe Delay-Adaptive Control of Strict-Feedback Nonlinear Systems with Application in Vehicle Platooning
Authors: Zhenxu Zhao, Ji Wang
Date: 2024-09-28 00:00:00

This paper presents a safe delay-adaptive control for a strict-feedback nonlinear ODE with a delayed actuator, whose dynamic is also a strict-feedback nonlinear ODE and the delay length is unknown. By formulating the delay as a transport PDE, the plant becomes a sandwich configuration consisting of nonlinear ODE-transport PDE-nonlinear ODE, where the transport speed in the PDE is unknown. We propose a predictor-based nonovershooting backstepping transformation to build the nominal safe delay-compensated control, guaranteeing that the output of the distal ODE safely tracks the target trajectory from one side without undershooting. To address the uncertainty in the delay, we incorporate recent delay-adaptive and safe adaptive technologies to build a safe adaptive-delay controller. The adaptive closed-loop system ensures 1) the exact identification of the unknown delay in finite time; 2) the output state stays in the safe region all the time, especially in the original safe region, instead of a subset, after a finite time; 3) all states are bounded, and moreover, they will converge to zero if the target trajectory is identically zero. In the simulation, the proposed control design is verified in the application of safe vehicle platooning. It regulates the spacing between adjacent vehicles to converge to a small distance and avoids collisions by ensuring they do not breach the safe distance at any time, even in the presence of large unknown delays and at a relatively high speed.
State estimation for parallel-connected batteries via inverse dynamic modeling
Authors: Hannah Lee, Casey Casten, Hosam Fathy
Date: 2024-09-28 00:00:00
Tasks: State Estimation

This paper examines the problem of estimating the states, including state of charge, of battery cells connected in parallel. Previous research highlights the importance of this problem, and presents multiple approaches for solving it. Algorithm scalability and observability analysis can both be challenging, particularly because the underlying pack dynamics are governed by differential algebraic equations. Our work addresses these challenges from a novel perspective that begins by inverting the causality of parallel pack dynamics, which breaks the pack model's underlying algebraic loop. This simplifies observability analysis and observer design significantly, leading to three novel contributions. First, the paper derives mathematical conditions for state observability that apply regardless of the number of battery cells and the order of their individual dynamics. Second, the paper presents an approach for grouping battery cells such that their lumped dynamics are observable. Finally, the paper presents a novel pack state estimator that achieves computational tractability by employing inverse dynamic modeling. We conclude by presenting a Monte Carlo simulation study of this estimator using experimentally-parameterized models of two battery chemistries. The simulation results highlight the computational benefits of both the clustering strategy and inverse dynamics approach for state estimation.
Improved formulation for long-duration storage in capacity expansion models using representative periods
Authors: Federico Parolin, Paolo Colbertaldo, Ruaridh Macdonald
Date: 2024-09-27 00:00:00

With the increasing complexity and size of capacity expansion models, temporal aggregation has emerged as a common method to improve computational tractability. However, this approach inherently complicates the inclusion of long-duration storage (LDS) systems, whose operation involves the entire time horizon connecting all time steps. This work presents a detailed investigation of LDS modelling with temporal aggregation. A novel compact formulation is proposed to reduce the number of constraints while effectively tracking the storage content and enforcing limits on the state of charge throughout the entire time horizon. The developed method is compared with two leading state-of-the-art formulations. All three methods are implemented in the Dolphyn capacity expansion model and tested on a case study for the continental United States, considering different configurations in terms of spatial resolutions and representative periods. The performance is assessed with both the commercial solver Gurobi and the open-source solver HiGHS. Results show that the developed compact formulation consistently outperforms the other methods in terms of both runtime (30%-70% faster than other methods) and memory usage (1%-9% lower than other methods).
Joint Optimization of Pattern, Headway, and Fleet Size of Multiple Urban Transit Lines with Perceived Headway Consideration and Passenger Flow Allocation
Authors: Max T. M. Ng, Draco Tong, Hani S. Mahmassani, Omer Verbas, Taner Cokyasar
Date: 2024-09-27 00:00:00

This study addresses the urban transit pattern design problem, optimizing stop sequences, headways, and fleet sizes across multiple routes and periods simultaneously to minimize user costs (composed of riding, waiting, and transfer times) under operational constraints (e.g., vehicle capacity and fleet size). A destination-labeled multi-commodity network flow (MCNF) formulation is developed to solve the problem at a large scale more efficiently compared to the previous literature. The model allows for flexible pattern options without relying on pre-defined candidate sets and simultaneously considers multiple operational strategies such as express/local services, short-turning, and deadheading. It evaluates perceived headways of joint patterns for passengers, assigns passenger flows to each pattern accordingly, and allows transfers across patterns in different directions. The mixed-integer linear programming (MILP) model is demonstrated with a city-sized network of metro lines in Chicago, USA, achieving near-optimal solutions in hours. The total weighted journey times are reduced by 0.61% and 5.76% under single-route and multi-period multi-route scenarios respectively. The model provides transit agencies with an efficient tool for comprehensive service design and resource allocation, improving service quality and resource utilization without additional operational costs.