| |
Last updated on March 17, 2025. This conference program is tentative and subject to change
Technical Program for Tuesday July 8, 2025
To show or hide the keywords and abstract (text summary) of a paper (if available), click on the paper title
Open all abstracts
Close all abstracts
Presentation  In person  On-line  No presentation  No information
|
TuA01 |
Plaza AB |
RI - Model Predictive Control I |
RI Session |
Chair: Findeisen, Rolf | TU Darmstadt |
Co-Chair: Deng, Li | University of Alberta |
|
10:00-10:03, Paper TuA01.1 | |
3D Cooperative Pursuit with Guaranteed Enclosure Via Robust Model Predictive Control |
|
Patra, Dinesh | IIT Kharagpur |
Hota, Ashish R. | Indian Institute of Technology (IIT), Kharagpur |
Keywords: Agents-based systems, Autonomous systems, Decentralized control
Abstract: We consider a cooperative pursuit setting involving multiple pursuers and a single evader. The pursuers are required to collectively enclose the evader in their convex hull throughout the game when the evader's strategy is unknown to the pursuers. While prior works have considered this problem in the two-dimensional space, we generalize their results to the unbounded three-dimensional space. We propose a partition of the evader-centered space such that if each pursuer adheres to its assigned constrained region, then the evader is guaranteed to lie within the convex hull defined by the positions of the pursuers. Each pursuer then solves a robust model predictive control (MPC) problem treating the strategy of the evader as the uncertain variable and by including the partition related constraints. The resulting robust optimization problem is solved in a decentralized manner by the pursuers and guarantees enclosure of the evader. Simulation results demonstrate the effectiveness of the proposed framework.
|
|
10:03-10:06, Paper TuA01.2 | |
Trajectory Planning among Interactive Markovian Obstacles Using Scenario Model Predictive Control |
|
Heiker, Carl-Johan | Chalmers University of Technology |
Falcone, Paolo | Chalmers University of Technology |
Keywords: Automotive systems, Communication networks, Markov processes
Abstract: We propose a scenario model predictive controller (SMPC) for determining the acceleration of an autonomous vehicle (AV) based on decisions made by human-driven vehicle (HDV) obstacles in a traffic intersection. The collective behavior of the HDVs is modeled as a decision process between Markovian agents, and the time-dependent probabilities of scenarios in which the agents decide to occupy the intersection are predicted. The SMPC then determines the AV acceleration that minimizes an expected scenario cost formulated using the transient probability predictions. In simulation, we show how using transient instead of stationary scenario probabilities determines the AV’s acceleration based on a trade-off between a current observation and a predicted environment behavior.
|
|
10:06-10:09, Paper TuA01.3 | |
Laboratory Testing of Model Predictive Control for Cost and Emissions Reduction of Heat Pump Water Heaters |
|
dela Rosa, Loren | University of California Davis |
Mande, Caton | UC Davis Western Cooling Efficiency Center |
Meyers, Fred | UC Davis Western Cooling Efficiency Center |
Ellis, Matthew | University of California, Davis |
Keywords: Building and facility automation, Control applications, Smart grid
Abstract: Water heating accounts for 18% of energy consumption and 15% of greenhouse gas (GHG) emissions in U.S. residential buildings. Electric heat pump water heaters (HPWHs) are more energy efficient than electric resistance water heaters, but widespread adoption could strain the grid. Moreover, successful decarbonization requires aligning HPWH operation with electricity generated from clean energy sources like solar and wind. This work demonstrates the effectiveness of a multi-objective economic model predictive control (MPC) in minimizing electricity costs, GHG emissions, and comfort violations for a laboratory HPWH unit over three consecutive days. An automated tuning approach for the MPC cost function is presented, along with a discussion of the practical implementation challenges of the proposed MPC framework. Experimental results show that MPC reduces electricity costs by 31% and GHG emissions by 46% compared to a typical HPWH rule-based control strategy.
|
|
10:09-10:12, Paper TuA01.4 | |
Encrypted Machine Learning-Based Model Predictive Control of Nonlinear Systems |
|
Khodaverdian, Arthur | University of California, Los Angeles |
Wu, Guoquan | National University of Singapore |
Wu, Zhe | National University of Singapore |
Christofides, Panagiotis D. | Univ. of California at Los Angeles |
Keywords: Chemical process control, Predictive control for nonlinear systems, Machine learning
Abstract: This work proposes the implementation of encryption to machine learning-based model predictive control to enhance cybersecurity without significant performance losses. Tracking model predictive control with respect to an unstable steady state for a model chemical process serves as the control group. Results are compared to the same process with the Pallier cryptosystem applied with varying degrees of precision. We determine the stabilizability of the design, including the impacts of quantization loss and sample-and-hold control. Results of the simulated system are compared to demonstrate the impact of quantization losses on system performance.
|
|
10:12-10:15, Paper TuA01.5 | |
ReLU Neural Networks for Approximating Model Predictive Control: Complexity and Stability Guarantees |
|
Li, Xingchen | Tsinghua University |
You, Keyou | Tsinghua University |
Keywords: Constrained control, Machine learning
Abstract: Recently, there has been a resurgence in research focused on using neural networks (NNs) to approximate model predictive control (MPC) for fast optimization, achieving great practical success. However, the relation between the computational complexity of NNs and control performance remains an open question. In this paper, we establish explicit upper bounds on the width and depth of ReLU NNs for linear MPC approximation with constraint satisfaction and stability guarantees. These bounds are expressed in terms of the desired approximation error, the problem size of the multi-parameter quadratic program and its Lipschitz constant, as well as the shape of the constraint set. We find that increasing the depth is more effective than increasing the width. Our work provides a theoretical guide for designing NN approximations of MPC.
|
|
10:15-10:18, Paper TuA01.6 | |
Introducing Implicit Tube Model Predictive Control to MPT+: Efficient Design for Large-Scale Systems |
|
Pavlovičová, Erika | Slovak University of Technology in Bratislava |
Holaza, Juraj | Slovak University of Technology in Bratislava |
Galčíková, Lenka | Faculty of Chemical and Food Technology, Slovak University of Te |
Oravec, Juraj | Slovak University of Technology in Bratislava |
Keywords: Control software, Predictive control for linear systems, Robust control
Abstract: As society advances, increasingly complex systems pose new challenges for control engineers. To address these challenges, researchers continually develop state-of-the-art control techniques. This creates a demand for software tools that integrate these advanced methods and allow users to utilize them with ease. In this paper, we aim to enhance the MPT+ toolbox, an extension of the widely used Multi-Parametric Toolbox~(MPT), with a novel implicit tube Model Predictive Control (MPC) approach. This approach avoids geometric set operations and enables robust MPC designs for large-scale problems. It will be shown that MPT+ allows users to apply this control strategy within a few lines in a user-friendly manner. Moreover, via a case study, we demonstrate that the implicit tube MPC approach enables us to design robust controllers for more complex systems, which were previously computationally intractable with the commonly used rigid tube MPC methods.
|
|
10:18-10:21, Paper TuA01.7 | |
Scalable Hierarchical MPC Using Input Space Reduction |
|
Wang, Wenqing | University of Texas at Dallas |
Koeln, Justin | University of Texas at Dallas |
Keywords: Hierarchical control, Predictive control for linear systems
Abstract: This paper presents two complementary approaches for reducing the computational complexity of the upper-level controller in a two-level vertical hierarchical Model Predictive Control (MPC) framework for systems with multiple dynamic timescales. First, inner-approximations are used to produce simplified output constraint sets, reducing the number of inequality constraints. Second, the fast and slow dynamic timescales are used to determine a reduced input space, reducing the number of decision variables. A systematic analysis of the number of design variables and constraints is provided and the improved scalability of the proposed approach is demonstrated using a simulated thermal system example.
|
|
10:21-10:24, Paper TuA01.8 | |
MPC-Guided, Data-Driven Fuzzy Controller Synthesis |
|
Paredes Salazar, Juan Augusto | University of Maryland, Baltimore Couunty |
Goel, Ankit | University of Maryland Baltimore County |
Keywords: Fuzzy systems, Learning, Identification for control
Abstract: Model predictive control (MPC) is a powerful control technique for online optimization using system model-based predictions over a finite time horizon. However, the computational cost MPC requires can be prohibitive in resource-constrained computer systems. This paper presents a fuzzy controller synthesis framework guided by MPC. In the proposed framework, training data is obtained from MPC closed-loop simulations and is used to optimize a low computational complexity controller to emulate the response of MPC. In particular, autoregressive moving average (ARMA) controllers are trained using data obtained from MPC closed-loop simulations, such that each ARMA controller emulates the response of the MPC controller under particular desired conditions. Using a Takagi-Sugeno (T-S) fuzzy system, the responses of all the trained ARMA controllers are then weighted depending on the measured system conditions, resulting in the Fuzzy-Autoregressive Moving Average (F-ARMA) controller. The effectiveness of the trained F-ARMA controllers is illustrated via numerical examples.
|
|
10:24-10:27, Paper TuA01.9 | |
Nonlinear Model Predictive Control for Roll-To-Roll Mechanical Transfer of Printed Electronics and 2D Materials |
|
Martin, Christopher | University of Texas at Austin |
Daniel, Aditi | University of Texas at Austin |
Li, Wei | University of Texas at Austin |
Chen, Dongmei | The University of Texas at Austin |
Keywords: Manufacturing systems, Materials processing, Reduced order modeling
Abstract: Roll-to-roll (R2R) mechanical transfer is an advanced technology that facilitates continuous, etchant-free transfer of printed electronics and two-dimensional (2D) materials on flexible substrates. It involves dry peeling of fabricated devices or material from a donor substrate and transferring them to a target substrate, both being flexible and known as webs. Achieving high-quality transfer requires precise regulation of the tensions in these webs, necessitating a controller that handles process nonlinearities, disturbances, and input constraints. To address these challenges, we propose a nonlinear model predictive control (MPC) approach for R2R mechanical peeling. However, current R2R peeling models are either too computationally expensive to use or lack the accuracy needed for real-time application. This study introduces a fast, accurate nonlinear model of R2R peeling and integrates it into an MPC framework. A case study on the dry transfer of chemical vapor deposition (CVD) graphene is used to demonstrate the effectiveness of this proposed nonlinear MPC approach.
|
|
10:27-10:30, Paper TuA01.10 | |
Robust Model Predictive Defense against Stealthy Actuator Attacks Based on a Novel Convex Reformulation of a Min-Max Problem |
|
Kuroptev, Kirill | Technical University of Darmstadt |
Abolpour, Roozbeh | Shiraz University |
Steinke, Florian | Technical University of Darmstandt |
Keywords: Optimization, Robust control, Predictive control for nonlinear systems
Abstract: We consider actuator attacks where an adversary applies an optimized control sequence to drive the system's output away from its nominal value while aiming to remain undetected. In response, we propose a robust model predictive defense (RMPD) strategy where an anticipatory defender foresees such an adversary. Our RMPD approach is formulated as a min-max problem, accounting for the set of the adversary's feasible control inputs when available and being conservative otherwise, allowing for different prediction horizons of the defender and adversary. We present a novel exact convex reformulation approach for our RMPD problem with a rectangular feasibility region. The novel exact reformulation is benchmarked against a relaxed formulation using an ellipsoidal feasibility region of the adversary's control inputs, which is solved using the S-procedure. Numerical experiments on a coupled pendulum validate our RMPD's effectiveness and show the exact approach's improved efficiency in terms of required control energy compared to the relaxed approach.
|
|
10:30-10:33, Paper TuA01.11 | |
Computationally Efficient Dual Mode Model Predictive Control to Ensure Safe Charging of Lithium-Ion Batteries |
|
Undare, Suchita Anil | University of Colorado Colorado Springs |
Karami, Kiana | Penn State Harrisburg |
Trimboli, Michael | University of Colorado, Colorado Springs |
Keywords: Predictive control for linear systems, Constrained control, Optimal control
Abstract: Model predictive control (MPC) has emerged as a promising strategy for the control of lithium-ion batteries due mainly to its capability for real-time constraint handling. However, classical implementations of MPC cannot guarantee stability, thus limiting its practical application. In addition, classical linear MPC relies on the computation of a constrained quadratic program at every time step, the computation of which may become burdensome when long horizons and numerous constraints are involved. The present paper applies a ”dual mode” variation of MPC which reduces the necessity of implementing a quadratic program and provides assured stability of operation, at the cost of introducing a degree of conservatism.
|
|
10:33-10:36, Paper TuA01.12 | |
Robust Model Predictive Control for Nonlinear Discrete-Time Systems Using Iterative Time-Varying Constraint Tightening |
|
Leister, Daniel Dias | The University of Texas at Dallas |
Koeln, Justin | University of Texas at Dallas |
Keywords: Predictive control for nonlinear systems, Constrained control
Abstract: Robust Model Predictive Control (MPC) for nonlinear systems is a problem that poses significant challenges, as highlighted by the diversity of approaches proposed in the last decades. Often compromises concerning computational load, conservatism, generality, or implementation complexity have to be made. This work provides a practical balance by proposing a novel receding-horizon robust MPC formulation for nonlinear discrete-time systems. By explicitly accounting for how disturbances and linearization errors are propagated through the nonlinear dynamics, a constraint tightening-based formulation is obtained, with guarantees of robust constraint satisfaction. The proposed controller relies on iteratively solving a Nonlinear Program (NLP) to optimize system operation and the required constraint tightening. Numerical experiments show the effectiveness of the proposed controller for three nonlinear systems. Comparisons with two existing techniques show scenario-dependent tradeoffs, though the proposed controller consistently generates less conservative error sets.
|
|
10:36-10:39, Paper TuA01.13 | |
Meta-Learning Augmented MPC for Disturbance-Aware Motion Planning and Control of Quadrotors |
|
Lapandić, Dženan | University of Sarajevo |
Xie, Fengze | Caltech |
Verginis, Christos | Uppsala University |
Chung, Soon-Jo | California Institute of Technology |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Wahlberg, Bo | KTH Royal Institute of Technology |
Keywords: Predictive control for nonlinear systems, Data driven control, Adaptive control
Abstract: A major challenge in autonomous flights is unknown disturbances, which can jeopardize safety and lead to collisions, especially in obstacle-rich environments. This paper presents a disturbance-aware motion planning and control framework designed for autonomous aerial flights. The framework is composed of two key components: a disturbance-aware motion planner and a tracking controller. The disturbance-aware motion planner consists of a predictive control scheme and a learned model of disturbances that is adapted online. The tracking controller is designed using contraction control methods to provide safety bounds on the quadrotor behaviour in the vicinity of the obstacles with respect to the disturbance-aware motion plan. Finally, the algorithm is tested in simulation scenarios with a quadrotor facing strong crosswind and ground-induced disturbances.
|
|
10:39-10:42, Paper TuA01.14 | |
Data-Driven Model Predictive Control of an Hydraulic Excavator Via Local Model Networks |
|
Msaad, Salim | Delft University of Technology |
Cecchin, Leonardo | Politecnico di Milano |
Demir, Ozan | Ruhr-University Bochum |
Fagiano, Lorenzo | Politecnico di Milano |
|
10:42-10:45, Paper TuA01.15 | |
Safe and High-Performance Learning of Model Predictive Control Using Kernel-Based Interpolation |
|
Rose, Alexander | Technical University of Darmstadt |
Schaub, Philipp | Technical University of Darmstadt |
Findeisen, Rolf | TU Darmstadt |
Keywords: Predictive control for nonlinear systems, Machine learning, Optimization algorithms
Abstract: We present a method, which allows efficient and safe approximation of model predictive controllers using kernel interpolation. Since the computational complexity of the approximating function scales linearly with the number of data points, we propose to use a scoring function which chooses the most promising data. To further reduce the complexity of the approximation, we restrict our considerations to the set of closed-loop reachable states. That is, the approximating function only has to be accurate within this set. This makes our method especially suited for systems, where the set of initial conditions is small. In order to guarantee safety and high performance of the designed approximated controller, we use reachability analysis based on Monte Carlo methods.
|
|
10:45-10:48, Paper TuA01.16 | |
Model Predictive Control in the Legendre Domain |
|
Damberger, Graeme | University of Waterloo |
Eliasmith, Chris | University of Waterloo |
Keywords: Predictive control for nonlinear systems, Neural networks, Identification for control
Abstract: We present a reformulation of the model predictive control problem using a Legendre basis. To do so, we use a Legendre representation both for prediction and optimization. For prediction, we use a neural network to approximate the dynamics by mapping a compressed Legendre representation of the control trajectory and initial conditions to the corresponding compressed state trajectory. We then reformulate the optimization problem in the Legendre domain, and demonstrate methods for including optimization constraints. We present simulation results demonstrating that our implementation provides a speedup of 31-40 times for comparable or lower tracking error with or without constraints on a benchmark task.
|
|
10:48-10:51, Paper TuA01.17 | |
Reinforcement Learning-Based Robust Model Predictive Control for Unknown Dynamics with Convergence and Stability Guarantees |
|
Deng, Li | University of Alberta |
Shu, Zhan | University of Alberta |
Chen, Tongwen | University of Alberta |
Keywords: Uncertain systems, Predictive control for linear systems, Reinforcement learning
Abstract: A reinforcement learning (RL)-based robust model predictive control (MPC) is proposed to achieve on-line learning and control for a system with unknown dynamics. A temporal difference (TD) RL method is applied to learn the unknown dynamics by utilizing real-time measurements of input-state data. With the learned system matrices of RL, robust MPC is used to provide effective control actions and approximate the value function for RL. The convergence of learning unknown parameters is discussed based on two constructed parameter sets. A stability condition is derived to connect the Lyapunov function matrices between two consecutive learning steps and input-to-state stability of the unknown system is analyzed. Simulation results are presented to validate the effectiveness of the proposed approach.
|
|
10:51-10:54, Paper TuA01.18 | |
Contraction Analysis of Continuation Method for Suboptimal Model Predictive Control |
|
Shima, Ryotaro | Toyota Central R&D Labs |
Ito, Yuji | Toyota Central R&D Labs., Inc |
Miyano, Tatsuya | Toyota Central R&D Labs., Inc |
Keywords: Predictive control for nonlinear systems, Stability of nonlinear systems, Optimization algorithms
Abstract: This letter analyzes the contraction property of the nonlinear systems controlled by suboptimal model predictive control (MPC) using the continuation method. We propose a contraction metric that reflects the hierarchical dynamics inherent in the continuation method. We derive a pair of matrix inequalities that elucidate the impact of suboptimality on the contraction of the optimally controlled closed-loop system. A numerical example is presented to verify our contraction analysis. Our results are applicable to other MPCs than stabilization, including economic MPC.
|
|
10:54-10:57, Paper TuA01.19 | |
On the Stability of a Nonlinear MPC Scheme for Avoidance |
|
Alves dos Santos, Marcelo | University of Bergamo |
Ferramosca, Antonio | Univeristy of Bergamo |
Raffo, Guilherme Vianna | Federal University of Minas Gerais |
Keywords: Predictive control for nonlinear systems, Stability of nonlinear systems, Optimal control
Abstract: This work analyzes the stability properties of a nonlinear Model Predictive Control (MPC) scheme for avoidance. This control approach introduces an extra penalty for avoidance within the nonlinear tracking MPC framework. We demonstrate that, under a mild assumption on the avoidance penalty, the closed-loop system is Input-to-State Stable (ISS) with respect to this penalty. Furthermore, we discuss the conditions under which asymptotic stability can be achieved and present a simplified scheme with relaxed terminal constraints. To illustrate the effectiveness of the proposed strategy, we apply it to the control of a van der Pol oscillator subjected to non-convex constraints.
|
|
10:57-11:00, Paper TuA01.20 | |
Online Learning of Interaction Dynamics with Dual Model Predictive Control for Multi-Agent Systems Using Gaussian Processes |
|
Baltussen, T.M.J.T. | Eindhoven University of Technology |
Lefeber, Erjen | Eindhoven University of Technology |
Tóth, Roland | Eindhoven University of Technology |
Heemels, W.P.M.H. (Maurice) | Eindhoven University of Technology |
Katriniok, Alexander | Eindhoven University of Technology |
Keywords: Predictive control for nonlinear systems, Autonomous systems, Statistical learning
Abstract: The control of a single agent in complex and uncertain multi-agent environments requires careful consideration of the interactions between the agents. In this context, this paper proposes a dual model predictive control (MPC) method using Gaussian process (GP) models for multi-agent systems. While Gaussian process MPC (GP-MPC) has been shown to be effective in predicting the dynamics of other agents, current methods do not consider the influence of the control input on the covariance of the predictions, and hence lack the dual control effect. Therefore, we propose a dual MPC that directly optimizes the actions of the ego agent, and the belief of the other agents by jointly optimizing their state trajectories as well as the associated covariance while considering their interactions through a GP. We demonstrate our GP-MPC method in a simulation study on autonomous driving, showing improved prediction quality compared to a baseline stochastic MPC. The results show that GP-MPC can learn the interactions between the agents online, demonstrating the potential of GPs for dual MPC in uncertain and unseen scenarios.
|
|
TuA02 |
Plaza DE |
RI - Machine Learning in Control |
RI Session |
Chair: Rizvi, Syed Ali Asad | Tennessee Technological University |
Co-Chair: Paternain, Santiago | Rensselaer Polytechnic Institute |
|
10:00-10:03, Paper TuA02.1 | |
Learning Free Terminal Time Optimal Closed-Loop Control of Manipulators |
|
Hu, Wei | Institute for Advanced Algorithms Research, Shanghai |
Zhao, Yue | Peking University |
E, Weinan | Princeton University |
Han, Jiequn | Flatiron Institute |
Long, Jihao | Institue for Advanced Algorithms Research, Shanghai |
Keywords: Machine learning, Optimal control, Robotics
Abstract: This paper presents a novel approach to learning free terminal time closed-loop control for robotic manipulation tasks, enabling dynamic adjustment of task duration and control inputs to enhance performance. We extend the supervised learning approach, namely solving selected optimal open-loop problems and utilizing them as training data for a policy network, to the free terminal time scenario. Three main challenges are addressed in this extension. First, we introduce a marching scheme that enhances the solution quality and increases the success rate of the open-loop solver by gradually refining time discretization. Second, we extend the QRnet in cite{QRnet} to the free terminal time setting to address discontinuity and improve stability at the terminal state. Third, we present a more automated version of the initial value problem (IVP) enhanced sampling method from previous work cite{IVP_Enhanced} to adaptively update the training dataset, significantly improving its quality. By integrating these techniques, we develop a closed-loop policy that operates effectively over a broad domain with varying optimal time durations, achieving near globally optimal total costs. The appendix and videos are available at https://deepoptimalcontrol.github.io/FreeTimeManipulator.
|
|
10:03-10:06, Paper TuA02.2 | |
Stability Margins of Continuous-Discrete 2D Linear Systems and Their Application to the Design of Iterative Learning Control Laws for Differential Systems |
|
Paszke, Wojciech | University of Zielona Gora |
Maniarski, Robert | University of Zielona Góra |
Rogers, Eric | University of Southampton |
Keywords: Iterative learning control, Linear systems, LMIs
Abstract: This paper considers the class of 2D linear systems where a linear differential equation governs information propagation in one of the two directions, and in the other, the updating is governed by a difference equation; in some of the literature, these systems are referred to as mixed or hybrid. Linear repetitive processes are a particular case of such systems that have been used in several areas, such as iterative learning control. Stability margins for these systems have received attention in the literature. In this paper, new results on these margins for differential linear repetitive processes are derived and applied to iterative learning control law design. Sufficient conditions for computing the required stability margins are formulated using linear matrix inequalities, which can be readily adapted to design the required controllers. Finally, the applications of the developed results to design of ILC scheme for a typical actuator in a tracking servo system is presented to demonstrate the effectiveness of the design and highlight its advantages over existing alternatives.
|
|
10:06-10:09, Paper TuA02.3 | |
L-GraD: Lyapunov-Based Gradient Descent of a DNN-Based Hybrid Exoskeleton Controller |
|
Ting, Jonathan | Auburn University |
Basyal, Sujata | Auburn University |
Mishra, Kislaya | Auburn University |
Allen, Brendon C. | Auburn University |
Keywords: Machine learning, Adaptive control, Robust adaptive control
Abstract: Functional electrical stimulation (FES) is widely used for rehabilitating individuals with total or partial limb paralysis, but challenges like muscle fatigue and discomfort limit its effectiveness. Hybrid exoskeletons combine the rehabilitative benefits of exoskeletons and FES, while mitigating the drawbacks of each. However, despite hybrid exoskeletons being highly effective in rehabilitation, the dynamics associated with these systems are complex. Deep neural networks (DNNs) can approximate these complex hybrid exoskeleton dynamics; however, they traditionally lack stability guarantees and robustness, hindering their application in real-world systems. Moreover, traditional training methods (e.g., gradient descent) require an extensive dataset and offline training, further hindering a DNNs practical use. Therefore, this paper presents an innovative Lyapunov-based adaptation law, with a gradient descent-like structure, that is designed to update all layer weights of a DNN in real-time for a DNN-based hybrid exoskeleton control framework. To promote user comfort and safety, a saturation limit was implemented on the DNN-based FES controller and the excess control effort was redirected to the exoskeleton. A Lyapunov-based stability analysis was performed on the DNN-based hybrid exoskeleton control system to prove global asymptotic trajectory tracking. A numerical simulation of the designed controller was performed to validate the results.
|
|
10:09-10:12, Paper TuA02.4 | |
State Space Models As Foundation Models: A Control Theoretic Overview |
|
Amo Alonso, Carmen | Stanford University |
Sieber, Jerome | ETH Zurich |
Zeilinger, Melanie N. | ETH Zurich |
Keywords: Machine learning, Learning, Time-varying systems
Abstract: In recent years, there has been a growing interest in integrating linear state-space models (SSM) in deep neural network architectures of foundation models. This is exemplified by the recent success of Mamba, showing better performance than the state-of-the-art Transformer architectures in language tasks. Foundation models, like e.g. GPT-4, aim to encode sequential data into a latent space in order to learn a compressed representation of the data. The same goal has been pursued by control theorists using SSMs to efficiently model dynamical systems. Therefore, SSMs can be naturally connected to deep sequence modeling, offering the opportunity to create synergies between the corresponding research areas. This paper is intended as a gentle introduction to SSM-based architectures for control theorists and summarizes the latest research developments. It provides a systematic review of the most successful SSM proposals and highlights their main features from a control theoretic perspective. Additionally, we present a comparative analysis of these models, evaluating their performance on a standardized benchmark designed for assessing a model’s efficiency at learning long sequences.
|
|
10:12-10:15, Paper TuA02.5 | |
Real-Time Modular Adjustment of Inner-Layer Weights of a Deep Neural Network-Based Saturated Lower Limb Hybrid Exoskeleton Controller |
|
Ting, Jonathan | Auburn University |
Mishra, Kislaya | Auburn University |
Basyal, Sujata | Auburn University |
Allen, Brendon C. | Auburn University |
Keywords: Machine learning, Adaptive control, Robust adaptive control
Abstract: Abstract--- Recent studies suggest that deep neural networks (DNNs) have the potential to outperform neural networks (NNs) in approximating complex dynamics, which may enhance the tracking performance of a control system. However, unlike NN-based nonlinear control systems, designing update policies for the inner-layer weights of a DNN using Lyapunov-based stability methods is problematic since the inner-layer weights are nested within activation functions. Traditional DNN training methods (e.g., gradient descent) may improve the approximation capability of a DNN and thus could enhance a DNN-based controller’s tracking performance; however, traditional DNN-based control approaches lack stability guarantees and may be ineffective in training the DNN without large data sets, which could hinder the tracking performance. In this work, a DNN-based control structure is developed for a hybrid exoskeleton, which combines a rehabilitative robot with functional electrical stimulation (FES). The proposed control system updates the DNN weights in real-time and a rigorous Lyapunov-based stability analysis is performed to ensure semi-global asymptotic trajectory tracking, even without the presence of a data set. Specifically, a Lyapunov-based update law is developed for the output-layer DNN weights and Lyapunov-based constraints are established for the adaptation laws of the inner-layer DNN weights. Additionally, the DNN-based FES controller was designed to be saturated to increase the comfort and safety of the participant.
|
|
10:15-10:18, Paper TuA02.6 | |
Gaussian Processes with Noisy Regression Inputs for Dynamical Systems |
|
Wolff, Tobias M. | Leibniz University Hannover |
Lopez, Victor G. | Leibniz University Hannover |
Müller, Matthias A. | Leibniz University Hannover |
Keywords: Machine learning, Modeling, Nonlinear systems identification
Abstract: This paper is centered around the approximation of dynamical systems by means of Gaussian processes. To this end, trajectories of such systems must be collected to be used as training data. The measurements of these trajectories are typically noisy, which implies that both the regression inputs and outputs are corrupted by noise. However, most of the literature considers only noise in the regression outputs. In this paper, we show how to account for the noise in the regression inputs in an extended Gaussian process framework to approximate scalar and multidimensional systems. We demonstrate the potential of our framework by comparing it to different state-of-the-art methods in several simulation examples.
|
|
10:18-10:21, Paper TuA02.7 | |
Learning Effective and Generalizable Controller Via Zeroth-Order Gradient Estimation |
|
Li, Chaodong | Tongji University |
Liu, Wenting | Tongji University |
Yi, Peng | Tongji University |
Keywords: Machine learning, Predictive control for nonlinear systems, Neural networks
Abstract: Learning-based offline training methods can effectively reduce the computational demands of real-time optimization-based control. However, existing approaches that rely on imitation or differentiable programming may fail if a well-tuned MPC controller or differentiable plant dynamics are unavailable. To address this, we propose a zeroth-order optimization approach for training neural controllers using input-output prediction sequences or even only bandit feedback. To improve the training efficiency, we introduce a mixed gradient computation scheme that first applies a zeroth-order gradient estimation with the bandit controller performance, and then applies a backpropagation to the neural controller network. Additionally, we propose a training procedure that relies on the closed-loop interaction between the neural controller network and a black-box plant model to generate training data with better distribution, thereby positively impacting training effectiveness. Finally, we evaluate the proposed method through extensive simulation experiments for tracking and stabilization control tasks with high-dimensional, nonlinear, and strongly coupled plants. The controller shows generalizability when implemented in plants with parameter drifts, which makes it suitable for transferring from simulation to real-world applications.
|
|
10:21-10:24, Paper TuA02.8 | |
Temporally-Consistent Bilinearly Recurrent Autoencoders for Control Systems |
|
Chakrabarti, Ananda | The Ohio State University |
Nayak, Indranil | Stanford University |
Goswami, Debdipta | Ohio State University |
Keywords: Neural networks, Machine learning, Nonlinear systems identification
Abstract: This paper introduces the temporally-consistent bilinearly recurrent autoencoder (tcBLRAN), a Koopman operator based neural network architecture for modeling a control-affine nonlinear control system. The proposed method extends traditional Koopman autoencoders (KAE) by incorporating bilinear recurrent dynamics that are consistent across predictions, enabling accurate long-term forecasting for control-affine systems. This overcomes the roadblock that KAEs face when encountered with limited and noisy training datasets, resulting in a lack of generalizability due to inconsistency in training data. Through a blend of deep learning and dynamical systems theory, tcBLRAN demonstrates superior performance in capturing complex behaviors and control systems dynamics, providing a superior data-driven modeling technique for control systems and outperforming the state-of-the-art Koopman bilinear form (KBF) learned by autoencoder networks.
|
|
10:24-10:27, Paper TuA02.9 | |
Machine Learning and Derivative-Free Optimization for Enhanced PID Tuning: A Case Study in Black Liquor Concentration Control |
|
El Koujok, Mohamed | CanmetENERGY-Varennes, Natural Resources Canada |
Zhang, Haitian | Department of Chemical Engineering, University of Waterloo |
Ghezzaz, Hakim | CanmetENERGY, EETS, Natural Resources Canada, Varennes |
Amazouz, Mouloud | CanmetENERGY, EETS, Natural Resources Canada, Varennes |
Elkamel, Ali | Department of Chemical Engineering, University of Waterloo |
|
10:27-10:30, Paper TuA02.10 | |
From Simulation to Reality: Reinforcement Learning for Real-Time Extreme Vehicle Control |
|
Suplin, Vladimir | General Motors |
Yechiel, Oded | General Motors |
Keywords: Reinforcement learning, Automotive control
Abstract: Collision avoidance is a critical component of automotive safety systems and a key feature of autonomous vehicles. This paper focuses on the lateral control aspect of collision avoidance. The complexity of vehicle dynamics, environmental uncertainties, and the need for real-time computation present significant challenges to effective collision avoidance control. State-of-the-art approaches, such as Model Predictive Control (MPC), provide optimal solutions but are difficult to calibrate, suffer from high computational demands, and can be unstable when simplified models are used. This study investigates an alternative approach using reinforcement learning (RL). We demonstrate how an RL agent, trained in a simulated environment, can be successfully deployed and perform aggressive maneuvers in a real vehicle without additional training. The RL agent’s performance is compared to state-of-the-art controllers, showing competitive results with lower computational requirements.
|
|
10:30-10:33, Paper TuA02.11 | |
When to Localize? a Risk-Constrained Reinforcement Learning Approach |
|
Shek, Chak Lam | University of Maryland |
Torshizi, Kasra | University of Maryland |
Williams, Troi | University of Maryland |
Tokekar, Pratap | University of Maryland |
Keywords: Reinforcement learning, Autonomous robots, Estimation
Abstract: In robotic navigation, continuous localization can be inefficient in certain scenarios, such as underwater searches. For example, an underwater agent surfacing to localize too often hinders it from searching for critical items underwater, such as black boxes from crashed aircraft. On the other hand, if the agent never localizes, it may fail to find the items due to inadvertently leaving the search area or entering hazardous, restricted areas. Motivated by such scenarios, we explore approaches to help an agent determine ``when to localize?''. We propose a bi-criteria optimization approach to determine optimal localization timing, which balances localization frequency with failure probability. Our method, RiskRL, employs a Particle Filter and a constrained Reinforcement Learning (RL) framework, which uses a recurrent Soft Actor-Critic (SAC) network. This approach improves our previous POMDP-based solution by reducing computational complexity and eliminating the need for complete transition and observation models. Experimental results demonstrate that RiskRL showed a 26% increase in success rates in unseen environments over our baselines. The implementation is available on GitHub: https://github.com/raaslab/when-to-localize-riskrl
|
|
10:33-10:36, Paper TuA02.12 | |
Deep Reinforcement Learning Approach for Output Feedback Control Purposes with Linear Extended State Observer |
|
Bernat, Jakub | Poznan University of Technology, Poland |
|
10:36-10:39, Paper TuA02.13 | |
Using Large Language Models to Automate and Expedite Reinforcement Learning with Reward Machine |
|
Meshkat Alsadat, Shayan | Arizona State University |
Gaglione, Jean-Raphaël | UTexas |
Neider, Daniel | TU Dortmund University |
Topcu, Ufuk | The University of Texas at Austin |
Xu, Zhe | Arizona State University |
Keywords: Reinforcement learning, Markov processes, Automata
Abstract: We present LARL-RM (Large language model-generated Automaton for Reinforcement Learning with Reward Machine) algorithm to encode high-level knowledge into reinforcement learning using automaton to expedite the reinforce- ment learning. Our method uses large language models (LLM) to obtain high-level domain-specific knowledge using prompt engineering instead of providing the reinforcement learning (RL) algorithm directly with the high-level knowledge that requires an expert to encode the automaton. We use chain- of-thought and few-shot methods for prompt engineering and demonstrate that our method works using these approaches. Additionally, LARL-RM allows for fully closed-loop reinforcement learning without the need for an expert to guide and supervise the learning since LARL-RM can use the LLM directly to generate the required high-level knowledge for the task at hand. Moreover, we demonstrate LARM-RM robustness to LLM hallucination and show the theoretical guarantee of our algorithm to converge to an optimal policy. We show that LARL-RM speeds up the convergence by implementing our method in two case studies and compare it to other RL methods.
|
|
10:39-10:42, Paper TuA02.14 | |
Adaptive Event-Triggered Reinforcement Learning Control for Complex Nonlinear Systems |
|
Umer, Muhammad | The University of Texas at San Antonio |
Sinha, Abhinav | The University of Cincinnati |
Cao, Yongcan | University of Texas, San Antonio |
Keywords: Reinforcement learning, Networked control systems, Autonomous systems
Abstract: In this paper, we propose an adaptive event-triggered reinforcement learning control for continuous-time nonlinear systems, subject to bounded uncertainties, characterized by complex interactions. Specifically, the proposed method is capable of jointly learning both the control policy and the communication policy, thereby reducing the number of parameters and computational overhead when learning them separately or only one of them. By augmenting the state space with accrued rewards that represent the performance over the entire trajectory, we show that accurate and efficient determination of triggering conditions is possible without the need for explicit learning triggering conditions, thereby leading to an adaptive non-stationary policy. Finally, we provide several numerical examples to demonstrate the effectiveness of the proposed approach.
|
|
10:42-10:45, Paper TuA02.15 | |
A Reduced-Order Output Feedback Parameterization for Reinforcement Learning Control with Application to the LQR Problem |
|
Rizvi, Syed Ali Asad | Tennessee Technological University |
Lin, Zongli | University of Virginia |
Keywords: Reinforcement learning, Observers for Linear systems, Optimal control
Abstract: Data-driven reinforcement learning (RL) algorithms primarily rely on the system data that may take the input-state or the input-output form. Input-output form is preferred by controls practitioners as it relaxes the sensing requirements compared to the full-state feedback case. The design of output feedback data-driven learning techniques is, however, a challenging control problem. Compared to the input-state form, the learning complexity is often significantly higher. This is a result of higher-order reinforcement learning equations that require deep historic input-output datasets, which then translates to higher exploration requirements and increased sample complexity. We present here a reduced-order parameterization that is tailored for RL-based control applications towards obtaining reduced-order RL learning equations. While the results are general to RL-based optimal control of LTI systems, we consider the classic Q-learning LQR algorithm as a proof-of-concept. It is shown that the parameterization is exact in N steps, where this N is always smaller than the full-order case. An iterative Q-learning algorithm based on the proposed reduced-order parameterized learning equation is presented, whose convergence to the nominal LQR solution is shown analytically. Finally, numerical simulation results are presented to show the effectiveness of the reduced-order method compared to existing full-order output feedback RL control approaches.
|
|
10:45-10:48, Paper TuA02.16 | |
On the Effect of Instability on Learning Continuous-Time Linear Control Systems |
|
Sadeghihafshejani, Reza | Southern Methodist University |
Shirani Faradonbeh, Mohamad Kazem | Southern Methodist University |
Keywords: Stochastic systems, Identification, Linear systems
Abstract: We study the problem of system identification for stochastic continuous-time dynamics, based on a single finite-length state trajectory. We present a method for estimating the possibly unstable open-loop matrix by employing properly randomized control inputs. Then, we establish theoretical performance guarantees showing that the estimation error decays with trajectory length, a measure of excitability, and the signal-to-noise ratio, while it grows with dimension. Numerical illustrations that showcase the rates of learning the dynamics, will be provided as well. To perform the theoretical analysis, we develop new technical tools that are of independent interest. That includes non-asymptotic stochastic bounds for highly non-stationary martingales and generalized laws of iterated logarithms, among others.
|
|
10:48-10:51, Paper TuA02.17 | |
Transfer Learning for a Class of Cascade Dynamical Systems |
|
Rabiei, Shima | Rensselaer Polytechnic Institute |
Mishra, Sandipan | Rensselaer Polytechnic Institute |
Paternain, Santiago | Rensselaer Polytechnic Institute |
Keywords: Reinforcement learning, Stochastic systems, Optimal control
Abstract: This work considers the problem of transferring a policy in the context of reinforcement learning. Specifically, we consider training a policy in a reduced order system and deploying it in the full state system. The motivation for this training strategy is that simulating full-state systems with complex dynamics may take excessive time. While transfer learning alleviates this issue, the transfer guarantees depend on the discrepancy between the two systems. In this work, we consider a class of cascade dynamical systems, where a subset of the state variables influences the dynamics of the remaining states but not vice-versa. We refer to the former as internal states. The reinforcement learning agent learns a policy using a model that ignores the internal states, treating them instead as commanded inputs. In deploying the policy in the full-state system, classic controllers (e.g., a PID) handle the dynamics of the internal states so that they track the reference signal provided by the reinforcement learning policy. The cascade structure allows us to provide transfer guarantees that depend on the stability of the inner loop controller. Numerical experiments on a quadrotor support the theoretical findings.
|
|
10:51-10:54, Paper TuA02.18 | |
Decision Transformer As a Foundation Model for Partially Observable Continuous Control |
|
Zhang, Xiangyuan | University of Illinois at Urbana-Champaign |
Mao, Weichao | University of Illinois at Urbana-Champaign |
Qiu, Haoran | University of Illinois, Urbana-Champaign |
Basar, Tamer | Univ of Illinois, Urbana-Champaign |
Keywords: Machine learning, Statistical learning, Neural networks
Abstract: Closed-loop control of nonlinear dynamical systems with partial-state observability demands expert knowledge of a diverse, less standardized set of theoretical tools. Moreover, it requires a delicate integration of controller and estimator designs to achieve the desired system behavior. To establish a general controller synthesis framework, we explore the Decision Transformer (DT) architecture. Specifically, we first frame the control task as predicting the current optimal action based on past observations, actions, and rewards, eliminating the need for a separate estimator design. Then, we leverage the pre-trained language models, i.e., the Generative Pre-trained Transformer (GPT) series, to initialize DT and subsequently train it for control tasks using low-rank adaptation (LoRA). Our comprehensive experiments across five distinct control tasks, ranging from maneuvering aerospace systems to controlling partial differential equations (PDEs), demonstrate DT's capability to capture the parameter-agnostic structures intrinsic to control tasks. DT exhibits remarkable zero-shot generalization abilities for completely new tasks and rapidly surpasses expert performance levels with a minimal amount of demonstration data. These findings highlight the potential of DT as a foundational controller for general control applications.
|
|
10:54-10:57, Paper TuA02.19 | |
Decomposing Control Lyapunov Functions for Efficient Reinforcement Learning |
|
Lopez, Antonio | University of Texas at Austin |
Fridovich-Keil, David | The University of Texas at Austin |
Keywords: Autonomous systems, Lyapunov methods, Reinforcement learning
Abstract: Recent methods using Reinforcement Learning (RL) have proven to be successful for training intelligent agents in unknown environments. However, current state-of-the-art RL methods require large amounts of data to learn a specific task, leading to unreasonable costs when deploying the agent to collect data in real-world applications. In this paper, we take a control-theoretic approach to improve sample efficiency in RL. Our approach has two key components. First, we build upon recent work which shows that the inclusion of a Control Lyapunov Function (CLF) in the reward function can enable RL algorithms to learn with substantially lower discount factors, and therefore require less data to train. To do this “reward shaping” requires access to a CLF, however, and computational methods to compute a CLF do not scale well to high-dimensional systems. Therefore, the primary contribution of our work is the development of a new variety of CLF-like functions, which we term Decomposed Control Lyapunov Functions (DCLFs). We show that these functions can be used in the same way as CLFs for RL reward shaping, yet are more readily computable in higher-dimensional cases via a system decomposition technique. Through multiple examples, we demonstrate the effectiveness of this approach, where our method finds a policy to successfully land a quadcopter with less than half the amount of real-world data required by two state-of-the-art RL algorithms.
|
|
10:57-11:00, Paper TuA02.20 | |
End-To-End Reinforcement Learning for Autonomous Racing: Bridging the Sim-To-Real Gap (I) |
|
Budai, Csanad | SZTAKI Institute for Computer Science and Control |
Szeles, Tamas | SZTAKI Institute for Computer Science and Control |
Nemeth, Balazs | SZTAKI Institute for Computer Science and Control |
Gaspar, Peter | SZTAKI |
Keywords: Automotive control, Autonomous systems, Reinforcement learning
Abstract: Deep reinforcement learning is a promising technique that can help create autonomous agents. However, it is still an open problem how one can create a controller with robust operation for real-world automotive systems. The difficulty lies in either sample efficiency for real-world learning or developing a good enough simulator for training. This paper addresses the latter, proposing a method that provides a solution to the sim-to-real gap through domain randomization, learning with disturbances, and observation preprocessing. The method is validated on a small-scale F1TENTH-type test vehicle, that is trained to race autonomously in a fully end-to-end manner. It is demonstrated that the training process results in a policy that can drive the car safely even over the grip limit.
|
|
TuA03 |
Plaza CF |
RI - Barrier Functions in Control |
RI Session |
Chair: Panagou, Dimitra | University of Michigan, Ann Arbor |
Co-Chair: Hoagg, Jesse B. | University of Kentucky |
|
10:00-10:03, Paper TuA03.1 | |
Adaptive Control Barrier Functions with Vanishing Conservativeness under Persistency of Excitation |
|
Gutierrez, Ricardo | University of Kentucky |
Hoagg, Jesse B. | University of Kentucky |
Keywords: Robotics, Constrained control, Adaptive control
Abstract: This article presents a closed-form adaptive control- barrier-function (CBF) approach for satisfying state constraints in systems with parametric uncertainty. This approach uses a sampled-data recursive-least-squares algorithm to estimate the unknown model parameters and construct a nonincreasing upper bound on the norm of the estimation error. Together, this estimate and upper bound are used to construct a CBF-based constraint that has nonincreasing conservativeness. Furthermore, if a persistency of excitation condition is satisfied, then the CBF-based constraint has vanishing conservativeness in the sense that the CBF-based constraint converges to the ideal constraint corresponding to the case where the uncertainty is known. In addition, the approach incorporates a monotonically improving estimate of the unknown model parameters—thus, this estimate can be effectively incorporated into a desired control law. We demonstrate constraint satisfaction and performance using a nonholonomic robot.
|
|
10:03-10:06, Paper TuA03.2 | |
A Control Barrier Function Candidate for Quadrotors with Limited Field of View |
|
Trimarchi, Biagio | Universitŕ Di Bologna |
Schiano, Fabrizio | Leonardo S.p.a |
Tron, Roberto | Boston University |
Keywords: Vision-based control, Visual servo control, Robotics
Abstract: The problem of control based on vision measurements (bearings) has been amply studied in the literature; however, the problem of addressing the limits of the field of view of physical sensors has received relatively less attention (especially for agents with non-trivial dynamics). The technical challenge is that, as in most vision-based control approaches, a standard approach to the problem requires knowing the distance between cameras and observed features in the scene, which is not directly available. Instead, we present a solution based on a Control Barrier Function (CBF) approach that uses a splitting of the original differential constraint to effectively remove the dependence on the unknown measurement error. Compared to the current literature, our approach gives strong robustness guarantees against bounded distance estimation errors. We showcase the proposed solution with the numerical simulations of a double integrator and a quadrotor tracking a trajectory while keeping the corners of a rectangular gate in the camera field of view.
|
|
10:06-10:09, Paper TuA03.3 | |
Graceful Vehicle Collision Avoidance Using a Second-Order Nonlinear Barrier Constraint |
|
Moon, Yejin | University of Maryland |
Orosz, Gabor | University of Michigan |
Fathy, Hosam K. | University of Maryland |
Keywords: Automotive control, Control applications, Optimal control
Abstract: This paper examines the problem of preventing frontal collisions between road vehicles. The paper focuses on the concept of achieving graceful safety control in the context of vehicle collision avoidance, in the sense of ensuring safety when possible, and degrading gracefully otherwise. This is achieved through a novel nonlinear barrier constraint which provides a multi-layered safety guarantee: it ensures safe spacing when possible, and avoids collision even when the safe spacing constraint is breached. The proposed graceful control approach is illustrated using a first-order barrier constraint. Then a second-order version of the constraint is presented that enables tracking a desired jerk signal while assuring graceful safety.
|
|
10:09-10:12, Paper TuA03.4 | |
Safety for Time-Varying Parameterized Sets Using Control Barrier Function Methods |
|
Usevitch, James | Brigham Young University |
Sahleen, Jackson David | Brigham Young University |
Keywords: Autonomous systems, Optimization
Abstract: A fundamental and classical problem in mobile autonomous systems is maintaining the safety of autonomous agents during deployment. Prior literature has presented techniques using control barrier functions (CBFs) to achieve this goal. These prior techniques utilize CBFs to keep an isolated point in state space away from the unsafe set. However, various situations require a non-singleton set of states to be kept away from an unsafe set. Prior literature has addressed this problem using nonsmooth CBF methods, but no prior work has solved this problem using only "smooth" CBF methods. This paper addresses this gap by presenting a novel method of applying CBF methods to non-singleton parameterized convex sets. The method ensures differentiability of the squared distance function between ego and obstacle sets by leveraging a form of the log-sum-exp function to form strictly convex, arbitrarily tight overapproximations of these sets. Safety-preserving control inputs can be computed via convex optimization formulations. The efficacy of our results is demonstrated through multi-agent simulations.
|
|
10:12-10:15, Paper TuA03.5 | |
Rate-Tunable Control Barrier Functions: Methods and Algorithms for Online Adaptation |
|
Parwana, Hardik | University of Michigan |
Panagou, Dimitra | University of Michigan, Ann Arbor |
Keywords: Constrained control, Autonomous robots, Autonomous systems
Abstract: This paper introduces the notion of a Rate-Tunable Control Barrier Function (RT-CBF), which allows for online tuning of the response of CBF-based controllers by adapting the parameters of the class-K function that is involved in the CBF condition. In contrast to most existing approaches that use a fixed class-K function to ensure safety, we propose an online adaptation law for the parameters of class-K function of the CBF condition. The algorithm can also incorporate multiple higher-order CBFs and adapt their class-K parameters for feasibility, albeit without guarantees in theory. The simulation results verify that online adaptation helps improve the system’s response in terms of the resulting trajectories being closer to a nominal reference while still being safe.
|
|
10:15-10:18, Paper TuA03.6 | |
Zero-Order Control Barrier Functions for Sampled-Data Systems with State and Input Dependent Safety Constraints |
|
Tan, Xiao | California Institute of Technology |
Das, Ersin | Caltech |
Ames, Aaron D. | California Institute of Technology |
Burdick, Joel W. | California Inst. of Tech |
Keywords: Constrained control, Autonomous robots, Lyapunov methods
Abstract: We propose a novel zero-order control barrier function (ZOCBF) for sampled-data systems to ensure system safety. Our formulation generalizes conventional control barrier functions and straightforwardly handles safety constraints with high-relative degrees or those that explicitly depend on both system states and inputs. The proposed ZOCBF condition does not require any differentiation operation. Instead, it involves computing the difference of the ZOCBF values at two consecutive sampling instants. We propose three numerical approaches to enforce the ZOCBF condition, tailored to different problem settings and available computational resources. We demonstrate the effectiveness of our approach through a collision avoidance example and a rollover prevention example on uneven terrains.
|
|
10:18-10:21, Paper TuA03.7 | |
Information Control Barrier Functions: Preventing Localization Failures in Mobile Systems through Control |
|
Gessow, Samuel | University of California, Los Angeles |
Thorne, David | University of California, Los Angeles |
Lopez, Brett | University of California - Los Angeles |
Keywords: Constrained control, Autonomous systems, Estimation
Abstract: This paper develops a new framework for preventing localization failures in mobile systems that estimate their state using measurements. Safety is guaranteed by imposing that the nonlinear least squares optimization, solved in modern localization algorithms, remains well-conditioned. Specifically, the eigenvalues of the Hessian matrix are made to be positive via two methods that leverage control barrier functions to achieve safe set invariance. The proposed method is not constrained to any specific measurement or system type, offering a general solution to the safe mobility with localization problem. The efficacy of the approach is demonstrated on a system provided range-only and heading-only measurements for localization.
|
|
10:21-10:24, Paper TuA03.8 | |
Disturbance-Robust Backup Control Barrier Functions: Safety under Uncertain Dynamics |
|
van Wijk, David | Texas A&M University |
Coogan, Samuel | Georgia Institute of Technology |
Molnar, Tamas G. | Wichita State University |
Majji, Manoranjan | Texas A&M University |
Hobbs, Kerianne | Air Force Research Laboratory |
Keywords: Constrained control, Optimization algorithms, Lyapunov methods
Abstract: Obtaining a controlled invariant set is crucial for safety-critical control with control barrier functions (CBFs) but is non-trivial for complex nonlinear systems and constraints. Backup control barrier functions allow such sets to be constructed online in a computationally tractable manner by examining the evolution (or flow) of the system under a known backup control law. However, for systems with unmodeled disturbances, this flow cannot be directly computed, making the current methods inadequate for assuring safety in these scenarios. To address this gap, we leverage bounds on the nominal and disturbed flow to compute a forward invariant set online by ensuring safety of an expanding norm ball tube centered around the nominal system evolution. We prove that this set results in robust control constraints which guarantee safety of the disturbed system via our Disturbance-Robust Backup Control Barrier Function (DR-bCBF) solution. Additionally, the efficacy of the proposed framework is demonstrated in simulation, applied to a double integrator problem and a rigid body spacecraft rotation problem with rate constraints.
|
|
10:24-10:27, Paper TuA03.9 | |
Safety Embedded Adaptive Control Using Barrier States |
|
AL-Sunni, Maitham | Carnegie Mellon University |
Almubarak, Hassan | Georgia Institute of Technology |
Dolan, John | Carnegie Mellon University |
Keywords: Constrained control, Stability of nonlinear systems, Adaptive control
Abstract: In this work, we explore the application of barrier states (BaS) in the realm of safe nonlinear adaptive control. Our proposed framework derives barrier states for systems with parametric uncertainty, which are augmented into the uncertain dynamical model. We employ an adaptive nonlinear control strategy based on a control Lyapunov functions approach to design a stabilizing controller for the augmented system. The developed theory shows that the controller ensures safe control actions for the original system while meeting specified performance objectives. We validate the effectiveness of our approach through simulations on diverse systems, including a planar quadrotor subject to unknown drag forces and an adaptive cruise control system, for which we provide comparisons with existing methodologies.
|
|
10:27-10:30, Paper TuA03.10 | |
Feasibility of Multiple Robust Control Barrier Functions for Bounding Box Constraints |
|
Spiller, Mark | German Aerospace Center (DLR) |
Isbono, Emilia Astagina | Deutsches Zentrum Für Luft Und Raumfahrt |
Schitz, Philipp | German Aerospace Center (DLR) |
Keywords: Constrained control
Abstract: Enforcing multiple constraints based on the concept of control barrier functions (CBFs) is a remaining challenge because each of the CBFs requires a condition on the control inputs to be satisfied which may easily lead to infeasibility problems. The problem becomes even more challenging with input constraints and disturbances. In this paper, we consider enforcement of bounding box constraints for a second order system under limited control authority and input disturbances. To solve the constrained control problem, we apply multiple robust control barrier functions (RCBFs) which, in general, do not provide a feasible solution to the problem. However, we derive conditions on how to select the RCBF parameters to guarantee that a feasible solution always exists.
|
|
10:30-10:33, Paper TuA03.11 | |
LiDAR-Based Model Predictive Control Using Control Barrier Functions |
|
Tooranjipour, Pouria | Michigan State Univeristy |
Kiumarsi, Bahare | Michigan State University |
Keywords: Constrained control, Predictive control for nonlinear systems, Robotics
Abstract: This paper presents a model predictive control (MPC) with recursive feasibility guarantees for robots with LiDAR sensory measurements. Control barrier functions (CBF) are incorporated within the MPC framework to shorten the prediction horizon of MPC compared to the standard MPC, effectively reducing computational complexity while ensuring the avoidance of unsafe sets. A CBF is synthesized from 2D LiDAR data points by first clustering obstacles using the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm and then fitting an ellipse to each cluster using the OpenCV library’s fitting tool. The resulting CBFs from each obstacle are subsequently unified and integrated into the MPC framework. The recursive feasibility of the proposed MPC is analyzed and guaranteed by choosing an appropriate terminal set. The effectiveness of the approach is demonstrated through simulations in the Gazebo robotic simulator using ROS 2, followed by experimental validation with a unicycle-type robot equipped with a LiDAR sensor.
|
|
10:33-10:36, Paper TuA03.12 | |
Mean-Field Control Barrier Functions: A Framework for Real-Time Swarm Control |
|
Wu Fung, Samy | Colorado School of Mines |
Nurbekyan, Levon | Emory |
Keywords: Distributed control, Mean field games, Constrained control
Abstract: Control Barrier Functions (CBFs) are an effective methodology to ensure safety and performative efficacy in real-time control applications such as power systems, resource allocation, autonomous vehicles, robotics, etc. This approach ensures safety independently of the high-level tasks that may have been pre-planned off-line. For example, CBFs can be used to guarantee that a vehicle will remain in its lane. However, when the number of agents is large, computation of CBFs can suffer from the curse of dimensionality in the multi-agent setting. In this work, we present Mean-field Control Barrier Functions (MF-CBFs), which extends the CBF framework to the mean-field (or swarm control) setting. The core idea is to model a population of agents as probability measures in the state space and build corresponding control barrier functions. Similar to traditional CBFs, we derive safety constraints on the (distributed) controls but now relying on the differential calculus in the space of probability measures.
|
|
10:36-10:39, Paper TuA03.13 | |
Safety Verification of Discrete-Time Systems Via Interpolation-Inspired Barrier Certificates |
|
Oumer, Mohammed Adib | University of Colorado Boulder |
Murali, Vishnu | University of Colorado Boulder |
Trivedi, Ashutosh | University of Colorado Boulder |
Zamani, Majid | University of Colorado Boulder |
Keywords: Hybrid systems, Optimization
Abstract: Barrier certificates provide an effective automated approach to verifying the safety of dynamical systems. A barrier certificate is a real-valued function over states of the system whose zero level set separates the unsafe region from all possible trajectories starting from a given set of initial states. Typically, the system dynamics must be nonincreasing in the value of the barrier certificate with each transition. Thus, the states of the system that are nonpositive with respect to the barrier certificate act as an over-approximation of the reachable states. The search for such certificates is typically automated by first fixing a template of functions and then using optimization and satisfiability modulo theory (SMT) solvers to find them. Unfortunately, it may not be possible to find a single function in this fixed template. To tackle this challenge, we propose the notion of interpolation-inspired barrier certificate. Instead of a single function, an interpolation-inspired barrier certificate consists of a set of functions such that the union of their sublevel sets over-approximate the reachable set of states. We show how one may find such interpolation-inspired barrier certificates of a fixed template, even when we fail to find standard barrier certificates of the same template. We present sum-of-squares (SOS) programming as a computational method to find this set of functions and demonstrate effectiveness of this method over a case study.
|
|
10:39-10:42, Paper TuA03.14 | |
Robust and Exponential Stability in Barrier-Certified Systems Via Contracting Piecewise Smooth Dynamics |
|
Marvi, Zahra | University of Minnesota |
Bullo, Francesco | Univ of California at Santa Barbara |
Alleyne, Andrew G. | University of Minnesota |
Keywords: Lyapunov methods, Constrained control, Control applications
Abstract: In this letter, we address the critical trade-off between safety and performance in control systems by establishing the contractivity of a class of nonlinear systems driven by control barrier function (CBF)-based online feedback optimization. First, we derive a closed-form solution for the control system driven by a CBF-based controller with vector-valued safety constraints. Next, we introduce sufficient design conditions based on the properties of a baseline controller and CBF parameters to ensure both safety and contractivity of the closed-loop system. Under these conditions, we demonstrate the existence of an exponentially stable equilibrium within the safe set and provide an explicit term for the rate of convergence. Building upon these results, we propose a feedback motion planning algorithm that guarantees a global region of attraction within non-convex search areas through a tree of contractive controllers. The contractive nature of our approach ensures robustness against perturbations, making it suitable for dynamic and uncertain environments.
|
|
10:42-10:45, Paper TuA03.15 | |
Co-Büchi Control Barrier Certificates for Stochastic Control Systems |
|
Ajeleye, Daniel | University of Colorado Boulder |
Zamani, Majid | University of Colorado Boulder |
Keywords: Stochastic systems, Hybrid systems, Automata
Abstract: This paper addresses the problem of synthesizing controllers that enforce properties expressed by Universal Co-Büchi Automata (UCA) over stochastic control systems. Our approach introduces a notion of Stochastic Co-Büchi Control Barrier Certificates (SCBC), which, together with their associated controllers, ensure that specific regions in the state set are visited only a limited number of times during the system’s evolution. The SCBC is formulated over a hybrid domain that combines the system’s state, the UCA’s state, and a counter variable that tracks the number of visits to the UCA’s accepting states. We require the SCBC to satisfy a supermartingale condition, thereby, enforcing the property expressed by the UCA on the stochastic control system without any restriction over the time horizon. Additionally, we propose a method for constructing SCBCs and corresponding controllers that guarantee the enforcement of UCA properties over stochastic control systems with formal probabilistic guarantee. The practical applicability of our approach is demonstrated through a case study involving a stochastic three-tank system, whose dynamics is both nonlinear and influenced by noise.
|
|
10:45-10:48, Paper TuA03.16 | |
Safety-Critical Planning and Control for Dynamic Obstacle Avoidance Using Control Barrier Functions |
|
Liu, Shuo | Boston University |
Mao, Yihui | Boston University |
Belta, Calin | University of Maryland |
Keywords: Optimal control, Lyapunov methods, Predictive control for nonlinear systems
Abstract: Dynamic obstacle avoidance is a challenging topic for optimal control and optimization-based trajectory planning problems. Many existing works use Control Barrier Functions (CBFs) to enforce safety constraints for control systems. CBFs are typically formulated based on the distance to obstacles, or integrated with path planning algorithms as a safety enhancement tool. However, these approaches usually require knowledge of the obstacle boundary equations or have very slow computational efficiency. In this paper, we propose a framework based on model predictive control (MPC) with discrete-time high-order CBFs (DHOCBFs) to generate a collision-free trajectory. The DHOCBFs are first obtained from convex polytopes generated through grid mapping, without the need to know the boundary equations of obstacles. Additionally, a path planning algorithm is incorporated into this framework to ensure the global optimality of the generated trajectory. We demonstrate through numerical examples that our framework allows a unicycle robot to safely and efficiently navigate tight, dynamically changing environments with both convex and nonconvex obstacles. By comparing our method to established CBF-based benchmarks, we demonstrate superior computing efficiency, length optimality, and feasibility in trajectory generation and obstacle avoidance.
|
|
10:48-10:51, Paper TuA03.17 | |
Robust Control Barrier Function Design for High Relative Degree Systems: Application to Unknown Moving Obstacle Collision Avoidance |
|
Kim, Kwang Hak | University of California San Diego |
Diagne, Mamadou | University of California San Diego |
Krstic, Miroslav | University of California, San Diego |
Keywords: Robust control, Uncertain systems, Autonomous systems
Abstract: In safety-critical control, managing safety constraints with high relative degrees and uncertain obstacle dynamics pose significant challenges in guaranteeing safety performance. Robust Control Barrier Functions (RCBFs) offer a potential solution, but the non-smoothness of the standard RCBF definition can pose a challenge when dealing with multiple derivatives in high relative degree problems. As a result, the definition was extended to the marginally more conservative smooth Robust Control Barrier Functions (sRCBF). Then, by extending the sRCBF framework to the CBF backstepping method, this paper offers a novel approach to these problems. Treating obstacle dynamics as disturbances, our approach reduces the requirement for precise state estimations of the obstacle to an upper bound on the disturbance, which simplifies implementation and enhances the robustness and applicability of CBFs in dynamic and uncertain environments. Then, we validate our technique through an example problem in which an agent, modeled using a kinematic unicycle model, aims to avoid an unknown moving obstacle. The demonstration shows that the standard CBF backstepping method is not sufficient in the presence of a moving obstacle, especially with unknown dynamics. In contrast, the proposed method successfully prevents the agent from colliding with the obstacle, proving its effectiveness.
|
|
10:51-10:54, Paper TuA03.18 | |
Safe Reinforcement Learning for Mixed-Autonomy Platoons: A Cooperative Control Barrier Function Approach |
|
Zhou, Jingyuan | National University of Singapore |
Yan, Longhao | National University of Singapore |
Liang, Jinhao | National University of Singapore |
Yang, Kaidi | National University of Singapore |
Keywords: Traffic control, Cooperative control, Reinforcement learning
Abstract: The control of mixed-autonomy platoons comprising both connected and automated vehicles (CAVs) and human-driven vehicles (HDVs) has attracted increasing research attention. Multi-agent reinforcement learning (MARL) appears to be a promising control strategy for its capability of managing complex scenarios in real time. However, current research on MARL-based mixed-autonomy platoon control suffers from the following limitations. First, existing MARL approaches lack theoretical safety guarantees, as they typically address safety by adding penalty terms for violations in the reward function, which does not ensure safety due to the black-box nature of RL. Second, few studies have explored the cooperative safety of multi-CAV platoons, where CAVs can be coordinated to further enhance the system-level safety involving the safety of both CAVs and HDVs. To address these limitations, we (i) design cooperative control barrier function (CBF) candidates to enhance system-level safety and (ii) integrate the safety constraints into a Multi-Agent Reinforcement Learning (MARL) framework through a differentiable quadratic programming layer. Simulation results show that our proposed control strategy can effectively enhance the system-level safety of a mixed-autonomy platoon through the cooperation of multiple CAVs.
|
|
10:54-10:57, Paper TuA03.19 | |
Rectified Control Barrier Functions for High-Order Safety Constraints |
|
Ong, Pio | California Institute of Technology |
Cohen, Max | California Institute of Technology |
Molnar, Tamas G. | Wichita State University |
Ames, Aaron D. | California Institute of Technology |
Keywords: Constrained control, Lyapunov methods
Abstract: This paper presents a novel approach for synthesizing control barrier functions (CBFs) from high relative degree safety constraints: Rectified CBFs (ReCBFs). We begin by discussing the limitations of existing High-Order CBF approaches and how these can be overcome by incorporating an activation function into the CBF construction. We then provide a comparative analysis of our approach with related methods, such as CBF backstepping. Our results are presented first for safety constraints with relative degree two, then for mixed-input relative degree constraints, and finally for higher relative degrees. The theoretical developments are illustrated through simple running examples and an aircraft control problem.
|
|
10:57-11:00, Paper TuA03.20 | |
Sensor-Based Safety-Critical Control Using an Incremental Control Barrier Function Formulation Via Reduced-Order Approximate Models |
|
Autenrieb, Johannes | German Aerospace Center (DLR) |
Shin, Hyo-Sang | KAIST |
|
TuA04 |
Governor's Sq. 15 |
RI - Autonomous Robotics |
RI Session |
Chair: Mueller, Mark W. | University of California, Berkeley |
Co-Chair: Inalhan, Gokhan | Cranfield University |
|
10:00-10:03, Paper TuA04.1 | |
Min-Time Escape of a Dubins Car from a Polygon |
|
Weintraub, Isaac | Air Force Research Laboratory |
Von Moll, Alexander | Air Force Research Laboratory |
Casbeer, David W. | Air Force Research Laboratory |
Manyam, Satyanarayana Gupta | DCS Corp., Air Force Research Labs |
Pachter, Meir | AFIT/ENG |
Taylor, Colin | Parallax Advanced Research |
Chapman, Thomas | Air Force Research Laboratory |
Keywords: Nonholonomic systems, Optimal control, Robotics
Abstract: A turn constrained vehicle is initially located inside a region described as a convex polygon and desires to escape in minimum time. First, the method of characteristics is used to describe the time-optimal strategies for reaching a line. Next, the approach is extended to polygons constructed of a series of line segments. Using this construction technique, the min-time path to reach each edge is obtained; the resulting minimum of the set of optimal trajectories is then selected for escaping the polygon.
|
|
10:03-10:06, Paper TuA04.2 | |
Robust NMPC for Uncalibrated IBVS Control of AUVs |
|
Gu, Hang | Carleton University |
Shen, Chao | Carleton University |
Keywords: Predictive control for nonlinear systems, Robotics, Robust control
Abstract: Image-based visual servoing (IBVS) applications for autonomous underwater vehicles (AUVs) face significant challenges, including frequent recalibration and lack of constraint handling ability. This paper introduces a novel nonlinear model predictive control (NMPC) approach that integrates the Broyden method for uncalibrated IBVS and incorporates the min-max strategy to tolerate the errors in Jacobian matrix estimation. Our proposed min-max NMPC-IBVS framework estimates the Jacobian matrix online, allowing for continuous adaptation to the underwater environment without the need for prior calibration. This approach significantly enhances computational efficiency and robust control performance, enabling real-time uncalibrated applications. A rigorous proof of recursive feasibility is provided in this work, ensuring that our NMPC-IBVS method consistently finds feasible optimal solutions that satisfy all constraints over time. Simulation results show that the proposed method is able to respect all design constraints in the AUV IBVS control and achieve robust stability with boosted computational efficiency.
|
|
10:06-10:09, Paper TuA04.3 | |
Bayesian Inferential Motion Planning Using Heavy-Tailed Distributions |
|
Vaziri, Ali | University of Kansas |
Askari, Iman | University of Kansas |
Fang, Huazhen | University of Kansas |
Keywords: Robotics, Estimation, Predictive control for nonlinear systems
Abstract: Robots rely on motion planning to navigate safely and efficiently while performing various tasks. In this paper, we investigate motion planning through Bayesian inference, where motion plans are inferred based on planning objectives and constraints. However, existing Bayesian motion planning methods often struggle to explore low-probability regions of the planning space, where high-quality plans may reside. To address this limitation, we propose the use of heavy-tailed distributions---specifically, Student's-t distributions---to enhance probabilistic inferential search for motion plans. We develop a novel sequential single-pass smoothing approach that integrates Student's-t distribution with Monte Carlo sampling. A special case of this approach is ensemble Kalman smoothing, which depends on short-tailed Gaussian distributions. We validate the proposed approach through simulations in autonomous vehicle motion planning, demonstrating its superior performance in planning, sampling efficiency, and constraint satisfaction compared to ensemble Kalman smoothing. While focused on motion planning, this work points to the broader potential of heavy-tailed distributions in enhancing probabilistic decision-making in robotics.
|
|
10:09-10:12, Paper TuA04.4 | |
Robust CBF-Based STL Motion Planning for Socially Responsible Robot Navigation in the Presence of Measurement Noise |
|
Ruo, Andrea | University of Modena and Reggio Emilia, Italy |
Sabattini, Lorenzo | University of Modena and Reggio Emilia |
Villani, Valeria | Universitŕ Degli Studi Di Modena E Reggio Emilia |
Keywords: Robotics, Uncertain systems, Kalman filtering
Abstract: In recent years, an increasing number of service robots have been deployed in human environments. The growing complexity of modern robotic systems and the environments in which they operate necessitates careful consideration of safety, increasing the challenges associated with socially responsible navigation. Moreover, localization measurements are often affected by random noise, which can lead to unsafe behavior if not addressed in the control design. Therefore, it is crucial to ensure robustness against measurement noise. This paper addresses navigation challenges by presenting a robust CBF-based STL motion planning algorithm, integrated with an unscented Kalman filter. This methodology mitigates the effects of state disturbances and measurement noise, ensuring task completion at any time within a specified time interval for dynamic systems subject to nonlinear velocity constraints and collision avoidance. A simulation study is conducted to validate the methodology, demonstrating its ability to ensure safety.
|
|
10:12-10:15, Paper TuA04.5 | |
On the Design of Safety-Critical Nonlinear Tracking Controllers for Attitude Control UAV |
|
Omidi, Saber | University of New Hampshire |
Batmani, Yazdan | University of Kurdistan |
Mu, Bingxian | University of New Hampshire |
Thein, May-Win | University of New Hampshire |
Keywords: Mechanical systems/robotics, Optimal control, Robotics
Abstract: In this paper, a “risk set” is introduced within the safe set of a safety-critical nonlinear tracking controller to en- hance performance while avoiding overly conservative behavior. Utilizing a barrier function approach within a quadratic cost framework, this set is incorporated into the State-Dependent Riccati Equation (SDRE) for the inner control loop of Uncrewed Aerial Vehicles (UAVs), ensuring safe flight control of quadro- tors. Additionally, a sliding mode controller is designed for the outer loop to generate the desired trajectory for the inner loop. The risk set further enables systematic switching of weighting adjustments in the nonlinear tracking SDRE controller to balance system performance and safety requirements. This approach is compared to that for scenarios without switching weighting adjustments, and the results demonstrate that the proposed controller satisfies safety constraints while delivering improved performance. Index Terms— safety critical tracking controller, SDRE, UAVs, time-varying desired trajectory, bar- rier functions
|
|
10:15-10:18, Paper TuA04.6 | |
Robust Perception-Based Navigation Using PAC-NMPC with a Learned Value Function |
|
Polevoy, Adam | Johns Hopkins University Applied Physics Laboratory |
Gonzales, Mark | Johns Hopkins University |
Kobilarov, Marin | Johns Hopkins University |
Moore, Joseph | Johns Hopkins University Applied Physics Lab |
Keywords: Robotics, Reinforcement learning, Optimal control
Abstract: Nonlinear model predictive control (NMPC) is typically restricted to short, finite horizons to limit the computational burden of online optimization. As a result, global planning frameworks are frequently necessary to avoid local minima when using NMPC for navigation in complex environments. By contrast, reinforcement learning (RL) can generate policies that minimize the expected cost over an infinite-horizon and can often avoid local minima, even when operating only on current sensor measurements. However, these learned policies are usually unable to provide performance guarantees (e.g., on collision avoidance), especially when outside of the training distribution. In this paper, we augment Probably Approximately Correct NMPC (PAC-NMPC), a sampling-based stochastic NMPC algorithm capable of providing statistical guarantees of performance and safety, with an approximate perception-based value function trained via RL. We demonstrate in simulation that our algorithm can improve the long-term behavior of PAC-NMPC while outperforming other approaches with regards to safety for both planar car dynamics and more complex, high-dimensional fixed-wing aerial vehicle dynamics. We also demonstrate that, even when our value function is trained in simulation, our algorithm can successfully achieve statistically safe navigation on hardware using a 1/10th scale rally car in cluttered real-world environments using only current sensor information.
|
|
10:18-10:21, Paper TuA04.7 | |
SwarmCVT: Centroidal Voronoi Tessellation-Based Path Planning for Very-Large-Scale Robotics |
|
Gao, Xu | Marshall University |
Lee, Jacob | Marshall University |
Zhou, Yuting | Marshall University |
Hu, Yunze | Peking University |
Liu, Chang | Peking University |
Zhu, Pingping | Marshall University |
Keywords: Distributed control, Large-scale systems, Optimal control
Abstract: Robotic swarms, also known as very large-scale robotic (VLSR) systems, have numerous applications in complex tasks. However, as the number of robots increases, the complexity of motion control and energy costs escalate rapidly. In addressing this problem, our previous studies have formulated various methods employing macroscopic and microscopic approaches. These methods enable microscopic robots to adhere to a reference Gaussian mixture model (GMM) distribution observed at the macroscopic scale. As a result, optimizing the macroscopic level will result in an optimal overall result. However, all these methods require systematic and global generation of Gaussian components (GCs) within obstacle-free areas to construct the GMM trajectories. This work utilizes centroidal Voronoi tessellation to generate GCs methodically. Consequently, it demonstrates performance improvement while also ensuring consistency and reliability.
|
|
10:21-10:24, Paper TuA04.8 | |
Learning-Based Trajectory Tracking for Bird-Inspired Flapping-Wing Robots |
|
Cai, Jiaze | University of California, Berkeley |
Sangli, Vishnu | University of California, Berkeley |
Kim, Mintae | University of California, Berkeley |
Sreenath, Koushil | University of California, Berkeley |
Keywords: Flight control, Reinforcement learning, Robotics
Abstract: Bird-sized flapping-wing robots offer significant potential for agile flight in complex environments, but achieving agile and robust trajectory tracking remains a challenge due to the complex aerodynamics and highly non-linear dynamics inherent in flapping-wing flight. In this work, a learning-based control approach is introduced to unlock the versatility and adaptiveness of flapping-wing flight. We propose a model-free reinforcement learning (RL)-based framework for a high degree-of-freedom (DoF) bird-inspired flapping-wing robot that allows for multimodal flight and agile trajectory tracking. Stability analysis was performed on the closed-loop system comprising of the flapping-wing system and the RL policy. Additionally, simulation results demonstrate that the RL-based controller can successfully learn complex wing trajectory patterns, achieve stable flight, switch between flight modes spontaneously, and track different trajectories under various aerodynamic conditions.
|
|
10:24-10:27, Paper TuA04.9 | |
Reinforcement Learning-Based Hover Control of a Quadrotor with Model Reference Adaptation |
|
Kannan, Harinee | Arizona State University |
Patnaik, Karishma | Arizona State University |
Zhang, Wenlong | Arizona State University |
Keywords: Emerging control applications, Reinforcement learning, Robotics
Abstract: Recent advancements in reinforcement learning have enabled the development of model-free controllers for a wide range of applications, including quadrotor aerial vehicles. However, a significant limitation of learning-based controllers is their inability to account for variations in system parameters, leading to sub-optimal performance when deployed in realworld. Typically, these variations stem from the inaccurate synthetic training environment. To address this limitation, this work develops an integrated control architecture that combines a reinforcement learning agent with a model reference adaptive controller (MR2C) for linear systems. This hybrid approach allows the controller to adapt to changes in system dynamics in real time. The proposed framework is validated through both simulations and real flight experiments using a Parrot Mambo quadrotor aerial vehicle for a hovering task. In these experiments, model uncertainties is introduced by varying the quadrotor’s mass and flying near the ground to incorporate unmodeled ground effects. Results demonstrate a significant improvement in tracking performance when handling parametric variations along-with faster rise-times with the MR2C controller compared to the conventional controllers and standalone learning-based approaches.
|
|
10:27-10:30, Paper TuA04.10 | |
Autonomous Wildland Fire Monitoring through Integrated UAS Path Planning and Sensor Fusion |
|
Ford, Bryce | The Ohio State University |
Kumar, Mrinal | Ohio State University |
Sel, Artun | Ohio State University |
Kassas, Zaher | The Ohio State University |
Yu, Xi | West Virginia University |
Keywords: Robotics, Sensor fusion, Autonomous robots
Abstract: Real time wildfire prediction and estimation is paramount in the practice of wildland fire management. In this paper we propose a method of autonomous wildland fire monitoring via integrated path planning and sensor fusion. Accurate localized measurements made by a Unmanned Aerial System (UAS) equipped with a radiometric infrared camera are fused with a low fidelity Reaction Diffusion fire model using an Ensemble Kalman Filter. We develop a reward function defined by the variance of the EnKF. We pose a fixed time horizon reward maximization path planning problem to determine what sequence of measurements the UAS is to take, and solve it using a dynamic programming algorithm. We demonstrate the closed loop performance of the path planning and sensor fusion framework using real infrared video of a prescribed prairie burn to simulate a wildland fire.
|
|
10:30-10:33, Paper TuA04.11 | |
Human Physical Interaction Based on UAV Cooperative Payload Transportation System Using Adaptive Backstepping and FNTSMC |
|
Naser, Hussein N. | Carleton University, University of Thi-Qar |
Hashim, Hashim A | Carleton University |
Ahmadi, Mojtaba | Carleton University |
Keywords: Robotics, Autonomous robots, Control system architecture
Abstract: This paper presents a nonlinear control strategy for an aerial cooperative payload transportation system consisting of two quadrotor UAVs rigidly connected to a payload. The system includes human physical interaction facilitated by an admittance control. The proposed control framework integrates an adaptive Backstepping controller for the position subsystem and a Fast Nonsingular Terminal Sliding Mode Control (FNTSMC) for the attitude subsystem to ensure asymptotic stabilization. The admittance controller interprets the interaction forces from the human operator, generating reference trajectories for the position controller to ensure accurate tracking of the operator’s guidance. The system aims to assist humans in payload transportation, providing both stability and responsiveness. The robustness and effectiveness of the proposed control scheme in maintaining system stability and performance under various conditions are presented.
|
|
10:33-10:36, Paper TuA04.12 | |
Kalman Filter-Based Drift Detection and Mitigation of Visual-Inertial Odometry in UAVs |
|
Ibrahimov, Roman | UC Berkeley |
Yang, Teaya | UC Berkeley |
Mueller, Mark W. | University of California, Berkeley |
Keywords: Robotics, Fault detection, Mechanical systems/robotics
Abstract: We present a conceptual framework for an autonomous safety mechanism designed to enhance the reliability of Unmanned Aerial Vehicles (UAVs) that use Visual-Inertial Odometry (VIO) for state estimation. As UAVs increasingly interact with the public, such safety mechanisms are crucial to reducing the likelihood and severity of accidents. VIO drift, which occurs when accumulated estimation errors cause discrepancies between the UAV’s perceived and actual position, poses a significant risk to safe operation. To address this challenge, we propose a Kalman filter-based approach for detecting VIO drift events. Upon detection, the envisioned safety mechanism is designed to adjust state estimation by integrating onboard gyroscope measurements and thrust commands for short durations, aiming to enhance stability and prevent potential crashes before initiating a controlled landing. While this framework provides the foundation for a real-time safety mechanism, the implementation and experiment focus on validating the drift detection component in an offline setting using real UAV flight data. The results demonstrate the effectiveness of the detection method in identifying VIO drift scenarios, highlighting its potential for future real-time applications.
|
|
10:36-10:39, Paper TuA04.13 | |
Coordinated Path Following of UAVs Using Event-Triggered Communication Over Networks with Digraph Topologies |
|
Kang, Hyungsoo | University of Illinois at Urbana-Champaign |
Kaminer, Isaac | Naval Postgraduate School |
Cichella, Venanzio | University of Iowa |
Hovakimyan, Naira | University of Illinois at Urbana-Champaign |
Keywords: Agents-based systems, Cooperative control, Networked control systems
Abstract: This article presents a novel time-coordination algorithm based on event-triggered communication to ensure multiple UAVs progress along their desired paths in coordination with one another. In the proposed algorithm, a UAV transmits its progression information to its neighbor UAVs only when a decentralized trigger condition is satisfied. Consequently, it significantly reduces the volume of inter-vehicle communications required to achieve the goal compared with the existing algorithms based on continuous communication. With such intermittent communications, it is shown that a decentralized coordination controller guarantees exponential convergence of the coordination error to a neighborhood of zero. Furthermore, a lower bound on the difference between two consecutive event-triggered times is provided showing that the Zeno behavior is excluded with the proposed algorithm. Lastly, simulation results validate the efficacy of the proposed algorithm.
|
|
10:39-10:42, Paper TuA04.14 | |
Control of an UAV Swarm in Amorphous Formation |
|
Piet, Benjamin | Institut Saint-Louis |
Strub, Guillaume | French-German Research Institute of Saint-Louis |
Changey, Sebastien | ISL - Fr.-Ge. Res. Inst. of Saint-Louis |
Petit, Nicolas | Mines Paris, PSL University |
Keywords: Autonomous systems, Multivehicle systems, Cooperative control
Abstract: Formation flying, particularly in swarms, has become a prominent area of interest for UAV applications. While rigid formation shapes offer several advantages, they also increase the likelihood of detection by optical or radar systems. Drawing inspiration from materials science and condensed matter physics, this paper proposes a method to provide to a formation an amorphous appearance, thereby reducing the swarm’s detectability. The proposed technique involves the introduction of a virtual obstacle that performs stochastic movements within the formation. Two simple metrics are introduced to evaluate the effectiveness of this approach: one assesses the formation’s resemblance to a rigid body, while the other measures the internal velocity correlation among the UAVs. Simulation results validate the effectiveness of this method.
|
|
10:42-10:45, Paper TuA04.15 | |
Optimal Beamforming Design for Stability and Performance of UAV Formations |
|
Lin, Wanyue | Washington University in St. Louis |
Clark, Andrew | Washington University in St. Louis |
Keywords: Networked control systems, Communication networks
Abstract: This paper explores the application of multi-loop Wireless Networked Control Systems (WNCS) for managing Unmanned Aerial Vehicle (UAV) formations. A multi-antenna base station (BS) employs beamforming (BF) technology to communicate with and control multiple UAVs simultaneously. Given the inherent uncertainty and stochastic nature of wireless channels and control system dynamics, we propose a joint communication-control strategy to ensure an accurate, stable, and efficient system. Our objective is to minimize the weighted sum of state error and communication costs while maintaining system stability and adhering to transmission power constraints by adapting BF weight vectors. The benefits of the BF design are twofold: first, a good trade-off between communication costs and control stability is achieved due to the array gain from the multi-antenna controller. Second, the generation of multiple beams to control multiple UAVs simultaneously effectively resolves scheduling issues, enhancing the efficiency of limited radio spectrum and energy consumption. To address the resulting non-trivial probabilistic optimization problem, we adopt the Bernstein outage probability theorem to construct a semidefinite program relaxation. Simulation results confirm the effectiveness of the proposed joint strategy.
|
|
10:45-10:48, Paper TuA04.16 | |
A Chebyshev Pseudospectral Method-Based Model Predictive Control of UAVs for Trajectory Tracking and Collision Avoidance |
|
Venkateswara Rao, Dasari Mohan Krishna Kishor | University of Luxembourg |
Habibi, Hamed | University of Luxembourg |
Voos, Holger | University of Luxembourg |
Keywords: Optimal control, Flight control, Aerospace
Abstract: In this paper, we address the Unmanned Aerial Vehicle trajectory (UAV) tracking and obstacle avoidance problem, by proposing a novel Chebyshev pseudospectral method-based Model Predictive Control (MPC) formulation that is real-time implementable. In this formulation, a continuous-time integral form of the quadratic tracking error cost function is considered and its exact solution is obtained by the Clenshaw-Curtis quadrature rule. The state and control histories are approximated by Lagrange interpolating polynomials, with their coefficients as decision variables. These polynomials are proven to yield smooth control histories, unlike piecewise constant control inputs in the standard MPC. The collocation method is used to satisfy the dynamics and avoid computationally expensive numerical integration. This also allows us for a longer prediction horizon with the same number of decision variables without affecting the computational speed. The MPC is designed by considering the translational dynamics for determining acceleration inputs, which are subsequently used by the low-level controller to obtain desired thrust, orientation, and angular speeds. The performance of the proposed MPC is validated by indoor experiments.
|
|
10:48-10:51, Paper TuA04.17 | |
Data-Driven Robust UAV Position Estimation in GPS Signal-Challenged Environment |
|
Yi, Shenglun | University of Padova |
Jin, Xuebo | Beijing Technology and Business University |
Wang, Zhengjie | Beijing Institute of Technology |
Liu, Zhijun | Beijing S-Svehicle Technology., CO. LTD |
Zorzi, Mattia | University of Padova |
Keywords: Kalman filtering, Uncertain systems, Mechanical systems/robotics
Abstract: In this paper, we consider a position estimation problem for an unmanned aerial vehicle (UAV) equipped with both proprioceptive sensors, i.e. IMU, and exteroceptive sensors, i.e. GPS and a barometer. We propose a data-driven position estimation approach based on a robust estimator which takes into account that the UAV model is affected by uncertainties and thus it belongs to an ambiguity set. We propose an approach to learn this ambiguity set from the data.
|
|
10:51-10:54, Paper TuA04.18 | |
Robustness Enhancement for Multi-Quadrotor Centralized Transportation System Via Online Tuning and Learning |
|
Gao, Tianhua | National Institute of Advanced Industrial Science and Technology |
Tomita, Kohji | National Institute of Advanced Industrial Science and Technology |
Kamimura, Akiya | National Institute of Advanced Industrial Science and Technology |
Keywords: Robust adaptive control, Adaptive systems, Robotics
Abstract: This paper introduces an adaptive-neuro geometric control for a centralized multi-quadrotor cooperative transportation system, which enhances both adaptivity and disturbance rejection. Our strategy is to coactively tune the model parameters and learn the external disturbances in real-time. To realize this, we augmented the existing geometric control with multiple neural networks and adaptive laws, where the estimated model parameters and the weights of the neural networks are simultaneously tuned and adjusted online. The Lyapunov-based adaptation guarantees bounded estimation errors without requiring either pre-training or the persistent excitation (PE) condition. The proposed control system has been proven to be stable in the sense of Lyapunov under certain preconditions, and its enhanced robustness under scenarios of disturbed environment and model-unmatched plant was demonstrated by numerical simulations.
|
|
10:54-10:57, Paper TuA04.19 | |
Minimum-Time Sequential Traversal by a Team of Small Unmanned Aerial Vehicles in an Unknown Environment with Winds |
|
DesRoches, Jeffrey | Worcester Polytechnic Institute |
Cowlagi, Raghvendra V. | Worcester Polytechnic Institute |
Keywords: Aerospace, Autonomous systems, Multivehicle systems
Abstract: We consider the problem of transporting multiple packages from an initial location to a destination location in a windy urban environment using a team of SUAVs. Each SUAV carries one package. We assume that the wind field is unknown, but wind speed can be measured by SUAVs during flight. The SUAVs fly sequentially one after the other, measure wind speeds along their trajectories, and report the measurements to a central computer. The overall objective is to minimize the total travel time of all SUAVs, which is in turn related to the number of SUAV traversals through the environment. For a discretized environment modeled by a graph, we describe a method to estimate wind speeds and the time of traversal for each SUAV path. Each SUAV traverses a minimum-time path planned based on the current wind field estimate. We study cases of static and time-varying wind fields with and without measurement noise. For each case, we demonstrate via numerical simulation that the proposed method finds the optimal path after a minimal number of traversals.
|
|
10:57-11:00, Paper TuA04.20 | |
Quadrotor Fault-Tolerant Control at High Speed: A Model-Based Extended State Observer for Mismatched Disturbance Rejection Approach |
|
Chen, Jinfeng | University of Houston |
Zhang, Fan | University of Houston |
Hu, Bin | University of Houston |
Lin, Qin | University of Houston |
Keywords: Fault tolerant systems, Flight control
Abstract: Fault-tolerant control of a quadrotor in extreme conditions, such as rotor failure and strong winds, is exceptionally challenging due to its underactuated nature, strong mismatched disturbances, and highly nonlinear multi-input and multi-output properties. This letter proposes a reduced attitude control approach that combines a model-based extended state observer (MB-ESO) and mismatched disturbance decoupling to control a quadrotor under strong winds and complete loss of two opposing rotors. Our MB-ESO based control provides a new theoretical framework for more general nonlinear systems by utilizing all measurable outputs, thereby maximizing the use of all available information to design a robust controller. Testing in a high-fidelity simulator shows that our approach outperforms the state-of-the-art Incremental Nonlinear Dynamic Inversion method.
|
|
TuB01 |
Plaza AB |
Trajectory Optimization and Tracking I |
Regular Session |
Chair: Meng, Xiangyu | Louisiana State University |
Co-Chair: Haghshenas-Jaryani, Mahdi | New Mexico State University |
|
13:30-13:45, Paper TuB01.1 | |
Non-Uniform B-Spline Trajectory Optimization Using Control Point Representation Transformations |
|
Christensen, David | Brigham Young University |
Shumway, Landon | Brigham Young University |
Beard, Randal W. | Brigham Young Univ |
McLain, Timothy W. | Brigham Young University |
Keywords: Optimization, Autonomous systems, Robotics
Abstract: Online trajectory generation for unmanned aerial vehicles has attracted increased interest for a variety of autonomous applications. This paper explores the use of non-uniform B-splines to produce improved time-optimal trajectories in comparison to contemporary work that uses uniform B-splines. This paper introduces the non-uniform B-spline matrix form and the transformation of non-uniform B-spline control points to other parametric representations such as MINVO and B'ezier control points. Conversion between control point representations allows the optimization to take advantage of the piecewise continuity of B-splines, as well as the tighter convex bounding properties of MINVO and B'ezier curve representations. The results show that non-uniform B-spline trajectories significantly outperform uniform B-splines trajectories in time optimality and path length. However, computational performance is degraded when optimizing for non-uniform B-splines, thus requiring computational improvements for online use.
|
|
13:45-14:00, Paper TuB01.2 | |
Optimal Trajectory Planning for Autonomous Vehicles in Unstructured Environments |
|
Essuman, Jones | Louisiana State University |
Meng, Xiangyu | Louisiana State University |
Keywords: Autonomous vehicles, Optimal control, Optimization
Abstract: In this paper, we propose a bi-stage optimal trajectory planning method to address the challenges of planning in unstructured environments. In the first stage, we leverage the incremental sampling method, optimal rapidly-exploring random tree star, combined with the Reeds-Shepp curve, to identify a feasible path in complex environments. The generated path is then smoothed using cubic spline interpolation. In the second stage, we address collision avoidance from multiple obstacles by first reducing the obstacle regions and then transforming the non-convex obstacle constraints into convex form through dual reformulation. The formulated optimal control problem is transcribed into a nonlinear programming and solved using a direct method, embedding the smoothed first-stage path as a feasible initial guess to generate optimal trajectories. We demonstrate the applicability of our approach in diverse environments, showing reduced computation time compared to representative methods due to fewer collision evaluations and improved feasibility. Additionally, the generated trajectories account for passenger comfort while minimizing travel time.
|
|
14:00-14:15, Paper TuB01.3 | |
Controllability and Stability Analysis of a Multi-Contact Human-Soft-Wearable-Robot Interaction for Trajectory Tracking (I) |
|
Haghshenas-Jaryani, Mahdi | New Mexico State University |
Keywords: Robotics, Feedback linearization, Reduced order modeling
Abstract: This work presents the study on the controllability and input-output stability of an underactuated soft robotic exoskeleton digit, made of three individual soft actuator segments, for guiding a human finger to track desired trajectories. A quasi-static analytical model of the underactuated soft robot interacting with a human finger was developed in terms of the joint variables, i.e. the arc length and bending angle. The analytical equations were investigated to determine the existence of control solutions (actuation pressure) in the joint space of each soft actuator. A nonlinear time-discrete state-space model was derived based on the quasi-static motion of the coupled human-soft-robot model. The underactuated system's controllability, partial feedback linearizability, and stability were studied. A partial feedback linearizing control law was derived, and a secondary controller was designed to guarantee the asymptotic stability of the input-output linearized subsystem. Then, the local stability of the zero dynamics was shown, and necessary and sufficient conditions were determined. The controller performance in following desired trajectories was validated in the simulation studies and compared to a standard PID controller.
|
|
14:15-14:30, Paper TuB01.4 | |
Equality Constrained Diffusion for Direct Trajectory Optimization |
|
Kurtz, Vincent | California Institute of Technology |
Burdick, Joel W. | California Inst. of Tech |
Keywords: Machine learning, Numerical algorithms, Optimization
Abstract: The recent success of diffusion-based generative models in image and natural language processing has ignited interest in diffusion-based trajectory optimization for nonlinear control systems. Existing methods cannot, however, handle the nonlinear equality constraints necessary for direct trajectory optimization. As a result, diffusion-based trajectory optimizers are currently limited to shooting methods, where the nonlinear dynamics are enforced by forward rollouts. This precludes many of the benefits enjoyed by direct methods, including flexible state constraints, reduced numerical sensitivity, and easy initial guess specification. In this paper, we present a method for diffusion-based optimization with equality constraints. This allows us to perform direct trajectory optimization, enforcing dynamic feasibility with constraints rather than rollouts. To the best of our knowledge, this is the first diffusion-based optimization algorithm that supports the general nonlinear equality constraints required for direct trajectory optimization.
|
|
14:30-14:45, Paper TuB01.5 | |
Trajectory Optimization for Spatial Microstructure Control in Electron Beam Metal Additive Manufacturing |
|
Khrenov, Mikhail | Carnegie Mellon University |
Tan, Yuet Ning | Carnegie Mellon University |
Fitzwater, Lauren | Carnegie Mellon University |
Hobdari, Michelle | Carnegie Mellon University |
Narra, Sneha Prabha | Carnegie Mellon University |
Keywords: Manufacturing systems, Optimal control, Materials processing
Abstract: Metal additive manufacturing (AM) opens the possibility for spatial control of as-fabricated microstructure and properties. However, since the solid state diffusional transformations that drive microstructure outcomes are governed by nonlinear ODEs in terms of temperature, which is itself governed by PDEs over the entire part domain, solving for the system inputs needed to achieve desired microstructure distributions has proven difficult. In this work, we present a trajectory optimization approach for spatial control of microstructure in metal AM, which we demonstrate by controlling the hardness of a low-alloy steel in electron beam powder bed fusion (EB-PBF). To this end, we present models for thermal and microstructural dynamics. Next, we use experimental data to identify the parameters of the microstructure transformation dynamics. We then pose spatial microstructure control as a finite-horizon optimal control problem. The optimal power field trajectory is computed using an augmented Lagrangian differential dynamic programming (AL-DDP) method with GPU acceleration. The resulting time-varying power fields are then realized on an EB-PBF machine through an approximation scheme. Measurements of the resultant hardness shows that the optimized power field trajectory is able to closely produce the desired hardness distribution.
|
|
14:45-15:00, Paper TuB01.6 | |
Filtering-Linearization: A First-Order Method for Nonconvex Trajectory Optimization with Filter-Based Warm-Starting |
|
Yuan, Minsen | University of Minnesota |
Yu, Yue | University of Minnesota Twin Cities |
Caverly, Ryan James | University of Minnesota |
Keywords: Optimal control, Optimization algorithms, Optimization
Abstract: Nonconvex trajectory optimization is at the core of designing trajectories for complex autonomous systems. A challenge for nonconvex trajectory optimization methods, such as sequential convex programming, is to find an effective warm-starting point to approximate the nonconvex optimization with a sequence of convex ones. We introduce a first-order method with filter-based warm-starting for nonconvex trajectory optimization. The idea is to first generate sampled trajectories using constraint-aware particle filtering, which solves the problem as an estimation problem. We then identify different locally optimal trajectories through agglomerative hierarchical clustering. Finally, we choose the best locally optimal trajectory to warm-start the prox-linear method, a first-order method with guaranteed convergence. We demonstrate the proposed method on a multi-agent trajectory optimization problem with linear dynamics and nonconvex collision avoidance. Compared with sequential quadratic programming and interior-point method, the proposed method reduces the objective function value by up to approximately 96% within the same amount of time for a two-agent problem, and 98% for a six-agent problem.
|
|
TuB02 |
Plaza DE |
Reinforcement Learning |
Regular Session |
Chair: Mueller, Mark W. | University of California, Berkeley |
Co-Chair: Isaksson, Alf J. | ABB |
|
13:30-13:45, Paper TuB02.1 | |
Hybrid Reinforcement Learning for Continuous-Time Industrial Systems with Time-Varying Delays |
|
Pawlak, Iga | ABB Corporate Research |
Rastegarpour, Soroush | ABB Corporate Research |
Feyzmahdavian, Hamid Reza | ABB Corporate Research |
Isaksson, Alf J. | ABB |
Keywords: Reinforcement learning, Process Control, Hierarchical control
Abstract: Traditional Reinforcement Learning (RL) methods typically assume that actions are executed instantly, and that the agent receives immediate feedback in terms of state and reward information. However, in many real-world systems, delays in action execution and feedback are common, making these assumptions impractical. While some existing RL methods address scenarios with constant and known delays, this paper proposes a hybrid RL approach designed to handle unknown but bounded delays. The approach introduces two operational modes, each managed by a specialized agent. Initially, a delay-safe agent guarantees system stability regardless of delays, ensuring safety during a delay identification phase. Once the delay is estimated, control is transferred to a delay-informed agent that optimizes performance based on the identified delay. The transition between the two agents is managed through a convex combination of their actions, with increasing emphasis on the delay-informed agent as the accuracy of the delay estimator improves.
|
|
13:45-14:00, Paper TuB02.2 | |
Fitted Q-Iteration Via Max-Plus-Linear Approximation |
|
Liu, Yichen | Delft University of Technology |
Sharifi Kolarijani, Mohamad Amin | Delft University of Technology |
Keywords: Reinforcement learning, Stochastic optimal control, Computational methods
Abstract: In this study, we consider the application of max-plus-linear approximators for Q-function in offline reinforcement learning of discounted Markov decision processes. In particular, we incorporate these approximators to propose novel fitted Q-iteration (FQI) algorithms with provable convergence. Exploiting the compatibility of the Bellman operator with max-plus operations, we show that the max-plus-linear regression within each iteration of the proposed FQI algorithm reduces to simple max-plus matrix-vector multiplications. We also consider the variational implementation of the proposed algorithm which leads to a per-iteration complexity that is independent of the number of samples.
|
|
14:00-14:15, Paper TuB02.3 | |
A Fairness-Oriented Reinforcement Learning Approach for the Operation and Control of Shared Micromobility Services |
|
Cederle, Matteo | Universitŕ Degli Studi Di Padova |
Piron, Luca Vittorio | Universitŕ Degli Studi Di Padova |
Ceccon, Marina | Universitŕ Degli Studi Di Padova |
Chiariotti, Federico | University of Padova |
Fabris, Alessandro | Max Planck Institute for Security and Privacy |
Fabris, Marco | University of Padua |
Susto, Gian Antonio | University of Padova |
Keywords: Reinforcement learning, Transportation networks, Smart cities/houses
Abstract: As Machine Learning grows in popularity across various fields, equity has become a key focus for the AI community. However, fairness-oriented approaches are still underexplored in smart mobility. Addressing this gap, our study investigates the balance between performance optimization and algorithmic fairness in shared micromobility services providing a novel framework based on Reinforcement Learning. Exploiting Q-learning, the proposed methodology achieves equitable outcomes in terms of the Gini index across different areas characterized by their distance from central hubs. Through vehicle rebalancing, the provided scheme maximizes operator performance while ensuring fairness principles for users, reducing iniquity by up to 85% while only increasing costs by 30% (w.r.t. applying no equity adjustment). A case study with synthetic data validates our insights and highlights the importance of fairness in urban micromobility (source code: https://github.com/mcederle99/FairMSS.git)
|
|
14:15-14:30, Paper TuB02.4 | |
Synthesis of Interacting Model-Based and Model-Free Controllers for Optimal Control |
|
Athalye, Surabhi | Georgia Institute of Technology |
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Antsaklis, Panos J. | University of Notre Dame |
Keywords: Optimal control, Reinforcement learning, Linear systems
Abstract: This paper presents a framework that integrates model-based and model-free optimal control methods for continuous-time linear systems. The control design starts with a controller derived from an available nominal model, and is subsequently augmented with a learned (model-free) controller component. We formulate an optimality-based condition that determines the switching instant from the purely model-based controller to the composite controller, which contains both model-based and model-free components. We do not impose any requirements on the model's precision; the switching condition accounts for real-time model mismatch, ensuring that a more misaligned model results in a faster switching time. Finally, to obtain the model-free component in the composite controller, we employ off-policy reinforcement learning (RL) where trajectory data is used to learn the optimal control augmentation.
|
|
14:30-14:45, Paper TuB02.5 | |
Improved Optimal Tracking of Uncertain Nonlinear Discrete-Time Systems Using Experience Replay |
|
Geiger, Maxwell | Missouri University of Science and Technology |
Jagannathan, Sarangapani | Missouri Univ of Science & Tech |
Keywords: Optimal control, Reinforcement learning
Abstract: This paper addresses the infinite horizon optimal tracking control problem for partially uncertain control-affine nonlinear discrete-time (DT) systems, where the control input dynamics are known. Multi-layer critic and actor neural networks (MNNs) are utilized for online estimation of the infinite horizon value function and optimal control input. The NN weights are tuned online using a direct temporal difference error (TDE)-driven learning approach, which modifies the singular values of the gradient with respect to the NN weights to accelerate their convergence. The critic NN uses a novel experience replay technique to improve sample efficiency without introducing biased TDEs and guarantee the persistence of excitation (PE) condition. The tracking error and weight estimation errors are shown to be uniformly ultimately bounded (UUB) using Lyapunov analysis. The performance of the optimal tracking control scheme with experience replay is evaluated on a two-link robot manipulator and contrasted with model predictive control scheme with known dynamics.
|
|
14:45-15:00, Paper TuB02.6 | |
Synthesizing Interpretable Control Policies through Large Language Model Guided Search |
|
Bosio, Carlo | UC Berkeley |
Mueller, Mark W. | University of California, Berkeley |
Keywords: Computational methods, Evolutionary computing, Reinforcement learning
Abstract: The combination of Large Language Models (LLMs), systematic evaluation, and evolutionary algorithms has enabled breakthroughs in combinatorial optimization and scientific discovery. We propose to extend this powerful combination to the control of dynamical systems, generating interpretable control policies capable of complex behaviors. With our novel method, we represent control policies as programs in standard languages like Python. We evaluate candidate controllers in simulation and evolve them using a pre-trained LLM. Unlike conventional learning-based control techniques, which rely on black-box neural networks to encode control policies, our approach enhances transparency and interpretability. We still take advantage of the power of large AI models, but only at the policy design phase, ensuring that all system components remain interpretable and easily verifiable at runtime. Additionally, the use of standard programming languages makes it straightforward for humans to finetune or adapt the controllers based on their expertise and intuition. We illustrate our method through its application to the synthesis of an interpretable control policy for the pendulum swing-up and the ball in cup tasks. We make the code available at https://github.com/muellerlab/synthesizing_interpretable_control_policies.git
|
|
TuB03 |
Plaza CF |
Safe Physics-Informed Learning in Dynamics and Control |
Tutorial Session |
Chair: Beckers, Thomas | Vanderbilt University |
Co-Chair: Fazlyab, Mahyar | Johns Hopkins University |
Organizer: Drgona, Jan | Johns Hopkins University |
Organizer: Nghiem, Truong X. | University of Central Florida |
Organizer: Beckers, Thomas | Vanderbilt University |
Organizer: Fazlyab, Mahyar | Johns Hopkins University |
Organizer: Mallada, Enrique | Johns Hopkins University |
Organizer: Jones, Colin N. | EPFL |
Organizer: Findeisen, Rolf | TU Darmstadt |
Organizer: Brunton, Steven L. | University of Washington |
Organizer: Vrabie, Draguna | Pacific Northwest National Laboratory |
|
13:30-15:00, Paper TuB03.1 | |
Safe Physics-Informed Machine Learning for Dynamics and Control (I) |
|
Drgona, Jan | Johns Hopkins University |
Nghiem, Truong X. | University of Central Florida |
Beckers, Thomas | Vanderbilt University |
Fazlyab, Mahyar | Johns Hopkins University |
Mallada, Enrique | Johns Hopkins University |
Jones, Colin N. | EPFL |
Vrabie, Draguna | Pacific Northwest National Laboratory |
Brunton, Steven L. | University of Washington |
Findeisen, Rolf | TU Darmstadt |
Keywords: Machine learning, Constrained control, Neural networks
Abstract: This tutorial paper focuses on safe physics-informed machine learning in the context of dynamics and control, providing a comprehensive overview of how to integrate physical models and safety guarantees. As machine learning techniques enhance the modeling and control of complex dynamical systems, ensuring safety and stability remains a critical challenge, especially in safety-critical applications like autonomous vehicles, robotics, medical decision-making, and energy systems. We explore various approaches for embedding and ensuring safety constraints, such as structural priors, Lyapunov functions, Control Barrier Functions, predictive control, projections, and robust optimization techniques, ensuring that the learned models respect stability and safety criteria. Additionally, we delve into methods for uncertainty quantification and safety verification, including reachability analysis and neural network verification tools, which help validate that control policies remain within safe operating bounds even in uncertain environments. The paper includes illustrative examples demonstrating the implementation aspects of safe learning frameworks that combine the strengths of data-driven approaches with the rigor of physical principles, offering a path toward the safe control of complex dynamical systems.
|
|
TuB04 |
Governor's Sq. 15 |
Autonomous Systems |
Regular Session |
Chair: Coogan, Samuel | Georgia Institute of Technology |
Co-Chair: Razza, Valentino | Politecnico Di Torino |
|
13:30-13:45, Paper TuB04.1 | |
Optimal Constrained Stabilization of Stochastic Time-Delay Systems |
|
Pan, Zhuo-Rui | Dalian University of Technology |
Ren, Wei | Dalian University of Technology |
Sun, Xi-Ming | Dalian University of Technology |
Keywords: Autonomous systems, Constrained control, Stochastic optimal control
Abstract: Physical systems in the real world are usually constrained due to different considerations. These constraints are closely related to the system safety and stability. In this letter we investigate the optimal stabilization control problem of stochastic time-delay systems under safety constraints. We first follow the Razumikhin approach to propose stochastic control Lyapunov and barrier functions, which result in the closed-form controllers for the stabilization and safety control individually. Next, based on the modification of the quadratic programming, an optimization problem is established to address the stabilization control under safe constraints. The optimal controller is derived explicitly in a switching form to tradeoff the stabilization and safety requirements. Finally, a numerical example is presented to illustrate the proposed control strategy.
|
|
13:45-14:00, Paper TuB04.2 | |
A Lyapunov-Based Cooperative Adaptive Cruise Control Improving Electric Vehicles Energy Efficiency |
|
Faghihian, Hamed | Department of Mechanical Engineering , University of South Flori |
Ansari Bonab, Parisa | University of South Florida |
Sargolzaei, Arman | University of South Florida |
Keywords: Autonomous systems, Cooperative control, Modeling
Abstract: As the transportation industry increasingly shifts towards electric vehicles (EVs), optimizing energy efficiency becomes crucial due to EVs' ongoing range limitations. Adaptive Cruise Control (ACC) improves driver comfort and safety by maintaining a preset speed and adjusting it to keep safe following distances between EVs. However, ACC tends to be less efficient and slower to react in traffic compared to Cooperative Adaptive Cruise Control (CACC), which leverages vehicle-to-vehicle (V2V) communication for quicker and smoother traffic flow. Therefore, this paper introduces a novel, practical, and energy-efficient Lyapunov-based CACC approach that guarantees safe following distances and facilitates smooth vehicle platooning for EVs. To address the absence of an accurate EV model, we initially performed experimental tests to derive a third-order differential equation representing EV acceleration dynamics and defined a novel controller for it. The proposed controller’s performance was then assessed, with an emphasis on energy efficiency and string stability, through both simulations and experimental validation.
|
|
14:00-14:15, Paper TuB04.3 | |
Connectivity Preservation in Planar Bearing-Only Formation Control |
|
Rayabagi, Susmitha T | Indian Institute of Technology Bombay |
Pal, Debasattam | Indian Institute of Technology Bombay |
Mukherjee, Dwaipayan | Indian Institute of Technology Bombay |
Keywords: Autonomous systems, Mechatronics, Networked control systems
Abstract: Connectivity preservation is an important aspect of the formation control problem as it is necessary for the agents to be able to sense their respective neighbors' information to maintain the geometric shape and accomplish the desired task. Recently, bearing-only formation control problem has garnered significant research interest, albeit in the absence of any connectivity preservation constraint. Towards that end, we study the problem of bearing-only formation control in presence of connectivity and safety constraints for single and double integrator agents. Circular disk shaped agents are considered and two relative bearing vectors are sensed such that the angle information can be extracted. We construct a barrier Lyapunov function which then exploits these angles to enforce required constraints for maintaining connectivity and safety among neighbors. We propose gradient based bearing-only controllers and carry out the stability analyses. Simulation examples are provided to illustrate the effectiveness of the control laws.
|
|
14:15-14:30, Paper TuB04.4 | |
Distributed High-Gain Observer for Nonlinear Connected Autonomous Vehicle |
|
Meng, Shengya | Universite De Lorraine, CRAN UMR CNRS |
Nguyen, Quang Huy | University of Lorraine |
Zemouche, Ali | CRAN UMR CNRS 7039 & Université De Lorraine |
Meng, Fanwei | Northeastern University at Qinhuangdao |
Zhang, Fan | Sun Yat-Sen University |
Keywords: Autonomous vehicles, Distributed control, Observers for nonlinear systems
Abstract: This paper presents a distributed high-gain observer for vehicle platoons, where each observer ensures exponential convergence of full state estimation using local measurements and a strongly connected directed communication graph. Unlike previous studies, our approach incorporates the nonlinear longitudinal dynamics of the platoon, taking air resistance into account. By employing the Lipschitz condition and leveraging the structure of the nonlinearity, we derive a less conservative inequality for the nonlinear estimation error. Gain matrices are computed by solving linear matrix inequalities based on observability decomposition. Simulation results for a platoon validate the effectiveness of the proposed observer, showing improved convergence rates and estimation accuracy.
|
|
14:30-14:45, Paper TuB04.5 | |
Feedback Linearization of an Underactuated Miniature Blimp with Zero Dynamics Mitigation Using High Order Control Barrier Functions |
|
Kasmalkar, Mihir | Georgia Institute of Technology |
Baird, Luke | Georgia Institute of Technology |
Coogan, Samuel | Georgia Institute of Technology |
Keywords: Feedback linearization, Autonomous systems, Robotics
Abstract: In this letter we derive a tracking controller based on feedback linearization for a miniature blimp controlled by co-located fans on an undermounted gondola. We prove that feedback linearization of the underactuated blimp induces nontrivial zero dynamics corresponding to lightly damped oscillations in pitch and roll. To mitigate these oscillations we use high-order control barrier functions (HOCBFs) to limit the maximum allowable pitch and roll at the expense of tracking error. Experimental results are presented for three illustrative trajectories which demonstrate that the proposed controller outperforms a well-tuned LQR controller and a baseline nonlinear MPC controller, while the attitude oscillations are theoretically and empirically shown to be bounded by the HOCBFs.
|
|
14:45-15:00, Paper TuB04.6 | |
An Original Sliding Mode Approach to Autonomous Driving Based on Super-Twisting and Artificial Potential Fields |
|
Punta, Elisabetta | CNR-IMATI |
Canale, Massimo | Politecnico Di Torino |
Cerrito, Francesco | Politecnico Di Torino |
Razza, Valentino | Politecnico Di Torino |
Keywords: Autonomous vehicles, Variable-structure/sliding-mode control, Automotive control
Abstract: An approach for automated driving in highway scenarios based on Sliding Mode Control (SMC) methodologies supported by the use of Artificial Potential (APF) fields is presented. The use of APF allows us to propose an effective SMC solution based on the gradient tracking (GT) principle. In fact, SMC-GT approaches regard the APF gradient lines as the desired trajectories and the gradient is interpreted as a desired velocity to be tracked by the vehicle. In this regard, a novel formulation of the APF functions is introduced that exploits a sequence of attractive quadratic functions centered on the target points of the planned trajectory. In this way, the computation of the gradient is more effective and leads to more accurate trajectory tracking and convergence results. Furthermore, the use of the Super-Twisting (STW) algorithm improves the smoothness properties of the velocity reference and the control action. Extensive simulation tests as well as a sensitivity analysis show the effectiveness and the robustness properties of the proposed approach.
|
|
TuB05 |
Governor's Sq. 9 |
Healthcare and Medical Systems I |
Invited Session |
Chair: Menezes, Amor A. | University of Florida |
Co-Chair: Hahn, Jin-Oh | University of Maryland |
Organizer: Hahn, Jin-Oh | University of Maryland |
Organizer: Menezes, Amor A. | University of Florida |
Organizer: Zhang, Wenlong | Arizona State University |
Organizer: Mesbah, Ali | University of California, Berkeley |
Organizer: Medvedev, Alexander V. | Uppsala University |
|
13:30-13:45, Paper TuB05.1 | |
Coactive Preference-Guided Multi-Objective Bayesian Optimization for Policy Learning in Plasma Control Applications (I) |
|
Shao, Ketong | University of California, Berkekely |
Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Mesbah, Ali | University of California, Berkeley |
Romeres, Diego | Mitsubishi Electric Research Laboratories |
|
13:45-14:00, Paper TuB05.2 | |
Continuous Venous Oxygen Saturation Estimation Via Population-Informed Personalized Gaussian Sum Extended Kalman Filtering (I) |
|
Rezaei, Parham | University of Maryland, College Park |
Friedberg, Joseph | University of Maryland |
Fathy, Hosam K. | University of Maryland |
Hahn, Jin-Oh | University of Maryland |
Keywords: Healthcare and medical systems
Abstract: Mixed venous oxygen saturation (SvO2) can play a pivotal role for patient monitoring and treatment in critical care and cardiopulmonary medicine. Unfortunately, its continuous measurement requires the use of invasive pulmonary artery catheters. This letter presents a novel population-informed personalized Gaussian sum extended Kalman filtering (PI-P-GSEKF) approach to continuous SvO2 estimation from arterial oxygen saturation (SpO2) measurement. The main challenge in SvO2 estimation is large inter-individual variability in the cardiopulmonary dynamics, which seriously deteriorates the efficacy of standard EKF. To cope with this challenge, we employ the GSEKF in which individual EKFs are designed using a mathematical model of cardiopulmonary dynamics whose operating points are selected from (i) population-level generative sampling (thus “population-informed”) and (ii) Markov chain Monte Carlo (MCMC) sampling based on a one-time SpO2-SvO2 measurement (thus “personalized”). Using the experimental data collected from 8 hypoxia trials in 4 large animals, we showed the ability of the PI-P-GSEKF to estimate SvO2 from SpO2 in comparison with its PI-EKF (EKF with population-level generative sampling as the source of process noise) and PI-GSEKF (GSEKF with population-level generative sampling alone) counterparts (average SvO2 root-mean-squared error: PI-EKF 4.7%, PI-GSEKF 4.3%, PI-P-GSEKF 3.0%). We also showed that population-level generative sampling and MCMC sampling both had respective roles in improving SvO2 estimation accuracy. In sum, the PI-P-GSEKF demonstrated its proof-of-principle to enable non-invasive continuous SvO2 estimation.
|
|
14:00-14:15, Paper TuB05.3 | |
Control of a Noncooperative Positive Nonlinear System by Augmented Positive Linear System Regulation (I) |
|
Liu, Guanyun | University of Florida |
Menezes, Amor A. | University of Florida |
|
14:15-14:30, Paper TuB05.4 | |
New Physics-LSTM Hybrid Models for Control-Oriented Glucose Prediction in Type 1 Diabetes (I) |
|
Mongini, Paolo Alberto | University of Pavia, Department of Electrical, Computer and Biom |
Drecogna, Martina | University of Pavia |
Toffanin, Chiara | University of Pavia |
Keywords: Identification for control, Machine learning, Metabolic systems
Abstract: Glucose modelling is crucial for an efficient management of Type 1 Diabetes (T1D). In recent years Neural Networks (NNs) techniques, in particular Long Short-Term Memory networks (LSTMs), have shown very promising performances in glucose prediction. However, to use them in control application, these NNs have to be able to correctly learn the effect of each single input from the data. Considering that meals and insulin boluses characterizing the datasets occur simultaneously, the pure NNs are often unable to distinguish their effects. This work proposes two Physics-LSTM hybrid Models (PhLSTMs) merging a classical Black Box model (BB) with two LSTM-based approaches in order to obtain satisfactory prediction capabilities for single impulse responses to insulin/meal. The resulting PhLSTMs have been tested on a case study of 2 in silico patients showing satisfactory glycemic prediction performances both on real-life datasets and impulse responses to insulin/meal.
|
|
14:30-14:45, Paper TuB05.5 | |
A Novel EMG-Based Homogeneous Dynamic System for Upper Extremity Movement Classification (I) |
|
Laskar, Adib | Texas A&M University |
Tafreshi, Reza | Texas A&M University at Qatar |
Wahid, MD Ferdous | TAMUQ |
Keywords: Computational methods, Human-in-the-loop control, Biomedical
Abstract: Accurate upper extremity (UE) movement classification is essential for effective prosthetic design and rehabilitation. However, distinguishing movements involving simultaneous shoulder and elbow motions is challenging due to the complexity presented by the multiple degrees of freedom (DOF). This study proposes an innovative homogeneous dynamic classifier selection system (HDCS) that accurately distinguishes between single DOF (sDOF) and multi-DOF (mDOF) movements. It comprises two main components: a feature-optimized multiple classifier system (MCS) with either linear discriminant analysis (LDA) or decision tree (DT) classifiers and a dynamic classifier selection (DCS) mechanism. On average, the HDCS significantly improves the accuracy from a baseline model by 3.3% (p < 0.05) for the 5-movement classification scenario and 2.5% (p < 0.05) for the 4-movement classification scenarios. The proposed HDCS outperformed individual ML across various movement paradigms, demonstrating its adaptability to a wide range of UE motions, and offering advantages for prosthetics and rehabilitation devices in biomedical engineering
|
|
14:45-15:00, Paper TuB05.6 | |
Seamless Integration of Target-Controlled Infusion and Closed-Loop Anesthesia (I) |
|
Wahlquist, Ylva | Lund University |
Soltesz, Kristian | Lund University |
Keywords: Biomedical, Kalman filtering, Control applications
Abstract: The anesthetic drug propofol is commonly used to control hypnotic depth (suppression of awareness) in patients undergoing surgery or intensive care. In addition to manual titration, a model-based open-loop feed-forward strategy called target-controlled infusion (TCI) has attained some clinical popularity. Research on closed-loop control, with awareness estimates derived from an electroencephalogram (EEG), has proven feasible through several extensive clinical studies over the past decades. While TCI is vulnerable to model imperfections, closed-loop control is susceptible to corrupt measurements. By combining Kalman-filter-based state estimation with model predictive control (MPC), we introduce a novel anesthetic dosing regimen that can transition seamlessly between TCI and closed-loop control, thus constituting an adequate trade-off between model and measurement reliance. We introduce this regimen and provide a realistic simulation example that highlights its strengths compared to pure TCI or closed-loop control of propofol infusion.
|
|
TuB06 |
Governor's Sq. 10 |
Optimal Control I |
Regular Session |
Chair: Wrona, Andrea | La Sapienza |
Co-Chair: Danielson, Claus | University of New Mexico |
|
13:30-13:45, Paper TuB06.1 | |
Some Results in Minimum-Time Optimal Control of Dynamical Flow Networks |
|
Di Paola, Antonio | University of Rome "La Sapienza" |
Gentile, Simone | University of Rome "La Sapienza" |
Wrona, Andrea | La Sapienza |
Keywords: Optimal control, Communication networks, Networked control systems
Abstract: Dynamical flow networks have emerged in the scientific community as a valuable tool to model the time-varying behavior of transportation and communication engineering systems. In this work, we present some results on the minimum-time optimal control of single-commodity dynamical flow networks, showing how it is possible to identify some structural properties relating optimality conditions and graph topology through a mathematical tool defined as the optimality matrix. Additionally, proving some results on the admissibility of solutions, which have significant implications for the activation of control inputs within the optimal time interval, leading to some derivations regarding the number of switching instants in the control strategy.
|
|
13:45-14:00, Paper TuB06.2 | |
Dynamic Programming Via the Quadratic Transform |
|
Dower, Peter M. | University of Melbourne |
McEneaney, William | University of California, San Diego |
Keywords: Optimal control, Computational methods
Abstract: With a view to generalizing existing max-plus and min-plus methods so as to use quadratic basis functions with a non-uniform Hessian, the underlying dual space representation of dynamic programming founded on the semiconvex transform is generalized via the quadratic transform. Using this generalization, an illustrative iteration is proposed as the foundation of a new max-plus method for the solution of a class of optimal control problems.
|
|
14:00-14:15, Paper TuB06.3 | |
An Optimal Solution to Infinite Horizon Nonholonomic and Discounted Nonlinear Control Problems |
|
Gul Mohamed, Mohamed Naveed | Texas A&M University |
Abhijeet, Fnu | Texas A&M University |
Sharma, Aayushman | Texas A&M University |
Goyal, Raman | Palo Alto Reserach Center, SRI International |
Chakravorty, Suman | Texas A&M University |
Keywords: Optimal control, Predictive control for nonlinear systems, Lyapunov methods
Abstract: This paper considers the infinite horizon optimal control problem for nonlinear systems. Under the condition of nonlinear controllability of the system to any terminal set containing the origin and forward invariance of the terminal set, we establish a regularized solution approach consisting of a ``finite free final time" optimal transfer problem to the terminal set, which renders the set globally asymptotically stable. Further, we show that the approximations converge to the optimal infinite horizon cost as the size of the terminal set decreases to zero. We also perform the analysis for the discounted problem and show that the terminal set is asymptotically stable only for a subset of the state space and not globally. The theory is empirically evaluated on various nonholonomic robotic systems to show that the cost of our approximate problem converges and the transfer time into the terminal set is dependent on the initial state of the system, necessitating the free final time formulation. We also do comparisons of our free-final time approach with nonlinear MPC.
|
|
14:15-14:30, Paper TuB06.4 | |
An Efficient Numerical Method for Optimal Control Problems with Low Dimensional Nonlinearities |
|
Zheng, Yifei | University of California San Diego |
Dower, Peter M. | University of Melbourne |
McEneaney, William | University of California, San Diego |
Keywords: Optimal control, Computational methods, Variational methods
Abstract: A class of finite time horizon optimal control problems with nonlinear dynamics and non-quadratic costs is considered. Stat-quad duality is used to transform the problem into a canonical form. A derivative-free numerical method that only uses fixed-point iterations is devised to solve it efficiently, the convergence of which is limited only by the existence of the staticizing control process ( arg stat). For problems with mild and low-dimensional nonlinearities, this leads to dimension reduction of the control space. A 4-D and a 25-D control problem are solved to demonstrate its accuracy and scalability.
|
|
14:30-14:45, Paper TuB06.5 | |
Tutorial Problems for Nonsmooth Dynamics and Optimal Control: Ski Jumping and Accelerating a Bike without Pedaling |
|
Golembiewski, Julian | Hamburg University of Technology |
Faulwasser, Timm | Hamburg University of Technology |
Keywords: Optimal control, Hybrid systems, Switched systems
Abstract: Nonsmooth phenomena, such as abrupt changes, impacts, and switching behaviors, frequently arise in real-world systems and present significant challenges for traditional optimal control methods, which typically assume smoothness and differentiability. These phenomena introduce numerical challenges in both simulation and optimization, highlighting the need for specialized solution methods. Although various applications and test problems have been documented in the literature, many are either overly simplified, excessively complex, or narrowly focused on specific domains. On this canvas, this paper proposes two novel tutorial problems that are both conceptually accessible and allow for further scaling of problem difficulty. The first problem features a simple ski jump model, characterized by state-dependent jumps and sliding motion on impact surfaces. This system does not involve control inputs and serves as a testbed for simulating nonsmooth dynamics. The second problem considers optimal control of a special type of bicycle model. This problem is inspired by practical techniques observed in BMX riding and mountain biking, where riders accelerate their bike without pedaling by strategically shifting their center of mass in response to the track’s slope.
|
|
14:45-15:00, Paper TuB06.6 | |
Randomized Roundings for a Mixed-Integer Elliptic Control System |
|
Köhler, Martin T. | Technical University of Braunschweig |
Kröger, Lauri | Technical University of Braunschweig |
Kirches, Christian | Technical University of Braunschweig |
Keywords: Optimal control, Randomized algorithms, Optimization algorithms
Abstract: We present randomized reconstruction approaches for optimal solutions to mixed-integer elliptic PDE control systems. Approximation properties and relations to sum-up rounding are derived using the cut norm. This enables us to dispose of space-filling curves required for sum-up rounding. Rates of almost sure convergence in the cut norm and the SUR norm in control space as well as almost sure H^1 convergence in state space are shown.
|
|
TuB07 |
Governor's Sq. 11 |
Power Systems |
Regular Session |
Chair: Taha, Ahmad | Vanderbilt University |
Co-Chair: Ishizaki, Takayuki | Tokyo Institute of Technology |
|
13:30-13:45, Paper TuB07.1 | |
Balanced Model Reduction for Nonlinear Power Network Models |
|
Nadeem, Muhammad | Vanderbilt University |
Taha, Ahmad | Vanderbilt University |
Keywords: Power systems, Differential-algebraic systems, Reduced order modeling
Abstract: Power systems transients are commonly modeled via a system of large nonlinear differential-algebraic equations (NDAEs). The complexity and size of power systems models are further increasing with the integration of renewables and other distributed energy resources. To allow scalable real-time monitoring and control, the field of model order reduction (MOR) is becoming more crucial. Although recent literature in power system MOR has proposed various MOR techniques, they simplify the NDAE models to often linear ODE ones. Consequently, the algebraic variables and constraints (power/current balance equations) are neglected and reduction is only carried out for dynamic variables. Ignoring algebraic states in the reduction process means a significant part of the system remains untouched, limiting the effectiveness of MOR. To that end, we propose MOR for complete NDAE power system models. The presented approach can significantly reduce the number of both dynamic and algebraic variables. Case studies on the IEEE 39-bus system validates the performance of the proposed approach. Numerical simulations show that the system can be represented using a far fewer number of states while providing input-output behavior similar to the original NDAE model.
|
|
13:45-14:00, Paper TuB07.2 | |
Incorporating Power System Stability Metrics into the Optimal Power Flow |
|
Gupta, Ashutossh | Purdue University |
Singh, Manish Kumar | University of Wisconsin-Madison |
Kekatos, Vassilis | Virginia Tech |
Keywords: Power systems, Stability of linear systems, Optimization
Abstract: While the effect of network topology, line impedances, and (synthetic) inertia/damping coefficients of synchronous generators and distributed energy resources (DER) on dynamic performance have been extensively investigated, the impact of the power network operating point has not been studied. This work proposes a novel semi-definite program (SDP)-based optimal power flow (OPF) formulation to find a more stable generator dispatch. Different stability metrics widely used in industry can be captured by a carefully selected mcH_2-norm of a linear time-invariant (LTI) system obtained from swing dynamics. Under practical approximations, the dependence of this norm on the operating point can be captured by a convex model. This allows selecting the operating point to minimize stability metrics, generation costs, or combinations thereof through an SDP-based OPF. A two-stage approach can also be followed, where first, active power setpoints are decided by a standard OPF and reactive power setpoints are decided subsequently by the proposed OPF. Pareto optimality analysis carried out to study the relative trade-off between generation and stability costs reveals that a significant improvement in stability can be obtained with small increments in generation cost. Dynamic simulations on the IEEE 68-bus system corroborate that the found OPF schedules feature improved dynamic behavior.
|
|
14:00-14:15, Paper TuB07.3 | |
Constrained Load Frequency Control in Power Systems Via Integrated Stochastic Model Predictive Control and Unscented Kalman Filter |
|
Liu, Yuqian | Xi'an Jiaotong University |
Ma, Tong | Northeastern University |
Keywords: Power systems, Stochastic optimal control, Kalman filtering
Abstract: By incorporating the unscented Kalman filter (UKF) into the stochastic model predictive control (SMPC) architecture, a UKF-SMPC framework is formulated to solve the load frequency control (LFC) problem of a power system subject to wind resources and load disturbances. To suppress the frequency deviations resulting from the stochastic uncertainties and reduce the mechanical power cost, a finite-horizon constrained optimization problem is formulated to maintain the stability of the power system and improve the overall performance. Considering the stochastic nature of wind resources and load disturbances, the UKF is incorporated into the SMPC directly to estimate the states and to propagate the mean and covariance of the states forward in time by taking the state estimation errors and additive noise from the disturbances into consideration. The statistical description including the mean and covariance estimates of the state provided by the UKF are employed to reformulate the cost function and chance constraints. By resorting to the Chebyshev-Cantelli inequality, the chance constraints on the load frequency deviation are reformulated as deterministic ones, which are subsequently linearized at the cost of additional conservativeness. To guarantee the convergence and recursive feasibility of the UKF-SMPC framework, two kinds of terminal constraints are applied, that is, “robust horizon” and Lyapunov equation. By resorting to the Schur complement, the finite-horizon constrained optimization problem is recast as a linear one with a set of linear matrix inequalities (LMIs), which yields an SDP. Simulation results validate the effectiveness of our approach.
|
|
14:15-14:30, Paper TuB07.4 | |
Stealthy Power Systems Data Attacks |
|
Alalem Albustami, Abdallah | Vanderbilt University |
Taha, Ahmad | Vanderbilt University |
Bou-Harb, Elias | LSU |
Keywords: Power systems, Smart grid, Differential-algebraic systems
Abstract: Increasing digitalization has made smart grids vulnerable to cyberattacks. False Data Injection Attacks (FDIAs), a type of cyberattacks, against power system monitoring and state estimation (SE) methods have been extensively studied for AC steady-state and simplified transient model of multi-machine power grids. However, the vulnerability of the more realistic (and complex) Nonlinear Differential Algebraic Equation (NDAE) models, favored in the industry for their accuracy, remains by and large unexplored. This paper investigates FDIAs targeting SE of NDAE models, which preserve crucial coupling between dynamic and algebraic power flow constraints. We formulate two novel FDIA methods: (i) an optimization-based approach and (ii) an algorithmic method leveraging worst-case attacks on intrusion detectors. Both methods ensure attack stealthiness and physical plausibility by adhering to NDAE model constraints. We compare these constraint-aware attacks to their constraint-unaware counterparts, quantifying the inherent resilience of NDAE models to FDIAs. We evaluate different intrusion detection methods and their impact on allowable attack magnitudes. The proposed attack strategies are validated through simulations on the IEEE 39-bus system.
|
|
14:30-14:45, Paper TuB07.5 | |
Machine Learning for Fairness-Aware Load Shedding: A Real-Time Solution Via Identifying Binding Constraints |
|
Zhou, Yuqi | National Renewable Energy Laboratory |
Severino, Joseph | National Renewable Energy Laboratory |
Vijayshankar, Sanjana | NREL |
Ugirumurera, Juliette | National Renewable Energy Laboratory |
Sanyal, Jibo | National Renewable Energy Laboratory |
Keywords: Power systems, Optimization, Machine learning
Abstract: Timely and effective load shedding in power systems is critical for maintaining supply-demand balance and preventing cascading blackouts. To eliminate load shedding bias against specific regions in the system, optimization-based methods are uniquely positioned to help balance between economic and fairness considerations. However, the resulting optimization problem involves complex constraints, which can be time-consuming to solve and thus cannot meet the real-time requirements of load shedding. To tackle this challenge, in this paper we present an efficient machine learning algorithm to enable millisecond-level computation for the optimization-based load shedding problem. Numerical studies on both a 3-bus toy example and a realistic RTS-GMLC system have demonstrated the validity and efficiency of the proposed algorithm for delivering fairness-aware and real-time load shedding decisions.
|
|
14:45-15:00, Paper TuB07.6 | |
Equilibrium-Independent Passivity of Power Systems Composed of Park Synchronous Generator Models |
|
Nishino, Taku | Tokyo Institute of Technology |
Ishizaki, Takayuki | Tokyo Institute of Technology |
Keywords: Stability of nonlinear systems, Power systems, Lyapunov methods
Abstract: This paper presents a passivity-based stability analysis of power systems comprised of Park synchronous generator models. While existing research often utilizes simplified generator models, we focus on the Park model that is known for its high level of detail. We extend existing equilibrium-independent passivity analysis for the stability of power systems with this detailed model. This approach enables a more accurate assessment of power system stability by considering the complex dynamics captured by the Park model, which are often neglected in simplified representations. Numerical simulations confirm the validity of our analysis.
|
|
TuB08 |
Governor's Sq. 12 |
Control Energy Systems and Grids |
Regular Session |
Chair: Lo Iudice, Francesco | Universitŕ Di Napoli Federico II |
Co-Chair: Zuo, Shan | University of Connecticut |
|
13:30-13:45, Paper TuB08.1 | |
An Optimal Control Approach for Enhancing Efficiency in Renewable Energy Communities |
|
Ancona, Camilla | Universitŕ di Napoli Federico II |
Lo Iudice, Francesco | Universitŕ di Napoli Federico II |
Musicň, Emanuele | University of Naples Federico II |
Glielmo, Luigi | University of Napoli Federico II |
|
13:45-14:00, Paper TuB08.2 | |
Improved Newton-Based Extremum Seeking Control Method for Maximum Power Point Tracking in Dynamic Environment and Partial Shading Condition |
|
Yan, Zhongbao | School of Automation Engineering, University of Electronic Scien |
Yin, Chun | University of Electronic Science and Technology of China |
Huang, Xuegang | Aerodynamics Institute, China Aerodynamics Research and Developm |
Cao, Jiuwen | Key Lab for IOT and Information Fusion Technology of Zhejiang, H |
Liu, Junyang | School of Automation Engineering, University of Electronic Scien |
Keywords: Energy systems, Control applications, Robust adaptive control
Abstract: With the growing use of PV systems in renewable energy, maximum power point tracking (MPPT) technology is vital for enhancing energy conversion efficiency. However, traditional MPPT algorithms struggle to find the global maximum power point (GMPP) in complex, dynamically changing environments and under partial shading. This paper introduces an improved Newton extremum seeking control (ESC) MPPT algorithm that employs an extreme value search for local extremes and a multi-peak mechanism for global extremes, preventing entrapment at local maxima and ensuring maximum power output. Simulations demonstrate that the algorithm rapidly adapts to irradiation and temperature changes, accurately tracking the GMPP in multi-peak scenarios, and improving the PV system's energy conversion rate. It offers faster convergence and higher accuracy than traditional methods, making it ideal for complex environments.
|
|
14:00-14:15, Paper TuB08.3 | |
Impact of Load Uncertainty from Electrified Rental Car Facilities on the Control and Design of Behind-The-Meter Battery Storage and PV Generation |
|
Campos, Gustavo | National Renewable Energy Laboratory |
Vercellino, Roberto | National Renewable Energy Laboratory |
Sigler, Devon | National Renewable Energy Laboratory |
Ugirumurera, Juliette | National Renewable Energy Laboratory |
Ge, Yanbo | National Renewable Energy Laboratory |
Lunacek, Monte | National Renewable Energy Lab |
Mann, Margaret | National Renewable Energy Laboratory |
Keywords: Energy systems, Optimal control, Control applications
Abstract: Airport rental car facilities present a significant potential for decarbonization through the adoption of electric vehicles. This transition will likely be accompanied by the deployment of fast charging infrastructure, necessary for keeping vehicle inventory and dwell times low. In this context, distributed or behind-the-meter resources such as stationary battery storage and PV generation are proposed as a solution for reducing costs and improving resiliency. The impact of load uncertainty on the optimal control and design of these systems, however, is a critical topic that has been less explored. In this work, the control and design of behind-the-meter resources under load uncertainty from a large-scale electrified rental car facility is investigated. An Economic Model Predictive Control model is presented, along with stochastic extensions. Different control policies and forecasting methods are compared, demonstrating that chance constraints can be employed to improve performance with limited forecasting. System design is shown to significantly impact control performance, indicating that larger batteries are necessary for less optimal policies. Finally, the effect of control policy choice on the optimal system design is evaluated.
|
|
14:15-14:30, Paper TuB08.4 | |
Nonlinear Optimal Control of DC Microgrids with Safety and Stability Guarantees |
|
Abdirash, Muratkhan | UCLA |
Cui, Xiaofan | University of California, Los Angeles |
|
14:30-14:45, Paper TuB08.5 | |
Safety-Guaranteed and Attack-Resilient Cooperative Control in AC Microgrids under Polynomially Unbounded FDI Attack |
|
Rajabinezhad, Mohamadamin | University of Connecticut (UCONN) |
Shams, Nesa | University of Connecticut |
Wang, Yichao | University of Connecticut |
Zuo, Shan | University of Connecticut |
Keywords: Distributed control, Power systems
Abstract: This letter proposes a novel, fully distributed, Safety-Guaranteed and Attack-Resilient (SGAR) cooperative control framework for AC microgrids, addressing polynomially unbounded false data injection (PU-FDI) attacks on control input channels. Unlike existing methods that address either transient-state safety, without considering malicious cyberattacks, or steady-sate resilience under attacks, without considering safety constraints, our SGAR control framework guarantees both safety and resilience, ensuring that system states remain within predefined safety bounds even during attack initiation—a critical aspect overlooked in prior research. Given the reduction of network inertia by increasing the penetration of inverted-based renewables, large overshooting and intense fluctuations are more likely to occur during transients caused by disturbances and cyberattacks. To mitigate these risks, the proposed SGAR control framework enhance resilient capabilities against PU-FDI attacks, maintaining safe system trajectories for both frequency and voltage throughout the transient response. Through rigorous certification using Control Barrier Functions (CBFs) and Control Lyapunov Function (CLF), we formally certify the strategies to achieve safety guarantees and maintain uniformly ultimately bounded (UUB) convergence in frequency regulation and voltage containment}, as well as active power sharing across multi-inverter-based AC microgrids. Numerical simulation studies verify the effectiveness of the proposed control protocols, demonstrating improved system reliability, safety, and resilience under adverse conditions.
|
|
14:45-15:00, Paper TuB08.6 | |
Privacy-Preserving Power Estimation for DC Microgrids: A Differentially Private Distributed Fusion Filtering Approach |
|
Fu, Xingquan | Southeast University |
Wen, Guanghui | Southeast University |
Fu, Zao | Southeast University |
Keywords: Sensor fusion, Smart grid, Kalman filtering
Abstract: This paper explores the privacy-preserving power estimation problem in DC microgrids with plug-and-play functionality. To safeguard the privacy of data associated with distributed generation units, a novel differentially private distributed fusion filtering algorithm is proposed. Under some mild assumptions, such as collective observability and bounded system parameters, the security, optimality of the gain matrix, consistency, and stability of the designed filters are ensured. Finally, simulation experiments demonstrate the effectiveness of the proposed algorithm.
|
|
TuB09 |
Governor's Sq. 14 |
Game Theory I |
Regular Session |
Chair: Monshizadeh, Nima | University of Groningen |
Co-Chair: Paarporn, Keith | University of Colorado, Colorado Springs |
|
13:30-13:45, Paper TuB09.1 | |
Distributed Nash Control of Multiplayer Multiagent Differential Games with Reinforcement Learning |
|
Lian, Bosen | Auburn University |
Zhang, Yizhong | Auburn University |
Xue, Wenqian | University of Florida |
Lewis, Frank L. | University of Texas at Arlington |
Keywords: Game theory, Reinforcement learning, Distributed control
Abstract: This paper formulates multiplayer multiagent differential games to design the optimal containment control of multiplayer multiagent systems. Distributed Nash equilibrium (simplified as Nash) control policies are designed within the games using only local agents' trajectories, enabling all players to implement optimal control simultaneously. The solvability of the games and the asymptotic stability of the local error system are ensured. A data-driven integral reinforcement learning (RL) algorithm is devised to compute the distributed Nash control online by leveraging system trajectories without knowing explicit system dynamics. Finally, simulation results verify the effectiveness of the designed games and algorithms.
|
|
13:45-14:00, Paper TuB09.2 | |
Potential Games on Cubic Splines for Self-Interested Multi-Agent Motion Planning |
|
Williams, Samuel | University of Southern California |
Deshmukh, Jyotirmoy | University of Southern California |
Keywords: Game theory, Autonomous systems, Optimization
Abstract: Existing multi-agent motion planners face scalability challenges with the number of agents and route plans that span long time horizons. We tackle these issues by introducing additional abstraction by interpolating agent trajectories with natural cubic splines and leveraging existing results that under some natural assumptions, the resulting game has the structure of a potential game. We prove a simultaneous gradient descent method using independent per-agent step sizes is guaranteed to converge to a local Nash equilibrium. Compared with recent iLQR-based potential game solvers, our method solves for local Nash equilibrium trajectories faster in games with up to 52 agents, and we demonstrate scalability to long horizons.
|
|
14:00-14:15, Paper TuB09.3 | |
Learning Nash Equilibrial Hamiltonian for Two-Player Collision-Avoiding Interactions |
|
Zhang, Lei | Arizona State University |
Das, Siddharth | Arizona State University |
Merry, Tanner | Arizona State University |
Zhang, Wenlong | Arizona State University |
Ren, Yi | Arizona State University |
Keywords: Game theory, Machine learning, Robotics
Abstract: We consider the problem of learning Nash equilibrial policies for two-player risk-sensitive collision-avoiding interactions. Solving the Hamilton-Jacobi-Isaacs equations of such general-sum differential games in real time is an open challenge due to the discontinuity of equilibrium values on the state space. A common solution is to learn a neural network that approximates the equilibrium Hamiltonian for given system states and actions. The learning, however, is usually supervised and requires a large amount of sample equilibrium policies from different initial states in order to mitigate the risks of collisions. This paper claims two contributions towards more data-efficient learning of equilibrium policies: First, instead of computing Hamiltonian through a value network, we show that the equilibrium co-states have simple structures when collision avoidance dominates the agents' loss functions and system dynamics is linear, and therefore are more data-efficient to learn. Second, we introduce theory-driven active learning to guide data sampling, where the acquisition function measures the compliance of the predicted co-states to Pontryagin's Maximum Principle. On an uncontrolled intersection case, the proposed method leads to more generalizable approximation of the equilibrium policies, and in turn, lower collision probabilities, than the state-of-the-art under the same data acquisition budget.
|
|
14:15-14:30, Paper TuB09.4 | |
Inefficient Alliance Formation in Coalitional Blotto Games |
|
Shah, Vade | University of California, Santa Barbara |
Paarporn, Keith | University of Colorado, Colorado Springs |
Marden, Jason R. | University of California, Santa Barbara |
Keywords: Game theory, Agents-based systems
Abstract: When multiple agents are engaged in a network of conflict, some can advance their competitive positions by forming alliances with each other. However, the costs associated with establishing an alliance may outweigh the potential benefits. This study investigates costly alliance formation in the framework of coalitional Blotto games, in which two players compete separately against a common adversary and are able to collude by exchanging resources with one another. Previous work has shown that both players in the alliance can mutually benefit if one player unilaterally donates, or transfers, a portion of their budget to the other. In this letter, we consider a variation where the transfer of resources is inherently inefficient, meaning that the recipient of the transfer only receives a fraction of the donation. Our findings reveal that even in the presence of inefficiencies, mutually beneficial transfers are still possible. More formally, our main result provides necessary and sufficient conditions for the existence of such transfers, offering insights into the robustness of alliance formation in competitive environments with resource constraints.
|
|
14:30-14:45, Paper TuB09.5 | |
Modeling of Rumor Propagation in Large Populations with Network Via Graphon Games |
|
Liu, Huaning | University of Illinois at Urbana-Champaign |
Dayanikli, Gokce | University of Illinois Urbana-Champaign |
Keywords: Game theory, Control applications, Mean field games
Abstract: In this paper, we propose a graphon game model to understand how rumor (such as fake news) propagates in large populations that are interacting on a network and how different policies affect the spread. We extend the SKIR model that is used to model rumor propagation and implement individual controls and weighted interactions with other agents to have controlled dynamics. The agents aim to minimize their own expected costs non-cooperatively. We give the finite player game model and the limiting graphon game model to approximate the Nash equilibrium in the population. We give the graphon game Nash equilibrium as a solution to a continuum of ordinary differential equations (ODEs) and give existence results. Finally, we give a numerical approach and analyze examples where we use piecewise constant graphon.
|
|
14:45-15:00, Paper TuB09.6 | |
Data-Driven Dynamic Intervention Design in Network Games |
|
Chen, Xiupeng | University of Groningen |
Monshizadeh Naini, Nima | University of Groningen |
Keywords: Game theory, Control of networks, Data driven control
Abstract: Targeted interventions in games present a challenging problem due to the asymmetric information available to the regulator and the agents. This note addresses the problem of steering the actions of self-interested agents in quadratic network games towards a target action profile. A common starting point in the literature assumes prior knowledge of utility functions and/or network parameters. The goal of the results presented here is to remove this assumption and address scenarios where such a priori knowledge is unavailable. To this end, we design a data-driven dynamic intervention mechanism that relies solely on historical observations of agent actions and interventions. Additionally, we modify this mechanism to limit the amount of interventions, thereby considering budget constraints. Analytical convergence guarantees are provided for both mechanisms, and a numerical case study further demonstrates their effectiveness.
|
|
TuB11 |
Governor's Sq. 17 |
Distributed Control I |
Regular Session |
Chair: Pierer von Esch, Maximilian | Institute of Automatic Control, Friedrich-Alexander-Universität Erlangen-Nürnberg |
Co-Chair: Bamieh, Bassam | Univ. of California at Santa Barbara |
|
13:30-13:45, Paper TuB11.1 | |
Asynchronous Sensitivity-Based Distributed Optimal Control for Nonlinear Systems |
|
Pierer von Esch, Maximilian | Institute of Automatic Control, Friedrich-Alexander-Universität |
Völz, Andreas | Friedrich-Alexander-University Erlangen-Nürnberg |
Graichen, Knut | University Erlangen-Nürnberg (FAU) |
Keywords: Distributed control, Agents-based systems, Optimal control
Abstract: This paper presents an asynchronous formulation of sensitivity-based nonlinear distributed optimal control. The execution is asynchronous in the sense that agents perform algorithmic steps independently of each other and are allowed to use outdated data. Under the assumption of a bounded delay, it is shown that the linear convergence rate of the synchronous execution reduces to R-linear convergence in the asynchronous setting. The algorithm is analyzed in numerical simulations and the execution time is evaluated on distributed hardware with networked communication. The results show that the slower convergence rate is compensated by the reduced execution time when compared to the synchronous approach.
|
|
13:45-14:00, Paper TuB11.2 | |
Multi-Partite Output Regulation with an Application to Networked Nonholonomic Mobile Robots |
|
Gul, Kursad Metehan | Utah State University |
Sarsilmaz, Selahattin Burak | Utah State University |
Keywords: Distributed control, Cooperative control, Output regulation
Abstract: A general multi-partite output regulation problem (MORP) for heterogeneous linear multi-agent systems (MASs) is formulated and solved by realizing it as the cooperative output regulation problem (CORP). In our previous work [1], we formulated the MORP, in which the objective is to design a distributed control law such that each follower sharing the same partition term asymptotically tracks a predefined scalar multiple of a reference while ensuring the internal stability of the closed-loop system. The goal of the problem formulated in this paper is more general; that is, a left matrix multiple is considered instead of a scalar multiple of the reference. In some applications, such as the formation tracking of networked mobile robots, the output of each agent tracking a scalar multiple of the reference imposes a limitation on the MAS's maneuverability due to the multi-output nature of the application. The primary motivation behind our problem formulation is to overcome this limitation and equip MASs with enhanced operational capability. To demonstrate this, an experiment is conducted with a MAS composed of nonholonomic mobile robots.
|
|
14:00-14:15, Paper TuB11.3 | |
Localization Phenomena in Large-Scale Networked Systems: Implications for Fragility |
|
Shukla, Poorva | UCSB |
Bamieh, Bassam | Univ. of California at Santa Barbara |
Keywords: Distributed control, Large-scale systems, Networked control systems
Abstract: We study phenomena where some eigenvectors of a graph Laplacian are largely confined in small subsets of the graph. These localization phenomena are similar to those generally termed Anderson Localization in the Physics literature, and are related to the complexity of the structure of large graphs in still unexplored ways. Using perturbation analysis and pseudo-spectrum analysis, we explain how the presence of localized eigenvectors gives rise to fragilities (low robustness margins) to unmodelled node or link dynamics. Our analysis is demonstrated by examples of networks with relatively low complexity, but with features that appear to induce eigenvector localization. The implications of this newly-discovered fragility phenomenon are briefly discussed.
|
|
14:15-14:30, Paper TuB11.4 | |
Design of Distributed Controller for Discrete-Time Systems Via the Integration of Extended LMI and Clique-Wise Decomposition |
|
Fushimi, Sotaro | Kyoto University |
Watanabe, Yuto | University of California, San Diego |
Sakurama, Kazunori | Osaka University |
Keywords: Distributed control, LMIs, Lyapunov methods
Abstract: This study addresses the centralized synthesis of distributed controllers using linear matrix inequalities (LMIs). Sparsity constraints on control gains of distributed controllers result in conservatism via the convexification of the existing methods such as the extended LMI method. In order to mitigate the conservatism, we introduce a novel LMI formulation for this problem, utilizing the clique-wise decomposition method from our previous work on continuous-time systems. By reformulating the sparsity constraint on the gain matrix within cliques, this method achieves a broader solution set. Also, the analytical superiority of our method is confirmed through numerical examples.
|
|
14:30-14:45, Paper TuB11.5 | |
Distributed Thompson Sampling under Constrained Communication |
|
Zerefa, Saba | Harvard University |
Ren, Zhaolin | Harvard University |
Ma, Haitong | Harvard University |
Li, Na | Harvard University |
Keywords: Distributed control, Optimization, Optimization algorithms
Abstract: In Bayesian optimization, a black-box function is maximized via the use of a surrogate model. We apply distributed Thompson sampling, using a Gaussian process as a surrogate model, to approach the multi-agent Bayesian optimization problem. In our distributed Thompson Sampling implementation, each agent receives sampled points from neighbors, where the communication network is encoded in a graph; each agent utilizes a Gaussian process to model the objective function. We demonstrate a theoretical bound on Bayesian Simple Regret, where the bound depends on the size of the largest complete subgraph of the communication graph. Unlike in batch Bayesian optimization, this bound is applicable in cases where the communication graph amongst agents is constrained. When compared to sequential Thompson sampling, our bound guarantees faster convergence with respect to time as long as there is a fully connected subgraph of at least two agents. We confirm the efficacy of our algorithm with numerical simulations on traditional optimization test functions, illustrating the significance of graph connectivity on improving regret convergence.
|
|
14:45-15:00, Paper TuB11.6 | |
Velocity Response Approximation for Autonomous Multi-Robot Conveyance System |
|
Iori, Tomoyuki | Japan Aerospace Exploration Agency (JAXA) |
Wada, Takayuki | Osaka University |
Yoshida, Hiroshi | NEC Corporation |
Yasuda, Shinya | NEC Corporation |
Fujisaki, Yasumasa | Osaka Univ |
Keywords: Modeling, Cooperative control, Adaptive systems
Abstract: In this study, cooperative conveyance by sandwiching a dolly with multiple mobile robots is considered. A velocity response approximation (VRA) is proposed to consider the dynamics of the robots and the dolly, in addition to their kinematics, while maintaining model simplicity and reducing challenges related to parameter estimation. Since the VRA relies on the condition that all robots hold the dolly correctly, we introduce a control barrier function-based assist controller to ensure the validity of the model. Assuming state measurements are performed more frequently than control updates, a parameter ataptation algorithm is proposed to estimate the time-varying parameters of the VRA. Several numerical examples demonstrate the effectiveness of the proposed method.
|
|
TuB12 |
Plaza Court 1 |
Vehicle Control |
Regular Session |
Co-Chair: Wang, Junmin | University of Texas at Austin |
|
13:30-13:45, Paper TuB12.1 | |
True-Proportional-Navigation Based Time Constrained Guidance of Unmanned Surface Vessel |
|
Verma, Ram Milan Kumar | Indian Institute of Technology Bombay |
Kumar, Shashi Ranjan | Indian Institute of Technology Bombay |
Arya, Hemendra | Indian Institute of Technology Bombay |
Keywords: Maritime control, Autonomous systems, Lyapunov methods
Abstract: Critical marine operations, such as offshore inspections and border patrols, require timely execution. Drawing inspiration from interceptor guidance techniques, this work presents a novel method for steering unmanned surface vessels (USVs) using a true-proportional-navigation philosophy. The proposed approach enables USVs to reach their destinations while adhering to specific time constraints. We first establish the framework and derive the necessary dynamics, allowing us to exploit the time-varying speed of USVs to arrive at the desired location at the desired time. The concept of time-to-go relative to the desired position is formulated and managed through a coordinated effort involving the vessels' longitudinal acceleration and yaw rate. Control inputs for both channels are then determined using a Lyapunov stability-based approach and a control allocation technique within a nonlinear framework, ensuring the strategy remains effective even with significant initial deviations. The proposed controller is validated through numerical simulations, demonstrating satisfactory performance.
|
|
13:45-14:00, Paper TuB12.2 | |
Occlusion-Aware Safe Overtaking under Early Deployment of Connected Vehicles |
|
Liu, Haoji | University of Texas at Austin |
Ji, Yiheng | University of Texas at Austin |
Lee, Yu Chul | University of Texas at Austin |
Yan, Yiming | University of Texas at Austin |
Park, Ji Hwan | The University of Texas at Austin |
Wang, Junmin | University of Texas at Austin |
Keywords: Multivehicle systems, Automotive control, Robotics
Abstract: Occluded areas restrict the field of view for autonomous vehicles, thus posing significant safety risks. Although cooperative perception via vehicle connectivity may mitigate these risks, gradual adoption of connected vehicles (CV) means such hazards will persist in mixed traffic in the foreseeable future. To enable safe autonomous overtaking in occluded zones under sparse CV deployment, this paper proposes a game-theoretical decision-making strategy using coordinated active perception. First, a risk assessment strategy based on reachability analysis quantifies maximum risk sets from potential occluded vehicles and derives safe drivable regions for the ego CV. Building on this, the coordinated active perception method employs automated CVs as active sensors that dynamically adjust their motion/pose to expand visibility and share information via wireless communications, thus minimizing overtaking conservativeness. Finally, with occluded vehicle intentions obtained via coordinated active perception, the ego CV interactively determines its maneuver based on a potential differential game, which is transformed into a centralized optimal control problem and solved using an iterative Linear Quadratic Regulator. Simulation results demonstrate the potential enhancement of overtaking efficiency through coordinated active perception, while the proposed interaction strategy ensures robust safety and adaptability across diverse overtaking scenarios.
|
|
14:00-14:15, Paper TuB12.3 | |
Covert Vehicle Misguidance and Its Detection: A Hypothesis Testing Game Over Continuous-Time Dynamics |
|
Tanaka, Takashi | Purdue University |
Sawada, Kenji | The University of Electro-Communications |
Watanabe, Yohei | The University of Electro-Communications |
Iwamoto, Mitsugu | The University of Electro-Communications |
Keywords: Stochastic optimal control, Fault detection, Information theory and control
Abstract: We formulate a stochastic zero-sum game over continuous-time dynamics to analyze the competition between the attacker, who tries to covertly misguide the vehicle to an unsafe region, versus the detector, who tries to detect the attack signal based on the observed trajectory of the vehicle. Based on Girsanov's theorem and the generalized Neyman-Pearson lemma, we show that a constant bias injection attack as the attacker's strategy and a likelihood ratio test as the detector's strategy constitute the unique saddle point of the game. We also derive the first-order and the second-order exponents of the type II error as a function of the data length.
|
|
14:15-14:30, Paper TuB12.4 | |
Optimal Layout Co-Design in Hybrid Battery Packs for Electric Racing Cars |
|
Riva, Giorgio | Politecnico di Milano |
Radrizzani, Stefano | Politecnico di Milano |
Panzani, Giulio | Politecnico di Milano |
Corno, Matteo | Politecnico di Milano |
Savaresi, Sergio M. | Politecnico Di Milano |
|
14:30-14:45, Paper TuB12.5 | |
Combined Design and Control Optimization for a Series Hybrid Electric Vehicle with an Opposed Piston Engine |
|
Haas, Meridian | UC Davis |
Drallmeier, Joseph | Southwest Research Institute |
Middleton, Robert | University of Michigan |
Siegel, Jason B. | University of Michigan |
Nazari, Shima | UC Davis |
Keywords: Optimal control, Optimization, Power systems
Abstract: Hybrid electric vehicles (HEV) enable reduction of emissions without sacrificing consumer expected range and drivability. The diversification of the powertrain with multiple power sources allows downsizing the internal combustion engine and implementing optimal energy management strategies. The interaction among components of an HEV are key to the overall efficiency. Therefore, efficiency potential is lost if this interdependence is neglected during the powertrain design by focusing on individual optimization of component specifications. This work formulates and solves a co-design problem by integrating the energy management with the optimal powertrain and drivetrain component sizing for a hybrid powertrain equipped with an opposed piston (OP) engine in a series architecture. Our novel approach develops a model for an OP engine and integrates battery capacity degradation into the co-design problem. The optimal solution allows for a minimally sized engine that accounts for the average power requirements, and a large enough battery to provide fast power dynamics.
|
|
14:45-15:00, Paper TuB12.6 | |
Approach Angle Constrained Guidance Strategy of Autonomous Surface Vessel |
|
Verma, Ram Milan Kumar | Indian Institute of Technology Bombay |
Kumar, Shashi Ranjan | Indian Institute of Technology Bombay |
Arya, Hemendra | Indian Institute of Technology Bombay |
Keywords: Maritime control, Control applications, Autonomous systems
Abstract: Uncrewed Surface Vessels (USVs) are increasingly employed in critical marine operations, such as offshore monitoring and cargo transport, where autonomous docking is essential for mission success. In this paper, we introduce a novel approach to autonomous docking wherein the motion control algorithm guides the USV to the docking station while maintaining the orientation required to dock and reducing vehicle speed for safe docking. Control inputs for the vehicle are derived using sliding mode control within a nonlinear framework that guarantees the validity of the proposed controller even in scenarios with significant deviations. Owing to the inherent robustness of sliding mode control techniques, the proposed controller is robust against matched uncertainties. The proposed algorithm's effectiveness is validated through numerical simulations, demonstrating satisfactory performance in achieving precise docking of USV from various initial and final geometries.
|
|
TuB13 |
Plaza Court 2 |
Control Interpretations of Optimization Algorithms |
Invited Session |
Chair: Van Scoy, Bryan | Miami University |
Co-Chair: Forbes, James Richard | McGill University |
Organizer: Forbes, James Richard | McGill University |
Organizer: Van Scoy, Bryan | Miami University |
|
13:30-13:45, Paper TuB13.1 | |
Real-Time Solution Strategy for Linearly Constrained Quadratic Programs with Proportional-Integral Control and Variants (I) |
|
Sawant, Kamlesh | University of Minnesota Twin Cities |
Seiler, Peter | University of Michigan, Ann Arbor |
Jovanovic, Mihailo R. | University of Southern California |
Poon, Jason | Cal Poly |
Dhople, Sairaj | University of Minnesota |
Keywords: Optimization algorithms, Stability of nonlinear systems, PID control
Abstract: We propose a generalized feedback system architecture to synthesize and analyze a class of continuous-time dynamics that solves linearly constrained quadratic programs (LCQPs) in real time. In particular, the architecture executes gradient descent on the cost function, invokes a deliberately engineered sector-bounded nonlinearity to penalize excursions in states away from the feasible space, and involves a family of linear controllers, including proportional-integral (PI) control and its variants to shape dynamic performance and minimize steady-state error. We establish the correspondence of the equilibria of the continuous-time dynamics with stationary points of the LCQP and provide numerical tests for stability leveraging the Kalman-Yakubovich-Popov lemma. We also comment on how specific variants of PI control present similarities to widely studied methods, including the augmented Lagrangian method, the primal-dual method, and gradient-flow dynamics for penalty program reformulations. Theoretical results are validated through simulations to benchmark performance and elucidate the design choices that emerge from the analysis.
|
|
13:45-14:00, Paper TuB13.2 | |
On the Stability Properties of Gradient Flow Dynamics for a Symmetric Low-Rank Matrix Factorization Problem (I) |
|
Mohammadi, Hesameddin | University of Southern California |
Soltanolkotabi, Mahdi | USC |
Jovanovic, Mihailo R. | University of Southern California |
Keywords: Optimization, Stability of nonlinear systems, Optimization algorithms
Abstract: The low-rank matrix factorization problem serves as a building block in many modern learning tasks including matrix recovery and neural networks training. For a symmetric version of the associated non-convex optimization problem, we characterize equilibrium points of the gradient flow dynamics and examine their local and global stability properties. Our proof exploits a novel change of variables that brings the underlying dynamics into a cascade connection of three subsystems whose analysis is considerably simpler than the analysis of the original system. We show that one of these subsystems is governed by autonomous dynamics which are decoupled from the rest of the system. In the over-parameterized regime, this subsystem is associated with the excess parameters; our analysis reveals its stability with an O(1/t) asymptotic convergence rate that captures the slow dynamics. For the other two subsystems, we utilize a Lyapunov-based approach to establish their exponential convergence under mild assumptions.
|
|
14:00-14:15, Paper TuB13.3 | |
Input-Output Stability of Gradient Descent: A Discrete-Time Passivity-Based Approach (I) |
|
Moalemi, Sepehr | McGill University |
Forbes, James Richard | McGill University |
Keywords: Optimization algorithms, Robust control, Numerical algorithms
Abstract: This paper presents a discrete-time passivity-based analysis of the gradient descent method for a class of functions with sector-bounded gradients. Using a loop transformation, it is shown that the gradient descent method can be interpreted as a passive controller in negative feedback with a very strictly passive system. The passivity theorem is then used to guarantee input-output stability, as well as the global convergence, of the gradient descent method. Furthermore, provided that the lower and upper sector bounds are not equal, the input-output stability of the gradient descent method is guaranteed using the weak passivity theorem for a larger choice of step size. Finally, to demonstrate the utility of this passivity-based analysis, a new variation of the gradient descent method with variable step size is proposed by gain-scheduling the input and output of the gradient.
|
|
14:15-14:30, Paper TuB13.4 | |
An Online Optimization Algorithm for Tracking a Linearly Varying Optimal Point with Zero Steady-State Error (I) |
|
Wu, Alex (Xinting) | Australian National University |
Petersen, Ian R. | Australian National University |
Ugrinovskii, Valery | University of New South Wales |
Shames, Iman | Australian National University |
Keywords: Optimization algorithms, Optimization, Robust control
Abstract: In this paper, we develop an online optimization algorithm for solving a class of nonconvex optimization problems with a linearly varying optimal point. The global convergence of the algorithm is guaranteed using the circle criterion for the class of functions whose gradient is bounded within a sector. Also, we show that the corresponding Luré-type nonlinear system involves a double integrator, which demonstrates its ability to track a linearly varying optimal point with zero steady-state error. The algorithm is applied to solving a time-of-arrival based localization problem with constant velocity and the results show that the algorithm is able to estimate the source location with zero steady-state error.
|
|
14:30-14:45, Paper TuB13.5 | |
Optimization Algorithms As Uncertain Graded Dynamical Systems (I) |
|
Van Scoy, Bryan | Miami University |
Keywords: Optimization algorithms, Robust control
Abstract: The interpretation of iterative optimization algorithms as dynamical systems has led to a variety of advances in their analysis and design using tools from control. In this paper, we identify a structure of dynamical systems that arises naturally in a variety of optimization algorithms, and we show how to take advantage of this structure in system analysis. In particular, first-order optimization algorithms consist of the gradient of the objective in feedback with graded dynamical systems, which are systems whose signal spaces decompose as direct sums that are not mixed by the system dynamics.
|
|
14:45-15:00, Paper TuB13.6 | |
L1 Adaptive Optimizer for Online Time-Varying Convex Optimization |
|
Kim, Jinrae | University of Illinois Urbana-Champaign |
Hovakimyan, Naira | University of Illinois at Urbana-Champaign |
Keywords: Optimization, Robust adaptive control, Uncertain systems
Abstract: We propose an adaptive method for online time-varying (TV) convex optimization, termed L1 adaptive optimization (L1-AO). TV optimizers utilize a prediction model to exploit the temporal structure of TV problems, which can be inaccurate in the online implementation. Inspired by L1 adaptive control, the proposed method augments an adaptive update law to estimate and compensate for the uncertainty from the prediction inaccuracies. The proposed method provides performance bounds of the error in the optimization variables and cost function, allowing efficient and reliable optimization for TV problems. Numerical simulation results demonstrate the effectiveness of the proposed method for online TV convex optimization.
|
|
TuB14 |
Plaza Court 3 |
Aerospace |
Regular Session |
Chair: Moore, Jacob | Brigham Young University |
Co-Chair: Lessard, Laurent | Northeastern University |
|
13:30-13:45, Paper TuB14.1 | |
Spacecraft Attitude Control under Reaction Wheel Constraints Using Control Lyapunov and Control Barrier Functions |
|
Alipour Shahraki, Milad | Northeastern University |
Lessard, Laurent | Northeastern University |
Keywords: Constrained control, Optimization, Aerospace
Abstract: This paper introduces a novel control strategy for agile spacecraft attitude control, addressing reaction wheel-related input and state constraints. An optimal-decay control Lyapunov function quadratic program stabilizes the system and mitigates chattering at low sampling frequencies, while control barrier functions enforce hard state constraints. Numerical simulations validate the method's practicality and efficiency for real-time agile spacecraft attitude control.
|
|
13:45-14:00, Paper TuB14.2 | |
FREDIM: Feasible Region Estimation and Decentralized Interception Method |
|
Reid, Ian | Brigham Young University |
Moore, Jacob | Brigham Young University |
Keywords: Aerospace, Autonomous systems, Cooperative control
Abstract: In this paper, we present a multi-agent framework for intercepting an incoming fast-moving intruder by slower agents. Given the pose of the intruder and a known target, agents compute the feasible region of intruder trajectories though an interception plane in 3D space. They then deploy themselves into a 3D formation that increases the likelihood of intruder interception in the feasible region. Results are verified in Monte-Carlo simulations for given intruder characteristics, and show that the proposed method reduces the miss distance to less than 0.2 meters for at least one agent in the swarm for more than 99% of simulated intruders that follow a proportional navigation scheme, even when intruders have significant speed advantage over the agents.
|
|
14:00-14:15, Paper TuB14.3 | |
Autonomous Helicopter Aerial Refueling: Controller Design and Performance Guarantees |
|
Jayarathne, Damsara | Rensselaer Polytechnic Institute |
Paternain, Santiago | Rensselaer Polytechnic Institute |
Mishra, Sandipan | Rensselaer Polytechnic Institute |
Keywords: Aerospace, Flight control, Feedback linearization
Abstract: In this paper, we present a control design methodology, stability criteria and performance bounds for autonomous helicopter aerial refueling. Autonomous aerial refueling is particularly difficult due to the aerodynamic interaction between the wake of the tanker, the contact-sensitive nature of the maneuver, and the uncertainty in drogue motion. Since the probe tip is located significantly away from the helicopter's center of gravity, its position/velocity is strongly sensitive to the helicopter's attitude/angular rates. In addition, the fact that the helicopter is operating at high speeds to match the velocity of the tanker forces it to maintain a particular orientation, making the docking maneuver especially challenging. In this paper, we propose a novel outer-loop position controller that incorporates the probe position and velocity into the feedback loop. The position and velocity of the probe tip depend both on the position/velocity and on the attitude/angular rates of the aircraft. We derive analytical guarantees for docking performance in terms of the uncertainty of the drogue motion and the angular acceleration of the helicopter, using the ultimate boundedness property of the closed loop error dynamics. Simulations are performed on a high-fidelity UH60 helicopter model with a high-fidelity drogue motion under wind effects to validate the proposed approach for realistic refueling scenarios. These high-fidelity simulations reveal that the proposed control methodology yields an improvement of 36% in the 2-norm docking error compared to the existing standard controller.
|
|
14:15-14:30, Paper TuB14.4 | |
Conflict Detection, Resolution, and Control of Aircraft Using 4D Polynomial Splines |
|
Klinefelter, Michael | Brigham Young University |
Orndorff, Gabriel | 4D Avionic Systems |
Salmon, John | Brigham Young University |
Peterson, Cameron | Brigham Young University |
Thompson, J. Garth | Kansas State Univ |
Keywords: Flight control, Control applications
Abstract: We implement a conflict detection and 4D flight path resolution algorithm on quadrotor platforms. 4D flight paths are based on 5th-order polynomial interpolating splines that fully define the flight path's position, velocity, and acceleration at each moment in time between waypoints. Our detection and resolution algorithms operate in a distributed manner with multiple quadrotors using 8Gb Raspberry Pis. We control the quadrotors to the 4D flight paths with Pixhawk autopilots using PX4 software. The results of this work show the capability of our flight path model to effectively separate autonomous vehicles with flight paths that their control systems are capable of tracking.
|
|
14:30-14:45, Paper TuB14.5 | |
Path Invariance of a Quadrotor System under Cyber Attacks with Theoretical Guarantees |
|
Mahmood, Hamza | National University of Sciences and Technology, Islamabad, Pakis |
Ali, Usman | De Montfort University |
Akhtar, Adeel | New Jersey Institute of Technology |
Keywords: Flight control, Fault tolerant systems, Feedback linearization
Abstract: This paper presents a path-following controller for a quadrotor system to guarantee safe maneuvers, in terms of forward path invariance, in the presence of cyber-physical attacks. We assume that an adversarial agent can control any one of the rotors through a false data injection (FDI) type of attack. A feedback controller is designed using transverse feedback linearization which guarantees that the system follows a class of smooth curves under FDI attacks. Our proposed controller is computationally efficient, with a closed-form analytical expression, that not only mitigates the effect of bounded malicious signal but also ensures mission success. We provide theoretical guarantees of forward path invariance under FDI attacks with realistic assumptions and demonstrate the effectiveness of our approach through simulation.
|
|
14:45-15:00, Paper TuB14.6 | |
Evidential Intent Assignment Using Belief States in the Hill Frame (I) |
|
Balo, Rondale | The Ohio State University |
Kumar, Mrinal | Ohio State University |
Soderlund, Alexander | The Ohio State University |
|
TuB15 |
Plaza Court 6 |
Control and Estimation in Flow Systems |
Invited Session |
Chair: Tang, Shuxia | Texas Tech University |
Co-Chair: Adil, Ania | King Abdullah University of Science and Technology |
Organizer: Tang, Shuxia | Texas Tech University |
Organizer: Diagne, Mamadou | University of California San Diego |
|
13:30-13:45, Paper TuB15.1 | |
Numerical and Lyapunov-Based Investigation of the Effect of Stenosis on Blood Transport Stability Using a Control-Theoretic PDE Model of Cardiovascular Flow (I) |
|
Singh, Shantanu | Tel Aviv University |
Bekiaris-Liberis, Nikolaos | Technical University of Crete |
Keywords: Distributed parameter systems, Fluid flow systems, Control applications
Abstract: We perform various numerical tests to study the effect of (boundary) stenosis on blood flow stability, employing a detailed and accurate, second-order finite-volume scheme for numerically implementing a partial differential equation (PDE) model, using clinically realistic values for the artery's parameters and the blood inflow. The model consists of a baseline 2x2 hetero-directional, nonlinear hyperbolic PDE system, in which, the stenosis' effect is described by a pressure drop at the outlet of an arterial segment considered. We then study the stability properties (observed in our numerical tests) of a reference trajectory, corresponding to a given time-varying inflow (e.g., a periodic trajectory with period equal to the time interval between two consecutive heartbeats) and stenosis severity, deriving the respective linearized system and constructing a Lyapunov functional. Due to the fact that the linearized system is time varying, with time-varying parameters depending on the reference trajectories themselves (that, in turn, depend in an implicit manner on the stenosis degree), which cannot be derived analytically, we verify the Lyapunov-based stability conditions obtained, numerically. Both the numerical tests and the Lyapunov-based stability analysis show that a reference trajectory is asymptotically stable with a decay rate that decreases as the stenosis severity deteriorates.
|
|
13:45-14:00, Paper TuB15.2 | |
Output Feedback Periodic Event-Triggered Control of Coupled 2×2 Linear Hyperbolic PDEs (I) |
|
Somathilake, Eranda | Department of Mechanical and Aerospace Engineering, University O |
Rathnayake, Bhathiya | Student (University of California San Diego) |
Diagne, Mamadou | University of California San Diego |
Keywords: Distributed parameter systems, Sampled-data control, Lyapunov methods
Abstract: This article introduces an observer-based periodic event-triggered control (PETC) strategy for boundary control of a system characterized by 2times2 linear hyperbolic partial differential equations (PDEs). An anti-collocated actuation and sensing configuration is considered, and an exponentially convergent observer for state estimation from boundary data is designed. Initially, a continuous-time dynamic event-triggering mechanism requiring constant monitoring of the triggering function is developed. This mechanism is subsequently adapted into a periodic event-triggering scheme, which necessitates only periodic monitoring to identify when the control input needs updating. The underlying control approach is the PDE backstepping boundary control, implemented in a zero-order hold manner between events. This result marks a substantial improvement over conventional observer-based continuous-time event-triggered control for linear coupled hyperbolic PDEs by removing the requirement for constant monitoring of the triggering function. With the triggering function evaluated periodically, the closed-loop system is inherently free from Zeno behavior. It is demonstrated that under the proposed PETC, the closed-loop system globally exponentially converges to zero in the spatial L^2 norm. A simulation study illustrating the theoretical results is presented.
|
|
14:00-14:15, Paper TuB15.3 | |
Setpoint Tracking and Disturbance Attenuation for Gas Pipeline Flow Subject to Uncertainties Using Backstepping (I) |
|
Rathnayake, Bhathiya | Student (University of California San Diego) |
Zlotnik, Anatoly | Los Alamos National Laboratory |
Tokareva, Svetlana | Los Alamos National Laboratory |
Diagne, Mamadou | University of California San Diego |
Keywords: Distributed parameter systems, Fluid flow systems, Uncertain systems
Abstract: In this paper, we consider the problem of regulating the outlet pressure of gas flowing through a pipeline subject to uncertain and variable outlet flow. Gas flow through a pipe is modeled using the coupled isothermal Euler equations, with the Darcy–Weisbach friction model used to account for the loss of gas flow momentum. The outlet flow variation is generated by a periodic linear dynamic system, which we use as a model of load fluctuations caused by varying customer demands. We first linearize the nonlinear equations around the equilibrium point and obtain a 2-by-2 coupled hyperbolic partial differential equation (PDE) system expressed in canonical form. Using an observer-based PDE backstepping controller, we demonstrate that the inlet pressure can be manipulated to regulate the outlet pressure to a setpoint, thus compensating for fluctuations in the outlet flow. Furthermore, we extend the observer-based controller to the case when the outlet flow variation is uncertain within a bounded set. In this case, the controller is also capable of regulating the outlet pressure to a neighborhood of the setpoint by manipulating the inlet pressure, even in the presence of uncertain fluctuations in the outlet flow. We provide numerical simulations to demonstrate the performance of the controller.
|
|
14:15-14:30, Paper TuB15.4 | |
Early versus Late Traffic Management for Autonomous Agents (I) |
|
Ghori, Salman Sarfaraz | King Abdullah University of Science and Technology |
Adil, Ania | King Abdullah University of Science and Technology |
Feron, Eric | King Abdullah University of Science and Technology |
Keywords: Traffic control, Optimization, Automotive systems
Abstract: Intersections pose critical challenges in traffic management, where maintaining operational constraints and ensuring safety are essential for efficient flow. This paper investigates the effect of intervention timing in managing the autonomous agents while satisfying constraints like safe separation distance, avoiding collisions at intersections, and minimizing the delay to improve the overall system efficiency. We introduce control regions, represented as circles around the intersection, which refers to the timing of interventions by a centralized control system when agents approach the intersection. We use a mixed-integer linear programming (MILP) approach to optimize the system's performance. A simulation study is conducted to analyze the effectiveness of early and late control measures, focusing on the safe, efficient, and robust management of agent movement within the control regions.
|
|
14:30-14:45, Paper TuB15.5 | |
MIMO-Decoupling to Improve Pressure and Flow Tracking in Mechanical Ventilation |
|
van de Kamp, Lars | Eindhoven University of Technology |
Franklin, Isabelle Margaretha | Eindhoven University of Technology |
van Loon, Bas | Eindhoven University of Technology |
Oomen, Tom | Eindhoven University of Technology |
Van De Wouw, Nathan | Eindhoven University of Technology |
Keywords: Switched systems, Biomedical, Decentralized control
Abstract: Mechanical ventilators are complex mechatronic devices that are essential for patients who are unable to breathe independently. The aim of this paper is to develop a systematic control method that achieves accurate tracking of both the pressure and flow to ensure comfortable breathing for the patient. This is achieved by using a feedback design procedure technique based on static decoupling and the factorized Nyquist criterion. Furthermore, switching controllers are introduced that allow for improved baseflow tracking performance. The presented control method is implemented in a real ventilator and it is demonstrated that the tracking performance is improved by conducting an experimental case-study.
|
|
14:45-15:00, Paper TuB15.6 | |
A Flipped Radau Finite Element Framework for the Optimal Control of the Viscous Burgers’ Equation |
|
Davies, Alexander | University of Florida |
Dennis, Miriam | Air Force Research Laboratory |
Pollock, Sara | University of Florida |
Rao, Anil V. | University of Florida |
Keywords: Optimal control, Computational methods, Fluid flow systems
Abstract: A computational framework for the solution of optimal control problems governed by a parabolic partial differential equation is presented. The continuous space-time optimal control problem is transcribed into a sparse nonlinear programming problem (NLP) through state and control parameterization. In particular, a multi-interval flipped Legendre-Gauss-Radau (fLGR) collocation method is implemented for temporal discretization alongside a Galerkin finite element spatial discretization. The finite element discretization allows for a reduction in problem size and avoids the redefinition of constraints required under a previous method. Further, a generalization of a Kirchoff transformation is performed to handle nonlinearities in the variational description of the problem. Lastly, it is demonstrated on a numerical example that the use of a multi-interval fLGR temporal discretization can lead to a reduction in the required number of collocation points to compute accurate values of the optimal objective in comparison to other methods.
|
|
TuB16 |
Plaza Court 7 |
Stability |
Regular Session |
Chair: Kammer, Leonardo C. | GE Vernova Inc |
Co-Chair: Cunis, Torbjřrn | University of Stuttgart |
|
13:30-13:45, Paper TuB16.1 | |
Data Informativity for Quadratic Stabilization under Data Perturbation |
|
Kaminaga, Taira | Institute of Science Tokyo |
Sasahara, Hampei | Institute of Science Tokyo |
Keywords: Learning, Robust control, LMIs
Abstract: Assessing data informativity, determining whether the measured data contains sufficient information for a specific control objective, is a fundamental challenge in data-driven control. In noisy scenarios, existing studies deal with system noise and measurement noise separately, using quadratic matrix inequalities. Moreover, the analysis of measurement noise requires restrictive assumptions on noise properties. To provide a unified framework without any restrictions, this study introduces data perturbation, a novel notion that encompasses both existing noise models. It is observed that the admissible system set with data perturbation does not meet preconditions necessary for applying the key lemma in the matrix S-procedure. Our analysis overcomes this limitation by developing an extended version of this lemma, making it applicable to data perturbation. Our results unify the existing analyses while eliminating the need for restrictive assumptions made in the measurement noise scenario.
|
|
13:45-14:00, Paper TuB16.2 | |
The Extended Stability Margin |
|
Kammer, Leonardo C. | GE Vernova Inc |
Keywords: Stability of linear systems
Abstract: This document surveys the most widely used metrics for assessing the stability margin of linear time-invariant scalar and multivariable closed-loop systems. These metrics are presented in a uniform mathematical framework that highlights their frequency-by-frequency quantification. The author proposes a set of desirable properties for stability-margin metrics, against which the surveyed metrics are assessed. In addition, this document introduces a novel metric, called extended stability margin, that addresses a gap found in all the other stability margins surveyed: A certain class of multivariable closed-loop systems can be at the brink of instability by a minimal perturbation in the plant, yet none of the other stability-margin metrics is able to detect such a near-instability condition.
|
|
14:00-14:15, Paper TuB16.3 | |
A Model-Free Active Noise Control for Periodic Disturbances: With Guaranteed Stability and Robustness |
|
Gong, Yizhou | ShanghaiTech University |
Ji, Chenyang | ShanghaiTech University |
Liu, Song | ShanghaiTech University |
Wang, Yang | Shanghai Technology Unversity |
Keywords: Uncertain systems, Robust adaptive control, Output regulation
Abstract: Acoustic noise attenuation is crucial in both industrial and everyday applications, particularly for low-frequency disturbances that passive methods cannot effectively mitigate. This paper presents a model-free active noise control (ANC) strategy inspired by the internal model principle (IMP), specifically designed for periodic noise in duct systems. We demonstrate significant attenuation of low-frequency noise while ensuring input-to-state stability, all without prior model information regarding the acoustic system's parameters or structure. More importantly, the proposed method robustly tolerates frequency estimation errors and measurement noise, as evidenced by theoretical analysis and experimental validation. Finally, benchmark experiments reveal the adaptability and generality of our approach within unknown environments and diverse systems. Our findings highlight the potential of IM-based model-free ANC strategies for practical applications in complex acoustic environments.
|
|
14:15-14:30, Paper TuB16.4 | |
Hyperexponential Stabilization of Double Integrator with Unmatched Perturbations |
|
Labbadi, Moussa | Aix-Marseille University |
Efimov, Denis | Inria |
Keywords: Variable-structure/sliding-mode control, Robust control, Robust adaptive control
Abstract: Linear time-varying state feedback controllers are proposed for a double integrator subject to bounded disturbances in each equation. It is shown that, for the double integrator, the first state converges to zero at a hyperexponential rate (faster than any exponential decay) uniformly with respect to the disturbances, while the second state approaches the negative of an unmatched perturbation. These results are applied to design a novel time-varying differentiator.
|
|
14:30-14:45, Paper TuB16.5 | |
Estimating Robust Regions of Attraction with Uncertain Equilibrium Points |
|
Loureiro, Renato | University of Stuttgart |
Cunis, Torbjřrn | University of Stuttgart |
Keywords: Uncertain systems, Stability of nonlinear systems, Computational methods
Abstract: A critical property of dynamical systems for real-world applications is their stability characterization, that is, their region of attraction. When accounting for systems with parametric uncertainty, it is crucial to obtain what is instead the robust region of attraction, i.e., the set of initial conditions of a dynamical system such that the system's asymptotic stability is guaranteed in the presence of uncertainties. Multiple methods to estimate the robust region of attraction are presented in the literature, mostly resorting to Lyapunov theory and converse results. In this paper, we present algorithms to estimate the robust region of attraction through an iterative approach based on invariant sets, sum-of-squares relaxations and some asymptotic stability certificates distinct from the ones present in Lyapunov's theory, namely an extension of the Bendixson-Dulac criterion. Furthermore, we demonstrate the applicability of this method to polynomial dynamical systems with constrained uncertainties, enabling the determination of a robust region of attraction inner estimate.
|
|
14:45-15:00, Paper TuB16.6 | |
Dynamic Self-Triggered Control for Linear Systems Based on Hierarchical Strategy |
|
Wang, Chenyang | Jiangnan University |
Wan, Haiying | Jiangnan University |
Luan, Xiaoli | Institute of Automation, Jiangnan University |
Liu, Fei | Jiangnan University |
Keywords: Hierarchical control, Linear systems, Stability of linear systems
Abstract: In this paper, a dynamic self-triggered mechanism based on the hierarchical strategy is proposed for linear systems to reduce communication resource utilization. Specifically, a hierarchical structure is employed, where the upper trigger layer calculates the maximum allowable triggering interval value while ensuring system stability. To further reduce the number of triggers, a dynamic variable is introduced for the construction of the dynamic self-triggered mechanism, which greatly reduces the waste of communication resources. Within each inter-execution interval computed in the upper layer, the lower control layer determines the optimal control input by minimizing the given objective function. Through the collaboration between the triggering layer and the control layer, the number of system samples is significantly reduced, and the convergence time of the system state trajectory is shortened. The effectiveness of this proposed method is demonstrated through a numerical simulation example.
|
|
TuB17 |
Plaza Court 8 |
Koopman I |
Regular Session |
Chair: Mohammadpour Velni, Javad | Clemson University |
Co-Chair: Subosits, John | Stanford University: Dynamic Design Lab |
|
13:30-13:45, Paper TuB17.1 | |
Adaptable High-Speed Model Predictive Control for Autonomous Drifting: Koopman-Based Dynamics |
|
Suminaka, Makoto | Toyota Research Institute |
Dallas, James | Toyota Research Institute |
Thompson, Michael | Toyota Research Institute |
Soga, Masayuki | Toyota Motor Corporation |
Kasai, Eiji | Toyota Motor Corporation |
Subosits, John | Stanford University: Dynamic Design Lab |
Keywords: Automotive control, Optimal control, Modeling
Abstract: Autonomous vehicles capable of safely operating beyond the stable handling limits would be able to perform a broader array of maneuvers during emergencies, thereby enhancing overall safety. This paper presents an approach to autonomous drifting using Koopman-based dynamics models, which globally linearize the nonlinear system dynamics. By leveraging the Koopman operator, we efficiently generate these dynamics models with only 2.2 minutes of offline data. The generated models are integrated with Model Predictive Control to achieve computationally efficient optimization and high tracking accuracy. Additionally, real-time adaptation using online data is employed to reduce model error and enhance trajectory tracking performance. Experimental results demonstrate that the proposed method effectively enables autonomous drifting, offering a significant improvement in control precision and computational efficiency compared to traditional approaches. This work opens up new possibilities for advanced autonomous driving applications where high-speed and precise control are crucial.
|
|
13:45-14:00, Paper TuB17.2 | |
No-Regret Model Predictive Control with Online Learning of Koopman Operators |
|
Zhou, Hongyu | University of Michigan |
Tzoumas, Vasileios | University of Michigan, Ann Arbor |
Keywords: Predictive control for nonlinear systems, Adaptive control, Optimal control
Abstract: We study a problem of simultaneous system identification and model predictive control of nonlinear systems. Particularly, we provide an algorithm for systems with unknown residual dynamics that can be expressed by Koopman operators. Such residual dynamics can model external disturbances and modeling errors, such as wind and wave disturbances to aerial and marine vehicles, or inaccurate model parameters. The algorithm has finite-time near-optimality guarantees and asymptotically converges to the optimal non-causal controller. Specifically, the algorithm enjoys sublinear dynamic regret, defined herein as the suboptimality against an optimal clairvoyant controller that knows how the unknown dynamics will adapt to its states and actions. To this end, we assume the algorithm is given Koopman observable functions such that the unknown dynamics can be approximated by a linear dynamical system. Then, it employs model predictive control based on the current learned model of the unknown dynamics. This model is updated online using least squares in a self-supervised manner based on the data collected while controlling the system. We validate our algorithm in physics-based simulations of a cart-pole aiming to maintain the pole upright despite inaccurate model parameters.
|
|
14:00-14:15, Paper TuB17.3 | |
Handling Output Constraints in Control of Nonlinear Systems Using Koopman-Operator-Based Robust Reference Governor |
|
Shi, Yao | Zhejiang University |
Wang, Yujia | National University of Singapore |
Wu, Zhe | National University of Singapore |
Keywords: Process Control, Machine learning, Constrained control
Abstract: We propose a data-driven robust reference governor (DRRG) framework to enforce output constraints in nonlinear systems with unknown dynamics and uncertainties. Leveraging the Koopman operator, DRRG maps complex dynamics into a higher-dimensional linear space for effective data-driven prediction. A data-driven maximal admissible set (MAS) and a min-max optimization problem are then formulated to compute robust reference signals. The proposed approach enhances robustness against uncertainties while preserving existing control architectures and simplifying controller tuning. Finally, a numerical simulation demonstrates its effectiveness.
|
|
14:15-14:30, Paper TuB17.4 | |
Performance-Oriented Data-Driven Control: Fusing Koopman Operator and MPC-Based Reinforcement Learning |
|
Nejatbakhsh Esfahani, Hossein | Clemson University |
Vaidya, Umesh | Clemson University |
Mohammadpour Velni, Javad | Clemson University |
Keywords: Predictive control for nonlinear systems, Data driven control, Reinforcement learning
Abstract: This paper develops the machinery of Koopman-based Model Predictive Control (KMPC) design, where the Koopman derived model is unable to capture the real nonlinear system perfectly. We then propose to use an MPC-based reinforcement learning within the Koopman framework combining the strengths of MPC, Reinforcement Learning (RL), and the Koopman Operator (KO) theory for an efficient data-driven control and performance-oriented learning of complex nonlinear systems. We show that the closed-loop performance of the KMPC is improved by modifying the KMPC objective function. In practice, we design a fully parameterized KMPC and employ RL to adjust the corresponding parameters aiming at achieving the best achievable closed-loop performance.
|
|
14:30-14:45, Paper TuB17.5 | |
Data-Driven Koopman Operator-Based Prediction and Control Using Model Averaging |
|
Uchida, Daisuke | University of Michigan |
Duraisamy, Karthik | University of Michigan |
Keywords: Learning, Nonlinear systems identification, Identification for control
Abstract: This work presents a data-driven Koopman operator-based modeling method using a model averaging technique. While the Koopman operator has been used for data-driven modeling and control of nonlinear dynamics, it is challenging to accurately reconstruct unknown dynamics from data and perform different decision-making tasks, mainly due to its infinite dimensionality and difficulty of finding invariant subspaces. We utilize ideas from a Bayesian inference-based model averaging technique to devise a data-driven method that first populates multiple Koopman models starting with a feature extraction using neural networks and then computes point estimates of the posterior of predicted variables. Although each model in the ensemble is not likely to be accurate enough for a wide range of operating points or unseen data, the proposed weighted linear embedding model combines the outputs of model ensemble aiming at compensating the modeling error of each model so that the overall performance will be improved.
|
|
14:45-15:00, Paper TuB17.6 | |
Koopman Operator Based Linear Model Predictive Control for 2D Quadruped Trotting, Bounding, and Gait Transition |
|
Yang, Chun-Ming | University of Illinois Chicago |
Bhounsule, Pranav | University of Illinois at Chicago |
Keywords: Nonlinear systems identification, Predictive control for linear systems, Mechanical systems/robotics
Abstract: Online optimal control of quadrupedal robots would enable them to plan their movement in novel scenarios. Linear Model Predictive Control (LMPC) has emerged as a practical approach for real-time control. In LMPC, an optimization problem with a quadratic cost and linear constraints is formulated over a finite horizon and solved on the fly. However, LMPC relies on linearizing the equations of motion (EOM), which may lead to poor solution quality. In this paper, we use Koopman operator theory and the Extended Dynamic Mode Decomposition (EDMD) to create a linear model of the system in high dimensional space, thus retaining the nonlinearity of the EOM. We model the aerial phase and ground contact phases using different linear models. Then, using LMPC, we demonstrate bounding, trotting, and bound-to-trot and trot-to-bound gait transitions in level and rough terrains. The main novelty is the use of Koopman operator theory to create hybrid models of a quadrupedal system and demonstrate the online generation of multiple gaits and gaits transitions.
|
|
TuB18 |
Director's Row E |
Estimation and Control of Distributed Parameter Systems I |
Invited Session |
Chair: Demetriou, Michael A. | Worcester Polytechnic Institute |
Co-Chair: Hu, Weiwei | University of Georgia |
Organizer: Demetriou, Michael A. | Worcester Polytechnic Institute |
Organizer: Hu, Weiwei | University of Georgia |
|
13:30-13:45, Paper TuB18.1 | |
Optimal and Adaptive Observers for Elliptic PDEs with Unknown Source Intensity Via Asymptotic Embedding Methods (I) |
|
Demetriou, Michael A. | Worcester Polytechnic Institute |
Keywords: Distributed parameter systems, Estimation, Adaptive systems
Abstract: This paper proposes a method to adaptively estimate static maps, representing spatially varying functions, by viewing them as solutions to elliptic partial differential equations (PDEs). The elliptic PDEs are assumed to have a known source function with an unknown source intensity and an unknown solution. By embedding the elliptic PDE into a parabolic PDE, a state and parameter estimator based on both the Kalman filter design and adaptive observer method is proposed. For both cases, the stability and convergence properties are presented. The benefit for this embedding approach is that the estimator for static maps no longer assumes a series expansion of the unknown spatially varying function with a prescribed and known series limit. Numerical results using both a Kalman filter and an adaptive observer demonstrate the proposed identifiers.
|
|
13:45-14:00, Paper TuB18.2 | |
Feedback Boundary Control Based on Cluster Reduced Order Modeling with Application to Convection-Diffusion (I) |
|
Wu, Tumin | University of Tennessee |
Wilson, Dan | University of Tennessee |
Djouadi, Seddik, M. | University of Tennessee |
Keywords: Reduced order modeling, Fluid flow systems, Control applications
Abstract: This paper presents a method to design feedback boundary controllers for nonlinear partial differential equations (PDEs) based on cluster reduced-order modeling. First, k-means clustering is introduced for snapshot solutions generated by the full-order simulation. The snapshots are grouped into several subregions over space, where the behavior has different features. Proper orthogonal decomposition (POD) is then applied locally within each cluster, which causes discontinuities of the POD basis at the cluster interfaces. Discontinuous-Galerkin (DG) projection is introduced to construct a more accurate reduced-order model than global POD. Open-loop simulations of the full and reduced order models with application to a convection-diffusion flow are compared to validate the efficiency of cluster reduced-order modeling. A linear quadratic regulator problem is formulated for the boundary control based on the reduced-order model and then applied to the full order flow. The efficiency of the proposed method is demonstrated in reduced and full order simulations.
|
|
14:00-14:15, Paper TuB18.3 | |
Finite Dimensional Observer Design for a Class of ODE-PDE Systems Involving Delay |
|
Cacace, Filippo | Universitŕ Campus Biomedico Di Roma |
Ahmed-Ali, Tarek | ENSICAEN |
Keywords: Distributed parameter systems, Delay systems, Observers for nonlinear systems
Abstract: We study the state estimation problem for a ODE-PDE delayed cascaded coupling. The delayed output of a nonlinear system in triangular form is the boundary condition of a 1-D linear parabolic system at one side, and the available measurement is taken at the opposite side. The observer of the parabolic system is based on the modal decomposition approach and it is finite dimensional. The nonlinear observer compensates the delay in the measurement. We prove that under a suitable delay bound the estimation error is bounded even when the dynamic of the parabolic system is unbounded.
|
|
14:15-14:30, Paper TuB18.4 | |
Chorin Projection Reduced Order Model for Control of Navier-Stokes Equations (I) |
|
Ravindran, S.S. | University of Alabama in Huntsville |
Keywords: Model/Controller reduction, Fluid flow systems, Distributed parameter systems
Abstract: This paper presents an efficient Chorin-projection reduced order model based on proper orthogonal decomposition (POD-ROM) for control of Navier-Stokes equations modeling viscous incompressible flows. The proposed POD-ROM is a velocity-pressure reduced-order model but decouples the computation of reduced-order velocity and pressure. Furthermore, it does not require satisfaction of the so-called inf-sup condition for mixed POD subspaces with the help of in-built pressure stabilization provided by the projection method without adding extra stabilization terms. We derive error estimates for the state, adjoint and control variables. Numerical studies are performed to discuss the accuracy and performance of the new Chorin- projection reduced order model in the simulation of control of flow past a backward-facing step channe
|
|
14:30-14:45, Paper TuB18.5 | |
Stabilization of an Unstable Reaction-Diffusion PDE with Input Delay Despite State and Input Quantization (I) |
|
Koudohode, Mahuklo Florent | Technical University of Crete |
Bekiaris-Liberis, Nikolaos | Technical University of Crete |
Keywords: Distributed parameter systems, Quantized systems, Switched systems
Abstract: We solve the global asymptotic stability problem of an unstable reaction-diffusion Partial Differential Equation (PDE) subject to input delay and state quantization developing a switched predictor-feedback law. To deal with the input delay, we reformulate the problem as an actuated transport PDE coupled with the original reaction-diffusion PDE. Then, we design a quantized predictor-based feedback mechanism that employs a dynamic switching strategy to adjust the quantization range and error over time. The stability of the closed-loop system is proven properly combining backstepping with a small-gain approach and input-to-state stability techniques, for deriving estimates on solutions, despite the quantization effect and the system's instability. We also extend this result to the input quantization case.
|
|
14:45-15:00, Paper TuB18.6 | |
Stabilization of Predator-Prey Age-Structured Hyperbolic PDE When Harvesting Both Species Is Inevitable (I) |
|
Veil, Carina | University of Stuttgart |
Krstic, Miroslav | University of California, San Diego |
Karafyllis, Iasson | National Technical University of Athens |
Diagne, Mamadou | University of California San Diego |
Demir, Cenk | University of California, San Diego |
Sawodny, Oliver | University of Stuttgart |
Keywords: Distributed parameter systems, Lyapunov methods, Systems biology
Abstract: Age-structured models describe the dynamic behaviors of populations over time and result in integro-partial differential equations (IPDEs). These models are useful to represent a multitude of processes in biotechnology or economics. Single population models are, for example, used to control the harvest rate of a chemostat in order to maximize the yield of a process. Age-structured population models with more than one species, leading to coupled IPDEs, are relevant for epidemics or ecology, but have received little attention in the literature. In this work, we present a model for two interacting populations in a predator-prey setup, whose input is the inevitable harvesting of both species, which represents a challenge for stabilization. The model is transformed to a system of two coupled ordinary differential equations (ODEs) actuated by the input, and two autonomous but exponentially stable integral delay equations (IDEs). The controllable ODE is stabilized through a weighted Control Lyapunov Function (CLF) feedback. We establish that the CLF-based control law exclusively derived from the ODE system dynamics, locally stabilizes the transformed ODE-IDE system.
|
|
TuB19 |
Director's Row H |
Student Best Paper Award |
Regular Session |
Chair: Uribe, Cesar A. | Rice University |
Co-Chair: Welikala, Shirantha | Stevens Institute of Technology |
|
13:30-13:45, Paper TuB19.1 | |
Co-Investment with Payoff Sharing Benefit Operators and Users in Network Design |
|
He, Mingjia | ETH Zurich |
Censi, Andrea | ETH Zurich |
Frazzoli, Emilio | ETH Zürich |
Zardini, Gioele | Massachusetts Institute of Technology |
Keywords: Transportation networks, Cooperative control, Game theory
Abstract: Network-based complex systems are inherently interconnected, with the design and performance of subnetworks being interdependent. However, the decisions of self-interested operators may lead to suboptimal outcomes for users. In this paper, we consider the question of what cooperative mechanisms can benefit both operators and users simultaneously. We address this question in a game theoretical setting, integrating both non-cooperative and cooperative game theory. During the non-cooperative stage, subnetwork decision-makers strategically design their local networks. In the cooperative stage, the co-investment mechanism and the payoff-sharing mechanism are developed to enlarge collective benefits and fairly distribute them. A case study of the Sioux Falls network is conducted to demonstrate the efficiency of the proposed framework. The impact of this interactive network design on environmental sustainability, social welfare and economic efficiency is evaluated, along with an examination of scenarios involving regions with heterogeneous characteristics.
|
|
13:45-14:00, Paper TuB19.2 | |
Lyapunov and Converse Lyapunov Theorems for Fixed Time Stability of Continuous Autonomous Systems |
|
Verma, Kriti | Georgia Institute of Technology |
Haddad, Wassim M. | Georgia Inst. of Tech |
Keywords: Lyapunov methods, Stability of nonlinear systems, Spacecraft control
Abstract: In this paper, we develop new necessary and sufficient Lyapunov conditions for fixed time stability that subsume the classical fixed time stability results presented in the literature as special cases and provide an optimized estimate of the settling time bound that is less conservative than the existing results. The results are then used to address the problem of fixed time stabilization of a rigid spacecraft.
|
|
14:00-14:15, Paper TuB19.3 | |
Deep Reinforcement Learning for Intervention of Partially Observable Regulatory Networks |
|
Hosseini, Seyed Hamid | Northeastern University |
Imani, Mahdi | Northeastern University |
Keywords: Genetic regulatory systems, Markov processes, Reinforcement learning
Abstract: This paper presents a deep reinforcement learning framework for designing optimal intervention policies in Gene Regulatory Networks (GRNs) under partial observability. Existing methods often assume full observability of the system states, which is unrealistic in practice due to incomplete or noisy gene expression data. To address these limitations, we extend Boolean network models to include partial observability. The uncertainty in gene expression data and stochasticity in gene activities impacted by interventions are captured through the posterior distribution of states, called the belief state. We formulate the optimal intervention policy over the belief space, maximizing long-term rewards by reducing harmful gene activations while accounting for system and data uncertainties. Deep reinforcement learning, particularly deep Q-network (DQN), is developed to enable approximation of the optimal intervention policy at scale. Our analytical results demonstrate that the method converges to the optimal dynamic programming solution if the uncertainty in the gene state disappears. Numerical experiments on a melanoma gene regulatory network demonstrate the efficacy of the proposed approach, showing improved performance compared to existing methods in maintaining desirable system states and reducing the activation of cancer-related genes.
|
|
14:15-14:30, Paper TuB19.4 | |
Dissipativity-Based Distributed Droop-Free Control and Communication Topology Co-Design for DC Microgrids |
|
Najafirad, Mohammad Javad | Stevens Institute of Technology |
Welikala, Shirantha | Stevens Institute of Technology |
Keywords: Power systems, Distributed control, Control of networks
Abstract: This paper presents a novel dissipativity-based distributed droop-free control approach for voltage regulation in DC microgrids (MGs) comprised of an interconnected set of distributed generators (DGs), loads, and power lines. First, we describe the closed-loop DC MG as a networked system where the sets of DGs and lines (i.e., subsystems) are interconnected via a static interconnection matrix. This interconnection matrix demonstrates how the disturbances, inputs, and outputs of DGs and lines are connected with each other. Each DG has a local controller and a distributed global controller. To design the latter, we use the dissipativity properties of the subsystems and formulate a linear matrix inequality (LMI) problem. To support the feasibility of this problem, we next identify a set of necessary local conditions, which we then enforce in a specifically developed LMI-based local controller design process. In contrast to existing DC MG control solutions, our approach proposes a unified framework for co-designing the distributed controller and communication topology. As the co-design process is LMI-based, it can be efficiently implemented and evaluated. The proposed solution's effectiveness in terms of voltage regulation and current sharing is verified by simulating an islanded DC MG in a MATLAB/Simulink environment under different scenarios, such as load changes and topological constraint changes, and then comparing the performance with a recent droop control solution.
|
|
14:30-14:45, Paper TuB19.5 | |
Prevailing against Adversarial Noncentral Disturbances: Exact Recovery of Linear Systems with the L_1-Norm Estimator |
|
Kim, Jihun | University of California, Berkeley |
Lavaei, Javad | UC Berkeley |
Keywords: Linear systems, Identification, Optimization
Abstract: This paper studies the linear system identification problem in the general case where the disturbance is sub-Gaussian, correlated, and possibly adversarial. First, we consider the case with noncentral (nonzero-mean) disturbances for which the ordinary least-squares (OLS) method fails to correctly identify the system. We prove that the l_1-norm estimator accurately identifies the system under the condition that each disturbance has equal probabilities of being positive or negative. This condition restricts the sign of each disturbance but allows its magnitude to be arbitrary. Second, we consider the case where each disturbance is adversarial with the model that the attack times happen occasionally but the distributions of the attack values are arbitrary. We show that when the probability of having an attack at a given time is less than 0.5 and each attack spans the entire space in expectation, the l_1-norm estimator prevails against any adversarial noncentral disturbances and the exact recovery is achieved within a finite time. These results pave the way to effectively defend against arbitrarily large noncentral attacks in safety-critical systems.
|
|
14:45-15:00, Paper TuB19.6 | |
Convex Constrained Controller Synthesis for Evolution Equations |
|
Conger, Lauren | California Institute of Technology |
Leeman, Antoine | ETH Zurich |
Hoffmann, Franca | California Institute of Technology |
Keywords: Distributed control, Linear systems, Observers for Linear systems
Abstract: We propose a convex controller synthesis framework for a large class of constrained linear systems, including those described by (deterministic and stochastic) partial differential equations and integral equations, commonly used in fluid dynamics, thermo-mechanical systems, quantum control, or transportation networks. Most existing control techniques rely on a (finite-dimensional) discrete description of the system, via ordinary differential equations. Here, we work instead with more general (infinite-dimensional) Hilbert spaces. This enables the discretization to be applied after the optimization (optimize-then-discretize). Using output-feedback SLS, we formulate the controller synthesis as a convex optimization problem. Structural constraints like sensor and communication delays, and locality constraints, are incorporated while preserving convexity, allowing parallel implementation and extending key SLS properties to infinite dimensions. The proposed approach and its benefits are demonstrated on a linear Boltzmann equation.
|
|
TuB20 |
Director's Row I |
Estimation |
Regular Session |
Chair: Sanyal, Amit | Syracuse University |
Co-Chair: Wang, Miaomiao | Huazhong University of Science and Technology |
|
13:30-13:45, Paper TuB20.1 | |
Pose Averaging from Relative Translations Using a Riemannian Staircase |
|
Fontana, Ernesto | University of Parma |
Tron, Roberto | Boston University |
Keywords: Agents-based systems, Vision-based control, Decentralized control
Abstract: Localization via Pose Graph Optimization is a relevant task in both robotics and computer vision. Most formulations rely on the availability of relative rotations between nodes. However, this is a non-trivial assumption, as in many practical settings (e.g., vision-based camera systems) estimating relative rotations is hard. State-of-the-art methods for pose averaging such as SE-Sync are based on relaxations and are able to obtain low cost solutions, but require relative rotations. In this paper, we present an SE-Sync-style solution for translation-only pose averaging. Our method is based on an application of the Riemannian staircase, and we analyze the potential symmetries introduced by degenerate cases (nodes with only two translation measurements). In particular, we show that our method outperforms other baseline algorithms (such as block coordinate descent) in terms of precision and accuracy. The improvements are particularly apparent in the case of a random initial guess.
|
|
13:45-14:00, Paper TuB20.2 | |
Communication-Efficient Data Exchange for Decentralized Loop-Closure Detection in Collaborative SLAM |
|
Zhang, Haochang | Shandong University |
Zhao, Yixian | Zhejiang University |
Xu, Jinming | Zhejiang University |
Keywords: Optimization algorithms, Distributed control, Autonomous robots
Abstract: Inter-robot loop closure detection is crucial in Collaborative Simultaneous Localization and Mapping (CSLAM) as it integrates individual robot trajectories into a unified map. However, accurately identifying all overlapping observations among a large group of robots poses significant challenges due to the limited computational and communication resources of multi-robot systems. Existing approaches typically rely on central nodes to facilitate data exchange and become resource-intensive as the problem size increases, resulting in substantial overhead and limiting scalability. To address this issue, we propose a distributed method that decentralizes the execution of resource-adaptive algorithms, enabling efficient data transmission without relying on a central node. Experimental results show that the proposed method is computationally efficient, outperforming benchmark algorithms while closely matching the performance of centralized counterparts.
|
|
14:00-14:15, Paper TuB20.3 | |
Pose, Velocity and Landmark Position Estimation Using IMU and Bearing Measurements |
|
Wang, Miaomiao | Huazhong University of Science and Technology |
Tayebi, Abdelhamid | Lakehead University |
Keywords: Observers for nonlinear systems, Autonomous systems, Robotics
Abstract: This paper investigates the estimation problem of the pose (orientation and position) and linear velocity of a rigid body, as well as the landmark positions, using an inertial measurement unit (IMU) and a monocular camera. First, we propose a globally exponentially stable (GES) linear time-varying (LTV) observer for the estimation of body-frame landmark positions and velocity, using IMU and monocular bearing measurements. Thereafter, using the gyro measurements, some landmarks known in the inertial frame and the estimates from the LTV observer, we propose a nonlinear pose observer on SO(3)times mathbb{R}^3. The overall estimation system is shown to be almost globally asymptotically stable (AGAS) using the notion of almost global input-to-state stability (ISS). Interestingly, we show that with the knowledge (in the inertial frame) of a small number of landmarks, we can recover (under some conditions) the unknown positions (in the inertial frame) of a large number of landmarks. Numerical simulation results are presented to illustrate the performance of the proposed estimation scheme.
|
|
14:15-14:30, Paper TuB20.4 | |
Coordinated Relative Attitude Control and Synchronization of a Multi-Body Network of Vehicles |
|
Srinivasu, Neon | Syracuse University |
Safaei Hashkavaei, Nazanin | Syracuse University |
Sanyal, Amit | Syracuse University |
Butcher, Eric | University of Arizona |
Keywords: Algebraic/geometric methods, Lyapunov methods, Control of networks
Abstract: This work analyzes and develops some fundamental results for attitude consensus control of a network of rigid-body vehicles, considered as a multi-agent rigid body system (MARBS). The system is analyzed using a full rigid body dynamics model on TSO(3) for each vehicle (agent) in the network. Therefore, the state space of the system is TSO(3)^N, where N is the number of vehicles. Attitude synchronization control laws for each vehicle in the network to reach a consensus attitude with zero angular velocity are obtained, using a Morse-Lyapunov function. Some fundamental results on equilibria of the network under these attitude consensus control laws are obtained. We show that unlike cooperative control of multi-agent systems with highly simplified dynamics models for agents, like point particles or unicycles where the state space of the dynamics is modeled as a vector space, there are multiple equilibrium solutions possible for attitude consensus control laws for a MARBS with dynamics on TSO(3)^N. Further, the number of equilibria depends on the network graph topology. This is followed by numerical simulation results for two different network graphs, which show this network control framework to be effective in obtaining attitude consensus.
|
|
14:30-14:45, Paper TuB20.5 | |
Consistent Cooperative Visual-Inertial Navigation Based on Matrix Lie Group |
|
Zhou, Yizhi | Geroge Mason University |
Wang, Xuan | George Mason University |
Keywords: Estimation, Networked control systems, Autonomous robots
Abstract: This paper introduces a novel algorithm for consistent Cooperative Visual-Inertial Navigation (CVIN) tailored for multi-robot systems using matrix Lie groups. The approach enables multiple robots to collaboratively estimate both their states and environmental features by integrating their own sensor data with shared information from neighboring robots. This shared information, which consists of commonly observed environmental features, creates geometric constraints between robots, thereby enhancing the individual robots' state estimation accuracy. The proposed CVIN algorithm extends the Invariant Extended Kalman Filter (IEKF) from single-robot localization to a multi-robot framework, leveraging the geometric constraints between robots to further improve localization accuracy. Thanks to the inherent properties of invariant error, the algorithm naturally maintains the consistency of the multi-robot localization system, as rigorously proven through an observability analysis. Moreover, the algorithm is fully distributed, relying solely on each robot's local measurements and information shared by one-hop communication neighbors. This structure ensures both robustness and scalability. Extensive Monte Carlo simulations demonstrate the superior performance of the proposed method in accurately estimating robot states and environmental features in 3D environments.
|
|
14:45-15:00, Paper TuB20.6 | |
Geometric Nonlinear Filtering with Almost Global Convergence for Attitude and Bias Estimation on the Special Orthogonal Group |
|
Aslam, Farooq | Institute of Space Technology |
Haydar, Muhammad Farooq | Animal Dynamics Ltd |
Akhtar, Suhail | Institute of Space Technology |
Keywords: Algebraic/geometric methods, Kalman filtering, Aerospace
Abstract: This paper proposes a novel geometric nonlinear filter for attitude and bias estimation on the Special Orthogonal Group SO(3) using matrix measurements. The structure of the proposed filter is similar to that of the continuous-time deterministic multiplicative extended Kalman filter (MEKF). The main difference with the MEKF is the inclusion of curvature correction terms in both the filter gain and gain update equations. These terms ensure that the proposed filter, named the Generalized SO(3)-MEKF, renders the desired equilibrium of the estimation error system to be almost globally uniformly asymptotically stable (AGUAS). More precisely, the attitude and bias estimation errors converge uniformly asymptotically to zero for almost all initial conditions except those where the initial angular estimation error equals pi radians. Moreover, in the case of small estimation errors, the proposed generalized SO(3)-MEKF simplifies to the standard SO(3)-MEKF with matrix measurements. Simulation results indicate that the proposed filter has similar performance compared to the latter. Thus, the main advantage of the proposed filter over the MEKF is the guarantee of (almost) global uniform asymptotic stability.
|
|
TuB21 |
Director's Row J |
Hybrid Systems |
Regular Session |
Chair: Sanfelice, Ricardo G. | University of California at Santa Cruz |
Co-Chair: Zamani, Majid | University of Colorado Boulder |
|
13:30-13:45, Paper TuB21.1 | |
Hybrid Control of the Buck Converter for Global Asymptotic Stabilization |
|
Fang, Yusheng | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Lyapunov methods, Power electronics
Abstract: We consider the problem of globally controlling a DC-DC Buck converter. A constrained switched differential inclusion model is derived to capture all possible modes of operation of the Buck converter circuit. In contrast with the traditional pulse-width modulation control method, a control Lyapunov function-based controller is designed. A hybrid closed-loop system is formulated to combine the continuous dynamics of the converter circuit and the hybrid dynamics of the controller. The hybrid closed-loop system induces global asymptotic stabilization of a desired output voltage setpoint. Simulations are provided to validate the results.
|
|
13:45-14:00, Paper TuB21.2 | |
Verification of Discrete-Time Systems against Timed Automata Specifications |
|
Awan, Asad Ullah | Technical University of Munich |
Murali, Vishnu | University of Colorado Boulder |
Zamani, Majid | University of Colorado Boulder |
Keywords: Hybrid systems, Automata
Abstract: We consider the problem of verifying discrete-time dynamical systems against properties specified as universal timed co-Buchi automata. Universal co-Buchi automata capture many important properties such as safety, liveness, and those specified in Linear Temporal Logic. However, such automata do not consider timing constraints. We thus consider the problem of verification against timed automata which combine such properties with timing constraints. Our verification approach relies on first constructing a product of the system, the states of the timed automata, and the valuations of the clocks of the automata. To show that the traces of the system are accepted by the automata, we seek to ensure that they correspond to runs that visit a set of co-Buchi states only finitely often. To prove this, we append a counter value to the product that keeps track of the number of visitations to relevant co-Buchi states. We then search for a so-called timed co-Buchi barrier certificate (TCBC) to show that these states are visited only finitely often. We present a satisfiability modulo theory (SMT)-based approach to find these certificates. Finally, we demonstrate our approach on some case studies.
|
|
14:00-14:15, Paper TuB21.3 | |
On Robust Stability of Hybrid Limit Cycles in the Impulsive Goodwin's Oscillator |
|
Lou, Xuyang | Jiangnan University |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Stability of hybrid systems, Biological systems
Abstract: The importance of pulse modulated regulation in non-basal testosterone secretion in males has motivated research to understand properties of periodic solutions to impulsive Goodwin's oscillators (IGOs). Despite the fruitful work studying IGOs, a result certifying robustness of asymptotically stable hybrid limit cycles is not available. In this paper, the IGO with a third-order continuous part of GnRH-LH-Te axis in males is described and analyzed within a hybrid systems framework. The notion of hybrid limit cycle is introduced and results on their existence are proposed for the IGO system. A sufficient condition related to Schur stability of the Jacobian of a hybrid Poincare map is presented for stability of hybrid limit cycles. In addition, we establish robustness properties to perturbations of stable hybrid limit cycles and validate the results numerically.
|
|
14:15-14:30, Paper TuB21.4 | |
Control of an Adsorption Cooling Facade System – Deep Reinforcement Learning for a Hybrid Dynamical System |
|
Daiber, Robin | University of Stuttgart |
Gschweng, Melanie | University of Stuttgart |
Sawodny, Oliver | University of Stuttgart |
Böhm, Michael | University of Stuttgart |
Keywords: Control applications, Reinforcement learning, Hybrid systems
Abstract: The operation of complex systems often requires balancing of conflicting goals. This also applies to the adsorption cooling facade system (AFS) that provides cooling power through a solar-driven adsorption-desorption cycle. Operation of the AFS is described with discrete states, called phases, that represent the different operational modes depending on, e. g., user requirements and weather conditions. In this hybrid system, transitions between phases are subject to state constraints, such as pressure conditions, and the state of switching valves represented by binary inputs. Using the example of the adsorption facade, this work adapts its hybrid system model to deep reinforcement learning (DRL) ensuring compliance of phase transitions with possible switching constraints. Exploiting this technique, an operational strategy based on DRL is developed. The choice of reward function is explained in detail, as it is crucial to the success of DRL-based policies. To illustrate the benefits of the DRL-based policy, it is compared to a conventional state-of-the-art rule-based operational strategy using a high-fidelity simulation model.
|
|
14:30-14:45, Paper TuB21.5 | |
Inferring Cell Size Control Mechanisms through Stochastic Hybrid Modeling |
|
Rezaee, Sayeh | University of Delaware |
Nieto, Cesar | University of Delaware |
Vargas-Garcia, Cesar A. | AGROSAVIA |
Singh, Abhyudai | University of Delaware |
Keywords: Systems biology, Stochastic systems, Hybrid systems
Abstract: Recent studies combining cell size dynamics measurements with mathematical modeling have uncovered how living cells regulate their division rates to buffer statistical size fluctuations around a target setpoint. Building on previous work, we propose a framework based on stochastic hybrid systems (SHS), where cell size grows according to an arbitrary ordinary differential equation, and division occurs probabilistically at a size-dependent rate. We propose different forms of division rates that capture the distribution of added size from cell birth to division, implementing size control via three models: Adder (division occurs when the added size reaches a prescribed threshold); sizer (division occurs when the cell reaches a prescribed size) or adder-sizer mixture models. The proposed division rates are corroborated with data from exponentially growing bacterial cells. We further show how solving the underlying Chapman-Kolmogorov equation for the SHS provides transient solutions for the cell size distribution and its statistical moments, which can be further tested through experimental tracking of cell size over time. In summary, this contribution provides novel theoretical tools for characterizing cell size homeostasis mechanisms in diverse proliferating cell types, offering experimentally testable predictions and a framework that can be generalized to model clonal expansion of cells.
|
|
14:45-15:00, Paper TuB21.6 | |
Relaxed Lyapunov Conditions for Compact Sets in Dynamical Systems |
|
Wintz, Paul K. | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Lyapunov methods, Stability of hybrid systems, Stability of nonlinear systems
Abstract: In the setting of continuous-time, discrete-time, and hybrid systems, including differential inclusions and difference inclusions, relaxations are given for Lyapunov functions to establish uniform global pre-asymptotic stability (UGAS) of compact sets. It is shown that for a compact set, if there exist a Lyapunov function and two lower semicontinuous functions that are positive definite with respect to the compact set and whose negations are upper bounds on the rate of change of the Lyapunov function during flows and jumps, respectively, then the compact set is UGAS. Under additional regularity conditions, conditions sufficient to show that a compact set is UGAS are further weakened to merely require the rate of change of the Lyapunov function is negative definite. Simplified conditions on hybrid time domains, compared to existing results, are given to establish that a set is UGAS for hybrid systems when the Lyapunov function is merely nonincreasing during either flows or jumps.
|
|
TuC01 |
Plaza AB |
Data-Driven Control I |
Regular Session |
Chair: Yame, Joseph Julien | Université De Lorraine |
Co-Chair: Rantzer, Anders | Lund University |
|
15:30-15:45, Paper TuC01.1 | |
Data-Driven Adaptive Dispatching Policies for Processing Networks |
|
Bencherki, Fethi | Lund University |
Rantzer, Anders | Lund University |
Keywords: Data driven control, Compartmental and Positive systems, Control of networks
Abstract: The paper presents and analyzes an adaptive data-driven controller that learns the optimal processing rate in a multi-unit processing network in the presence of disturbances. We formulate an optimization problem of linear cost, linear dynamics for the processing network model and an affine constraint on the dispatcher policy. A data-driven linear equation is constructed, based on which the online dispatcher policy is updated. An upper bound on the gap between the optimal cost and the cost incurred by the data-driven controller is extracted.
|
|
15:45-16:00, Paper TuC01.2 | |
Probabilistic Data-Driven Invariance for Constrained Control of Nonlinear Systems |
|
Kashani, Ali | University of New Mexico |
Strong, Amy | Duke University |
Bridgeman, Leila J. | Duke University |
Danielson, Claus | University of New Mexico |
Keywords: Data driven control, Constrained control, Switched systems
Abstract: We present a novel direct data-driven method for computing constraint-admissible positive invariant sets for general nonlinear systems with compact constraint sets. Our approach employs machine learning techniques to lift the state space and approximate invariant sets using finite data. The invariant sets are parameterized as sublevel-sets of linear functions in the lifted space, which is suitable for control applications. We provide probabilistic guarantees of invariance through scenario optimization, with probability bounds on robustness against the uncertainty inherent in the data-driven framework. As the amount of data increases, these probability bounds approach 1. We use our invariant sets to design a model-free switched controller for nonlinear systems, which selects constraintenforcing controllers from a set of existing controllers. We demonstrate the practicality of our method by applying it to a nonlinear autonomous driving lane-keeping scenario.
|
|
16:00-16:15, Paper TuC01.3 | |
Data-Driven Linear Quadratic Control of Multizone Building VAV Units Using Q-Learning |
|
Yame, Joseph Julien | Université De Lorraine |
Jamouli, Hicham | National School of Applied Sciences, Ibn Zohr University |
Hamelin, Frederic | University of Lorraine |
Jha, Mayank Shekhar | University of Lorraine |
Keywords: Building and facility automation, Reinforcement learning, Optimal control
Abstract: This paper introduces an innovative data-driven control methodology for variable air volume (VAV) HVAC systems in non-residential buildings with fluctuating occupancy patterns. A reinforcement learning approach leveraging model-free optimal linear quadratic control principles is developed. The algorithm utilizes Bellman dynamic programming to derive a quality function that enables control decisions based entirely on system-generated data, encompassing both building dynamics and occupant behavior. The approach is validated through simulations conducted on a recently installed HVAC-VAV system in a university building. Results demonstrate the method's effectiveness in maintaining optimal thermal comfort while minimizing airflow requirements of VAV units, directly correlating with reduced energy consumption per room. This approach proves particularly valuable in non-residential settings where occupancy levels vary significantly and unpredictably throughout the day.
|
|
16:15-16:30, Paper TuC01.4 | |
Data-Driven Controllability and Controller Designs for Nabla Fractional Order Systems |
|
Cao, Shiang | MESA Lab at C Merced |
Chen, YangQuan | University of California, Merced |
Keywords: Data driven control, Linear systems, Optimal control
Abstract: This paper presents a data-driven approach to assess the controllability of discrete fractional-order systems using the nabla difference operator. The paper also proposes a data-driven approximation method for these systems, grounded in behavioral system theory. Instead of identifying a model that replicates the input-output dynamics, a direct modification was applied to the collected input-output data by solving a Hankel-structured low-rank approximation problem. The performance of the approximated nonparametric model in system response simulation is compared with that of an ARX model. The results indicate that the proposed method has similar simulation performance with improved accuracy. Furthermore, leveraging this approximation, many data driven controllers can be designed. As an example, a data-driven predictive control strategy is designed and applied to a discrete fractional-order system. Simulation results demonstrate that the controller successfully drives the system outputs to the desired positions.
|
|
16:30-16:45, Paper TuC01.5 | |
Data-Driven Reachability Analysis for Nonlinear Systems |
|
Park, Hyunsang | Purdue University |
Vijay, Vishnu | Purdue University |
Hwang, Inseok | Purdue University |
Keywords: Data driven control, Optimization
Abstract: We consider the problem of forward reachability analysis of a black-box nonlinear system, using only the data from the system. We propose a method that computes an ellipsoidal set that tightly over-approximates the true reachable set using convex optimization. Exploiting the fact that a linear approximation of a nonlinear system is not unique, we find conditions of a linear time-varying system that approximates the nonlinear system such that its reachable set is guaranteed to include the reachable set of the unknown nonlinear system, textcolor{red}{ assuming that the Lipchitz coefficient of the nonlinear system is known.} Then, we formulate a convex optimization problem that jointly searches for the parameters of the linear system and its ellipsoidal over-approximate reachable set based only on the data to minimize the growth rate of the reachable set while ensuring the ellipsoid over-approximates the true reachable set. We demonstrate the advantages of the proposed method via two illustrative examples: an autonomous nonlinear system and the TRAF22 benchmark system, and compare the results with other state-of-the-art algorithms.
|
|
16:45-17:00, Paper TuC01.6 | |
Data-Driven Predictive Control of Bilinear HVAC Dynamics – an Experimental Case Study |
|
Bilgic, Deborah | Robert Bosch GmbH |
Harding, Alexander | Robert Bosch GmbH |
Faulwasser, Timm | Hamburg University of Technology |
Keywords: Data driven control, Predictive control for nonlinear systems, Building and facility automation
Abstract: Buildings are responsible for around 40% of the global energy demand. In order to effectively reduce the high energy consumption of HVAC systems while maintaining comfortable indoor climate, tailored control schemes are promising. Since the derivation of physical models of individual HVAC systems is time consuming, data-driven methods are a promising alternative. This paper proposes a framework for data-driven predictive control of HVAC system with bilinear system dynamics, which compensates for prediction errors via constraint adaptation through a bias term. The proposed scheme combines an extension of Willems’ fundamental lemma to bilinear systems with the consideration of multiple data-sets. To evaluate the efficacy of the data-driven control scheme, an experimental case study is performed under realistic conditions. In comparison with an existing simple control scheme, our results demonstrate energy efficient operation and successful compensation of prediction errors.
|
|
TuC02 |
Plaza DE |
Neural Networks I |
Regular Session |
Chair: Sidrane, Chelsea Rose | KTH Royal Institute of Technology |
Co-Chair: Koeln, Justin | University of Texas at Dallas |
|
15:30-15:45, Paper TuC02.1 | |
TTT: A Temporal Refinement Heuristic for Tenuously Tractable Discrete Time Reachability Problems |
|
Sidrane, Chelsea Rose | KTH Royal Institute of Technology |
Tumova, Jana | KTH Royal Institute of Technology |
Keywords: Formal verification/synthesis, Neural networks, Machine learning
Abstract: Reachable set computation is an important tool for analyzing control systems. Simulating a control system can show general trends, but a formal tool like reachability analysis can provide guarantees of correctness. Reachability analysis for complex control systems, e.g., with nonlinear dynamics and/or a neural network controller, is often either slow or overly conservative. To address these challenges, much literature has focused on spatial refinement, i.e., tuning the discretization of the input sets and intermediate reachable sets. This paper introduces the idea of temporal refinement: automatically choosing when along the horizon of the reachability problem to execute slow symbolic queries which incur less approximation error versus fast concrete queries which incur more approximation error. Temporal refinement can be combined with other refinement approaches as an additional tool to trade off tractability and tightness in approximate reachable set computation. We introduce a temporal refinement algorithm and demonstrate its effectiveness at computing approximate reachable sets for nonlinear systems with neural network controllers. We calculate reachable sets with varying computational budget and show that our algorithm can generate approximate reachable sets with a similar amount of error to the baseline in 20-70% less time.
|
|
15:45-16:00, Paper TuC02.2 | |
Lipschitz Constants of Hybrid Zonotope Representations of Feedforward Neural Networks |
|
Chen, Justin | University of Texas at Dallas |
Glunt, Jonah | The Pennsylvania State University |
Koeln, Justin | University of Texas at Dallas |
Pangborn, Herschel | The Pennsylvania State University |
Ruths, Justin | University of Texas at Dallas |
Keywords: Neural networks, Computational methods
Abstract: Verifying the robustness of neural network outputs to perturbations in inputs is a key criterion for integrating them as part of any commercial or safety-critical application. The Lipschitz constant--a measure of the steepness of the surface--has been the standard statistic used to quantify input sensitivity. Recent work has established that hybrid zonotopes can exactly represent ReLU feedfoward networks. Here we expand this exactness to neural networks with any piecewise affine activation function and discuss tight approximations of neural networks with smooth activation functions. We leverage the hybrid zonotope representation to efficiently calculate exact Lipschitz constants and further present the opportunity to develop novel, more informative statistics for neural network verification.
|
|
16:00-16:15, Paper TuC02.3 | |
Early Stopping Strategy Using Neural Tangent Kernel Theory and Rademacher Complexity |
|
Martin Xavier, Daniel | Université Paris-Saclay, CentraleSupélec, ENS Paris-Saclay, CNRS |
Chamoin, Ludovic | Université Paris-Saclay, CentraleSupélec, ENS Paris-Saclay, CNRS |
Fribourg, Laurent | CNRS |
Keywords: Neural networks, Predictive control for nonlinear systems, Network analysis and control
Abstract: The early stopping strategy consists in stopping the training process of a neural network (NN) on a set S of input data before training error is minimal. The advantage is that the NN then retains good generalization properties, i.e. it gives good predictions on data outside S, and a good estimate of the statistical error (“population loss”) is obtained. Using the theories of Rademacher complexity and neural tangent kernel, we give here two stopping strategies that minimize upper bounds on the population loss. These methods are well-suited to the underparameterized context (where the number of parameters is moderate compared with the number of data). They are illustrated on the example of an NN simulating the model predictive control of a Van der Pol oscillator.
|
|
16:15-16:30, Paper TuC02.4 | |
A Guaranteed-Stable Neural Network Approach for Optimal Control of Nonlinear Systems |
|
Li, Anran | Washington State University |
Swensen, John | Washington State University |
Hosseinzadeh, Mehdi | Washington State University |
Keywords: Neural networks, Predictive control for nonlinear systems, Optimization
Abstract: A promising approach to optimal control of nonlinear systems involves iteratively linearizing the system and solving an optimization problem at each time instant to determine the optimal control input. Since this approach relies on online optimization, it can be computationally expensive, and thus unrealistic for systems with limited computing resources. One potential solution to this issue is to incorporate a Neural Network (NN) into the control loop to emulate the behavior of the optimal control scheme. Ensuring stability and reference tracking in the resulting NN-based closed-loop system requires modifications to the primary optimization problem. These modifications often introduce non-convexity and nonlinearity with respect to the decision variables, which may surpass the capabilities of existing solvers and complicate the generation of the training dataset. To address this issue, this paper develops a Neural Optimization Machine (NOM) to solve the resulting optimization problems. The central concept of a NOM is to transform the optimization challenges into the problem of training a NN. Rigorous proofs demonstrate that when a NN trained on data generated by the NOM is used in the control loop, all signals remain bounded and the system states asymptotically converge to a neighborhood around the desired equilibrium point, with a tunable proximity threshold. Simulation and experimental studies are provided to illustrate the effectiveness of the proposed methodology.
|
|
16:30-16:45, Paper TuC02.5 | |
Improved Mass Conservation of Control-Oriented Models of Two-Phase Thermal Systems Using Neural Networks |
|
Gomez, Alexander | University of Texas at Dallas |
Shaikh, Juned | University of Texas at Dallas |
Koeln, Justin | University of Texas at Dallas |
Keywords: Reduced order modeling, Simulation, Control applications
Abstract: This paper presents a systematic approach for representing two-phase refrigerant fluid properties as neural networks. In deriving control-oriented models of two-phase thermal systems, conservation of mass and conservation of energy are used to derive differential equations for each component in the system. However, due to steep nonlinearities of refrigerant density at the saturated liquid boundary, traditional implementations of fluid properties often result in a system model that fails to conserve mass. Rapidly changing density can also lead to very small time steps when using variable-step solvers to simulate these systems and prevent the use of fixed-step solvers with step sizes large enough for producing discrete-time models used for control. To overcome these challenges, the proposed approach smooths the refrigerant density data, fits a shallow feed-forward neural network to this smoothed data, and explicitly differentiates this neural network to represent the partial derivatives of density that appear in the model. At the cost of introducing some model error, using a neural network to represent the smoothed refrigerant density and its derivatives is shown to increase the overall simulation efficiency of two-phase thermal systems models while conserving mass.
|
|
16:45-17:00, Paper TuC02.6 | |
Efficient Reachability Analysis for Convolutional Neural Networks Using Hybrid Zonotopes |
|
Zhang, Yuhao | University of Wisconsin-Madison |
Xu, Xiangru | University of Wisconsin-Madison |
Keywords: Neural networks, Intelligent systems
Abstract: Feedforward neural networks are extensively used in autonomous systems, particularly for control and perception tasks within the system loop. However, their susceptibility to adversarial attacks necessitates formal verification before deployment in safety-critical applications. Existing set propagation-based methods for reachability analysis of feedforward neural networks often struggle to balance scalability and accuracy. This work introduces a novel set-based method for computing reachable sets of convolutional neural networks. The proposed approach utilizes a hybrid zonotope set representation and an efficient neural network reduction technique, offering the flexibility to balance computational complexity and approximation accuracy. Numerical examples are provided to demonstrate the performance of the proposed method.
|
|
TuC03 |
Plaza CF |
Safe Control I |
Regular Session |
Chair: Seiler, Peter | University of Michigan, Ann Arbor |
Co-Chair: Rober, Nicholas | MIT |
|
15:30-15:45, Paper TuC03.1 | |
ShieldNN: A Provably Safe NN Filter for Unsafe NN Controllers |
|
Ferlez, James | University of California, Irvine |
Elnaggar, Mahmoud | University of Virginia |
Shoukry, Yasser | University of California, Irvine |
Fleming, Cody | Iowa State University |
Keywords: Formal verification/synthesis, Neural networks, Autonomous systems
Abstract: In this paper, we develop a novel closed-form Control Barrier Function (CBF and associated controller shield for the Kinematic Bicycle Model (KBM) with respect to obstacle avoidance. The proposed CBF and shield --- designed by an algorithm we call ShieldNN --- provide two crucial advantages over existing methodologies. First, ShieldNN considers steering and velocity constraints directly with the non-affine KBM dynamics; this is in contrast to more general methods, which typically consider only affine dynamics and do not guarantee invariance properties under control constraints. Second, ShieldNN provides a closed-form set of safe controls for each state unlike more general methods which typically rely on optimization algorithms to generate a single instantaneous control for each state. Together, these advantages make ShieldNN uniquely suited as an efficient Multi-Obstacle Safe Actions (i.e multiple-barrier-function shielding) during training time of a Reinforcement Learning (RL) enabled Neural Network (NN) controller. We show via experiments that ShieldNN dramatically increases the completion rate of RL training episodes in the presence of multiple obstacles, thus establishing the value of ShieldNN in training RL-based controllers.
|
|
15:45-16:00, Paper TuC03.2 | |
Cooptimizing Safety and Performance with a Control-Constrained Formulation |
|
Wang, Hao | University of Southern California |
Dhande, Adityaya | Indian Institute of Technology Bombay |
Bansal, Somil | University of Southern California |
Keywords: Optimal control, Autonomous systems, Robotics
Abstract: Autonomous systems have witnessed a rapid increase in their capabilities, but it remains a challenge for them to perform tasks both effectively and safely. The fact that performance and safety can sometimes be competing objectives renders the cooptimization between them difficult. One school of thought is to treat this cooptimization as a constrained optimal control problem with a performance-oriented objective function and safety as a constraint. However, solving this constrained optimal control problem for general nonlinear systems remains challenging. In this work, we use the general framework of constrained optimal control, but given the safety state constraint, we convert it into an equivalent control constraint, resulting in a state and time-dependent control-constrained optimal control problem. This equivalent optimal control problem can readily be solved using the dynamic programming principle. We show the corresponding value function is a viscosity solution of a certain Hamilton-Jacobi-Bellman Partial Differential Equation (HJB-PDE). Furthermore, we demonstrate the effectiveness of our method with a two-dimensional case study, and the experiment shows that the controller synthesized using our method consistently outperforms the baselines, both in safety and performance. The implementation of the case study can be found on the project website (https://github.com/haowwang/cooptimize_safety_performance).
|
|
16:00-16:15, Paper TuC03.3 | |
Safe and Performant Control Via Efficient Overapproximation of the Reachable Set Probability Distribution |
|
Cao, Michael Enqi | Georgia Institute of Technology |
Coogan, Samuel | Georgia Institute of Technology |
Keywords: Predictive control for nonlinear systems, Robust control, Uncertain systems
Abstract: We consider a nonlinear system subject to an unknown state-dependent disturbance input and assume availability of state-dependent upper and lower bounds on the disturbance that hold with any user-prescribed probability available from, e.g., Gaussian Process estimation. Using methods from mixed monotone systems theory, we then propose an efficient technique for overbounding the probabilistic reachable set of the system for any prescribed probability. Next, we consider a reach-avoid control synthesis problem and propose using a weighted sum of reachability quantiles as the control objective to balance safety and performance. We show via a case study of a kinematic bicycle vehicle model that this approach generally outperforms using a single fixed probability bound.
|
|
16:15-16:30, Paper TuC03.4 | |
Formally Verified Physics-Informed Neural Control Lyapunov Functions |
|
Liu, Jun | University of Waterloo |
Fitzsimmons, Maxwell | University of Waterloo |
Zhou, Ruikun | University of Waterloo |
Meng, Yiming | University of Illinois Urbana-Champaign |
Keywords: Neural networks, Formal verification/synthesis, Lyapunov methods
Abstract: Control Lyapunov functions are a central tool in the design and analysis of stabilizing controllers for nonlinear systems. Constructing such functions, however, remains a significant challenge. In this paper, we investigate physics-informed learning and formal verification of neural network control Lyapunov functions. These neural networks solve a transformed Hamilton-Jacobi–Bellman equation, augmented by data generated using Pontryagin's maximum principle. Similar to how Zubov's equation characterizes the domain of attraction for autonomous systems, this equation characterizes the null-controllability set of a controlled system. This principled learning of neural network control Lyapunov functions outperforms alternative approaches, such as sum-of-squares and rational control Lyapunov functions, as demonstrated by numerical examples. As an intermediate step, we also present results on the formal verification of quadratic control Lyapunov functions, which, aided by satisfiability modulo theories solvers, can perform surprisingly well compared to more sophisticated approaches and efficiently produce global certificates of null-controllability.
|
|
16:30-16:45, Paper TuC03.5 | |
Stability Margins of Neural Network Controllers |
|
Junnarkar, Neelay | University of of California Berkeley |
Arcak, Murat | University of California, Berkeley |
Seiler, Peter | University of Michigan, Ann Arbor |
Keywords: Neural networks, Robust control, Reinforcement learning
Abstract: We present a method to train neural network controllers with guaranteed stability margins. The method is applicable to linear time-invariant plants interconnected with uncertainties and nonlinearities that are described by integral quadratic constraints. The type of stability margin we consider is the disk margin. Our training method alternates between a training step to maximize reward and a stability margin-enforcing step. In the stability margin enforcing-step, we solve a semidefinite program to project the controller into the set of controllers for which we can certify the desired disk margin.
|
|
16:45-17:00, Paper TuC03.6 | |
Safe Set-Theoretic Model Reference Adaptive Control with Concurrent Learning |
|
Sarioglu, Eren | Embry-Riddle Aeronautical University |
Kurttisi, Atahan | Embry-Riddle Aeronautical University |
Dogan, K. Merve | Embry-Riddle Aeronautical University |
Keywords: Adaptive control, Uncertain systems, Robust adaptive control
Abstract: Model reference adaptive control (MRAC) seeks to adjust the control law parameters such that the resulting closed-loop system behaves as closely as possible to the specified ideal reference model while dealing with the presence of uncertainties. In the context of this paper, a system is considered safe if the required states remain continuously within a predetermined safe set that can be enforced by safe reference commands using control barrier functions (CBFs). Also, it is essential to establish strict and predictable performance guarantees for reference model tracking to ensure safety not only in the steady state but also in the transient phase of the tracking. To this end, this study proposes a safe set-theoretic MRAC with CBF and concurrent learning methods. The efficacy of the method is shown through simulation studies.
|
|
TuC04 |
Governor's Sq. 15 |
Learning Interpretable Control Policies: Unifying Reinforcement Learning,
Differentiable Programming and Bayesian Optimization |
Tutorial Session |
Chair: Mesbah, Ali | University of California, Berkeley |
Co-Chair: Findeisen, Rolf | TU Darmstadt |
Organizer: Mesbah, Ali | University of California, Berkeley |
|
15:30-16:10, Paper TuC04.1 | |
Local-Global Learning of Interpretable Control Policies: The Interface between MPC and Reinforcement Learning (I) |
|
Banker, Thomas | University of California, Berkeley |
Lawrence, Nathan P. | University of California, Berkeley |
Mesbah, Ali | University of California, Berkeley |
Keywords: Reinforcement learning, Machine learning, Optimal control
Abstract: Making optimal decisions under uncertainty is a shared problem among distinct fields. While optimal control is commonly studied in the framework of dynamic programming, it is approached with differing perspectives of the Bellman optimality condition. In one perspective, the Bellman equation is used to derive a global optimality condition useful for iterative learning of control policies through interactions with an environment. Alternatively, the Bellman equation is also widely adopted to derive tractable optimization-based control policies that satisfy a local notion of optimality. By leveraging ideas from the two perspectives, we present a local-global paradigm for optimal control suited for learning interpretable local decision makers that approximately satisfy the global Bellman equation. The benefits and practical complications in local-global learning are discussed. These aspects are exemplified through case studies, which give an overview of two distinct strategies for unifying reinforcement learning and model predictive control. We discuss the challenges and trade-offs in these local-global strategies, towards highlighting future research opportunities for safe and optimal decision-making under uncertainty.
|
|
16:10-16:35, Paper TuC04.2 | |
Differentiable Predictive Control: From Offline Pre-Training to Safe Online Deployment (I) |
|
Drgona, Jan | Johns Hopkins University |
Keywords: Predictive control for nonlinear systems
Abstract: This talk presents differentiable programming (DP) for domain-aware learning for dynamical systems and control. We introduce differentiable predictive control (DPC), a data-driven, model-based policy optimization approach for solving parametric model predictive control (MPC) problems through offline gradient-based optimization. We show how to use recent developments in control barrier functions, and neural Lyapunov functions to obtain online performance guarantees for these pre-trained neural control policies. We also show how to utilize an online adaptation of the pre-trained control policies to handle steady-state errors caused by the plant-model mismatch. We demonstrate the performance of these new DP-based methods in a range of simulation case studies, including building control, dynamic economic dispatch, and mechatronic devices with fast real-time deployment in embedded hardware.
|
|
16:35-17:00, Paper TuC04.3 | |
Bayesian Optimization for Closed-Loop Learning of Model Predictive Control Parameters (I) |
|
Findeisen, Rolf | TU Darmstadt |
|
TuC05 |
Governor's Sq. 9 |
Biomedical Control Applications |
Regular Session |
Chair: Kwon, Joseph | Texas A&M University |
Co-Chair: Stolpe, Phoebus Raphael | Maastricht University |
|
15:30-15:45, Paper TuC05.1 | |
Pareto-Optimal Interventions in Gene Regulatory Networks Using Signal Temporal Logic |
|
Hosseini, Seyed Hamid | Northeastern University |
Aksaray, Derya | Northeastern University |
Imani, Mahdi | Northeastern University |
Keywords: Genetic regulatory systems, Stochastic systems, Optimization
Abstract: This paper presents a framework for identifying Pareto-optimal intervention policies in Gene Regulatory Networks (GRNs), addressing both the complexity and uncertainty inherent in biological systems. Existing methods, such as dynamic programming and reinforcement learning, focus primarily on average intervention performance. However, practical interventions in systems biology must account for multiple competing objectives, including worst-case performance, response time, intervention frequency, and long-term system stability. To model the stochastic dynamics of GRNs, this paper employs Boolean networks with perturbations (BNp) and formulates the intervention problem as a constrained multi-objective optimization task. Signal Temporal Logic (STL) is leveraged to evaluate policies, particularly focusing on maximizing intervals free of therapeutic side effects and minimizing repeated interventions. Our method generates a Pareto-optimal set of policies, providing biologists with a flexible range of solutions tailored to specific experimental needs. Numerical experiments demonstrate the effectiveness of our approach in achieving robust and efficient intervention performance.
|
|
15:45-16:00, Paper TuC05.2 | |
Transformer-Based QSPR Modeling for Complex Molecular Systems: A Case Study on Ionic Liquids |
|
Khambhawala, Aahil | Texas A&M University |
Lee, Chi Ho | Texas A&M University |
Pahari, Silabrata | Texas A&M |
Nancarrow, Paul | American University of Sharjah |
Jabbar, Nabil | American University of Sharjah |
El-Halwagi, Mahmoud | Texas A&M University |
Kwon, Joseph | Texas A&M University |
Keywords: Computational methods, Machine learning, Neural networks
Abstract: Quantitative structure-property relationship (QSPR) models are widely used for predicting molecular properties, yet they often struggle with highly complex and non-linear systems, such as ionic liquids (ILs), polymers, and supramolecular complexes. Traditional models, including machine learning approaches like deep neural networks (DNNs) and random forest regressors (RFRs), rely on predefined descriptors, which limit their ability to generalize across diverse chemical datasets. To address these limitations, we propose a transformer-based approach to QSPR modeling. Transformers, initially developed for natural language processing, capture long-range dependencies and model nonlinear relationships by directly learning from raw molecular data without predefined features. In this study, we applied a transformer architecture to predict the melting points of 902 ionic liquids, a highly diverse and complex chemical system. Our model achieved excellent predictive performance, with an R˛ score of 0.98 across the entire dataset, a root mean square error (RMSE) of 14.42 K, and robust generalizability (R˛ of 0.912 on test data). Compared to traditional QSPR methods, our transformer model demonstrated superior accuracy and generalization capabilities, making it a powerful tool for predicting properties in complex molecular systems and guiding the design of new compounds in practical applications.
|
|
16:00-16:15, Paper TuC05.3 | |
Optimal Process Design through Compartment Modeling: Spatiotemporal Analysis for Industry-Scale Fermentation Systems |
|
Shah, Parth | Texas A&M University |
Nagpal, Satchit | Texas A&M University |
Kim, Jun-Woo | CJ CheilJedang |
Park, Sang-Min | CJ CheilJedang |
Cho, Jaehoon | CJ CheilJedang |
Kim, Jeong-Ho | CJ CheilJedang |
Kwak, Dong-Hun | CJ CheilJedang |
Kwon, Joseph | Texas A&M University |
Keywords: Computational methods, Time-varying systems, Biological systems
Abstract: Large-scale bioreactors often experience spatial heterogeneity in substrate and oxygen concentrations due to insufficient mixing, impacting productivity and product quality. Traditional computational fluid dynamics (CFD) methods provide valuable insights into these mixing patterns but are computationally expensive, limiting their use to transient snapshots rather than full-process simulations. This study introduces a novel compartment modeling approach that integrates CFD-derived hydrodynamics with microbial kinetics. The bioreactor is divided into ideally mixed compartments, each characterized by axial and radial velocity distributions. This allows the model to capture spatiotemporal variations in key variables, such as biomass, substrate, and product concentrations, throughout the entire fermentation process. The model is validated against industrial-scale data from a 525 kL fermenter, demonstrating high accuracy in predicting the evolution of process states. Moreover, it significantly reduces computational time compared to traditional CFD, making it a practical tool for optimizing bioprocesses through improved process design. By identifying suboptimal zones and improving reactor efficiency, this approach offers a powerful alternative for large-scale fermentation optimization. Future efforts will focus on incorporating oxygen transfer limitations and extending the model’s applicability to other industrial systems.
|
|
16:15-16:30, Paper TuC05.4 | |
Dynamical Grounding: Closed-Loop Control to Evaluate Functional Neural Models, Application to Spinal Pathway |
|
Stolpe, Phoebus Raphael | Maastricht University |
Morel, Yannick | Maastricht University, Faculty of Psychology |
Keywords: Biological systems, Lyapunov methods, Predictive control for nonlinear systems
Abstract: This paper presents a framework supporting enforcement of functional constraints for a range of computational neural models relating to motor control. It builds upon a control structure addressing the tracking problem for a class of neuro-musculoskeletal systems. We illustrate, through a specific example, the manner in which it may be used to investigate functional efficacy of a class of spinal pathway models. Specifically, we assess efficacy of a stretch-reflex model in fulfilling its expected function and compare it to performance to an alternative model proposed here. A discussion of the manner in which the framework can be employed to help constrain a broad range of neural models concludes this paper.
|
|
16:30-16:45, Paper TuC05.5 | |
Consequences of Decoy Site Repair on Stochastic Fluctuations in Neurotransmission |
|
Gambrell, Oliver | University of Delaware |
Singh, Abhyudai | University of Delaware |
Keywords: Biological systems, Stochastic systems, Hybrid systems
Abstract: Neurons form the fundamental unit of the central nervous system with the human brain containing close to 100 billion neurons. We present a systems-level model of a chemical synapse by which signals from a presynaptic neuron are transmitted to a postsynaptic neuron. In this model, neurotransmitter-filled synaptic vesicles (SVs) dock with a given rate at a fixed number of docking sites in the axon terminal of the presynaptic neuron. Upon the arrival of an action potential (AP), each docked SV has a certain probability to fuse with the presynaptic membrane and release neurotransmitters into the synaptic cleft. After the SV fusion event, the corresponding docking site undergoes repair before becoming available to be reoccupied by an SV. We develop a stochastic model of these coupled processes and derive exact analytical results quantifying the mean and the degree of random fluctuations (i.e., noise) in the levels of docked SVs and released neurotransmitters in response to a train of APs. Our results show that the repair of docking sites exacerbates synaptic depression, i.e., reduces the ability of the chemical synapse to release neurotransmitters in response to an AP. Moreover, repair amplifies statistical fluctuations in neurotransmission for fixed mean neurotransmitter levels.
|
|
TuC06 |
Governor's Sq. 10 |
Stochastic Optimal Control |
Regular Session |
Chair: Braatz, Richard D. | Massachusetts Institute of Technology |
Co-Chair: Vlahakis, Eleftherios | KTH Royal Institute of Technology |
|
15:30-15:45, Paper TuC06.1 | |
On Risk-Sensitive Decision Making under Uncertainty |
|
Hsieh, Chung-Han | National Tsing Hua University |
Wong, Yi-Shan | National Tsing Hua University |
Keywords: Stochastic systems, Control applications, Finance
Abstract: This paper studies a risk-sensitive decision-making problem under uncertainty. It considers a decision-making process that unfolds over a fixed number of stages, in which a decision-maker chooses among multiple alternatives, some of which are deterministic and others stochastic. The decision-maker's cumulative value is updated at each stage, reflecting the outcomes of the chosen alternatives. After formulating this as a stochastic control problem, we delineate the necessary optimality conditions. Two illustrative examples from optimal betting and inventory management are provided to support our theory.
|
|
15:45-16:00, Paper TuC06.2 | |
Discrete Distributionally Robust Optimal Control with Explicitly Constrained Optimization |
|
Shida, Yuma | Toyota Central R&D Labs., Inc |
Ito, Yuji | Toyota Central R&D Labs., Inc |
Keywords: Uncertain systems, Optimization, Stochastic systems
Abstract: Distributionally robust optimal control (DROC) is gaining interest. This study presents a reformulation method for discrete DROC (DDROC) problems to design optimal control policies under a worst-case distributional uncertainty. The reformulation of DDROC problems impacts both the utility of tractable improvements in continuous DROC problems and the inherent discretization modeling of DROC problems. DROC is believed to have tractability issues; namely, infinite inequalities emerge over the distribution space. Therefore, investigating tractable reformulation methods for these DROC problems is crucial. One such method utilizes the strong dualities of the worst-case expectations. However, previous studies demonstrated that certain non-trivial inequalities remain after the reformulation. To enhance the tractability of DDROC, the proposed method reformulates DDROC problems into one-layer smooth convex programming with only a few trivial inequalities. The proposed method is applied to a DDROC version of a patrol-agent design problem.
|
|
16:00-16:15, Paper TuC06.3 | |
Probabilistically Robust Uncertainty Analysis and Optimal Control of Continuous Lyophilization Via Polynomial Chaos Theory |
|
Srisuma, Prakitr | Massachusetts Institute of Technology |
Barbastathis, George | Massachusetts Institute of Technology |
Braatz, Richard D. | Massachusetts Institute of Technology |
Keywords: Uncertain systems, Stochastic systems, Process Control
Abstract: Lyophilization, aka freeze drying, is a process commonly used to increase the stability of various drug products in biotherapeutics manufacturing, e.g., mRNA vaccines, allowing for higher storage temperature. While the current trends in the industry are moving towards continuous manufacturing, the majority of industrial lyophilization processes are still being operated in a batch mode. This article presents a framework that accounts for the probabilistic uncertainty during the primary and secondary drying steps in continuous lyophilization. The probabilistic uncertainty is incorporated into the mechanistic model via polynomial chaos theory (PCT). The resulting PCT-based model is able to accurately and efficiently quantify the effects of uncertainty on several critical process variables, including the temperature, sublimation front, and concentration of bound water. The integration of the PCT-based model into stochastic optimization and control is demonstrated. The proposed framework and case studies can be used to guide the design and control of continuous lyophilization while accounting for probabilistic uncertainty.
|
|
16:15-16:30, Paper TuC06.4 | |
Online Nonstochastic Control with Convex Safety Constraints |
|
Jiang, Nanfei | University of California, Santa Barbara |
Hutchinson, Spencer | University of California, Santa Barbara |
Alizadeh, Mahnoosh | University of California Santa Barbara |
Keywords: Machine learning, Optimal control, Linear systems
Abstract: This paper considers the online nonstochastic control problem of a linear time-invariant system under convex state and input constraints that need to be satisfied at all times. We propose an algorithm called Online Gradient Descent with Buffer Zone for Convex Constraints (OGD-BZC), designed to handle scenarios where the system operates within general convex safety constraints. We demonstrate that OGD-BZC, with appropriate parameter selection, satisfies all the safety constraints under bounded adversarial disturbances. Additionally, to evaluate the performance of OGD-BZC, we define the regret with respect to the best safe linear policy in hindsight. We prove that OGD-BZC achieves tilde{mathcal{O}}(sqrt{T}) regret given proper parameter choices. Our numerical results highlight the efficacy and robustness of the proposed algorithm.
|
|
16:30-16:45, Paper TuC06.5 | |
Conformal Prediction for Distribution-Free Optimal Control of Linear Stochastic Systems |
|
Vlahakis, Eleftherios | KTH Royal Institute of Technology |
Lindemann, Lars | University of Southern California |
Sopasakis, Pantelis | Queen's University Belfast |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Sampled-data control, Stochastic systems, Optimal control
Abstract: We address an optimal control problem for linear stochastic systems with unknown noise distributions and joint chance constraints using conformal prediction. Our approach involves designing a feedback controller to maintain an error system within a prediction region (PR). We define PRs as sublevel sets of a nonconformity score over error trajectories, enabling the handling of joint chance constraints. We propose two methods to design feedback control and PRs: one through direct optimization over error trajectory samples, and the other indirectly using the S-procedure with a disturbance ellipsoid obtained from data. By tightening constraints with PRs, we solve a relaxed problem to synthesize a feedback policy. Our method ensures reliable probabilistic guarantees based on marginal coverage, independent of data size.
|
|
16:45-17:00, Paper TuC06.6 | |
Retrofitting Heat Pump Control Systems in Residential Buildings with Supervisory Economic MPC |
|
Kalantar-Neyestanaki, Hossein | University of California, Davis |
dela Rosa, Loren | University of California Davis |
Mande, Caton | UC Davis Western Cooling Efficiency Center |
Ellis, Matthew | University of California, Davis |
Keywords: Building and facility automation, Control applications, Predictive control for linear systems
Abstract: In the U.S., residential heat pumps (HPs) are typically operated with a thermostat equipped with an onboard rule-based control (RBC) strategy to turn them on and off. RBC strategies are reactive feedback control strategies that do not proactively operate HPs in a way that accounts for system dynamics, weather forecasts, and time-varying electricity pricing. This paper proposes a novel approach to retrofit existing HP thermostats with economic model predictive control (EMPC) to optimize electricity costs while maintaining occupant thermal comfort. Specifically, the EMPC, implemented in a supervisory layer above the existing thermostat RBC, determines the temperature setpoint used by the RBC. An RBC model, representing the relationship between the temperature setpoint, indoor air temperature, and HP status, is developed and integrated into the EMPC formulation. The EMPC cost function is augmented to penalize setpoint changes, as frequent setpoint adjustments can be undesirable for residents. A novel soft constraint on the building temperature is developed to penalize temperature deviations from the comfortable range only when the indoor air temperature is less than the lower bound resulting from HP operation (considering space cooling operation). Closed-loop simulations demonstrate that the supervisory EMPC reduces electricity costs compared to a fixed-setpoint strategy.
|
|
TuC07 |
Governor's Sq. 11 |
Machine Learning for Prediction and Estimation in Energy Storage Systems |
Invited Session |
Chair: Fogelquist, Jackson | University of California, Davis |
Co-Chair: Soudbakhsh, Damoon | Temple University |
Organizer: Zhang, Dong | University of Oklahoma |
Organizer: Soudbakhsh, Damoon | Temple University |
Organizer: Roy, Tanushree | Texas Tech University |
Organizer: Espin, Jorge Esteban | University of Oklahoma |
Organizer: Siegel, Jason B. | University of Michigan |
Organizer: Tang, Shuxia | Texas Tech University |
Organizer: Dey, Satadru | The Pennsylvania State University |
Organizer: Lin, Xinfan | University of California, Davis |
Organizer: Fogelquist, Jackson | University of California, Davis |
|
15:30-15:45, Paper TuC07.1 | |
Historical-Data-Independent Battery Remaining Useful Life Prediction with Life Decomposition (I) |
|
Xia, Junyi | The University of Texas at Austin |
Ahn, Hyunjin | The University of Texas at Austin |
Wang, Junmin | University of Texas at Austin |
Keywords: Energy systems, Machine learning, Estimation
Abstract: Accurate remaining useful life (RUL) prediction is crucial to long-term battery management. Existing RUL prediction methods have limited applicability due to their reliance on historical data and the prerequisite of future working condition being the same as the past. A historical-data-independent RUL prediction method that only needs current cycle’s data is proposed in this paper. By a life decomposition method, battery RUL is separated into three elements, including mean whole life, extent of cycling, and deviation, which serve as the ingredients for the RUL calculation. Compared with models that predict RUL directly, the proposed method outperforms its counterparts and achieves the best performance on the test set. Additionally, when utilizing the prior knowledge of the number of past cycles, the proposed method achieves comparable prediction performance with the state-of-the-art, historical-data-dependent methods. This work sheds light on more practical battery RUL estimation and offers a unique life decomposition method that is beneficial to battery RUL prediction and analysis.
|
|
15:45-16:00, Paper TuC07.2 | |
Improving Low-Fidelity Models of Li-Ion Batteries Via Hybrid Sparse Identification of Nonlinear Dynamics (I) |
|
Filgueira da Silva, Samuel | The Ohio State University |
Ozkan, Mehmet | Ohio State University |
El Idrissi, Faissal | The Ohio State University |
Ramesh, Prashanth | The Ohio State University |
Canova, Marcello | The Ohio State University |
Keywords: Nonlinear systems identification, Energy systems, Reduced order modeling
Abstract: Accurate modeling of lithium ion (li-ion) batteries is essential for enhancing the safety, and efficiency of electric vehicles and renewable energy systems. This paper presents a data-inspired approach for improving the fidelity of reduced-order li-ion battery models. The proposed method combines a Genetic Algorithm with Sequentially Thresholded Ridge Regression (GA-STRidge) to identify and compensate for discrepancies between a low-fidelity model (LFM) and data generated either from testing or a high-fidelity model (HFM). The hybrid model, combining physics-based and data-driven methods, is tested across different driving cycles to demonstrate the ability to significantly reduce the voltage prediction error compared to the baseline LFM, while preserving computational efficiency. The model robustness is also evaluated under various operating conditions, showing low prediction errors and high Pearson correlation coefficients for terminal voltage in unseen environments.
|
|
16:00-16:15, Paper TuC07.3 | |
Joint Parameterization of Hybrid Physics-Based and Machine Learning Li-Ion Battery Model (I) |
|
Fogelquist, Jackson | University of California, Davis |
Lin, Xinfan | University of California, Davis |
Keywords: Energy systems, Estimation, Identification
Abstract: Electrochemical hybrid battery models have major potential to enable advanced physics-based control, diagnostic, and prognostic features for next-generation lithium-ion battery management systems. This is due to the physical significance of the electrochemical model, which is complemented by a machine learning model that compensates for output prediction errors caused by system uncertainties. While hybrid models have demonstrated robust output prediction performance under large system uncertainties, they are highly susceptible to the influence of uncertainties during parameter identification, which can compromise the physical significance of the model. To address this challenge, we present a parameter estimation framework that explicitly considers system uncertainties through a discrepancy function. The approach also incorporates a downsampling procedure to address the computational barriers associated with large time-series data sets, as are typical in the battery domain. The framework was verified in simulation, yielding several mean parameter estimation errors that were one order of magnitude smaller than those of the conventional least squares approach. While developed for the high-uncertainty, electrochemical hybrid modeling context, the estimation framework is applicable to all models and is presented in a generalized form.
|
|
16:15-16:30, Paper TuC07.4 | |
Lithium-Ion Battery Capacity Prediction Via Conditional Recurrent Generative Adversarial Network-Based Time-Series Regeneration |
|
Chowdhury, Myisha Ahmed | Texas Tech University |
Modekwe, Gift | Texas Tech University |
Lu, Qiugang (Jay) | Texas Tech University |
Keywords: Machine learning, Energy systems, Estimation
Abstract: Accurate capacity prediction is essential for the safe and reliable operation of batteries by anticipating potential failures beforehand. The performance of state-of-the-art capacity prediction methods is significantly hindered by the limited availability of training data, primarily attributed to the expensive experimentation and data sharing restrictions. To tackle this issue, this paper presents a recurrent conditional generative adversarial network (RCGAN) scheme to enrich the limited battery data by adding high-fidelity synthetic ones to improve the capacity prediction. The proposed RCGAN scheme consists of a generator network to generate synthetic samples that closely resemble the true data and a discriminator network to differentiate real and synthetic samples. Long short-term memory (LSTM)-based generator and discriminator are leveraged to learn the temporal and spatial distributions in the multivariate time-series battery data. Moreover, the generator is conditioned on the capacity value to account for changes in battery dynamics due to the degradation over usage cycles. The effectiveness of the RCGAN is evaluated across six batteries from two benchmark datasets (NASA and MIT). The raw data is then augmented with synthetic samples from the RCGAN to train LSTM and gate recurrent unit (GRU) models for capacity prediction. Simulation results show that the models trained with augmented datasets significantly outperform those trained with the original datasets in capacity prediction.
|
|
16:30-16:45, Paper TuC07.5 | |
Predicting Battery Remaining Useful Life for EV Resale: Switching From/to Cold/Hot Temperature (I) |
|
Roy, Apoorva | University of Michigan, Ann Arbor |
Alghalayini, Maher | Lawrence Berkeley National Laboratory |
Movahedi, Hamidreza | University of Michigan |
Siegel, Jason B. | University of Michigan |
Harris, Stephen Harris | Lawrence Berkeley National Lab |
Stefanopoulou, Anna G. | University of Michigan |
Keywords: Energy systems, Modeling
Abstract: Used electric vehicles are driven and sold across states and countries where there can be a switch in both the driving pattern and environmental temperature in which the vehicle is parked and driven. Predicting battery remaining useful life (RUL) and associated fair resale value under such a switch is challenging as one cannot rely on extrapolating the state-of-health (SOH) trend observed from its first user. This paper presents Gaussian Process (GP) regressions that can predict capacity fade in NMC-graphite cells undergoing a switch in operating temperature (from -5◦C to 45◦C and vice versa) as they transition from first to second use. The GPs are trained on data collected from three cells cycled until 70% SOH in the laboratory at various temperatures (room: 25◦C, cold: -5◦C, and hot: 45◦C). In addition, the GP is also trained on first-use data (before SOH reaches 80%), after which the operating temperature is switched. Training data consisted of temperature and total Amp-hours throughput collected during slow and full charge/discharge cycles which are performed approximately every 40 cycles, assuming such conditions will rarely (once every year) occur in the field. We compare two versions of GP: a baseline regression with a linear mean function and a domain-knowledge informed regression with nonlinear mean function. The nonlinear mean leverages and retrains a basis function based on an empirical degradation model previously developed by the authors. Our GP predicts RUL in second use after a large temperature swing, with an RMSE of 2.5% for another 3 years of operation (about 100 cycles) in the future.
|
|
16:45-17:00, Paper TuC07.6 | |
Machine Learning-Driven Prediction of Lithium-Ion Battery Power Capability for eVTOL Aircraft (I) |
|
Tu, Hao | University of Kansas |
Wang, Yebin | Mitsubishi Electric Research Labs |
Mou, Shaoshuai | Purdue University |
Fang, Huazhen | University of Kansas |
Keywords: Energy systems, Machine learning, Modeling
Abstract: Electric vertical take-off and landing (eVTOL) aircraft have emerged as a promising solution to transform urban transportation. They present a few technical challenges for battery management, a prominent one of which is the prediction of the power capability of their lithium-ion battery systems. The challenge originates from the high C-rate discharging conditions required during eVTOL flights as well as the complexity of lithium-ion batteries' electro-thermal dynamics. This paper, for the first time, formulates a power limit prediction problem for eVTOL which explicitly considers long prediction horizons and the possible occurrence of emergency landings. We then harness machine learning to solve this problem in two intertwined ways. First, we adopt a dynamic model that integrates physics with machine learning to predict a lithium-ion battery's voltage and temperature behaviors with high accuracy. Second, while performing search for the maximum power, we leverage machine learning to predict the remaining discharge time and use the prediction to accelerate the search with fast computation. Our validation results show the effectiveness of the proposed study for eVTOL operations.
|
|
TuC08 |
Governor's Sq. 12 |
Wind Energy – Floating Wind Turbines and Wind Farms |
Invited Session |
Chair: van Wingerden, Jan-Willem | Delft University of Technology |
Co-Chair: Fleming, Paul | National Renewable Energy Laboratory |
Organizer: Mulders, Sebastiaan Paul | Delft University of Technology |
Organizer: Sinner, Michael | National Renewable Energy Laboratory |
Organizer: Bay, Christopher | National Renewable Energy Laboratory |
Organizer: Fleming, Paul | National Renewable Energy Laboratory |
Organizer: van Wingerden, Jan-Willem | Delft University of Technology |
|
15:30-15:45, Paper TuC08.1 | |
Power Maximization and Platform Oscillation Mitigation in Reconfigurable Floating Offshore Wind Farms (I) |
|
Niu, Yue | The University of British Columbia |
Nagamune, Ryozo | University of British Columbia |
Keywords: Energy systems, Control applications
Abstract: This paper presents a novel floating offshore wind farm controller that dynamically reconfigures wind farm layout through turbine repositioning. The controller aims to maximize wind farm power output and mitigate platform oscillations both during and after layout reconfigulation, utilizing a two-level structure: a farm-level controller and a turbine-level controller. The farm-level controller solves, for a given wind condition, an optimization problem to determine the optimal turbine positions to maximize the total power post-reconfiguration. The turbine-level controller ensures turbine movement to the optimal positions, high and regulated power output as well as mitigated platform oscillations during both transient and steady-state, by augmenting a baseline controller with a model predictive individual blade pitch controller. The effectiveness of the wind farm controller is validated through simulations using the medium-fidelity software FAST.Farm and OpenFAST.
|
|
15:45-16:00, Paper TuC08.2 | |
A Unified Controller for a Floating Wind Turbine Evolving in Region II and Region III: Preliminary Experimental Results (I) |
|
Aslmostafa Jarchelou, Ehsan | École Centrale De Nantes |
Hamida, Mohamed Assaad | LS2N, Ecole Centrale De Nantes |
Shtessel, Yuri | Univ. or Alabama at Huntsville |
Laghrouche, Salah | Université De Technologie Belfort-Montbéliard (UTBM) |
Plestan, Franck | Ecole Centrale De Nantes-LS2N |
Keywords: Variable-structure/sliding-mode control, Adaptive control, Energy systems
Abstract: This study introduces a unified control strategy for managing a floating offshore wind turbine (FOWT) in both Region II and Region III. Traditionally, controlling a wind turbine in the so-called inter-region area poses significant challenges due to the instability that can arise from switching controllers between the regions. Additionally, the dual-controller approach complicates its tuning and implementation processes. To address these issues, a unified adaptive super-twisting controller (ASTWC) is proposed based on the allocation control concept. The ASTWC removes the need for a dedicated transition area between FOWT regions in the presence of varying wind conditions. Simulation and preliminary experimental results validate the efficacy of the proposed approach.
|
|
16:00-16:15, Paper TuC08.3 | |
Data-Driven Wave Feedforward Control of Floating Offshore Wind Turbines (I) |
|
Ministeru, Alexandra | TU Delft |
Hegazy, Amr | Delft University of Technology |
van Wingerden, Jan-Willem | Delft University of Technology |
Keywords: Predictive control for linear systems, Optimal control, Control applications
Abstract: Floating offshore wind turbines pave the way to accessing deep-water regions with abundant wind resources. However, they face specific control challenges, such as the negative damping problem and increased model complexity. Since model-based control is becoming increasingly demanding, a model-free, data-driven approach is considered. Additionally, floating wind turbines are susceptible to rough environmental disturbances. Feedforward information, such as wave elevation measurements from wave radars, may be included in the controller to lessen the impact of disturbances. Although waves have been shown to increase rotor speed oscillations and turbine loads, wave-preview-based methods have only recently been explored. To this end, this paper first proposes a modified Data-enabled Predictive Control formulation that includes past and future information about measurable disturbances. The feasibility of this control strategy is then demonstrated for floating wind turbines through mid-fidelity simulations. The model-free, feedforward controller uses a preview of wave forces acting on the floating platform and aims for rotor speed regulation. Simulations indicate that the data-driven approach has potential for floating wind turbine control, and including wave feedforward action reduces the amplitude of rotor speed oscillations.
|
|
16:15-16:30, Paper TuC08.4 | |
Towards Collective Control of Floating Offshore Wind Farms (I) |
|
Ampleman, Stephen | Johns Hopkins University |
Ayala, Manuel | Johns Hopkins University |
Gayme, Dennice | Johns Hopkins University |
Keywords: Predictive control for nonlinear systems, Reduced order modeling, Networked control systems
Abstract: This paper describes a framework for collective control of dynamically coupled nonlinear control-oriented models of floating offshore wind turbines. A quadratic cost function is designed to produce turbine level commands that achieve farm level power tracking objectives while maintaining platform motion and turbine states within acceptable limits. An inner-outer loop control architecture is adopted due to the time scale separation between the farm and turbine level dynamics. In the inner loop, a linear quadratic regulator (LQR) is designed to regulate the individual turbine rotor speed using blade pitch, while maintaining stability of the floating turbine (i.e. both turbine and platform motion). The outer loop (farm level) control uses a model predictive approach with an embedded linear-parameter-varying (LPV) model of the turbines coupled with a time delay wake advection model. Closed loop simulations of an 8 turbine (4 row by 2 column) wind farm with wind inflow conditions based on high-fidelity simulations of the atmospheric boundary layer demonstrate good tracking performance of a time-varying power signal.
|
|
16:30-16:45, Paper TuC08.5 | |
Individual Pitch Control for Lateral Motion Control of Floating Offshore Wind Turbines (I) |
|
Phadnis, Mandar | University of Colorado, Boulder |
Pao, Lucy Y. | University of Colorado Boulder |
Keywords: Control applications, Energy systems, PID control
Abstract: Engineering challenges emerge with floating offshore wind turbines (FOWTs) due to the dynamics of the floating platform under wind and wave disturbances. Undesired platform motions can reduce power quality, increase mechanical loads, and affect stability. However, platform motions also provide an opportunity to improve energy capture at the floating wind farm level through dynamic turbine repositioning for wake deflection. In this research, we explore the use of individual pitch control (IPC) for motion control of the FOWT platform. Specifically, we study the potential of IPC for platform yaw and sway motion control. Turbine sway has an application in dynamic FOWT repositioning for wind farm applications, which requires lengthening of mooring lines to achieve meaningful displacements in the FOWT location. Although FOWT repositioning has been demonstrated using nacelle yaw in the literature, we explore using IPC to achieve sway repositioning, thus eliminating or reducing the usage of the maintenance-intensive nacelle yaw drive. The sensitivity of this Sway-by-IPC is studied for varying mooring line lengths. A baseline control is evaluated under varying wind conditions in still water. The FOWT system used as an example is the NREL-5MW reference turbine on the OC4 DeepCWind semi-submersible floating platform.
|
|
16:45-17:00, Paper TuC08.6 | |
Optimal Axial Induction Factor Control for Wind Farms Considering Wake Effect: A Hybrid Approach |
|
Liu, Yiming | Shanghai Jiao Tong University |
Wang, Zhaojian | Shanghai Jiao Tong University |
Wang, Yong | Shanghai Jiao Tong University |
Huang, Ruanming | State Grid Shanghai Municipal Electric Power Company |
Yang, Bo | Shanghai Jiao Tong University |
Keywords: Power systems, Energy systems
Abstract: Wind energy has rapidly expanded as a critical renewable resource in recent years, leading to the prosperity of wind farms. The operation of wind farms requires balancing power generation revenue with the expenditures related to lifespan degradation. As a result, axial induction factor (AIF) control has become a focal point of research. This paper investigates the comprehensive wind farm AIF control problem incorporating the wake effect and power generation characteristics. The control objective is to balance the power output revenue and the health-degradation costs, both of which are associated with AIF. Then, a hybrid control approach incorporating the advantages of model-based and model-free algorithms is introduced to address the inaccuracy of the wind speed. We further prove its convergence to a neighborhood of the optimal solution. Finally, numerical experiments on a 9- turbine wind farm validate the effectiveness of the proposed method.
|
|
TuC09 |
Governor's Sq. 14 |
Game Theory II |
Regular Session |
Chair: Marden, Jason R. | University of California, Santa Barbara |
Co-Chair: Givigi, Sidney | Queen's University |
|
15:30-15:45, Paper TuC09.1 | |
Optimal Two-Evader Cooperative Strategy against a Single Pursuer for a 3D Reach-Avoid Game |
|
Santos Franco, Daniel | Queen's University |
Rabbath, Camille Alain | DRDC |
Givigi, Sidney | Queen's University |
Keywords: Game theory, Cooperative control, Optimal control
Abstract: A reach-avoid problem with two evaders that target a plane in 3D space against a pursuer is studied. In this work, we propose a theorem for the optimal cooperation strategy for two evaders targeting a plane defended by a faster pursuer. This cooperation strategy is tested against two pursuer’s strategies: one that needs the evaders’ control command at the current time – which is unrealistic in adversarial settings – and one that uses only the system state at the current time. We also investigate the latter pursuer’s strategy when the system is implemented in discrete-time with a realistic sampling rate. We do this because the proof is only established for continuous-time. The theoretical results as well as the discrete-time investigations are illustrated by simulations.
|
|
15:45-16:00, Paper TuC09.2 | |
Strategic Information Disclosure with Communication Constraints and Private Preferences |
|
Vasconcelos, Marcos M. | Florida State University |
Camara, Odilon | University of Southern California |
Keywords: Game theory, Intelligent systems, Estimation
Abstract: Social-media platforms are one of the most prevalent communication media today. In such systems, a large amount of content is generated and available to the platform. However, not all content can be transmitted to every possible user at all times. At the other end are the users, who have their own preferences about which content they enjoy, which is often unknown ex ante to the platform. We model the interaction between the platform and the users as a signaling game with asymmetric information, where each user optimizes its preference disclosure policy, and the platform optimizes its information disclosure policy. We provide structural as well as existence of policies that constitute Bayesian Nash Equilibria, and necessary optimality conditions used to explicitly compute the optimal policies.
|
|
16:00-16:15, Paper TuC09.3 | |
To What Extent Do Open-Loop and Feedback Nash Equilibria Diverge in General-Sum Linear Quadratic Dynamic Games? |
|
Chiu, Chih-Yuan | University of California, Berkeley |
Li, Jingqi | UC Berkeley |
Bhatt, Maulik | University of California, Berkeley |
Mehr, Negar | University of California Berkeley |
Keywords: Game theory, Linear systems, Optimal control
Abstract: Dynamic games offer a versatile framework for modeling the evolving interactions of strategic agents, whose steady-state behavior can be captured by the Nash equilibria of the games. Nash equilibria are often computed in feedback, with policies depending on the state at each time, or in open-loop, with policies depending only on the initial state. Empirically, open-loop Nash equilibria (OLNE) could be more efficient to compute, while feedback Nash equilibria (FBNE) often encode more complex interactions. However, it remains unclear exactly which dynamic games yield FBNE and OLNE that differ significantly and which do not. To address this problem, we present a principled comparison study of OLNE and FBNE in linear quadratic (LQ) dynamic games. Specifically, we prove that the OLNE strategies of an LQ dynamic game can be synthesized by solving the coupled Riccati equations of an auxiliary LQ game with perturbed costs. The construction of the auxiliary game allows us to establish conditions under which OLNE and FBNE coincide and derive an upper bound on the deviation between FBNE and OLNE of an LQ game.
|
|
16:15-16:30, Paper TuC09.4 | |
Active Inverse Learning in Stackelberg Trajectory Games |
|
Ward, William | The University of Texas at Austin |
Yu, Yue | University of Minnesota Twin Cities |
Levy, Jacob | University of Texas at Austin |
Mehr, Negar | University of California Berkeley |
Fridovich-Keil, David | The University of Texas at Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Game theory, Optimization, Optimization algorithms
Abstract: Game-theoretic inverse learning is the problem of inferring a player's objectives from their actions. We formulate an inverse learning problem in a Stackelberg game between a leader and a follower, where each player's action is the trajectory of a dynamical system. We propose an active inverse learning method for the leader to infer which hypothesis among a finite set of candidates best describes the follower's objective function. Instead of using passively observed trajectories like existing methods, we actively maximize the differences in the follower's trajectories under different hypotheses by optimizing the leader's control inputs. Compared with uniformly random inputs, the optimized inputs accelerate the convergence of the estimated probability of different hypotheses conditioned on the follower's trajectory. We demonstrate the proposed method in a receding-horizon repeated trajectory game and visualize the results using virtual TurtleBots in Gazebo.
|
|
16:30-16:45, Paper TuC09.5 | |
The Value of Compromising Strategic Intent in General Lotto Games |
|
Diaz-Garcia, Gilberto | University of California, Santa Barbara |
Paarporn, Keith | University of Colorado, Colorado Springs |
Marden, Jason R. | University of California, Santa Barbara |
Keywords: Game theory, Optimization
Abstract: Resource allocation in adversarial environments is a fundamental challenge across various domains, from corporate competition to military strategy. This article examines the impact of compromising an opponent's strategic intent in a class of competitive resource allocation problems known as General Lotto games. General Lotto games provide a rich framework for analyzing strategic environments involving two players competing over a given contest. This paper considers a scenario where one player, termed the "Breaker", has access to partial information about their opponent's strategy through a binary sensor. This sensor reveals whether the opponent's allocated resources exceed a certain threshold. Our main result provides a comprehensive characterization of the equilibrium strategies and payoffs for both players under this information structure. Through numerical studies, we demonstrate that the information provided by the sensor can significantly improve the Breaker's performance in equilibrium.
|
|
16:45-17:00, Paper TuC09.6 | |
A Semi-Infinite Approach for Solving Nash Games with Off-The-Shelf Solvers |
|
Gardner, Tyler | Utah State University |
Harris, Matthew W. | Utah State University |
Keywords: Game theory, Optimization algorithms, Optimization
Abstract: Static and dynamic two-player Nash games are investigated and reformulated into semi-infinite programs. A custom algorithm that leverages off-the-shelf solvers is used to solve the programs, and hence, the games. The approach is tested on four benchmark problems. All four problems are successfully solved. When using a local solver, it is observed that the algorithm works consistently with different initial guesses. When using a global solver, initial guesses are not required. A dynamic linear quadratic game with hundreds of variables is investigated. The solution obtained from the semi-infinite program is compared with the theoretical closed-loop solution. The objective values differ by less than 0.1 percent. Finally, control constraints are added to the dynamic game. Again, the semi-infinite approach successfully solves the problem though no theoretical solution exists for comparison.
|
|
TuC10 |
Governor's Sq. 16 |
The Autonomy Loop: Today’s Practices and Tomorrow’s Challenges |
Tutorial Session |
Chair: Speranzon, Alberto | Lockheed Martin |
Organizer: Speranzon, Alberto | Lockheed Martin |
Organizer: Fregene, Kingsley C. | Lockheed Martin |
Organizer: Banaszuk, Andrzej | Lockheed Martin |
Organizer: Franke, Jerry | Lockheed Martin |
|
15:30-17:00, Paper TuC10.1 | |
The Autonomy Loop (I) |
|
Speranzon, Alberto | Lockheed Martin |
Fregene, Kingsley C. | Lockheed Martin |
Banaszuk, Andrzej | Lockheed Martin |
Franke, Jerry | Lockheed Martin |
|
TuC11 |
Governor's Sq. 17 |
Consensus Algorithms I |
Regular Session |
Chair: Ishii, Hideaki | University of Tokyo |
Co-Chair: Li, Dongyu | BEIHANG UNIVERSITY |
|
15:30-15:45, Paper TuC11.1 | |
Practical Time-Synchronized Consensus Control with an Event-Triggered Mechanism |
|
Wang, Hanzhou | Beihang University |
Liu, Jianwei | Beihang University |
Mingxi, Li | Beihang |
Sun, Zhicheng | Beihang University |
Li, Dongyu | BEIHANG UNIVERSITY |
Keywords: Autonomous systems, Distributed control, Networked control systems
Abstract: Time-synchronized control allows each agent state component to simultaneously achieve consensus in finite time. This synchronized performance of the convergence relies on continuous communication between agents to obtain the real-time state information of their neighbors, presenting a communication challenge for resource-constraint multi-agent systems. This paper proves that, to achieve exact time-synchronized consensus in multi-agent systems, the common state-dependent event-triggered mechanisms lead to the Zeno behavior. As a trade-off to avoid Zeno behavior, a minimum inter-event time is introduced to design the distributed controllers with the event-triggered mechanism for both first- and second-order dynamics systems. The influence of the inter-event time on the control performance is analyzed, which guarantees to achieve practical time-synchronized consensus with bounded error. Especially for second-order dynamics systems, a time-synchronized sliding-mode surface is designed and its potential singularity is avoided. Theoretical analysis and numerical simulations demonstrate that the controllers achieve quasi-synchronous state convergence with guaranteed performance under discrete communication.
|
|
15:45-16:00, Paper TuC11.2 | |
A Novel Consensus-Based Formation Control Scheme in the Image Space |
|
Chávez-Aparicio, Edgar Iván | Centro De Investigación En Matemáticas A.C |
Becerra, Hector M. | Centro De Investigación En Matemáticas (CIMAT) |
Hayet, Jean-Bernard | CIMAT, A.C |
Keywords: Distributed control, Decentralized control, Cooperative control
Abstract: In this letter, we propose a novel distributed vision-based formation control operating in the image space, with free-flying cameras in a three dimensional space as agents. Two controllers are proposed, both formulated in terms of a formation image error, without using a global reference frame, nor requiring the estimation of the 3D pose between agents or of additional projective objects. The proposed formation scheme allows a large flexibility in defining the desired formation, without constraining it to planar formations, for example. We evaluate our approach in simulations for random sets of initial and desired conditions, different number of agents and different connectivities among the agents.
|
|
16:00-16:15, Paper TuC11.3 | |
Fast Consensus Over Almost Regular Directed Graphs |
|
Lu, Susie | Stanford OHS |
Gamarra, Marco | Air Force Research Laboratory |
Liu, Ji | Stony Brook University |
Keywords: Cooperative control, Distributed control, Agents-based systems
Abstract: This paper studies an open consensus network design problem: identifying the optimal simple directed graphs, given a fixed number of vertices and arcs, that maximize the second smallest real part of all Laplacian eigenvalues, referred to as algebraic connectivity. For sparse and dense graphs, the class of all optimal directed graphs that maximize algebraic connectivity is theoretically identified, leading to the fastest consensus. For general graphs, a computationally efficient sequence of almost regular directed graphs is proposed to achieve fast consensus, with algebraic connectivity close to the optimal value.
|
|
16:15-16:30, Paper TuC11.4 | |
On the Stability of Consensus Control under Rotational Ambiguities |
|
Li, Zhonggang | Delft University of Technology |
Li, Changheng | Delft University of Technology |
Rajan, Raj Thilak | TU Delft |
|
16:30-16:45, Paper TuC11.5 | |
Resilient Centerpoint-Based Vector Consensus Protocol against Mobile Attacks |
|
Zheng, Zhongmin | The University of Tokyo |
Yan, Jiaqi | ETH Zurich |
Ishii, Hideaki | University of Tokyo |
Keywords: Networked control systems, Agents-based systems, Fault tolerant systems
Abstract: This paper addresses the resilient vector consensus problem in the presence of mobile attacks, where malicious attackers can dynamically move within the network, causing faulty behaviors in compromised agents. We introduce three representative mobile attack models drawn from distributed computing literature and propose secure protocols for state updates of agents. Central to our approach is a centerpoint-based data aggregation algorithm, whereby each non-malicious agent updates its local value to the centerpoint of the values received from its neighboring agents. By restricting an upper bound on the number of mobile attackers, we establish sufficient conditions on the communication topology, demonstrating how our method enhances network resilience compared to existing algorithms. Numerical examples are provided to illustrate the performance of the protocols.
|
|
16:45-17:00, Paper TuC11.6 | |
An ADMM-Inspired Algorithm for Sensor Selection and Scheduling with Routing Constraints |
|
Dhingra, Neil K | Auria |
Keywords: Optimization algorithms, Estimation, Aerospace
Abstract: We consider the problem of parsimoniously selecting sensors or scheduling sensor observation actions to optimize the covariance of a predicted system state. In contrast to previous work on this problem which typically consider a budget or cardinality constraint on the number of sensors or sensor actions chosen, we consider a budget imposed by a routing constraint. This type of constraint arises in multi-target tracking (MTT) applications using sensors that must slew to point at different targets. To decompose the problem into tractable subproblems, we develop an approach inspired by the alternating direction method of multipliers (ADMM) using the Earth mover's distance rather than the squared ell_2 norm to augment the Lagrangian. This allows us to avoid solving a mixed integer quadratic program (MIQP). Moreover, because it is a more natural metric for the underlying variables, it makes intermediate iterates easier to interpret, facilitating extraction of a feasible solution when the algorithm iteration is stopped before convergence. Such a property is desirable for this nonconvex problem since convergence is not guaranteed. We perform a polishing step that uses a simple local search method to improve performance. Finally, we apply our algorithm to an example problem and show that it outperforms baseline heuristics and achieves the global optimal solution.
|
|
TuC12 |
Plaza Court 1 |
Multivehicle |
Regular Session |
Chair: Taha, Ahmad | Vanderbilt University |
Co-Chair: Roy, Tanushree | Texas Tech University |
|
15:30-15:45, Paper TuC12.1 | |
Port-Hamiltonian-Based Geometric Control for Rigid Body Platoons with Mesh Stability Guarantee |
|
Song, Zihao | University of Notre Dame |
Antsaklis, Panos J. | University of Notre Dame |
Lin, Hai | University of Notre Dame |
|
15:45-16:00, Paper TuC12.2 | |
Interplay between Resilience, Safety, and String Stability in Vehicle Platoon |
|
Ma, Ruijie | Zhejiang University |
Zhao, Chengcheng | Zhejiang University |
Keywords: Cooperative control, Distributed control
Abstract: This paper investigates the issue of achieving a vehicle platoon’s resilience, safety, and string stability simultaneously under false data injection attacks, further revealing the interplay between these properties. We utilize the resilient Control Barrier Function-Quadratic Programming framework to achieve the control objective. Specifically, an existing network-redundancy-based resilient controller serves as the nominal controller to ensure internal stability, while safety and string stability are characterized by control barrier function (CBF) constraints for control input optimization. A new concept of boundary robustness is introduced to address the threats posed by malicious information in the CBFs. Our analysis reveals certain conflicts between resilience, safety, and string stability within the proposed framework, and we propose effective solutions to address the trade-offs between these properties. Comparative simulations are conducted to demonstrate the effectiveness of the proposed method.
|
|
16:00-16:15, Paper TuC12.3 | |
Enhancing Vehicle Platooning Safety Via Control Node Placement and Sizing under State and Input Bounds |
|
She, Yifei | Beijing University of Posts and Telecommunications |
Wang, Shen | Beijing University of Posts and Telecommunications |
Taha, Ahmad | Vanderbilt University |
Tao, Xiaofeng | Beijing University of Posts and Telecommunications |
Keywords: Automotive control, Transportation networks, Optimization
Abstract: Vehicle platooning with Cooperative Adaptive Cruise Control improves traffic efficiency, reduces energy consumption, and enhances safety but remains vulnerable to cyber-attacks that disrupt communication and cause unsafe actions. To address these risks, this paper investigates control node placement and input bound optimization to balance safety and defense efficiency under various conditions. We propose a two-stage actuator placement and actuator saturation approach, which focuses on identifying key actuators that maximize the system's controllability while operating under state and input constraints. By strategically placing and limiting the input bounds of critical actuators, we ensure that vehicles maintain safe distances even under attack. Simulation results show that our method effectively mitigates the impact of attacks while preserving defense efficiency, offering a robust solution to vehicle platooning safety challenges.
|
|
16:15-16:30, Paper TuC12.4 | |
Assessment of Cyberattack Detection-Isolation Algorithm for CAV Platoons Using SUMO |
|
Ghosh, Sanchita | Texas Tech University |
Roy, Tanushree | Texas Tech University |
Keywords: Autonomous vehicles, Emerging control applications, Filtering
Abstract: A Connected Autonomous Vehicle (CAV) platoon in an evolving real-world driving environment relies strongly on accurate vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) communication for its safe and efficient operation. However, a cyberattack on this communication network can corrupt the appropriate control actions, tamper with system measurement, and drive the platoon to unsafe or undesired conditions. As a first step toward practicable resilience against such V2V-V2I attacks, in this paper, we implemented in Simulation of Urban MObility (SUMO) a unified V2V-V2I cyberattack detection scheme and a V2I isolation scheme for a CAV platoon under changing driving conditions. The implemented algorithm utilizes vehicle-specific residual generators that are designed based on analytical disturbance-to-state stability, robustness, and sensitivity performance constraints. Our case studies include two driving scenarios where highway driving is simulated using the Next-Generation Simulation (NGSIM) data and urban driving follows the benchmark EPA Urban Dynamometer Driving Schedule (UDDS). The results validate the applicability of the algorithm to ensure CAV cybersecurity and demonstrate the promising potential for practical test-bed implementation in the future.
|
|
16:30-16:45, Paper TuC12.5 | |
How Many Autonomous Vehicles Are Required to Stabilize Traffic Flow? |
|
Bahavarnia, MirSaleh | Vanderbilt University |
Taha, Ahmad | Vanderbilt University |
Keywords: Traffic control, Transportation networks
Abstract: The collective behavior of human-driven vehicles (HVs) produces the well-known stop-and-go waves potentially leading to higher fuel consumption and emissions. This paper investigates the stabilization of traffic flow via a minimum number of autonomous vehicles (AVs) subject to constraints on the control parameters aiming to reduce the number of vehicles on the road while achieving lower fuel consumption and emissions. The unconstrained scenario has been well-studied in recent studies. The main motivation to investigate the constrained scenario is that, in realistic engineering applications, lower and upper bounds exist on the control parameters. For the constrained scenario, we optimally find the minimum number of required AVs (via computing the optimal lower bound on the AV penetration rate) to stabilize traffic flow for a given number of HVs. As an immediate consequence, we conclude that for a given number of AVs, the number of HVs in the stabilized traffic flow may not be arbitrarily large in the constrained scenario unlike the unconstrained scenario studied in the literature. We systematically propose a procedure to compute the optimal lower bound on the AV penetration rate using nonlinear optimization techniques. Finally, we validate the theoretical results via numerical simulations. Numerical simulations suggest that enlarging the constraint intervals makes a smaller optimal lower bound on the AV penetration rate attainable. However, it leads to a slower transient response due to a dominant pole closer to the origin.
|
|
16:45-17:00, Paper TuC12.6 | |
Virtual Vehicle Flocking Control for Multi-Lane Ramp Merging |
|
Wang, Gang | Arizona State University |
Chen, Yan | Arizona State University |
Keywords: Traffic control, Agents-based systems, Automotive control
Abstract: This paper presents a novel approach to ramp merging in multi-lane highway scenarios for connected and automated vehicles (CAVs) using virtual vehicle flocking control. Unlike existing methods that mainly focus on single-lane scenarios through virtual platooning, the proposed approach aims to address the complicated multi-lane merging scenarios by allowing main road vehicles to execute lane changes, create space for merging vehicles, and balance traffic flow across lanes. The new vehicle flocking control design can virtually project and manage CAVs on the ramp and main road as a coordinated group. Three key components are considered in the virtual vehicle flocking design for ramp merging: 1) Optimal selection of lane-changing vehicles on the main road to minimize flocking transitions using a Wasserstein distance-based indicator; 2) Smooth lane-change navigation to reach target lanes by adjusting the navigation effect of flocking control inputs; 3) Avoidance of unnecessary accelerations and decelerations through a heterogeneous connection approach for smoother merging. The simulation results of ramp merging on a three-lane highway demonstrate the effectiveness of the proposed method. Compared to traditional virtual platooning strategies based on an intelligent driver model, the improved merging efficiency and safety are verified.
|
|
TuC13 |
Plaza Court 2 |
Optimization I |
Regular Session |
Chair: Modares, Hamidreza | Michigan State University |
Co-Chair: Olucak, Jan | University of Stuttgart |
|
15:30-15:45, Paper TuC13.1 | |
Trajectory-Oriented Control Using Gradient Descent: An Unconventional Approach |
|
Esmzad, Ramin | Michigan State University |
Modares, Hamidreza | Michigan State University |
Keywords: Optimization, Optimal control
Abstract: In this work, we introduce a novel gradient descent-based approach for optimizing control systems, leveraging a new representation of stable closed-loop dynamics as a function of two matrices i.e. the step size or direction matrix and value matrix of the Lyapunov cost function. This formulation provides a new framework for analyzing and designing feedback control laws. We show that any stable closed-loop system can be expressed in this form with appropriate values for the step size and value matrices. Furthermore, we show that this parameterization of the closed-loop system is equivalent to a linear quadratic regulator for appropriately chosen weighting matrices. We also show that trajectories can be shaped using this approach to achieve a desired closed-loop behavior.
|
|
15:45-16:00, Paper TuC13.2 | |
Guaranteed Feasibility in Differentially Private Linearly Constrained Convex Optimization |
|
Benvenuti, Alexander | Georgia Institute of Technology |
Bialy, Brendan | AFRL |
Dennis, Miriam | Air Force Research Laboratory |
Hale, Matthew | Georgia Institute of Technology |
Keywords: Optimization, Markov processes
Abstract: Convex programming with linear constraints plays an important role in the operation of a number of everyday systems. However, absent any additional protections, revealing or acting on the solutions to such problems may reveal information about their constraints, which can be sensitive. Therefore, in this paper, we introduce a method to keep linear constraints private when solving a convex program. First, we prove that this method is differentially private and always generates a feasible optimization problem (i.e., one whose solution exists). Then we show that the solution to the privatized problem also satisfies the original, non-private constraints. Next, we bound the expected loss in performance from privacy, which is measured by comparing the cost with privacy to that without privacy. Simulation results apply this framework to constrained policy synthesis in a Markov decision process, and they show that a typical privacy implementation induces only an approximately 9% loss in solution quality.
|
|
16:00-16:15, Paper TuC13.3 | |
CaΣoS: A Nonlinear Sum-Of-Squares Optimization Suite |
|
Cunis, Torbjřrn | University of Stuttgart |
Olucak, Jan | University of Stuttgart |
Keywords: Optimization, Numerical algorithms, Stability of nonlinear systems
Abstract: We present CaΣoS, the first MATLAB software specifically designed for nonlinear sum-of-squares optimization. Catextgreek{Σ}oS's symbolic polynomial algebra system allows for the formulation of parametrized nonlinear sum-of-squares optimization problems and facilitates their fast, repeated evaluations. To that extent, we utilize CasADi's symbolic framework and realize concepts of monomial sparsity, linear operators (including duals), and functions between polynomials. CaΣoS interfaces the conic solvers SeDuMi, Mosek, Clarabel, and SCS and provides methods to solve quasiconvex optimization problems (via bisection) and nonconvex optimization problems (via sequential convexification). Numerical examples for benchmark nonconvex problems, including region-of-attraction and reachable set estimation for nonlinear dynamic systems, demonstrate significant improvements in computation time compared to existing toolboxes. CaΣoS is available open-source at https://github.com/ifr-acso/casos.
|
|
16:15-16:30, Paper TuC13.4 | |
Variance-Reduced Gradient Estimator for Nonconvex Zeroth-Order Distributed Optimization |
|
Mu, Huaiyi | Peking University |
Tang, Yujie | Peking University |
Li, Zhongkui | Peking University |
Keywords: Optimization, Optimization algorithms, Distributed control
Abstract: This paper investigates distributed zeroth-order optimization for smooth nonconvex problems. We propose a novel variance-reduced gradient estimator, which randomly renovates one orthogonal direction of the true gradient in each iteration while leveraging historical snapshots for variance correction. By integrating this estimator with gradient tracking mechanism, we address the trade-off between convergence rate and sampling cost per zeroth-order gradient estimation that exists in current zeroth-order distributed optimization algorithms, which rely on either the 2-point or 2d-point gradient estimators. We derive a convergence rate of O(d^{5/2}/m) for smooth nonconvex functions in terms of sampling number m and problem dimension d. Numerical simulations comparing our algorithm with existing methods confirm the effectiveness and efficiency of the proposed gradient estimator.
|
|
16:30-16:45, Paper TuC13.5 | |
Safe Gradient Flow for Bilevel Optimization |
|
Sharifi, Sina | Johns Hopkins University |
Abolfazli, Nazanin | University of Arizona |
Yazdandoost Hamedani, Erfan | University of Arizona |
Fazlyab, Mahyar | Johns Hopkins University |
Keywords: Optimization, Optimization algorithms, Lyapunov methods
Abstract: Bilevel optimization is a key framework in hierarchical decision-making, where one problem is embedded within the constraints of another. In this work, we propose a control-theoretic approach to solving bilevel optimization problems. Our method consists of two components: a gradient flow mechanism to minimize the upper-level objective and a safety filter to enforce the constraints imposed by the lower-level problem. Together, these components form a safe gradient flow that solves the bilevel problem in a single loop. To improve scalability with respect to the lower-level problem's dimensions, we introduce a relaxed formulation and design a compact variant of the safe gradient flow. This variant minimizes the upper-level objective while ensuring the lower-level decision variable remains within a user-defined suboptimality. Using Lyapunov analysis, we establish convergence guarantees for the dynamics, proving that they converge to a neighborhood of the optimal solution. Numerical experiments further validate the effectiveness of the proposed approaches. Our contributions provide both theoretical insights and practical tools for efficiently solving bilevel optimization problems.
|
|
16:45-17:00, Paper TuC13.6 | |
Proximal Gradient Dynamics: Monotonicity, Exponential Convergence, and Applications |
|
Gokhale, Anand | University of California, Santa Barbara |
Davydov, Alexander | University of California, Santa Barbara |
Bullo, Francesco | Univ of California at Santa Barbara |
Keywords: Optimization, Optimization algorithms, Stability of nonlinear systems
Abstract: In this letter we study the proximal gradient dynamics. This recently-proposed continuous-time dynamics solves optimization problems whose cost functions are separable into a nonsmooth convex and a smooth component. First, we show that the cost function decreases monotonically along the trajectories of the proximal gradient dynamics. We then introduce a new condition that guarantees exponential convergence of the cost function to its optimal value, and show that this condition implies the proximal Polyak-Lojasiewicz condition. We also show that the proximal Polyak-Lojasiewicz condition guarantees exponential convergence of the cost function. Moreover, we extend these results to time-varying optimization problems, providing bounds for equilibrium tracking. Finally, we discuss applications of these findings, including the LASSO problem, certain matrix based problems change{and a numerical experiment on a feed-forward neural network.}
|
|
TuC14 |
Plaza Court 3 |
Autonomous Spacecraft Decision-Making |
Invited Session |
Chair: Petersen, Chris | University of Florida |
Co-Chair: Phillips, Sean | Air Force Research Laboratory |
Organizer: Soderlund, Alexander | The Ohio State University |
Organizer: Phillips, Sean | Air Force Research Laboratory |
Organizer: Petersen, Chris | University of Florida |
|
15:30-15:45, Paper TuC14.1 | |
A Rapid Trajectory Optimization and Control Framework for Resource-Constrained Applications (I) |
|
Parikh, Deep | Texas A&M University |
Ahrens, Thomas | Texas A&M University |
Majji, Manoranjan | Texas A&M University |
Keywords: Optimal control, Computational methods, Spacecraft control
Abstract: This paper presents a computationally efficient model predictive control formulation that uses an integral Chebyshev collocation method to enable rapid operations of autonomous agents. By posing the finite-horizon optimal control problem and recursive re-evaluation of the optimal trajectories, minimization of the L2 norms of the state and control errors are transcribed into a quadratic program. Control and state variable constraints are parameterized using Chebyshev polynomials and are accommodated in the optimal trajectory generation programs to incorporate the actuator limits and keep-out constraints. Differentiable collision detection of polytopes is leveraged for optimal collision avoidance. Results obtained from the collocation methods are benchmarked against the existing approaches on an edge computer to outline the performance improvements. Finally, collaborative control scenarios involving multi-agent space systems are considered to demonstrate the technical merits of the proposed work.
|
|
15:45-16:00, Paper TuC14.2 | |
Trade-Offs in On-Orbit Inspection of a Stochastic, Tumbling Satellite (I) |
|
Sivaramakrishnan, Karthik | The University of New Mexico |
Sivaramakrishnan, Vignesh | University of New Mexico |
Cutlip, Steven | Verus Research |
Oishi, Meeko | University of New Mexico |
Keywords: Spacecraft control, Optimization, Stochastic optimal control
Abstract: On-orbit inspection is of growing importance as low-earth orbits become more cluttered, and new tools are needed to facilitate satellite maintenance and repair. We presume that an inspecting satellite conducts a fly-by maneuver of a torque-free, tumbling satellite, with uncertain initialization and a specific key point of interest on the target. However, the inspecting satellite is limited in what it can observe, due to field-of-view and occlusion constraints. Further, we presume that sensing quality is dependent on how close the satellite is to being directly overhead of the key points of interest on the inspection target. Finding feasible trajectories for the on-orbit inspection is difficult, not only because of the nonlinear quaternion kinematics and nonlinear constraints, but also because of the non-Gaussian stochasticity introduced through the uncertainty of the initial condition of the tumbling satellite. We seek to identify feasible trajectories for inspection, and to explore trade-offs between sensing performance, deviations from the nominal fly-by trajectory, and fuel expenditures. We formulate this problem as a type of stochastic optimization problem, and leverage sample average approximation (SAA) to solve it approximately. Solutions provide a computationally efficient way to assess inspection trajectories that would otherwise be extremely difficult to synthesize. We demonstrate the efficacy of our approach, and examine trade-offs between the multiple elements of the cost function, on both a stable tumbling object, and on a chaotic tumbling object.
|
|
16:00-16:15, Paper TuC14.3 | |
Electromagnetic Formation Flying with State and Input Constraints Using Alternating Magnetic Field Forces (I) |
|
Kamat, Sumit Suryakant | University of Kentucky |
Seigler, Thomas Michael | University of Kentucky |
Hoagg, Jesse B. | University of Kentucky |
Keywords: Spacecraft control, Constrained control, Multivehicle systems
Abstract: This article presents a feedback control algorithm for electromagnetic formation flying with constraints on the satellites’ states and control inputs. The algorithm combines several key techniques. First, we use alternating magnetic field forces to decouple the electromagnetic forces between each pair of satellites in the formation. Each satellite’s electromagnetic actuation system is driven by a sum of amplitude-modulated sinusoids, where amplitudes are controlled in order to prescribe the time-averaged force between each pair of satellites. Next, the desired time-averaged force is computed from a optimal control that satisfies state constraints (i.e., no collisions and an upper limit on intersatellite speeds) and input constraints (i.e., not exceeding satellite’s apparent power capability). The optimal time-averaged force is computed using a single relaxed control barrier function that is obtained by composing multiple control barrier functions that are designed to enforce each state and input constraint.
|
|
16:15-16:30, Paper TuC14.4 | |
Station-Keeping on Near-Rectilinear Halo Orbits Via Full-State Targeting Model Predictive Control (I) |
|
Shimane, Yuri | Georgia Institute of Technology |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Ho, Koki | Georgia Institute of Technology |
Weiss, Avishai | Mitsubishi Electric Research Labs |
Keywords: Spacecraft control, Predictive control for nonlinear systems
Abstract: We develop a model predictive control (MPC) policy for station-keeping (SK) on a Near-Rectilinear Halo Orbit (NRHO). Leveraging the controllability obtained from a control horizon consisting of two maneuvers, the proposed MPC policy achieves full-state tracking of a reference NRHO. By spacing the maneuvers one revolution apart, our method abides by the typical mission requirement that at most one maneuver is utilized for SK during each NRHO revolution. Through full-state tracking, the proposed policy does not suffer from phase deviation in the along-track direction of the reference NRHO, a common drawback of existing SK methods with a single maneuver per revolution. Numerical simulations demonstrate that the proposed approach successfully maintains the spacecraft’s motion both in space and phase along the NRHO, with tighter tracking than state-of-the-art SK methods and comparable delta-v performance.
|
|
16:30-16:45, Paper TuC14.5 | |
Monocular Inspection of Spacecraft under Illumination Constraints and Avoidance Regions (I) |
|
Ogri, Tochukwu Elijah | University of Florida |
Qureshi, Muzaffar | University of Florida |
Bell, Zachary I. | Air Force |
Longmire, Matthew | AFRL |
Kamalapurkar, Rushikesh | University of Florida |
Keywords: Spacecraft control, Adaptive control, Autonomous systems
Abstract: This paper presents an adaptive control approach to information-based guidance and control of a spacecraft carrying out on-orbit inspection by actively computing optimal policies for the spacecraft to achieve the best possible representation of objects within its orbital environment. Due to the complexity of navigating the space environment, it may be impossible to carry out on-orbit servicing to maintain space systems like satellites using a spacecraft equipped with controllers that cannot adapt to changing conditions. In particular, the presence of constraints such as illumination, field-of-view (FOV), minimal fuel, the use of visual-inertial navigation for improved localization, and the need for real-time computation of control policies render the spacecraft motion planning problem challenging. The control framework developed in this paper addresses these challenges by formulating the inspection task as a constrained optimization problem where the goal is to maximize information gained from the cameras, while navigating to the emph{next best view}, subject to illumination and FOV constraints. The developed architecture is analyzed using a Lyapunov-based stability analysis and the effectiveness of the planning algorithm is verified in simulation.
|
|
16:45-17:00, Paper TuC14.6 | |
Impulsive Relative Motion Control with Continuous-Time Constraint Satisfaction for Cislunar Space Missions (I) |
|
Spada, Fabio | University of Washington |
Elango, Purnanand | Mitsubishi Electric Research Laboratories |
Acikmese, Behcet | University of Washington |
Keywords: Spacecraft control, Predictive control for nonlinear systems, Optimal control
Abstract: Recent investments in cislunar applications open new frontiers for space missions within highly nonlinear dynamical regimes. In this paper, we propose a method based on Sequential Convex Programming (SCP) to loiter around a given target with impulsive actuation while satisfying path constraints continuously over the finite time-horizon, i.e., independently of the number of nodes in which domain is discretized. Location, timing, magnitude, and direction of a fixed number of impulses are optimized in a model predictive framework, exploiting the exact nonlinear dynamics of non-stationary orbital regimes. The proposed approach is first validated on a relative orbiting problem with respect to a selenocentric near rectilinear halo orbit. The approach is then compared to a formulation with path constraints imposed only at nodes and with mesh refined to ensure complete satisfaction of path constraints over the continuous-time horizon. CPU time per iteration of 400 ms for the refined-mesh approach reduce to 5.5 ms for the proposed approach.
|
|
TuC15 |
Plaza Court 6 |
Boost Sustainability and Growth through Process Systems Engineering |
Tutorial Session |
Chair: Wang, Zhenyu | Dow Chemical |
Co-Chair: Braun, Birgit | The Dow Chemical Company |
Organizer: Wang, Zhenyu | The Dow Chemical Company |
Organizer: Chiang, Leo | The Dow Chemical Company |
Organizer: Braun, Birgit | The Dow Chemical Company |
|
15:30-17:00, Paper TuC15.1 | |
Navigating the Trade-Offs and Synergies of Economic and Environmental Sustainability Using Process Systems Engineering (I) |
|
Zhang, Qi | University of Minnesota |
Avraamidou, Styliani | University of Wisconsin Madison |
Paulson, Joel | The Ohio State University |
Thakker, Vyom | The Dow Chemical Company |
Wang, Zhenyu | The Dow Chemical Company |
Chiang, Leo | The Dow Chemical Company |
Braun, Birgit | The Dow Chemical Company |
Rathi, Tushar | University of Minnesota, Twin Cities |
Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Sorourifar, Farshud | Ohio State University |
Tang, Wei-Ting | The Ohio State University |
Munoz, Paola | University of Wisconsin-Madison |
Sampat, Apoorva | The Dow Chemical Company |
Guertin, France | The Dow Chemical Company |
Keywords: Optimization, Process Control, Machine learning
Abstract: This paper provides an overview of recent research efforts on the role of Process Systems Engineering (PSE) in advancing sustainability initiatives, particularly in achieving net-zero emissions and carbon neutrality. The paper is organized as a collection of four domains where PSE methodologies contribute to sustainability: (i) carbon monetization and low-carbon supply chains, where optimization and systems modeling help design cost-effective decarbonization strategies; (ii) circular economy and sustainable manufacturing, which leverage system-level optimization to minimize resource consumption and maximize economic viability; (iii) sustainable land management and ecosystem services, where PSE approaches aid in quantifying trade-offs between land use, emissions, and economic feasibility; and (iv) advanced control technology, particularly in building energy management, where data-driven control strategies enhance energy optimization under significant uncertainty. In addition to reviewing relevant literature, this paper highlights common challenges across these domains and discusses future opportunities for integrating emerging technologies, such as generative AI and mixed-integer programming, into PSE-driven sustainability strategies.
|
|
TuC16 |
Plaza Court 7 |
Stability of Nonlinear Systems |
Regular Session |
Chair: Kundu, Soumya | Pacific Northwest National Laboratory |
Co-Chair: Sinha, Subhrajit | Pacific Northwest National Laboratory |
|
15:30-15:45, Paper TuC16.1 | |
Dynamic Event-Triggered Control under Input and State Delays Using Interval Observers |
|
Mazenc, Frederic | Inria Saclay |
Malisoff, Michael | Louisiana State University |
Keywords: Stability of nonlinear systems, Delay systems
Abstract: We prove global exponential stability estimates for a class of nonlinear control systems that contain uncertain time-varying input delays and uncertain state delays. We use new dynamic event-triggered controls that ensure that Zeno's phenomenon does not occur. Our analysis uses new synergies of interval observers and Halanay's inequality. We illustrate our approach in a marine robotic dynamics that contains uncertain nonlinear terms.
|
|
15:45-16:00, Paper TuC16.2 | |
On Extension of Ergodic Hierarchy and Complexity of Dynamical Systems |
|
Sinha, Subhrajit | Pacific Northwest National Laboratory |
Keywords: Stability of nonlinear systems, Information theory and control
Abstract: In this work, we propose an entropy-based framework to extend the notion of Ergodic Hierarchy (EH) to include conservative and almost everywhere (a.e.) stable systems. In particular, we use increasingly weaker notions of entropy to include more classes of systems into the Ergodic Hierarchy and we refer to this emph{extended} hierarchy of systems as Extended Ergodic Hierarchy (E-EH). In particular, we show that going from the Kolmogorov-Sinai entropy to the concept of entropy of measurable subsets of the state-space, one can include conservative systems in the EH and using the even weaker notion of entropy of a partition, one can include a.e. stable systems in the EH.
|
|
16:00-16:15, Paper TuC16.3 | |
Sampled-Data Extremum Seeking for General Nonlinear Maps with Constant Delays |
|
Li, Jianzhong | Southwest University of Science and Technology |
Pan, Gaofeng | Institute of Cyber-Systems and Control, Zhejiang University |
Su, Hongye | Zhejiang Univ |
Zhu, Yang | Zhejiang University |
Keywords: Stability of nonlinear systems, Networked control systems, Adaptive control
Abstract: This paper introduces a novel implementation of sampled-data extremum seeking (ES) over communication network, which is convenient for handling the delays. By the newly developed time-delay approach, the original ES system is transformed into a retarded-type nonlinear system with disturbances. When the nonlinear map is unknown, we offer a rigorously practical stability analysis via Lyapunov-Krasovskii method. Moreover, we suggest a quantitative estimation on upper bounds of time-delay and dither periods that the ES system is able to maintain stable, if some bounds of nonlinear maps are available. Finally, numerical simulations confirm the theoretical analysis.
|
|
16:15-16:30, Paper TuC16.4 | |
Sufficient Conditions for Practical Partial Stability of Nonlinear Time-Varying Impulsive Systems |
|
Beji, Lotfi | University of Evry |
Hammami, Mohamed Ali | Faculty of Sciences of Sfax |
Hadj Taieb Nizar, Hadj Taieb | Faculty of Sciences of Sfax |
|
16:30-16:45, Paper TuC16.5 | |
An SVD-Like Decomposition of Functions with Finite 2-Induced Norm |
|
Brown, Brian Charles | Brigham Young University |
King, Michael | Brigham Young University, Department of Computer Science |
Warnick, Sean | Brigham Young University |
Yeung, Enoch | University of California Santa Barbara |
Grimsman, David | Brigham Young University |
Keywords: Stability of nonlinear systems, Nonlinear systems identification, Robust control
Abstract: The Singular Value Decomposition (SVD) of linear functions facilitates the calculation of their 2-induced norm and row and null spaces, hallmarks of linear control theory. In this work, we present a function representation that, similar to SVD, provides an upper bound on the 2-induced norm of any function where such a bound exists, while also facilitating the computation of generalizations of the notions of row and null spaces for these functions. Borrowing from the notion of ``lifting" in Koopman operator theory, we construct a finite-dimensional lifting of inputs that relaxes the unitary property of the right-most matrix in traditional SVD, V^*, to be an injective, norm-preserving mapping to a slightly higher-dimensional space.
|
|
16:45-17:00, Paper TuC16.6 | |
On Characterization and Computation of Almost Everywhere Domain of Attraction |
|
Sinha, Subhrajit | Pacific Northwest National Laboratory |
Nandanoori, Sai Pushpak | Pacific Northwest National Laboratory |
Kundu, Soumya | Pacific Northwest National Laboratory |
Vaidya, Umesh | Clemson University |
Keywords: Stability of nonlinear systems, Lyapunov methods
Abstract: In this paper, we characterize almost everywhere (a.e.) domain of attraction in autonomous nonlinear systems using Lyapunov density, which was introduced to verify the weaker set-theoretic notion of almost everywhere uniform (a.e.u.) stability. We show that this weaker notion of stability offers advantages over the classical point-wise Lyapunov stability for the domain of attraction characterization. In particular, if D_{cl} is the domain of attraction estimates based on Lyapunov function V(x), we show that the a.e. domain of attraction estimates, D_{aeu}, based on Lyapunov density rho(x)=V(x)^{-alpha}, for some alpha>0, always satisfies D_{cl}subseteq D_{aeu}. The proposed procedure yields a.e. domain of attraction estimates that can include unstable fixed points, thereby highlighting the main advantage of the proposed novel a.e. domain of attraction, since unstable equilibrium points are not allowed in the classical point-wise domain of attraction estimates. Furthermore, using the Gröbner basis tool from commutative algebra, we provide a computational framework to compute the a.e. domain of attraction for polynomial systems.
|
|
TuC17 |
Plaza Court 8 |
Koopman II |
Regular Session |
Chair: Werner, Herbert | Hamburg University of Technology |
Co-Chair: Rai, Ayush | Purdue University |
|
15:30-15:45, Paper TuC17.1 | |
Koopman Mode-Based Detection of Internal Short Circuits in Lithium-Ion Battery Pack |
|
Ghosh, Sanchita | Texas Tech University |
Mallick, Soumyoraj | Texas Tech University |
Roy, Tanushree | Texas Tech University |
Keywords: Fault detection, Learning, Energy systems
Abstract: Monitoring of internal short circuit (ISC) in Lithium-ion battery packs is imperative to safe operations, optimal performance, and extension of pack life. Since ISC in one of the modules inside a battery pack can eventually lead to thermal runaway, it is crucial to detect its early onset. However, the inaccuracy and aging variability of battery models and the unavailability of adequate ISC datasets pose several challenges for both model-based and data-driven approaches. Thus, in this paper, we proposed a model-free Koopman Mode-based module-level ISC detection algorithm for battery packs. The algorithm adopts two parallel Koopman mode generation schemes with the Arnoldi algorithm to capture the Kullback-Leibler divergence-based distributional deviations in Koopman mode statistics in the presence of ISC. Our proposed algorithm utilizes module-level voltage measurements to accurately identify the shorted battery module of the pack without using specific battery models or pre-training with historical battery data. Furthermore, we presented two case studies on shorted battery module detection under both resting and charging conditions. The simulation results illustrated the sensitivity of the proposed algorithm toward ISC and the robustness against measurement noise.
|
|
15:45-16:00, Paper TuC17.2 | |
Willems’ Fundamental Lemma for Nonlinear Systems with Koopman Linear Embedding |
|
Shang, Xu | UC San Diego |
Cortes, Jorge | UC San Diego |
Zheng, Yang | University of California San Diego |
Keywords: Data driven control, Nonlinear systems identification, Predictive control for nonlinear systems
Abstract: Koopman operator theory and Willems’ fundamental lemma both can provide (approximated) data-driven linear representation for nonlinear systems. However, choosing lifting functions for the Koopman operator is challenging, and the quality of the data-driven model from Willems’ fundamental lemma has no guarantee for general nonlinear systems. In this paper, we extend Willems’ fundamental lemma for a class of nonlinear systems that admit a Koopman linear embedding. We first characterize the relationship between the trajectory space of a nonlinear system and that of its Koopman linear embedding. We then prove that the trajectory space of Koopman linear embedding can be formed by a linear combination of rich-enough trajectories from the nonlinear system. Combining these two results leads to a data-driven representation of the nonlinear system, which bypasses the need for the lifting functions and thus eliminates the associated bias errors. Our results illustrate that both the width (more trajectories) and depth (longer trajectories) of the trajectory library are important to ensure the accuracy of the data-driven model.
|
|
16:00-16:15, Paper TuC17.3 | |
Koopman Spectral Analysis from Noisy Measurements Based on Bayesian Learning and Kalman Smoothing |
|
Zeng, Zhexuan | Huazhong University of Science and Techonology |
Zhou, Jun | Huazhong University of Science and Technology |
Wang, Yasen | Huazhong University of Science and Technology |
Ping, Zuowei | Naval University of Engineering |
Keywords: Nonlinear systems identification, Estimation, Kalman filtering
Abstract: Koopman spectral analysis plays a crucial role in understanding and modeling nonlinear dynamical systems as it reveals key system behaviors and long-term dynamics. However, the presence of measurement noise poses a significant challenge to accurately extracting spectral properties. In this work, we propose a robust method for identifying the Koopman operator and extracting its spectral characteristics in noisy environments. To address the impact of noise, our approach tackles an identification problem that accounts for both systematic errors from finite-dimensional approximations and measurement noise in the data. By incorporating Bayesian learning and Kalman smoothing, the method simultaneously identifies the Koopman operator and estimates system states, effectively decoupling these two error sources. The method's efficiency and robustness are demonstrated through extensive experiments, showcasing its accuracy across varying noise levels.
|
|
16:15-16:30, Paper TuC17.4 | |
Distributed Deep Koopman Learning for Nonlinear Dynamics |
|
Hao, Wenjian | Purdue University |
Wang, Lili | Southern University of Science and Technology |
Rai, Ayush | Purdue University |
Mou, Shaoshuai | Purdue University |
|
16:30-16:45, Paper TuC17.5 | |
Learning Koopman Bilinear Models with Multiplication-Closed Observations for Linear Optimal Controller Design |
|
Zheng, Ketong | Dresden University of Technology |
Huang, Peng | Barkhausen Institut |
Villamil, Andres | TU Dresden |
Casas, Jonathan | Dresden University of Technology |
Fettweis, Gerhard | Technische Universität Dresden |
Keywords: Identification for control, Learning, Optimal control
Abstract: The Koopman operator approximation is emerging as a leading approach for identifying and controlling nonlinear systems by transforming them into a bilinear form. However, designing reactive controllers for the Koopman bilinear system remains challenging. This paper proposes a purely data-driven method to learn the Koopman bilinear representation of control-affine systems using measurement data only and design a linear optimal controller for the learned system. Specifically, Deep Neural Networks (DNNs) are employed to learn a finite set of observables that approximately span a Koopman-invariant subspace and form a multiplication-closed set. This multiplication-closed property facilitates optimal controller design by enabling the conversion of the Koopman bilinear system into a closed-loop linear system. The linear control matrix is derived by iteratively solving the Koopman Riccati equation while minimizing an upper bound of the optimal cost. The proposed approach is validated on the Van der Pol oscillator, which outperforms the method that approximates the Koopman control system using a fixed function library in prediction accuracy and control performance.
|
|
16:45-17:00, Paper TuC17.6 | |
Temporal Autoencoder for Identification and Predictive Control of Nonlinear Dynamics Based on Koopman Operator Theory |
|
Shenoy, Sucheth | Hamburg University of Technology |
Sharan, Bindu | Hamburg University of Technology |
Werner, Herbert | Hamburg University of Technology |
Keywords: Identification for control, Machine learning, Predictive control for nonlinear systems
Abstract: This paper presents an approach to Model Predictive Control (MPC) for nonlinear systems by combining Koopman operator theory with autoencoder networks enhanced by temporal layers for time-delay embedding. Traditional Koopman-based methods miss temporal dependencies, so we incorporate Temporal Convolutional Networks (TCN), Long Short-Term Memory (LSTM), and Gated Recurrent Units (GRU) in the autoencoder. These layers capture spatial and temporal features, improving system identification and predictive capabilities. The framework is validated on Duffing and Van der Pol oscillators, showing that temporal models, especially TCN-based, outperform non-temporal ones in prediction and control. TCN-based Koopman MPC achieves faster settling times and better control, while non-temporal models show errors and poor control. The LSTM and GRU models exhibit oscillatory control behavior. We also introduce a python package PyKoopman-AE, which facilitates Koopman operator-based system identification using both temporal and non-temporal autoencoders.
|
|
TuC18 |
Director's Row E |
System Identification I |
Regular Session |
Chair: Chatzikiriakos, Nicolas | University of Stuttgart |
Co-Chair: Narayanan, Vignesh | University of South Carolina |
|
15:30-15:45, Paper TuC18.1 | |
A Novel Online System Identification Using Chebyshev Polynomial Basis of the Second Kind |
|
Yousefian, Arian | The University of Alabama in Huntsville |
Sahoo, Avimanyu | University of Alabama in Huntsville |
Narayanan, Vignesh | University of South Carolina |
Keywords: Nonlinear systems identification, Learning, Uncertain systems
Abstract: This paper introduces a novel online system identification approach utilizing the Chebyshev pseudospectral (PS) method to approximate the dynamics of a continuous-time nonlinear system. Unlike conventional periodic sampling of states, this approach employs aperiodic sampling of states leveraging the concept of Chebyshev nodes to achieve arbitrary approximation accuracy. The proposed approach introduces a moving time window strategy to determine the nodes of the Chebyshev polynomial for sampling. An adaptive identifier is proposed that approximates dynamics and reconstructs the states from the aperiodic state measurements. The least-square approach is used to estimate the parameters. The boundedness of parameter and state estimation errors is analyzed using the Lyapunov theory. Numerical simulations validate the proposed scheme.
|
|
15:45-16:00, Paper TuC18.2 | |
Online Optimal Input Excitation Signal for Sparse Identification of Euler-Lagrangian Systems |
|
Jen, Chin-Yang | National Taiwan University |
Chen, Cheng-Wei | National Taiwan University |
Keywords: Nonlinear systems identification, Modeling, Optimization
Abstract: This paper addresses the limitations of the Sparse Identification of Nonlinear Dynamical Systems (SINDy) methods, which, while effective in identifying system dynamics with minimal prior knowledge, often depend on stochastic input excitation, which limits performance. To overcome this, we propose an Online-Optimal xL-SINDy (OOL-SINDy) framework that generates optimal excitation signals for sparse identification of Euler-Lagrange systems. The framework employs a one-step-ahead optimization strategy based on D-optimality criteria, enhancing information richness during system identification, thereby improving the convergence rate. Simulation on pendulum models show superior performance of the proposed method compared to stochastic inputs, while respecting system constraints.
|
|
16:00-16:15, Paper TuC18.3 | |
Physics-Constrained Taylor Neural Networks for Learning and Control of Dynamical Systems |
|
Nguyen, Nam | Northern Arizona University |
Tique, Juan | Northern Arizona University |
Nghiem, Truong X. | University of Central Florida |
Keywords: Nonlinear systems identification, Neural networks, Optimal control
Abstract: Data-driven approaches are increasingly popular for identifying dynamical systems due to improved accuracy and availability of sensor data. However, relying solely on data for identification does not guarantee that the identified systems will maintain their physical properties or that the predicted models will generalize well. In this paper, we propose a novel method for data-driven system identification by integrating a neural network as the first-order derivative of the learned dynamics in a Taylor series instead of learning the dynamical function directly. In addition, for dynamical systems with known monotonic properties, our approach can ensure monotonicity by constraining the neural network derivative to be non-positive or non-negative to the respective inputs, resulting in Monotonic Taylor Neural Networks (MTNN). Such constraints are enforced by either a specialized neural network architecture or regularization in the loss function for training. The proposed method demonstrates better performance compared to methods without the physics-based monotonicity constraints when tested on experimental data from an HVAC system and a temperature control testbed. Furthermore, MTNN shows good performance in the control application of a model predictive controller for a practical nonlinear MIMO system.
|
|
16:15-16:30, Paper TuC18.4 | |
A Generalized Metriplectic System Via Free Energy and System Identification Via Bilevel Convex Optimization |
|
Teng, Sangli | University of Michigan |
Iwasaki, Kaito | University of Michigan |
Clark, William | Ohio University |
Bloch, Anthony M. | Univ. of Michigan |
Yu, Xihang | Massachusetts Institute of Technology |
Vasudevan, Ramanarayan | University of Michigan |
Ghaffari, Maani | University of Michigan |
Keywords: Algebraic/geometric methods, Identification
Abstract: This work generalizes the classical metriplectic formalism to model Hamiltonian systems with nonconservative dissipation. Classical metriplectic representations allow for the description of energy conservation and production of entropy via a suitable selection of an entropy function and a bilinear symmetric metric. By relaxing the Casimir invariance requirement of the entropy function, this paper shows that the generalized formalism induces the emph{free energy} analogous to thermodynamics. The monotonic change of emph{free energy} can serve as a more precise criterion than mechanical energy or entropy alone. This paper provides examples of the generalized metriplectic system in a 2-dimensional Hamiltonian system and mathrm{SO}(3). This paper also provides a bilevel convex optimization approach for the identification of the metriplectic system given measurements of the system.
|
|
16:30-16:45, Paper TuC18.5 | |
Sample Complexity Bounds for Linear System Identification from a Finite Set |
|
Chatzikiriakos, Nicolas | University of Stuttgart |
Iannelli, Andrea | University of Stuttgart |
Keywords: Statistical learning, Identification
Abstract: This paper considers a finite sample perspective on the problem of identifying an LTI system from a finite set of possible systems using trajectory data. To this end, we use the maximum likelihood estimator to identify the true system and provide an upper bound for its sample complexity. Crucially, the derived bound does not rely on a potentially restrictive stability assumption. Additionally, we leverage tools from information theory to provide a lower bound to the sample complexity that holds independently of the used estimator. The derived sample complexity bounds are analyzed analytically and numerically.
|
|
16:45-17:00, Paper TuC18.6 | |
Sampling in Parametric and Nonparametric System Identification: Aliasing, Input Conditions, and Consistency |
|
González, Rodrigo A. | Eindhoven University of Technology |
van Haren, Max | Eindhoven University of Technology |
Oomen, Tom | Eindhoven University of Technology |
Rojas, Cristian R. | KTH Royal Institute of Technology |
Keywords: Identification, Estimation, Linear systems
Abstract: The sampling rate of input and output signals is known to play a critical role in the identification and control of dynamical systems. For slow-sampled continuous-time systems that do not satisfy the Nyquist-Shannon sampling condition for perfect signal reconstructability, careful consideration is required when identifying parametric and nonparametric models. In this letter, a comprehensive statistical analysis of estimators under slow sampling is performed. Necessary and sufficient conditions are obtained for unbiased estimates of the frequency response function beyond the Nyquist frequency, and it is shown that consistency of parametric estimators can be achieved even if input frequencies overlap after aliasing. Monte Carlo simulations confirm the theoretical properties.
|
|
TuC19 |
Director's Row H |
Adaptive Control I |
Regular Session |
Chair: Paredes Salazar, Juan Augusto | University of Maryland, Baltimore Couunty |
|
15:30-15:45, Paper TuC19.1 | |
Observer-Based Adaptive Anti-Windup Compensation for LTI Stable Uncertain Systems |
|
Sofrony, Jorge Ivan | Universidad Nacional De Colombia |
Turner, Matthew C. | University of Southampton |
Keywords: Adaptive control, Constrained control, Robust adaptive control
Abstract: Actuator constraints, particularly saturation lim- its, pose significant challenges in control system implementation, especially for uncertain systems. This paper proposes a novel anti-windup scheme in which an adaptive observer is used to estimate linear parameter uncertainty in the system. The proposed compensator retains the architecture of established non-adaptive schemes, such as Model Recovery Anti-windup, but uses the observer to deal with uncertainty. If the uncertainty is estimated precisely, the system effectively reverts to the Model Recovery Anti-windup framework. The main result establishes conditions under which, if the ideal control signal eventually returns to a level within constraints, the system states will asymptotically converge to those of the nominal system, ensuring recovery of the nominal closed-loop behavior.
|
|
15:45-16:00, Paper TuC19.2 | |
Compensation-Based Asymptotic Adaptive Stabilization for Time-Varying Nonlinear Systems |
|
Liu, Guoqing | Southeast University |
Chen, Yang-Yang | Southeast University |
Keywords: Adaptive control, Stability of nonlinear systems, Uncertain systems
Abstract: Note that classical adaptive control methods often impose restrictive assumptions on uncertainty dynamics, such as the persistence of excitation conditions, and the assumption of known basis functions. To relax these stringent assumptions while ensuring asymptotic stability, sliding mode techniques and integral bounded function designs have been developed for general nonlinear time-varying systems. However, sliding mode control's reliance on the sign function often introduces controller oscillations, and integral function designs may result in high-gain or high-frequency feedback, both of which degrade transient performance. In response to these challenges, this paper proposes a novel compensation-based adaptive control scheme. The proposed design incorporates a dynamic compensation mechanism, eliminating the need for high-gain feedback and sliding mode-like terms, while still achieving asymptotic stabilization. The method is further applied to high-order nonlinear systems with unknown control coefficients. A simulation of an Euler-Lagrange system is provided to demonstrate the superior asymptotic stability performance.
|
|
16:00-16:15, Paper TuC19.3 | |
Output Emulator-Based Observer-Free Distributed Output Feedback Adaptive Control for Multivehicle Systems |
|
Albattat, Ali | Missouri University of Science and Technology |
Yucelen, Tansel | University of South Florida |
Keywords: Adaptive control, Cooperative control, Linear systems
Abstract: This work develops a novel output emulator-based, observer-free output feedback adaptive control ((OF)^2AC) method for continuous-time, minimum phase, high-order linear multivehicle systems under exogenous disturbances, specifically addressing containment. The (OF)^2AC framework employs a nonminimal state-space representation, generating an extended state set using filtered inputs, outputs, and their derivatives, thus eliminating the need for an observer for each vehicle. Additionally, the output emulator reference model ensures smooth transients by mitigating high-frequency oscillations. A numerical example is provided to demonstrate the efficacy of the proposed method.
|
|
16:15-16:30, Paper TuC19.4 | |
Experimental Application of Predictive Cost Adaptive Control to Thermoacoustic Oscillations in a Rijke Tube with Unknown Input Delay |
|
Paredes Salazar, Juan Augusto | University of Maryland, Baltimore Couunty |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control, Delay systems, Sampled-data control
Abstract: Model predictive control (MPC) has been used successfully in diverse applications. As its name suggests, MPC requires a model for predictive optimization. The present paper focuses on the application of MPC to a Rijke tube, in which a heating source and acoustic dynamics interact to produce self-excited oscillations. Since the dynamics of a Rijke tube are difficult to model to a high level of accuracy, the implementation of MPC requires leveraging data from the laboratory setup as well as knowledge about thermoacoustics, which is labor intensive and requires domain expertise. This is exacerbated by the presence of unknown input delays, which are caused by wave propagation properties, dependent on the placement of the heating source along the tube, and hard to accurately determine. With this motivation, the present paper uses predictive cost adaptive control (PCAC) for sampled-data control of an experimental Rijke-tube setup. PCAC performs online closed-loop linear model identification for receding-horizon optimization based on the backward propagating Riccati equation. In place of analytical modeling, open-loop experiments are used to create a simple emulation model, which is used for choosing PCAC hyperparameters. PCAC is applied to the Rijke-tube setup under various experimental scenarios to test its performance under unknown and parameter-dependent dynamics, and its robustness to input delay.
|
|
16:30-16:45, Paper TuC19.5 | |
A Robust Human Autonomy Collaboration Framework with Experimental Validation |
|
Uzun, Muhammed Yusuf | Bilkent University |
Inanc, Emirhan | Illinois Institute of Technology |
Yildiz, Yildiray | Bilkent University |
|
16:45-17:00, Paper TuC19.6 | |
Output-Feedback Model Predictive Control of Nonlinear Systems with Piecewise-Linear Input-Output Dynamics |
|
Islam, Syed Aseem Ul | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control, Indirect adaptive control, Switched systems
Abstract: The present paper considers nonlinear model predictive control (MPC) of piecewise-linear (PWL) dynamics. The switching of the PWL models is defined on an arbitrary (not-necessarily-polyhedral) partition of the model output. The use of input-output (rather than state space) models enables output-feedback MPC without the need for state estimation. The goal of the paper is to present an easy-to-implement and computationally cheap, heuristic algorithm that avoids the need for mixed-integer programming, and branch-and-bound and branch-and-cut solvers by taking advantage of the convexity of the receding-horizon optimization problem for each fixed PWL sequence over the optimization horizon. The challenging aspect of this approach is the fact that the optimized control sequence over the given horizon may not be consistent with the PWL model sequence used for the optimization. To overcome this problem, at each step, a sequence of optimization-based subiterations is performed using the PWL model sequence corresponding to the previously optimized sequence of control inputs. The contribution of the paper is a numerical investigation of the feasibility of output-feedback MPC with nonpolyhedral PWL models without the need for mixed-integer programming. A comparison with mixed-integer programming is also presented. In addition, one-step-subiteration convergence of the algorithm for a SISO PWL system with two partitions is proved.
|
|
TuC20 |
Director's Row I |
Estimation and Filtering I |
Regular Session |
Chair: Lamperski, Andrew | University of Minnesota |
Co-Chair: Bouhadjra, Dyhia | Consiglio Nazionale Delle Ricerche |
|
15:30-15:45, Paper TuC20.1 | |
GNSS-RTK Factor Graph Optimization with Adaptive Ambiguity Noise |
|
Hu, Yingjie | University of Minnesota, Twin Cities |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Berntorp, Karl | Walmart Advanced Systems Robotics |
Keywords: Estimation, Aerospace
Abstract: This paper proposes a graph-optimization based Real-time kinematic (RTK) global navigation satellite system (GNSS) positioning approach, which consists of two stages of factor graph optimization (FGO). The first-stage FGO solves for the float solutions of PNT states including the carrier phase integer ambiguities. To reliably resolve the integer ambigui- ties plagued by the recurrent cycle clips in GNSS-challenged environments, we characterize the time evolution of integer ambiguities with an adaptive ambiguity model to accommodate the frequent cycle slips. This adaptive ambiguity model is incorporated into the first-stage factor graph formulation, which enables the graph optimization to explore the time correlation inherent in the integer ambiguity evolution. By employing this time-correlated constraint on integer ambiguity variables, integer fixation with higher accuracy can be achieved, thus, leading to improved precision in positioning. After the integer ambiguity is resolved, the second-stage FGO takes the solutions from the first stage as prior and performs another graph optimization to obtain the fixed solutions of positions and velocities. Monte Carlo simulation results demonstrate that our proposed approach can achieve statistically smaller root mean square error (RMSE) in position estimates compared to Kalman filter-based method and is more robust to cycle slips.
|
|
15:45-16:00, Paper TuC20.2 | |
Wind Estimation by Parameter Identification of an Aircraft's Lateral-Directional Dynamic Model |
|
Nguyen, Duc Thang | National Defense Academy of Japan |
Ochi, Yoshimasa | National Defense Academy |
Keywords: Estimation, Identification, Model Validation
Abstract: This paper proposes a practical method for estimating wind in the inertial frame by estimating the parameters of an aircraft's lateral-directional equations of motion. The north, east, and down-wind components are estimated as part of the parameters of the equations of motion, along with stability and control derivatives, using a standard estimation algorithm such as the least-squares method. The wind is assumed to be constant or linearly varying with time. The proposed method, based on the observation that the state variables regarding speed in the right-hand side of the linear equations of motion are the airspeed and that the wind is given by the coordinate transformation from the inertial frame to the body frame, is not only theoretically sound but also practically applicable. The method's effectiveness was investigated through simulation using the flight data generated by NASA's Generic Transport Model (GTM).
|
|
16:00-16:15, Paper TuC20.3 | |
Non-Asymptotic Analysis of Classical Spectrum Estimators with L-Mixing Time-Series Data |
|
Zheng, Yuping | University of Minnesota |
Lamperski, Andrew | University of Minnesota |
Keywords: Estimation, Markov processes, Stochastic systems
Abstract: Spectral estimation is a fundamental problem for time series analysis, which is widely applied in economics, speech analysis, seismology, and control systems. The asymptotic convergence theory for classical, non-parametric estimators, is well-understood, but the non-asymptotic theory is still rather limited. Our recent work gave the first non-asymptotic error bounds on the well-known Bartlett and Welch methods, but under restrictive assumptions. In this paper, we derive non-asymptotic error bounds for a class of non-parametric spectral estimators, which includes the classical Bartlett and Welch methods, under the assumption that the data is an L-mixing stochastic process. A broad range of processes arising in time-series analysis, such as autoregressive processes and measurements of geometrically ergodic Markov chains, can be shown to be L-mixing. In particular, L-mixing processes can model a variety of nonlinear phenomena which do not satisfy the assumptions of our prior work. Our new error bounds for L-mixing processes match the error bounds in the restrictive settings from prior work up to logarithmic factors.
|
|
16:15-16:30, Paper TuC20.4 | |
On the Real-Time Compliance of Moving-Horizon Simultaneous Input-And-State Estimation Problems |
|
Manngĺrd, Mikael | Novia University of Applied Sciences |
Bouzoulas, Dimitrios | Novia University of Applied Sciences |
Hakonen, Urho | Aalto University |
Viitala, Raine | Aalto University |
Kronqvist, Jan | KTH Royal Insitute of Technology |
Keywords: Estimation, Optimization, Observers for Linear systems
Abstract: The real-time compliance of a family of moving-horizon simultaneous input-and-state estimation (MH-SISE) problems is assessed. Given the strict real-time requirements of practical applications, the use of numerical optimization techniques for estimation has been limited for systems with fast dynamics. Thus, we explore the use of solver code generation to improve solution times. By generating high-speed solver code tailored to this specific class of moving-horizon problems, substantial improvements in solution times compared to conventional solvers are observed. The proposed methods are evaluated through simulated benchmark tests on lumped-element models of rotating shafts to assess the real-time compliance with respect to measurement sampling rate, model size, and estimation horizon length.
|
|
16:30-16:45, Paper TuC20.5 | |
Gradient-Based Line-Search Optimization for Moving Horizon Estimation |
|
Bouhadjra, Dyhia | National Research Council of Italy |
Gaggero, Mauro | National Research Council of Italy |
Alessandri, Angelo | University of Genoa |
Keywords: Estimation, Optimization, Optimization algorithms
Abstract: This paper investigates the application of the gradient descent method in moving horizon state estimation for discrete-time nonlinear systems with line-search optimization based on a reduce number of iterations. Conditions guaranteeing the stability of the estimation error are established for single- and multi-iteration schemes to minimize a least-squares cost function based on the most recent batch of information. Numerical results demonstrate the effectiveness of the proposed approaches and highlight the enhanced performance through the combination of descent algorithms and line-search methods.
|
|
16:45-17:00, Paper TuC20.6 | |
A Convex Optimization Framework for Computing Robustness Margins of Kalman Filters |
|
Prabhat, Himanshu | Texas A&M University |
Bhattacharya, Raktim | Texas A&M |
Keywords: Kalman filtering, Estimation, Optimization
Abstract: This paper proposes a novel convex optimization framework for designing robust Kalman filters that guarantee a user-specified steady-state error while maximizing process and sensor noise. The proposed framework simultaneously determines the Kalman gain and the robustness margin in terms of the process and sensor noise. This joint formulation for the Kalman filtering is addressed for discrete and continuous linear time-invariant systems. The proposed methodology is validated through two distinct examples: the Clohessy-Wiltshire-Hill equations for a chaser spacecraft in an elliptical orbit and the longitudinal motion model of an F-16 aircraft.
|
|
TuC21 |
Director's Row J |
Switched Systems |
Regular Session |
Chair: Hanke, Nils | University of Kassel |
Co-Chair: Li, Jing Shuang (Lisa) | University of Michigan |
|
15:30-15:45, Paper TuC21.1 | |
Parameter Tuning for Optimal Control of Switched Systems with Applications in Hypersonic Vehicles |
|
Yin, Shunan | Purdue University |
Rai, Ayush | Purdue University |
Mou, Shaoshuai | Purdue University |
Keywords: Agents-based systems, Optimal control, Switched systems
Abstract: Optimal control of switched systems (OCSS) is of great importance since they have significant practical implementation. This article aims to tackle the problem of adapting OCSS to additional objective functions. We propose an algorithm to enable a tunable OCSS to adjust its parameters dynamically with respect to an additional loss function in a bi-level framework. At the higher level, the algorithm utilizes gradient descent to minimize this additional objective function while simultaneously addressing an optimal control problem at the lower level. By differentiating the maximum principle for the optimal control of switched systems, gradient computation is achieved by solving an auxiliary initial value problem. Besides theoretical analysis, the algorithm’s effectiveness is also numerically demonstrated by optimal control problems of a hypersonic vehicle with a combined-power engine.
|
|
15:45-16:00, Paper TuC21.2 | |
Human Balancing on a Log: A Switched Multi-Layer Controller |
|
Zhao, Jiayi | University of Michigan, Ann Arbor |
Yang, Mo | University of Michigan |
Li, Jing Shuang (Lisa) | University of Michigan |
Keywords: Biological systems, Mechanical systems/robotics, Robotics
Abstract: We study the task of balancing a human on a log that is fixed in place. Balancing on a log is substantially more challenging than balancing on a flat surface due to increased instability --- nonetheless, we are able to balance by composing simple (e.g., PID, LQR) controllers in a bio-inspired switched multi-layer configuration. The controller consists of an upper-layer LQR planner (akin to the central nervous system) that coordinates ankle and hip torques, and lower-layer PID trackers (akin to local motor units) that follow this plan subject to nonlinear dynamics. The controller switches between three operational modes depending on the state of the human. The efficacy of the controller is verified in simulation, where our controller is able to stabilize the human for a variety of initial conditions and disturbances. We also introduce a controller that outputs muscle activations to perform the same balancing task.
|
|
16:00-16:15, Paper TuC21.3 | |
Saturated ARISE Control for a Nonsmooth and Switched Euler-Lagrange Dynamic System |
|
Crapet, Joseph | Auburn University |
Mishra, Kislaya | Auburn University |
Basyal, Sujata | Auburn University |
Allen, Brendon C. | Auburn University |
Keywords: Robust adaptive control, Lyapunov methods, Stability of nonlinear systems
Abstract: Abstract—Nonlinear control techniques have been developed and researched for a few decades. One common area of study is the development of controllers that can address unknown disturbances or unknown dynamics. Another area of study considers control methods that can be implemented in systems despite the existence of discontinuities. Although this progress has been made, these prior methods contain limitations that restrict them to specific nonlinear control scenarios or result in undesired effects such as chatter. With these limitations taken into consideration, an ARISE controller is developed that is capable of addressing the unknown dynamics and discontinuities of a switched Euler-Lagrange dynamic system while also minimizing chatter. The proposed controller includes a saturated error signal to saturate the control input, accounting for actuator limitations. Moreover, to resolve the system uncertainties, an adaptive update law is developed to learn the system’s uncertain control effectiveness matrix. To validate the proposed controller, a Lyapunov-like switched systems stability analysis was performed, and the analysis proved that the controller achieves semi-global exponential trajectory tracking to an ultimate bound.
|
|
16:15-16:30, Paper TuC21.4 | |
Recurrent Output Tracking of Switched Boolean Control Networks under Constant Reference Signal |
|
Jiang, Chunfeng | University of Sannio |
Fu, Shihua | Liaocheng University |
Wu, Yuhu | Dalian University of Technology |
Del Vecchio, Carmen | Universitŕ Del Sannio |
Keywords: Switched systems, Genetic regulatory systems, Output regulation
Abstract: This paper investigates the recurrent output tracking (ROT) problem of switched Boolean control networks (SBCNs). The ROT problem of SBCNs is formulated when the output tracking of systems does not need to or can not be achieved. Leveraging the concept of recurrent state and reachable set, a necessary and sufficient condition is proposed to check the solvability of the ROT problem for SBCNs. Subsequently, an efficient algorithm is established to design state feedback switching signals and state feedback controllers such that the SBCNs can recurrently track a fixed reference output signal. Finally, the validity of obtained results is verified through a practical example.
|
|
16:30-16:45, Paper TuC21.5 | |
Approximation of Planar Periodic Behavior from Data with Stability Guarantees Using Switching Affine Systems |
|
Hanke, Nils | University of Kassel |
Liu, Zonglin | University of Kassel |
Stursberg, Olaf | University of Kassel |
Keywords: Switched systems, Identification, Stability of hybrid systems
Abstract: This paper proposes a novel method to approximate sampled trajectories of periodic systems by switching affine dynamics in the plane. Unlike previous work, which uses only state partitions into two regions or external input signals, the present work provides a set of rules for partitioning the state space and a scheme to synthesize the switching affine systems. These are constructed such that the existence of a unique and locally stable limit cycle is guaranteed. The synthesis approach is formulated as a constrained numeric optimization problem, which starts from the sampled data and minimizes the difference between the data and the resulting limit cycle of the approximation while assuring the stability constraints. The principle and efficiency of the proposed method is illustrated for an example.
|
|
16:45-17:00, Paper TuC21.6 | |
Robust Controller Synthesis under Markovian Mode Switching with Periodic LTV Dynamics |
|
Shrivastava, Shaurya | Purdue University |
Oguri, Kenshiro | Purdue University |
Keywords: Stochastic systems, Hybrid systems, LMIs
Abstract: In this work, we propose novel LMI-based controller synthesis frameworks for periodically time-varying Markov-jump linear systems. We first discuss the necessary conditions for mean square stability and derive Lyapunov-like conditions for stability assurance. To relax strict stability requirements, we introduce a new criterion that doesn't require the Lyapunov function to decrease at each time step. Further, we incorporate these stability theorems in LMI-based controller synthesis frameworks while considering two separate problems: minimizing a quadratic cost, and maximizing the region of attraction. Numerical simulations verify the controllers' stability and showcase its applicability to fault-tolerant control.
|
| |