| |
Last updated on August 8, 2024. This conference program is tentative and subject to change
Technical Program for Friday July 12, 2024
|
FrP1 Plenary Session, Metro E/C |
Add to My Program |
Automatic Control in the Era of Artificial Intelligence |
|
|
Chair: Leang, Kam K. | University of Utah |
Co-Chair: Grover, Martha | Georgia Institute of Technology |
|
08:30-09:30, Paper FrP1.1 | Add to My Program |
Automatic Control in the Era of Artificial Intelligence |
|
Borrelli, Francesco | Unversity of California at Berkeley |
Keywords: Predictive control for nonlinear systems, Robust adaptive control, Autonomous systems
Abstract: In an era where Artificial Intelligence (AI) is often seen as a universal solution for any complex problem, this presentation offers a critical examination of its role in the field of automatic control. To be concrete, I will focus on Optimal Control techniques, navigating through its history and addressing the evolution from its traditional model-based roots to the emerging data-driven methodologies empowered by AI. The presentation will delve into how the theoretical underpinnings of Optimal Control have been historically aligned with computational capabilities, and how this alignment has shifted over the years. This juxtaposition of theory and computation motivates a deeper investigation into the diminishing relevance of certain traditional control methods amidst the AI revolution. We will critically examine scenarios where AI-driven approaches could outperform classical methods, as well as cases where the hype surrounding AI overshadows its actual utility. The talk will conclude with a nuanced view of state-of-the-art optimal control methods in practical applications including self-driving cars, advanced robotics and energy efficient systems. From this perspective, we will identify and explore future potential directions for the field, including the design of learning control architectures which seamlessly integrate predictive capabilities at every level, focusing on systems that can autonomously refine their performance over time through continuous learning and interaction with their environment.
|
|
FrA01 RI Session, Metro E/C |
Add to My Program |
RI: Learning and Optimization |
|
|
Chair: Chhabra, Robin | Carleton University |
Co-Chair: Yi, Jingang | Rutgers University |
|
10:00-10:03, Paper FrA01.1 | Add to My Program |
Utilizing Load Shifting for Optimal Compressor Sequencing in Industrial Refrigeration |
|
Konda, Rohit | UC Santa Barbara |
Chandan, Vikas | CrossnoKaye |
Crossno, Jesse | CrossnoKaye |
Pollard, Blake | CrossnoKaye |
Walsh, Daniel | CrossnoKaye |
Bohonek, Rick | Butterball |
Marden, Jason R. | University of California, Santa Barbara |
Keywords: Control applications, Building and facility automation, Optimization
Abstract: The ubiquity and energy needs of industrial refrigeration has prompted several research studies investigating various control opportunities for reducing energy demand. This study focuses on one such opportunity termed compressor sequencing, which involves selecting the optimal operational state of compressors to fulfill the required refrigeration load efficiently. We first investigate the static compressor sequencing problem and highlight its computational complexity and load-dependent variability. To address these issues, we propose integrating load shifting with compressor sequencing, in which the facility is strategically pre-cooled to enhance compressor efficiency. Our results, based on real-world sensor data from an industrial refrigeration site of Butterball LLC located in Huntsville, AR, demonstrate that without load shifting, even optimal compressor operation often results in inefficiencies due to compressors running at intermediate capacity levels. By implementing load shifting, we observe potential energy savings of up to 20% compared to optimal sequencing without load shifting.
|
|
10:03-10:06, Paper FrA01.2 | Add to My Program |
Exponential Stability of Primal-Dual Gradient Method for Distributed Convex Strongly Concave Minimax Problem |
|
Hu, Binxin | Tongji University |
Liang, Shu | Tongji University |
Keywords: Distributed control, Optimization algorithms, Agents-based systems
Abstract: In this paper, we investigate distributed convex strongly concave minimax problem without the requirement of strong convexity. The distributed minimax problem is transformed into a distributed optimization with inner maximum operation and solved by a class of primal-dual gradient algorithms. By using the metric regularity, a criterion for exponential convergence is given. Moreover, we explain why the criterion corresponds to a weaker assumption than strict or strong convexity. Two numerical simulation examples demonstrate the effectiveness of the algorithm.
|
|
10:06-10:09, Paper FrA01.3 | Add to My Program |
Communication-Constrained STL Task Decomposition through Convex Optimization |
|
Marchesini, Gregorio | KTH Royal Institute of Technology |
Liu, Siyuan | KTH Royal Institute of Technology |
Lindemann, Lars | University of Southern California |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Formal verification/synthesis, Distributed control, Agents-based systems
Abstract: We propose a method to decompose signal temporal logic tasks for multi-agent systems under communication constraints. Specifically, given a task graph representing task dependencies among couples of agents in the system, we propose to decompose tasks assigned to couples of agents not connected in the communication graph by a set of sub-tasks assigned to couples of communicating agents over the communication graph. To this end, we parameterize the predicates' level set of tasks to be decomposed as hyper-rectangles with parametric centres and dimensions. Convex optimization is then leveraged to find optimal parameters maximising the volume of the predicate's level sets. Moreover, a formal treatment of conflicting conjunctions of formulas in the considered STL fragment is introduced, including sufficient conditions to avoid the insurgence of such conflicts in the final decomposition.
|
|
10:09-10:12, Paper FrA01.4 | Add to My Program |
Learning-Based Hierarchical Model Predictive Control for Drift Vehicles |
|
Zhou, Bei | Zhejiang University |
Hu, Cheng | Zhejiang University |
Shi, Yao | Zhejiang University |
Hu, Xiaorong | Zhejiang University |
Xie, Lei | Zhejiang University |
Su, Hongye | Zhejiang Univ |
Keywords: Learning, Automotive control, Optimization
Abstract: Drift-driving technique offers valuable insights to support safe autonomous driving in extreme conditions. Model predictive control (MPC) has become the dominant choice for drift vehicle control with a superior ability to handle the changing system dynamics and constraints. Existing control strategies necessitate a precise system model to calculate the reference drift equilibriums, which can be more intractable due to the highly nonlinear dynamics and sensitive vehicle parameters. Furthermore, MPC performance strictly contingents on appropriate controller parameters, presenting an additional hurdle for drift vehicles. To solve these problems, Bayesian optimization (BO) is first applied to compensate for modeling errors and optimize controller design for drift vehicles. A learning-based hierarchical model predictive control (LHMPC) strategy is proposed in this paper, where an upper-level BO supervisor provides learned drift equilibriums and controller parameters for a lower-level MPC. This hierarchical system architecture also effectively resolves the inherent conflict between path tracking and drifting. The LHMPC strategy is verified on the Matlab-Carsim platform, and simulation results demonstrate its effectiveness in guiding the vehicle following the reference trajectory while maintaining the drift states.
|
|
10:12-10:15, Paper FrA01.5 | Add to My Program |
Real-Time Safety Index Adaptation for Parameter-Varying Systems Via Determinant Gradient Ascend |
|
Chen, Rui | Carnegie Mellon University |
Zhao, Weiye | Carnegie Mellon University |
Liu, Ruixuan | Carnegie Mellon University |
Zhang, Weiyang | University of Michigan, Ann Arbor |
Liu, Changliu | Carnegie Mellon University |
Keywords: Lyapunov methods, Optimization, Adaptive control
Abstract: Safety Index Synthesis (SIS) is critical for deriving safe control laws. Recent works propose to synthesize a safety index (SI) via nonlinear programming and derive a safe control law such that the system 1) achieves forward invariant (FI) with some safe set and 2) guarantees finite time convergence (FTC) to that safe set. However, real-world system dynamics can vary during run-time, making the control law infeasible and invalidating the initial SI. Since the full SIS nonlinear programming is computationally expensive, it is infeasible to re-synthesize the SI each time the dynamics are perturbed. To address that, this paper proposes an efficient approach to adapting the SI to varying system dynamics and maintaining the feasibility of the safe control law. The proposed method leverages determinant gradient ascend and derives a closed-form update to safety index parameters, enabling real-time adaptation performance. A numerical study validates the effectiveness of our approach.
|
|
10:15-10:18, Paper FrA01.6 | Add to My Program |
Sample Complexity of Chance Constrained Optimization in Dynamic Environment |
|
Shukla, Apurv | Texas A&M |
Zhang, Qian | Texas A&M University |
Xie, Le | Texas A&M University |
Keywords: Optimization algorithms
Abstract: We study the scenario approach for solving chance-constrained programs in dynamic environments. Scenario generation methods approximate the true feasible region from scenarios generated independently and identically from the actual distribution. In this paper, we consider this problem in a dynamic environment, where the scenarios are assumed to be drawn in a sequential fashion from an unknown and time-varying distribution. Such dynamic environments are driven by changing environmental conditions present in many real-world applications. We couple the time-varying distributions using the Wasserstein metric between the sequence of scenario-generating distributions and the actual chance-constrained distribution. Our main results are bounds on the number of samples essential for ensuring the ex-post risk in chance-constrained optimization problems when the underlying feasible set is convex or non-convex. Finally, our results are illustrated on multiple numerical experiments for both types of feasible sets.
|
|
10:18-10:21, Paper FrA01.7 | Add to My Program |
Analysis of Backtracking A* for Resource Constrained Shortest Path Problems |
|
Ford, Bryce | The Ohio State University |
Kumar, Mrinal | Ohio State University |
Keywords: Optimization algorithms, Optimization
Abstract: The Resource Constrained Shortest Path Problem (RCSPP) requires a minimum-cost simple path between two nodes that is subject to a resource consumption constraint. In this paper, we consider the Backtracking A* algorithm presented in previous works applied to the general RCSPP. Backtracking A* attempts to solve the RCSPP by iterative modification of paths generated by a shortest path algorithm such as A*. We consider the completeness of Backtracking A* and demonstrate that it cannot be a complete algorithm. Then we propose a complete, modified version of Backtracking A*. Finally, we give a result for the time complexity of Backtracking A*, and demonstrate it under worst-case conditions applied to randomly generated graphs.
|
|
10:21-10:24, Paper FrA01.8 | Add to My Program |
Guaranteeing Service in Connected Microgrids: Storage Planning and Optimal Power Sharing Policy |
|
Dey, Arnab | University of Minnesota, Twin Cities |
Khatana, Vivek | University of Minnesota, Twin-Cities |
Mani, Ankur | University of Minnesota |
Salapaka, Murti V. | University of Minnesota, Minneapolis |
Keywords: Stochastic systems, Power systems, Optimization
Abstract: The integration of renewable energy sources (RES) into power distribution grids poses challenges to system reliability due to the inherent uncertainty in their power production. To address this issue, battery energy sources (BESs) are being increasingly used as a promising solution to counter the uncertainty associated with RES power production. During the overall system planning stage, the optimal capacity of the BES has to be decided. In the operational phase, policies on when to charge the BESs and when to use them to support loads must be determined so that the BES remains within its operating range, avoiding depletion of charge on one hand and remaining within acceptable margins of maximum charge on the other. In this paper, a stochastic control framework is used to determine battery capacity, for microgrids, which ensures that during the operational phase, BESs' operating range is respected with pre-specified high probability. We provide an explicit analytical expression of the required BESs energy capacity for a single microgrid with RES as the main power source. Leveraging insights from the single microgrid case, the article focuses on the design and planning of BESs for the two-microgrid scenario. In this setting, microgrids are allowed to share power while respecting the capacity constraints imposed by the power lines. We characterize the optimal power transfer policy between the microgrids and the optimal BES capacity for multiple microgrids. This provides the BES savings arising from connecting the microgrids.
|
|
10:24-10:27, Paper FrA01.9 | Add to My Program |
Learning in Stochastic Stackelberg Games |
|
Das, Pranoy | Purdue University |
Nortmann, Benita Alessandra Lucia | Imperial College London |
Ratliff, Lillian J. | University of Washington |
Gupta, Vijay | Purdue University |
Mylvaganam, Thulasi | Imperial College London |
Keywords: Learning, Game theory, Markov processes
Abstract: We present a learning algorithm for players to converge to their stationary policies in a general sum stochastic sequential Stackelberg game. The algorithm is a two time scale implicit policy gradient algorithm that provably converges to stationary points of the optimization problems of the two players. Our analysis allows us to move beyond the assumptions of zero-sum or static Stackelberg games made in the existing literature for learning algorithms to converge.
|
|
10:27-10:30, Paper FrA01.10 | Add to My Program |
Incentivized Exploration of Non-Stationary Stochastic Bandits |
|
Chakraborty, Sourav | University of Colorado |
Chen, Lijun | University of Colorado at Boulder |
Keywords: Learning, Uncertain systems, Randomized algorithms
Abstract: We study the incentivized exploration for the multi-armed bandit (MAB) problem with non-stationary reward distributions, where the players receive compensation for exploring arms other than the greedy choice and may provide a biased feedback on reward. We consider two different non-stationary environments: abruptly-changing and continuously-changing, and propose respective incentivized exploration algorithms. We show that the proposed algorithms achieve sublinear regret and compensation in time, and are therefore effective in incentivizing exploration, despite the nonstationarity and the biased/drifted feedback.
|
|
10:30-10:33, Paper FrA01.11 | Add to My Program |
Does Online Gradient Descent (and Variants) Still Work with Biased Gradient and Variance? |
|
Al-Tawaha,, Ahmad | Virginia Tech |
Jin, Ming | Virginia Tech |
Keywords: Learning, Optimization, Optimization algorithms
Abstract: Deterministic bias and stochastic unbiased noise in gradients can affect the performance of online learning algorithms. While existing studies provide bounds for dynamic regret under these uncertainties, they offer limited insight into the specific functionality of the algorithms. This paper investigates the efficacy of online gradient-based algorithms (OGD) with inexact gradients, quantifying the degree of tolerance to these uncertainties and identifying conditions for ensuring robustness. Our analysis reveals that bias and variance function independently, and the tolerance of online gradient-based algorithms to inexactness depends on factors such as decision dimension, gradient norm, function variations, alignment of gradients, and function curvature. We verify our results numerically and experimentally, bridging a significant knowledge gap. As a case study, we introduce a general online optimization algorithm to explore the interplay between bias and variance with dynamic regret.
|
|
10:33-10:36, Paper FrA01.12 | Add to My Program |
Physics-Informed RL for Maximal Safety Probability Estimation |
|
Hoshino, Hikaru | University of Hyoto |
Nakahira, Yorie | Carnegie Mellon University |
Keywords: Learning, Stochastic optimal control, Markov processes
Abstract: Accurate risk quantification and reachability analysis are crucial for safe control and learning, but sampling from rare events, risky states, or long-term trajectories can be prohibitively costly. Motivated by this, we study how to estimate the long-term safety probability of maximally safe actions without sufficient coverage of samples from risky states and long-term trajectories. The use of maximal safety probability in control and learning is expected to avoid conservative behaviors due to over-approximation of risk. Here, we first show that long-term safety probability, which is multiplicative in time, can be converted into additive costs and be solved using standard reinforcement learning methods. We then derive this probability as solutions of partial differential equations (PDEs) and propose Physics-Informed Reinforcement Learning (PIRL) algorithm. The proposed method can learn using sparse rewards because the physics constraints help propagate risk information through neighbors. This suggests that, for the purpose of extracting more information for efficient learning, physics constraints can serve as an alternative to reward shaping. The proposed method can also estimate long-term risk using short-term samples and deduce the risk of unsampled states. This feature is in stark contrast with the unconstrained deep RL that demands sufficient data coverage. These merits of the proposed method are demonstrated in numerical simulation.
|
|
10:36-10:39, Paper FrA01.13 | Add to My Program |
Learning-To-Control Relaxation Systems with the Step Response |
|
Drummond, Ross | University of Sheffield |
Taghavian, Hamed | KTH Royal Institute of Technology |
Baldivieso Monasterios, Pablo Rodolfo | The University of Sheffield |
Keywords: Linear systems, Learning, Robust control
Abstract: The problem of learning-to-control relaxation systems from data is considered. It is shown that the equilibrium of the relaxation system’s step response defines the solution of a class of robust control problems and provides a good suboptimal solution to a class of linear quadratic regulator problems. These results demonstrate the potential to efficiently learn policies for these control problems from a single, easy-to-implement trajectory data point, being the step response. More broadly, these results highlight how the system structure and problem definition of the control problem can be exploited to generate data efficient learning-to-control methods.
|
|
10:39-10:42, Paper FrA01.14 | Add to My Program |
An Iterative Method for Computing Controlled Reach-Avoid Sets |
|
Ren, Dejin | Institute of Software Chinese Academy of Sciences |
Wu, Taoran | Institute of Software CAS |
Xue, Bai | Institute of Software, Chinese Academy of Sciences |
Keywords: Formal verification/synthesis, Computational methods, Autonomous systems
Abstract: This paper focuses on addressing the problem of computing controlled reach-avoid sets for continuous-time systems modeled by polynomial ordinary differential equations with control inputs in order to ensure the safety and reachability of safety-critical systems. In a controlled reach-avoid set (CRAS), there exists a feedback controller capable of driving the closed-loop system into a target set of desired states while avoiding hazardous regions. The computation of a controlled reach-avoid set can be transformed into a search for a guidance-barrier function in existing literature. However, existing guidance-barrier functions tend to produce conservative CRASs due to certain flaws. To overcome this issue, a new guidance-barrier function is introduced, which generates less conservative CRASs compared to existing ones. Given the inherent nonlinearity associated with searching for guidance-barrier functions in the control setting, an iterative computational approach is proposed. This approach modifies controllers from previous iterations to find these functions and expand CRASs by solving convex optimizations. Finally, numerical results demonstrate the efficiency of our method in generating less conservative CRASs.
|
|
10:42-10:45, Paper FrA01.15 | Add to My Program |
ChatMPC: Natural Language Based MPC Personalization |
|
Miyaoka, Yuya | Keio University |
Inoue, Masaki | Keio University |
Nii, Tomotaka | Keio University |
Keywords: Human-in-the-loop control, Emerging control applications, Learning
Abstract: We address the personalization of control systems, which is an attempt to adjust inherent safety and other essential control performance based on each user's personal preferences. A typical approach to personalization requires a substantial amount of user feedback and data collection, which may result in a burden on users. Moreover, it might be challenging to collect data in real-time. To overcome this drawback, we propose a natural language-based personalization, which places a comparatively lighter burden on users and enables the personalization system to collect data in real-time. In particular, we consider model predictive control (MPC) and introduce an approach that updates the control specification using chat within the MPC framework, namely ChatMPC. In the numerical experiment, we simulated an autonomous robot equipped with ChatMPC. The result shows that the specification in robot control is updated by providing natural language-based chats, which generate different behaviors.
|
|
10:45-10:48, Paper FrA01.16 | Add to My Program |
Compression Repair for Feedforward Neural Networks Based on Model Equivalence Evaluation |
|
Mo, Zihao | Augusta University |
Yang, Yejiang | Augusta University |
Lu, Shuaizheng | Augusta University |
Xiang, Weiming | Augusta University |
Keywords: Neural networks, Formal verification/synthesis, Model/Controller reduction
Abstract: In this paper, we propose a method of repairing compressed Feedforward Neural Networks (FNNs) based on equivalence evaluation of two neural networks. In the repairing framework, a novel neural network equivalence evaluation method is developed to compute the output discrepancy between two neural networks. The output discrepancy can quantitatively characterize the output difference produced by compression procedures. Based on the computed output discrepancy, the repairing method first initializes a new training set for the compressed networks to narrow down the discrepancy between the two neural networks and improve the performance of the compressed network. Then, we repair the compressed FNN by re-training based on the training set. We apply our developed method to the MNIST dataset to demonstrate the effectiveness and advantages of our proposed repair method.
|
|
10:48-10:51, Paper FrA01.17 | Add to My Program |
Verification-Aided Learning of Neural Network Barrier Functions with Termination Guarantees |
|
Chen, Shaoru | Microsoft Corporation |
Ogunmolu, Olalekan | Microsoft Research |
Fazlyab, Mahyar | Johns Hopkins University |
Keywords: Neural networks, Learning, Formal verification/synthesis
Abstract: Barrier functions are a general framework for establishing a safety guarantee for a system. However, there is no general method for finding these functions. To address this shortcoming, recent approaches use self-supervised learning techniques to learn these functions using training data that are periodically generated by a verification procedure, leading to a verification-aided learning framework. Despite its immense potential in automating barrier function synthesis, the verification-aided learning framework does not have termination guarantees and may suffer from a low success rate of finding a valid barrier function in practice. In this paper, we propose a holistic approach to address these drawbacks. With a convex formulation of the barrier function synthesis, we propose to first learn an empirically well-behaved neural network basis function and then apply a fine-tuning algorithm that exploits the convexity and counterexamples from the verification failure to find a valid barrier function with finite-step termination guarantees: if there exist valid barrier functions, the fine-tuning algorithm is guaranteed to find one in a finite number of iterations. We demonstrate that our fine-tuning method can significantly boost the performance of the verification-aided learning framework on examples of different scales and using various neural network verifiers.
|
|
10:51-10:54, Paper FrA01.18 | Add to My Program |
Obstacle-Free Trajectory Planning of an Uncertain Space Manipulator: Learning from a Fixed-Based Manipulator |
|
Sze, Timothy | Carleton University |
Chhabra, Robin | Carleton University |
Keywords: Learning, Autonomous robots, Mechanical systems/robotics
Abstract: In a typical space debris mitigation mission, a space manipulator must plan maneuvers free of self-collision and collision with the noncooperative target satellite to perform a safe capture. We develop an effective model-free planner based on deep reinforcement learning for free-floating manipulators that only relies on an uncertain target position feedback. At its core, the learning agent employs the Deep Deterministic Policy Gradient (DDPG) algorithm capable of working with continuous states and actions. To improve the learning performance, we propose a five-step sequential learning that uses priority episode sampling to effectively transfer knowledge from a fixed-based manipulator trained to follow a moving target to an uncertain space manipulator capturing a target point on a satellite. Further, to avoid moving obstacles, we introduce the notion of multi-critic in the DDPG setting, such that one critic optimizes the task of chasing in an uncertain environment and another one focuses on obstacle avoidance. To show the efficacy of the developed trajectory planner, we compare its running average success rate and reward value with a baseline DDPG.
|
|
10:54-10:57, Paper FrA01.19 | Add to My Program |
Learning and Optimization for Price-Based Demand Response of Electric Vehicle Charging |
|
Gu, Chengyang | The Hong Kong University of Science and Technology (Guangzhou) |
Pan, Yuxin | The Hong Kong University of Science and Technology |
Liu, Ruohong | Hong Kong University of Science and Technology |
Chen, Yize | Hong Kong University of Science and Technology |
Keywords: Optimal control, Neural networks, Power systems
Abstract: In the context of charging electric vehicles (EVs), the price-based demand response (PBDR) is becoming increasingly significant for charging load management. Such response usually encourages cost-sensitive customers to adjust their energy demand in response to changes in price for financial incentives. Thus, to model and optimize EV charging, it is important for charging station operator to model the PBDR patterns of EV customers by precisely predicting charging demands given price signals. Then the operator refers to these demands to optimize charging station power allocation policy. The standard pipeline involves offline fitting of a PBDR function based on historical EV charging records, followed by applying estimated EV demands in formulation of downstream charging station operation optimization. However, the criterion used for evaluating demand prediction often differs from the ultimate criteria on which we evaluate the performance of EV charging optimization. And considering the relatively small scale of historical price-demand dataset, the model trained offline may not reliably predict outcomes for the incoming charging scheduling tasks. To tackle these problems as a whole, we propose a new decision-focused end-to-end framework for PBDR modeling that combines prediction errors and downstream optimization cost errors in the model learning stage. We evaluate the effectiveness of our method on a simulation of charging station operation with synthetic PBDR patterns of EV customers, and experimental results demonstrate that this framework can provide a more reliable prediction model for the ultimate optimization process, leading to more effective optimization solutions in terms of cost savings and charging station operation objectives with only a few training samples.
|
|
10:57-11:00, Paper FrA01.20 | Add to My Program |
Optimal Tracking of Uncertain Linear Discrete-Time Systems Using Trajectory-Dependent Lifelong Q-Learning |
|
Geiger, Maxwell | Missouri University of Science and Technology |
Narayanan, Vignesh | University of South Carolina |
Jagannathan, Sarangapani | Missouri Univ of Science & Tech |
Keywords: Optimal control, Adaptive control, Machine learning
Abstract: This research proposes an innovative optimal trajectory tracking scheme for uncertain linear discrete-time (DT) systems, leveraging trajectory-dependent Q-learning. Unlike conventional optimal tracking control approaches, the proposed method eliminates the need for a desired trajectory generator function, typically modeled as the dynamics of an autonomous system. Instead, we tackle the tracking problem by learning a Q-function that depends on a horizon of reference trajectory points in the future, which enables the computation of optimal feedback gains and time-varying feedforward control inputs without prior knowledge of system parameters or access to the complete reference trajectory. To enhance the effectiveness of the controller in multitask scenarios, we use the Efficient Lifelong Learning Algorithm (ELLA) to generate a shared knowledge base and use online adaptive control methods to directly learn parameters for each task, enabling information transfer between tasks. Simulation results using a power system demonstrate the efficacy of our approach.
|
|
FrA02 RI Session, Harbour |
Add to My Program |
RI: Advances in Optimal Control |
|
|
Chair: Andersson, Sean B. | Boston University |
Co-Chair: Yao, Bin | Purdue University |
|
10:00-10:03, Paper FrA02.1 | Add to My Program |
Optimal Assignment for Multiplayer Target Defense Differential Games Via Analytical Geometric Approach |
|
Long, Yanchen | Beihang University |
Han, Liang | Beihang University |
Dong, Fei | Beihang University |
Hu, Qinglei | Beihang University |
Li, Qingdong | Beihang University |
Keywords: Optimal control, Optimization algorithms, Intelligent systems
Abstract: This article considers a multiplayer target defense differential game (TDDG) between attacker team and defender team. The attackers aim at reaching the targets while the defenders aim at intercepting their opponents. In the 1 defender vs 1 attacker scenario, a geometric approach is proposed to explicitly obtain the optimal feedback controls of the players and the Value function of the differential game. For a multiplayer game, we propose a bipartite graph matching algorithm, utilizing the Value function, to obtain the optimal assignment. The proposed algorithm performs well in reducing the computational costs. Furthermore, we conduct several simulations to validate the optimality of the proposed method.
|
|
10:03-10:06, Paper FrA02.2 | Add to My Program |
Stack Degradation Protection of FCEVs Via Predictive Energy Management Strategy with Segmented Roads |
|
Park, GeunYoung | Korea Advanced Institute of Science and Technology (KAIST) |
Choi, Kyunghwan | GIST |
Kum, Dongsuk | Korea Advanced Institute of Science & Technology |
Keywords: Optimal control, Hybrid systems, Energy systems
Abstract: Proton exchange membrane (PEM) fuel cell electric vehicles (FCEVs) have gained attention owing to their significant advantages, including rapid refueling times, exceptional energy efficiency, and zero emissions. Nonetheless, FCEVs have a durability issue, a substantial obstacle to the widespread adoption of applications. This study proposes a novel predictive energy management strategy (P-EMS) with segmented roads that strikes a delicate balance between optimizing fuel consumption and safeguarding the durability of the stacks. Dynamic load and high-power operations are deemed avoidable operating conditions, and a control strategy is designed to avoid these factors. Subsequently, the optimal control problem is reformulated within road segments, transforming it into a quadratic programming (QP) framework. This allows for the utilization of model predictive control (MPC) to efficiently solve the optimal control problems. The reformulated problem needs the predictable driving parameters of each road segment, including travel time and average power demand. The simulation results show that the proposed method successfully avoids excessive stack degradation, even at the expense of some reduction in fuel consumption. Compared to dynamic programming (DP), which only considers fuel consumption, the proposed method shows superior performance in safeguarding stack degradation, showing 29% performance improvement, with only an 11% mileage decrease.
|
|
10:06-10:09, Paper FrA02.3 | Add to My Program |
A Fisher Information Based Receding Horizon Control Method for Signal Strength Model Estimation |
|
Zhu, Yancheng | Boston University |
Andersson, Sean B. | Boston University |
Keywords: Optimal control, Estimation, Iterative learning control
Abstract: This paper considers the problem of localizing a set of nodes in a wireless sensor network when both their positions and the parameters of the communication model are unknown. We assume that a single agent moves through the environment, taking measurements of the Received Signal Strength (RSS), and seek a controller that optimizes a performance metric based on the Fisher Information Matrix (FIM). We develop a receding horizon (RH) approach that alternates between estimating the parameter values (using a maximum likelihood estimator) and determining where to move so as to maximally inform the estimation problem. The receding horizon controller solves a multi-stage look ahead problem to determine the next control to be applied, executes the move, collects the next measurement, and then re-estimates the parameters before repeating the sequence. We consider both a Dynamic Programming (DP) approach to solving the optimal control problem at each step, and a simplified heuristic based on a pruning algorithm that significantly reduces the computational complexity. We also consider a modified cost function that seeks to balance the information acquired about each of the parameters to ensure the controller does not focus on a single value in its optimization. These approaches are compared against two baselines, one based on a purely random trajectory and one on a greedy control solution. The simulations indicate our RH schemes outperform the baselines, while the pruning algorithm produces significant reductions in computation time with little effect on overall performance.
|
|
10:09-10:12, Paper FrA02.4 | Add to My Program |
Synchronization Error Elimination for Heterogeneous Discrete-Time Multi-Agent Systems: A Reinforcement Learning Design Approach |
|
Wang, Xinyang | Harbin Institute of Technology |
Guay, Martin | Queens University |
Wang, Shimin | Massachusetts Institute of Technology |
Zhang, Hongwei | Harbin Institute of Technology, Shenzhen |
Keywords: Distributed control, Adaptive control, Optimal control
Abstract: This paper proposes a novel reinforcement learning approach to solve the optimal output synchronization problem for discrete-time heterogeneous multi-agent systems. Different from existing learning methods, the optimal control protocol is obtained to guarantee zero synchronization error by solving the augmented algebraic Riccati equations (AREs). The proposed adaptive dynamic programming (ADP) method can stabilize the output synchronization error and solve the output regulator equations implicitly. To eliminate the dependency on information of system dynamics, an online Q-function-based policy iteration (PI) algorithm is developed. Finally, a numerical example is provided to demonstrate the advantages of the proposed ADP over traditional ADP in terms of synchronization performance.
|
|
10:12-10:15, Paper FrA02.5 | Add to My Program |
Energy Optimal Control of a Harmonic Oscillator with a State Inequality Constraint |
|
Zhou, Mi | Georgia Institute of Technology |
Verriest, Erik I. | Georgia Inst. of Tech |
Abdallah, Chaouki T. | Georgia Institute of Technology |
Keywords: Optimal control, Mechanical systems/robotics, Numerical algorithms
Abstract: In this article, the optimal control problem for a harmonic oscillator with an inequality constraint is considered. The applied energy of the oscillator during a fixed final time period is used as the performance criterion. The analytical solution with both small and large terminal time is found for a special case when the undriven oscillator system is initially at rest. For other initial states of the Harmonic oscillator, the optimal solution is found to have three modes: wait-move, move-wait, and move-wait-move given a longer terminal time.
|
|
10:15-10:18, Paper FrA02.6 | Add to My Program |
Stability Analysis of Hypersampled Model Predictive Control |
|
Gautam, Yaashia | University of Colorado, Boulder |
Nicotra, Marco M | University of Colorado Boulder |
Keywords: Optimal control, Constrained control, Predictive control for nonlinear systems
Abstract: This paper introduces a new framework for analyzing the stability of discrete-time model predictive controllers acting on continuous-time systems. The proposed framework introduces the distinction between discretization time (used to generate the optimal control problem) and sampling time (used to implement the controller). The paper not only shows that these two time constants are independent, but also motivates the benefits of selecting a sampling time that is smaller than the discretization time. The resulting approach, hereafter referred to as Hypersampled Model Predictive Control, overcomes the traditional trade-off between performance and computational complexity that arises when selecting the sampling time of traditional discrete-time model predictive controllers.
|
|
10:18-10:21, Paper FrA02.7 | Add to My Program |
Searching for Sparse Controllers with a Budget: A Bottom-Up Approach |
|
Baddam, Vasanth Reddy | Virginia Tech |
Gumussoy, Suat | Siemens Technology |
Eldardiry, Hoda | Virginia Tech |
Boker, Almuatazbellah | Virginia Tech |
Keywords: Optimal control, Linear systems, Large-scale systems
Abstract: We propose a sparse static output-feedback controller for a class of large-scale systems. Our approach starts with an initial stabilizing controller with a decentralized/distributed structure and then searches for nearby structured controllers limited by a budget of a predefined number of controller parameters. Our methodology relies on a predictor-corrector approach where a greedy gradient with respect to controller parameters is a predictor oracle and an existing non-smooth optimization algorithm specialized for sparse structures is applied to correct the predicted values in the previous step. We show the effectiveness of our algorithm in terms of performance and speed on a benchmark example.
|
|
10:21-10:24, Paper FrA02.8 | Add to My Program |
Safe Predefined-Time Stability and Optimal Feedback Control: A Lyapunov-Based Approach |
|
Kokolakis, Nick-Marios T. | Georgia Institute of Technology |
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Keywords: Stability of nonlinear systems, Optimal control, Lyapunov methods
Abstract: In this paper, we introduce the notion of safe predefined-time stability and address an optimal safe predefined-time stabilization problem. In particular, safe predefined-time stability characterizes parameter-dependent nonlinear dynamical systems whose trajectories starting in a given set of admissible states remain in the set of admissible states for all time and converge to an equilibrium point in a predefined time. Furthermore, we provide a Lyapunov theorem establishing sufficient conditions for safe predefined-time stability. We address the optimal safe predefined-time stabilization problem by synthesizing feedback controllers that guarantee closed-loop system safe predefined-time stability while optimizing a given performance measure. Specifically, safe predefined-time stability of the closed-loop system is guaranteed via a Lyapunov function satisfying a differential inequality while simultaneously serving as a solution to the steady-state Hamilton-Jacobi-Bellman equation ensuring optimality. Finally, an illustrative numerical example is provided to demonstrate the efficacy of the proposed approach.
|
|
10:24-10:27, Paper FrA02.9 | Add to My Program |
A Unifying Statement for an H-Infinity Optimal Controller with Positivity Properties |
|
Vladu, Emil | Lund University |
Keywords: H-infinity control, Robust control, Large-scale systems
Abstract: In this paper, we unify two already published results on state feedback H-infinity optimality. Previously, optimality has been shown for a particular controller structure in the case that the open-loop state matrix is symmetric, as well as in the case that the closed-loop system is internally positive. By contrast, the main result of the present paper gives optimality based on neither of these two properties. As a result, when applied to a class of buffer networks, it succeeds not only in showing optimality when the system parameters are chosen so as to give open-loop symmetry and closed-loop positivity, respectively, but also when both of these properties are absent.
|
|
10:27-10:30, Paper FrA02.10 | Add to My Program |
Composition of Control Barrier Functions with Differing Relative Degrees for Safety under Input Constraints |
|
Rabiee, Pedram | University of Kentucky |
Hoagg, Jesse B. | University of Kentucky |
Keywords: Optimal control, Constrained control, Autonomous systems
Abstract: This paper presents a new approach for guaranteed safety subject to input constraints (e.g., actuator limits) using a composition of multiple control barrier functions (CBFs). First, we present a method for constructing a single CBF from multiple CBFs, which can have different relative degrees. This construction relies on a soft minimum function and yields a CBF whose 0-superlevel set is a subset of the union of the 0-superlevel sets of all the CBFs used in the construction. Next, we extend the approach to systems with input constraints. Specifically, we introduce control dynamics that allow us to express the input constraints as CBFs in the closed-loop state (i.e., the state of the system and the controller). The CBFs constructed from input constraints do not have the same relative degree as the safety constraints. Thus, the composite soft-minimum CBF construction is used to combine the input-constraint CBFs with the safety-constraint CBFs. Finally, we present a feasible real-time-optimization control that guarantees that the state remains in the 0-superlevel set of the composite soft-minimum CBF. We demonstrate these approaches on a nonholonomic ground robot example.
|
|
10:30-10:33, Paper FrA02.11 | Add to My Program |
Time-Varying Soft-Maximum Control Barrier Functions for Safety in an a Priori Unknown Environment |
|
Safari, Amirsaeid | University of Kentucky |
Hoagg, Jesse B. | University of Kentucky |
Keywords: Optimal control, Constrained control, Autonomous robots
Abstract: This paper presents a time-varying soft-maximum composite control barrier function (CBF) that can be used to ensure safety in an a priori unknown environment, where local perception information regarding the safe set is periodically obtained. We consider the scenario where the periodically obtained perception feedback can be used to construct a local CBF that models a local subset of the unknown safe set. Then, we use a novel smooth time-varying soft-maximum function to compose the N most recently obtained local CBFs into a single CBF. This composite CBF models an approximate union of the N most recently obtained local subsets of the safe set. Notably, this composite CBF can have arbitrary relative degree r. Next, this composite CBF is used as a rth-order CBF constraint in a real-time optimization to determine a control that minimizes a quadratic cost while guaranteeing that the state stays in a time-varying subset of the unknown safe set. We also present an application of the time-varying soft-maximum composite CBF method to a nonholonomic ground robot with nonnegligible inertia. In this application, we present a simple approach to generate the local CBFs from the periodically obtained perception data.
|
|
10:33-10:36, Paper FrA02.12 | Add to My Program |
An Output Feedback Game-Theoretic Approach for Defense against Stealthy GNSS Spoofing Attacks |
|
Athalye, Surabhi | Georgia Institute of Technology |
Fotiadis, Filippos | Georgia Institute of Technology |
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Hugues, Jerome | Carnegie Mellon University / Software Engineering Institute |
Keywords: Optimal control, Game theory, Optimization
Abstract: We employ a game-theoretic approach to mitigate stealthy spoofing attacks on an aerial cyber-physical system. The attacker's objective is to drive the vehicle away from its nominal trajectory while misleading the system operator of the adversarial deviation. We characterize this as a dual actuation-deception attack; the former involves corrupting the vehicle's actuating input, and the latter is done by spoofing the measurable output; that is, the acceleration effort and the Global Navigation Satellite System (GNSS) sensor reading, respectively. The attack is designed to be stealthy, implying that its effect on the system's trajectory is indiscernible from that of a naturally occurring disturbance. The defender aims to counter such an attack and steer the aerial vehicle back towards its nominal path. We couple receding horizon control and game-theoretic methods to derive optimal attack and defense policies.
|
|
10:36-10:39, Paper FrA02.13 | Add to My Program |
A Case Study on the Convergence of Direct Policy Search for Linear Quadratic Gaussian Control |
|
Keivan, Darioush | University of Illinois at Urbana Champaign |
Seiler, Peter | University of Michigan, Ann Arbor |
Dullerud, Geir E. | Univ of Illinois, Urbana-Champaign |
Hu, Bin | University of Illinois at Urbana-Champaign |
Keywords: Optimal control, Lyapunov methods, Linear systems
Abstract: Policy optimization has gained renewed attention from the control community, serving as a pivotal link between control theory and reinforcement learning. In the past few years, the global convergence theory of direct policy search on state-feedback linear control benchmarks has been developed. However, it remains difficult to establish the global convergence of policy optimization on the linear quadratic Gaussian (LQG) problem, marked by the presence of suboptimal stationary points and the lack of cost coerciveness. In this paper, we revisit the policy optimization intricacies of LQG via a case study on first-order single-input single-output (SISO) systems. For this case study, while the issue related to suboptimal stationary points can be easily fixed via parameterizing the policy class more carefully, the non-coerciveness of the LQG cost function still poses a substantial obstacle to a straightforward global convergence proof for the policy gradient method. Our contribution, within the scope of this case study, introduces an approach to construct a positive invariant set for the policy gradient flow, addressing the non-coerciveness issue in the global convergence proof. Based on our analysis, the policy gradient flow can be guaranteed to converge to the globally optimal full-order dynamic controller in this particular scenario. In summary, although centered on a specific case study, our work broadens the comprehension of how the absence of coerciveness impacts LQG policy optimization, highlighting inherent complexities.
|
|
10:39-10:42, Paper FrA02.14 | Add to My Program |
Asynchronous Block Parallel Policy Optimization for the Linear Quadratic Regulator |
|
Sha, Xingyu | Tsinghua University |
You, Keyou | Tsinghua University |
Keywords: Linear systems, Optimal control, Optimization algorithms
Abstract: Though policy optimization (PO) has been acknowledged as an essential approach in reinforcement learning, its theoretical understandings still lag behind as we usually have to address non-convex problems. In this work, we study the convergence of the PO method for the linear quadratic regulator problem under asynchronous block parallel policy updates. Particularly, there are a group of agents to jointly compute the policy and each agent is only responsible for the updates of a block of the policy via asynchronously communicating with a central coordinator. Then, we rigorously prove its linear convergence to the optimal policy. Numerical results validate the performance of our method.
|
|
10:42-10:45, Paper FrA02.15 | Add to My Program |
Control Barrier Functions in Dynamic UAVs for Kinematic Obstacle Avoidance: A Collision Cone Approach |
|
Tayal, Manan | Indian Institute of Science, Bengaluru |
Singh, Rajpal | Indian Institute of Science |
Keshavan, Jishnu | Indian Institute of Science |
Nadubettu Yadukumar, Shishir | Indian Institute of Science |
Keywords: Control applications, Optimal control, Robotics
Abstract: Unmanned aerial vehicles (UAVs), specifically quadrotors, have revolutionized various industries with their maneuverability and versatility, but their safe operation in dynamic environments heavily relies on effective collision avoidance techniques. This paper introduces a novel technique for safely navigating a quadrotor along a desired route while avoiding kinematic obstacles. We propose a new constraint formulation that employs control barrier functions (CBFs) and collision cones to ensure that the relative velocity between the quadrotor and the obstacle always avoids a cone of vectors that may lead to a collision. By showing that the proposed constraint is a valid CBF for quadrotors, we are able to leverage its real-time implementation via Quadratic Programs (QPs), called the CBF-QPs. Validation includes PyBullet simulations and hardware experiments on Crazyflie 2.1, demonstrating effectiveness in static and moving obstacle scenarios. Comparative analysis with literature, especially higher order CBF-QPs, highlights the proposed approach's less conservative nature.
|
|
10:45-10:48, Paper FrA02.16 | Add to My Program |
Optimal Charging Control and Incentivization Strategies for Electric Vehicles Considering Grid Dynamical Constraints |
|
Podder, Amit Kumer | North Carolina State University |
Sadamoto, Tomonori | The University of Electro-Communications |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Power systems, Optimal control
Abstract: We study how high charging rate demands from electric vehicles (EVs) in a power distribution grid may collectively cause its dynamic instability, and, accordingly, how a price incentivization strategy can be used to steer customers to settle for lesser charging rate demands so that these instabilities can be avoided. We pose the problem as a joint optimization and optimal control formulation. The optimization determines the optimal charging setpoints for EVs to minimize the H2-norm of the transfer function of the grid model, while the optimal control simultaneously develops a linear quadratic regulator (LQR) based state-feedback control signal for the battery currents of those EVs to jointly minimize the risk of grid instability. A subsequent algorithm is developed to determine how much customers may be willing to sacrifice their intended charging rate demands in return for financial incentives. Results are validated using numerical simulations of three EV charging stations in the IEEE 33-bus power distribution model.
|
|
10:48-10:51, Paper FrA02.17 | Add to My Program |
A Safe and Computationally Efficient Tracking Control Algorithm for Autonomous Vehicles |
|
Notomista, Gennaro | University of Waterloo |
Wardi, Yorai | Georgia Institute of Technology |
Keywords: Automotive control, Predictive control for nonlinear systems, Optimal control
Abstract: This paper investigates the use of control barrier functions in conjunction with a recently developed output-tracking technique, with the aim of guaranteeing safe and smooth driving conditions for autonomous vehicles. The tracking technique in question has been developed by the authors of this paper for effectiveness as well as efficiency of computation, but its implementation may be fraught with large early input transients and state oscillations. The main objective of this paper is to investigate the use of control barrier functions for the dual purpose of safety guarantees and drastic reductions in the input oscillations and state overshoots. Furthermore, if the plant subsystem is differentially flat then we exploit this fact to further reduce the complexity of the control algorithm. As this is an initial study we focus the discussion on the particular example of a kinematic bicycle model, but argue for its potential generality to more complicated models of self-driving cars such as the dynamic bicycle. We test the aforementioned ideas by simulation and on a hardware platform, and the results suggest that the developed controller may have merits in autonomous vehicle applications.
|
|
10:51-10:54, Paper FrA02.18 | Add to My Program |
Time-Optimal Constrained Adaptive Robust Control of Single-DOF Mechanical Systems: A Comparative Study with BLF-Based Methods |
|
Liu, Yingqiang | Zhejiang University |
Chen, Zheng | Zhejiang University |
Yao, Bin | Purdue University |
Keywords: Control applications, Mechatronics, Constrained control
Abstract: The high-accuracy tracking and time-optimal response of mechanical systems are very important for modern manufacturing. However, the inevitable parametric uncertainties, disturbances, and constraints make achieving these high performances difficult. In this paper, a two-loop control algorithm combining online planning and adaptive robust control (ARC) is proposed for the 1-DOF mechanical systems to improve tracking accuracy and efficiency. In the outer loop, a time-optimal reference trajectory starting from the initial state of the plant is planned without violating the constraints. In the inner loop, the ARC law is synthesized to track the planned trajectory with high accuracy in the presence of parametric uncertainties and disturbances. The proposed method has a simpler inner-loop design compared with the existing work, and achieves the prescribed convergence of the tracking error. The widely used barrier Lyapunov function (BLF) based methods are compared with the proposed method in this paper. The experimental results verify the superiority of the proposed method in achieving fast response and high tracking accuracy. The limitations of the feasibility conditions of BLF on the tracking performance are analyzed.
|
|
10:54-10:57, Paper FrA02.19 | Add to My Program |
Optimal Pinning Control for Synchronization Over Temporal Networks |
|
Sahaya Arokiadoss, Aandrew Baggio | Indian Institute of Technology Madras |
Kalaimani, Rachel Kalpana | Indian Institute of Technology Madras |
Keywords: Control of networks, Distributed control, Optimization
Abstract: In this paper, we address the finite time synchronization of a network of dynamical systems with time-varying interactions modeled using temporal networks. We synchronize a few nodes initially using external control inputs. These nodes are termed as pinning nodes. The other nodes are synchronized by interacting with the pinning nodes and with each other. We first provide sufficient conditions for the network to be synchronized. Then we formulate an optimization problem to minimize the number of pinning nodes for synchronizing the entire network. Finally, we address the problem of maximizing the number of synchronized nodes when there are constraints on the number of nodes that could be pinned. We show that this problem belongs to the class of NP-hard problems and propose a greedy heuristic. We illustrate the results using numerical simulations.
|
|
FrA03 RI Session, Frontenac |
Add to My Program |
RI: Control of Robotic and Mechatronic Systems |
|
|
Chair: Portella Delgado, Jhon Manuel | University of Maryland Baltimore County |
Co-Chair: Karimi, Alireza | EPFL |
|
10:00-10:03, Paper FrA03.1 | Add to My Program |
Safe Human-Robot Motor Skill Learning through Probabilistic Dynamic Movement Primitives and Control Barrier Functions |
|
Theofanidis, Michail | The University of Texas at Arlington Research Institute |
Davoodi, Mohammadreza | The University of Memphis |
Hafezi, Hamid | University of Memphis |
Gans, Nicholas | University of Texas at Arlington |
Keywords: Robotics, Learning
Abstract: We present a novel framework that enables robots to learn motor skills from human demonstrations with guaranteed safety. Our framework comprises two components: a high-level planner and a low-level controller. The planner generates a safe trajectory region through an embodied state-action mapping (i.e., policy) computed using Dynamic Movement Primitives. The policy enables the robot to adapt to new environments, avoid obstacles, and stay within the predefined safe region. To execute the planned trajectories, we combine a control Lyapunov function controller, which tracks the mean trajectory of the distribution, and a control barrier function controller to strictly enforce constraints on the position of the robot's end effector, ensuring it remains within the safe zone. Our proposed framework is tested and validated through simulations and experiments with a Baxter robot to perform a pick and place task. These experiments demonstrate that the ProDMP is capable of generating distributions from demonstrated trajectories. Moreover, utilizing our proposed controller, the robot can navigate within these distributions from starting to goal locations while avoiding obstacles and reduces overall control effort.
|
|
10:03-10:06, Paper FrA03.2 | Add to My Program |
Collision-Free Landing of Multiple UAVs on Moving Ground Vehicles Using Time-Varying Control Barrier Functions |
|
Sankaranarayanan, Viswa Narayanan | Lulea University of Technology, Sweden |
Saradagi, Akshit | Luleå University of Technology, Luleå, Sweden |
Satpute, Sumeet | Lulea University of Technology |
Nikolakopoulos, George | Luleå University of Technology |
Keywords: Robotics, Multivehicle systems
Abstract: In this article, we present a centralized approach for the control of multiple unmanned aerial vehicles (UAVs) for landing on moving unmanned ground vehicles (UGVs) using control barrier functions (CBFs). The proposed control framework employs two kinds of CBFs to impose safety constraints on the UAVs' motion. The first class of CBFs (LCBF) is a three-dimensional exponentially decaying function centered above the landing platform, designed to safely and precisely land UAVs on the UGVs. The second set is a spherical CBF (SCBF), defined between every pair of UAVs, which avoids collisions between them. The LCBF is time-varying and adapts to the motions of the UGVs. In the proposed CBF approach, the control input from the UAV's nominal tracking controller designed to reach the landing platform is filtered to choose a minimally-deviating control input that ensures safety (as defined by the CBFs). As the control inputs of every UAV are shared in establishing multiple CBF constraints, we prove that the control inputs are shared without conflict in rendering the safe sets forward invariant. The performance of the control framework is validated through a simulated scenario involving three UAVs landing on three moving targets.
|
|
10:06-10:09, Paper FrA03.3 | Add to My Program |
Learning-Based Tracking Control of Unknown Robot Systems with Online Parameter Estimation |
|
Peng, Zhinan | University of Electronic Science and Technology of China |
Chen, Chen | University of Electronic Science and Technology of China |
Luo, Rui | University of Electronic Science and Technology of China |
Zhang, Jingting | University of Rhode Island |
Cheng, Hong | University of Electronic Science and Technology of China |
Ghosh, Bijoy | Texas Tech University |
Keywords: Robotics, Adaptive control, Learning
Abstract: This paper proposes a novel learning-based optimal control approach for the tracking control problem of a robot manipulator, which is allowed to have uncertainty in the model parameters. We first employ neural network (NN) technique to design an identifier for the system parameters estimation. Then, an optimal tracking controller is proposed with a critic NN. A novel online NN weight adaptation law is designed with the dynamic regression extension and mixing technique, for updating both the unknown parameters and the critic network's weight during the control process. With such setup, our approach can develop an important capability of relaxing the persistent excitation (PE) condition, leading to improved parameter-convergence accuracy and control applicability, which can be distinguished from the existing methods that use gradient-descent based weight adaptation laws. Rigorous theoretical analysis is conducted based on the Lyapunov stability theory and demonstrates the ultimately uniformly boundedness of the closed-loop systems. Effectiveness of the proposed method is validated through simulation study by using a 2 degree-of-freedom robot system.
|
|
10:09-10:12, Paper FrA03.4 | Add to My Program |
Learning-Based Design of Off-Policy Gaussian Controllers: Integrating Model Predictive Control and Gaussian Process Regression |
|
Tekumatla, Shiva | WPI |
Gampa, Varun | WPI |
Farzan, Siavash | California Polytechnic State University |
Keywords: Robotics, Predictive control for nonlinear systems, Learning
Abstract: This paper presents an off-policy Gaussian Predictive Control (GPC) framework aimed at solving optimal control problems with a smaller computational footprint, thereby facilitating real-time applicability while ensuring critical safety considerations. The proposed controller imitates classical control methodologies by modeling the optimization process through a Gaussian process and employs Gaussian Process Regression to learn from the Model Predictive Control (MPC) algorithm. Notably, the Gaussian Process setup does not incorporate a built-in model, enhancing its applicability to a broad range of control problems. We applied this framework experimentally to a differential drive mobile robot, tasking it with trajectory tracking and obstacle avoidance. Leveraging the off-policy aspect, the controller demonstrated adaptability to diverse trajectories and obstacle behaviors. Simulation experiments confirmed the effectiveness of the proposed GPC method, emphasizing its ability to learn the dynamics of optimal control strategies. Consequently, our findings highlight the significant potential of off-policy Gaussian Predictive Control in achieving real-time optimal control for handling of robotic systems in safety-critical scenarios.
|
|
10:12-10:15, Paper FrA03.5 | Add to My Program |
A Novel Multivariate Skew-Normal Mixture Model and Its Application in Path-Planning for Very-Large-Scale Robotic Systems |
|
Zhu, Pingping | Marshall University |
Liu, Chang | Peking University |
Estephan, Peter | Marshall University |
Keywords: Distributed control, Large-scale systems, Statistical learning
Abstract: This paper addresses the path-planning challenge for very large-scale robotic systems (VLSR) operating in complex and cluttered environments. VLSR systems consist of numerous cooperative agents or robots working together autonomously. Traditionally, many approaches for VLSR systems are developed based on Gaussian mixture models (GMMs), where the GMMs represent agents’ evolving spatial distribution, serving as a macroscopic view of the system’s state. However, our recent research into VLSR systems has unveiled limitations in using GMMs to represent agent distributions, especially in cluttered environments. To overcome these limitations, we propose a novel model called the skew-normal mixture model (SNMM) for representing agent distributions. Additionally, we present a parameter learning algorithm designed to estimate the SNMM’s parameters using sample data. Furthermore, we develop two SNMM-based path-planning algorithms to guide VLSR systems through complex and cluttered environments. Our simulation results demonstrate the effectiveness and superiority of these algorithms compared to GMM-based path-planning methods.
|
|
10:15-10:18, Paper FrA03.6 | Add to My Program |
Adaptive Impedance and Admittance Controls for Physical Human-Robot Interaction with Force-Sensorless |
|
Ngo, Van-Tam | NCKU |
Liu, Yen-Chen | National Cheng Kung University |
Keywords: Human-in-the-loop control, Mechanical systems/robotics, Adaptive control
Abstract: In this paper, we introduce control frameworks for physical human-robot interaction that rely on adaptive impedance learning and without force measurement. The adaptation laws are specifically designed to estimate human interaction forces, eliminating the need for a force sensor. These estimated forces are then utilized in the two controller designs. In the first one, estimated forces are used to compensate for the human’s force, ensuring the robot tracks a predefined trajectory. Conversely, the second control law uses the estimated forces to adjust the robot’s reference velocity in compliance with human intention. We employ Lyapunov’s technique to demonstrate stability and the uniform ultimate boundedness of the responses. Simulation results are presented to validate the proposed control algorithms. These results indicate that the approaches offer promising solutions for human-robot interaction with reduced cost and complexity.
|
|
10:18-10:21, Paper FrA03.7 | Add to My Program |
Modeling Reluctance Actuator Topologies with a Focus on Stiffness |
|
Pumphrey, Michael Joseph | University of Guelph |
Al Saaideh, Mohammad | Memorial University of Newfoundland |
Alatawneh, Natheer | Cysca Technology |
Al Janaideh, Mohammad | University of Guelph |
Keywords: Mechatronics
Abstract: The reluctance actuator (RA) can provide more acceleration than the Lorentz actuators that are currently in use in next-generation wafer scanners used in semiconductor lithography systems. These wafer scanners are utilized in semiconductor lithography systems. Due to the significant amount of nonlinearity that exists between the RA's input current and output force, it might be challenging to build an effective control system. In the ten years prior, a great number of studies contributed to the modelling, design, and control of RAs; however, the geometrical topology of the actuator was not evaluated from the standpoint of control. This study presents topology selection criteria with the intention of improving the control design process. Additionally, it assesses the various accessible RA topologies, including C and E cores, with reference to the modelling of stiffness. The C-core RA was shown to have a lower magnitude of stiffness at low air gap values (less than 0.5 mm) when compared to the E-core RA. This was discovered through simulation as well as through experimentation.
|
|
10:21-10:24, Paper FrA03.8 | Add to My Program |
Motion Control of a Cable Robotic LED Light Fixture with IoT Connectivity |
|
Tavakoli, Negar | Simon Fraser University Surrey |
Mohagheghi, Afagh | Simon Fraser University |
Moallem, Mehrdad | Simon Fraser University |
Keywords: Mechanical systems/robotics, Mechatronics
Abstract: This paper presents development of a 2-degrees-of-freedom cable-suspended motion mechanism for a light-emitting diode (LED) horticultural light fixture with Internet-of-Things (IoT) connectivity. The proposed light motion mechanism is intended to provide uniform light distribution on the plant canopy to optimize growth through proper position and orientation control with set-points determined, for instance, by natural light conditions and based on the plant’s growth stage. The setup was built to have two main features: (i) Motion control of fixture’s height and roll angle; and (ii) IoT connectivity. The motion control unit consists of a trajectory planner, which receives the control set-points via an IoT module, and embedded firmware. The reference values are obtained, for instance, through a light recipe database that provide the required data from a remote digital twin computer. The desired motion trajectory is obtained based on the dynamics of the system such that the tension of cables remain positive during the motion. To this end, conditions are obtained for the desired motion trajectory to guarantee positive tension in the cables which is utilized in the trajectory tracking controller. A hardware prototype was built to evaluate performance of the system which is presented along with experimental results
|
|
10:24-10:27, Paper FrA03.9 | Add to My Program |
A Robust Sliding-Mode Control Framework for Quadrotors Subject to Model Uncertainty and External Disturbances |
|
Yang, Yefeng | The Hong Kong Polytechnic University |
Huang, Tao | The Hong Kong Polytechnic University |
Wang, Tianqi | The Hong Kong Polytechnic University |
Chih-Yung, Wen | Hong Kong Polytechnic University |
Keywords: Mechanical systems/robotics, Uncertain systems, Variable-structure/sliding-mode control
Abstract: In this study, we propose a novel control framework to deal with position control for quadrotors subject to time-varying disturbances and uncertainty. High-order sliding mode observers (HSMOs) are utilized to estimate the uncertainty and disturbances. Then, a dynamic sliding mode controller (DSMC) is presented for tracking control of the inner-loop subsystem and a fast non-singular terminal sliding mode controller (FNTSMC) is developed for outer-loop subsystem tracking control. As a result, our proposed control law enables the quadrotor to precisely track a large class of reference signals under the presence of model uncertainty and a large class of time-varying external disturbances while reducing the chattering phenomenon. Both simulation and experiment are given to validate the effectiveness and superiority of the designed controllers.
|
|
10:27-10:30, Paper FrA03.10 | Add to My Program |
Precision ZP Perforation Automation: A Vision-Based Robotic Approach for Blastocyst Embryo Biopsy |
|
Abu Ajamieh, Ihab | Birzeit University |
Al Janaideh, Mohammad | University of Guelph |
Mills, James K. | Univ. of Toronto |
Keywords: Mechanical systems/robotics
Abstract: Microsurgical operations such as embryo biopsy require extracting a material sample from inside the embryo for genetic testing. A precise perforation for embryo zona pellucida (ZP) is required to permit access for the biopsy micropipette to extract the sample. Many approaches developed for the ZP perforation, such as mechanical, chemical, and the Photothermolysis (the laser). In this paper, an automatic method for the blastocyst embryo ZP perforation is presented. This method utilizes a conventional laser system currently in use in manual approaches in research labs and In-Vitro Fertilization clinics and controls the whole perforation process using a vision feedback system. An experimental setup is developed to verify the behavior of the proposed method, in which a holding micropipette is used to hold and move the embryo, which is then moved in two coordinate directions toward the laser spot location. A computer vision algorithm is used to estimate the embryo ZP thickness to tune the laser parameters and estimate the ZP circle median quadrant coordinates. Then use this information as a feedback signal to a simple proportional controller to control the embryo motion. Experimental results demonstrate that the system is capable of embryo relocation and ZP perforation.
|
|
10:30-10:33, Paper FrA03.11 | Add to My Program |
Flux Estimation and Control Based on High-Gain Observer for Variable Reluctance Actuator Using the Measured Current Only |
|
Al Saaideh, Mohammad | Memorial University of Newfoundland |
Alatawneh, Natheer | Cysca Technology |
Aljanaideh, Omar | ASML |
Al Janaideh, Mohammad | University of Guelph |
Keywords: Mechatronics
Abstract: Measuring magnetic flux plays a crucial role in developing a linearized controller for a variable reluctance actua- tor. However, the method used for measuring magnetic flux may have limitations that render it invalid under different operating conditions. This paper presents a flux estimation and control method based on the Extended High-Gain Observer (EHGO) approach for reluctance actuators, utilizing only the measured current. Initially, the dynamic model of the reluctance actuator is formulated in terms of the current in the coil, considering the magnetic field as unknown. Subsequently, EHGO is designed to use the measured current to estimate the magnetic field and magnetic flux. Finally, a feedforward controller is introduced to utilize the estimated magnetic field for achieving tracking performance of the desired magnetic flux. The analysis of the error bound in tracking errors demonstrates that minimizing the estimation error of the magnetic field reduces the tracking error. The effectiveness of the proposed flux estimator and the control approach is evaluated through numerical simulations. The results illustrate the EHGO’s capability to achieve accurate magnetic flux estimation, improving the tracking performance of the feedforward controller and minimizing tracking errors
|
|
10:33-10:36, Paper FrA03.12 | Add to My Program |
Risk-Based Socially-Compliant Behavior Planning for Autonomous Driving |
|
Lyu, Yiwei | Carnegie Mellon University |
Luo, Wenhao | University of North Carolina at Charlotte |
Dolan, John | Carnegie Mellon University |
Keywords: Multivehicle systems, Robotics, Automotive systems
Abstract: In this study, we introduce an innovative risk-aware behavior planning framework designed for autonomous driving, with the aim of fostering socially compliant vehicle behavior in diverse mixed-traffic highway scenarios. Our objective is to empower autonomous vehicles to exhibit behavior that aligns with societal norms, thus enhancing their acceptability among human drivers. We expand the scope of Control Barrier Function-inspired risk assessment to encompass a heterogeneous spectrum of road participants, allowing us to explicitly model varying degrees of social influences between different classes of vehicles. We also present a mathematical condition for accountability tracing, enabling the identification of responsible entities in situations where risks surge. Drawing inspiration from Isaac Asimov's "Three Laws of Robotics," we establish social compliance conditions grounded in our unique risk concept, which seamlessly integrates with a wide range of existing safety-critical controllers, regardless of their type or design. By incorporating these conditions, which encode societal expectations, into existing safe controllers, we demonstrate that autonomous vehicles can exhibit context-aware behavior without compromising the safety guarantees provided by existing controllers. This approach effectively excludes behaviors that may be safe but do not align with human intuition while guaranteeing the least interference with the existing controller.
|
|
10:36-10:39, Paper FrA03.13 | Add to My Program |
Joint Trajectory Optimization for Redundant Manipulators with Constant Path Speed |
|
Fried, Jonathan | Rensselaer Polytechnic Institute |
Paternain, Santiago | Rensselaer Polytechnic Institute |
Keywords: Optimization algorithms, Robotics, Manufacturing systems
Abstract: In this work, we present an approach to minimizing the time necessary for the end-effector of a redundant robot manipulator to traverse a given trajectory by optimizing the trajectory of its joints, under a number of restrictions. Each joint has limits in the ranges of position, velocity and acceleration, the latter making jerks in joint space undesirable. Furthermore, for the applications involved, the end-effector must traverse the path with high accuracy and at a constant path velocity, i.e. the tip of the manipulator must cover equal distances in equal amounts of time. The proposed approach takes this nonlinear optimization problem that has two variables (path speed and joint trajectory) and solves it in two steps - First, we solve an inner subproblem that considers a fixed joint trajectory and maximizes path speed, for which we obtain a closed-form solution that considers all joint velocity and acceleration restrictions. Moreover, we establish that the value of the inner subproblem is convex. Then, we solve an outer subproblem that takes a subgradient of the inner subproblem’s value to update the trajectory with a Primal-Dual optimization method that considers all path accuracy and joint position restrictions. We show the efficacy of our proposed approach with simulations.
|
|
10:39-10:42, Paper FrA03.14 | Add to My Program |
Adaptive Backstepping Control of a Bicopter in Pure Feedback Form with Dynamic Extension |
|
Portella Delgado, Jhon Manuel | University of Maryland Baltimore County |
Mirtaba, Mohammad | University of Maryland Baltimore County |
Goel, Ankit | University of Maryland Baltimore County |
Keywords: Adaptive control, Flight control, Lyapunov methods
Abstract: This paper presents a model-based, adaptive, nonlinear controller for the bicopter stabilization and trajectory-tracking problem. The nonlinear controller is designed using the backstepping technique. Due to the non- invertibility of the input map, the bicopter system is first dynamically extended. However, the resulting dynamically extended system is in the pure feedback form with the uncertainty appearing in the input map. The adaptive backstepping technique is then extended and applied to design the controller. The proposed controller is validated in simulation for a smooth and nonsmooth trajectory- tracking problem.
|
|
10:42-10:45, Paper FrA03.15 | Add to My Program |
Hybrid Task Constrained Incremental Planner for Robot Manipulators in Confined Environments |
|
Sun, Yifan | Carnegie Mellon University |
Zhao, Weiye | Carnegie Mellon University |
Liu, Changliu | Carnegie Mellon University |
Keywords: Optimization algorithms, Robotics, Optimization
Abstract: Incremental motion planning has emerged as a powerful approach for generating safe trajectories in confined environments. However, its effectiveness can be hampered by susceptibility to local optima. This vulnerability arises from the algorithm's heavy dependence on the previously achieved configuration (pose) as a reference for the next step. This paper presents a novel incremental motion planning approach for redundant robot arms. It leverages an optimization-based planner combined with null-space exploration to escape local optima and generate high-quality trajectories satisfying task and collision constraints. Our approach is evaluated in an onsite polishing scenario with various robot and workpiece configurations, demonstrating significant improvements in trajectory quality compared to existing methods. The proposed approach has the potential for broad applications in industrial tasks involving redundant robot arms.
|
|
10:45-10:48, Paper FrA03.16 | Add to My Program |
Data-Driven Frequency-Based Feedforward Control Design for a Robotic Arm Joint |
|
Schuchert, Philippe | EPFL |
Karimi, Alireza | EPFL |
Keywords: Robust control, H-infinity control, Mechanical systems/robotics
Abstract: Next-generation motion control systems require fast and precise control, but advanced control strategies often rely on complex and expensive models. This paper proposes a data-driven approach to tune controllers for a joint used in a robotic arm. This is achieved by using the frequency response at different operating points and designing a low-bandwidth controller robust to multimodel uncertainties, not exciting the nonlinear modes of the system. Tracking performance is improved by tuning an appropriate feedforward controller, and additional constraints are derived to guarantee the stability of this filter. The proposed approach is applied to a joint in an industrial robotic arm.
|
|
10:48-10:51, Paper FrA03.17 | Add to My Program |
A Sliding Cone Control Method for Robust Robot Running |
|
Lo, Chun Ho, David | The Chinese University of Hong Kong |
Ng, Wee Shen | The Chinese University of Hong Kong |
Chu, Xiangyu | The Chinese University of Hong Kong |
Au, Kwok Wai Samuel | CUHK |
Keywords: Robust control, Robotics, Biologically-inspired methods
Abstract: Rapid locomotion on complicated terrains with height and stiffness changes can be challenging. This paper presents a novel Sliding Cone Control (SCC), that offers a legged robot the capability to interact with rough terrains with explainable control commands and minimal computation resources. The proposed SCC is a sliding mode control-based robust controller that enforces the spring-like leg to undulate on the ground following the desired limit cycle in a finite-time converging manner. Its stability and robustness have been proved mathematically, which ensures a safe extension to the overall planar running control. The proposed controller is verified experimentally on a planer hopper. The results show desirable and stable running on the terrains with height and stiffness variations.
|
|
10:51-10:54, Paper FrA03.18 | Add to My Program |
Adaptive Nonlinear Control of a Bicopter with Unknown Dynamics |
|
Portella Delgado, Jhon Manuel | University of Maryland Baltimore County |
Goel, Ankit | University of Maryland Baltimore County |
Keywords: Adaptive control, Feedback linearization, Control applications
Abstract: This paper presents an adaptive, model- based, nonlinear controller for the bicopter trajectory- tracking problem. The nonlinear controller is constructed by dynamically extending the bicopter model, stabilizing the extended dynamics using input-output linearization, augmenting the controller with a finite-time convergent parameter estimator, and designing a linear tracking con- troller. Unlike control systems based on the time separa- tion principle to separate the translational and rotational dynamics, the proposed technique is applied to design a controller for the full nonlinear dynamics of the system to obtain the desired transient performance. The proposed controller is validated in simulation for a smooth and nonsmooth trajectory-tracking problem.
|
|
10:54-10:57, Paper FrA03.19 | Add to My Program |
EMPC-Based Flight Controller Design for a Quadrotor with Unbalanced Payload |
|
Zhang, Xiangyu | University of New Hampshire |
Mu, Bingxian | University of New Hampshire |
Yoon, Se Young (Pablo) | University of New Hampshire |
Keywords: Flight control, Control applications, Predictive control for linear systems
Abstract: In this paper, a robust explicit model predictive control (EMPC) flight scheme is investigated for a quadrotor. MPC is widely recognized for its effectiveness in control, but its computational complexity for solving the online optimization problem, particularly for fast systems, poses a challenge. To address this, we introduce an innovative inner-outer loop control structure that incorporates EMPC which can transfer the overall optimization process offline. In the outer loop, we calculate reference roll and pitch angles, while the inner loop employs EMPC for rapid and optimized angle tracking within practical constraints. Additionally, integral sliding mode control (ISMC) is integrated to mitigate the effects of unbalanced payloads. The recursive feasibility is guaranteed for the proposed flight control method if the initial states are in the feasibility set, and the Lyapunov stability analysis is conducted. Finally, experiments show the efficacy of the proposed control strategies.
|
|
10:57-11:00, Paper FrA03.20 | Add to My Program |
Newton-Raphson Flow for Aggressive Quadrotor Tracking Control |
|
Morales-Cuadrado, Evanns | Georgia Institute of Technology |
Llanes, Christian | Georgia Institute of Technology |
Wardi, Yorai | Georgia Institute of Technology |
Coogan, Samuel | Georgia Institute of Technology |
Keywords: Nonlinear output feedback, Predictive control for nonlinear systems, Numerical algorithms
Abstract: We apply the Newton-Raphson flow tracking controller to aggressive quadrotor flight and demonstrate that it achieves good tracking performance over a suite of benchmark trajectories, beating the native trajectory tracking controller in the popular PX4 Autopilot. The Newton-Raphson flow tracking controller is a recently proposed integrator-type controller that aims to drive to zero the error between a future predicted system output and the reference trajectory. This controller is computationally lightweight, requiring only an imprecise predictor, and achieves guaranteed asymptotic error bounds under certain conditions. We show that these theoretical advantages are realizable on a quadrotor hardware platform. Our experiments are conducted on a Holybrox x500v2 quadrotor using a Pixhawk 6x flight controller and a Rasbperry Pi 4 companion computer which receives location information from an OptiTrack motion capture system and sends input commands through the ROS2 API for the PX4 software stack.
|
|
FrA04 RI Session, Metro W |
Add to My Program |
RI: Stochastic and Nonlinear Systems |
|
|
Chair: Morgansen, Kristi A. | University of Washington |
Co-Chair: Coogan, Samuel | Georgia Institute of Technology |
|
10:00-10:03, Paper FrA04.1 | Add to My Program |
Uncertainty Quantification for Recursive Estimation in Adaptive Safety-Critical Control |
|
Cohen, Max | California Institute of Technology |
Mann, Makai | MIT Lincoln Laboratory |
Leahy, Kevin | Worcester Polytechnic Institute |
Belta, Calin | Boston University |
Keywords: Adaptive control, Lyapunov methods, Constrained control
Abstract: In this paper, we present a framework for online parameter estimation and uncertainty quantification in the context of adaptive safety-critical control. The key insight enabling our approach is that the parameter estimate generated by the continuous-time recursive least squares (RLS) algorithm at any point in time is an affine transformation of the initial parameter estimate. This property allows for parameterizing such estimates using objects that are closed under affine transformation, such as zonotopes, and enables the efficient propagation of such set-based estimates as time progresses. We illustrate how such an approach facilitates the synthesis of safety-critical controllers for systems with parametric uncertainty and additive disturbances using control barrier functions, and demonstrate the utility of our approach through illustrative examples.
|
|
10:03-10:06, Paper FrA04.2 | Add to My Program |
Uncertainty and Its Effect on Optimal Multidrug Control of Hemodynamic Variables |
|
Popescu, Teodora | Technical University of Cluj-Napoca |
Birs, Isabela | Ghent University |
Ben Othman, Ghada | Ghent University |
Yumuk, Erhan | Ghent University |
Mihai, Marcian | Technical University of Cluj-Napoca |
Hegedus, Erwin | Technical University of Cluj-Napoca |
Copot, Dana | Ghent University |
De Keyser, Robin M.C. | Ghent University |
Ionescu, Clara | Ghent University |
Muresan, Cristina-Ioana | Technical University of Cluj-Napoca |
Keywords: Biomedical, Uncertain systems, Predictive control for linear systems
Abstract: Computer aided control in biomedical applications is gaining more and more popularity due to numerous research studies that have proven the efficiency of automatic control over manual dosing, which is highly susceptible to human errors. Optimal drug dosing is best achieved using automatic control, which triggers important benefits in terms of both costs and patient side-effects. However, mathematical models for patients are highly susceptible to large modeling uncertainty. A predictive control algorithm is designed in this paper for optimal multidrug control of hemodynamic variables. Improved closed loop performance is obtained compared to similar control strategies, for ±30% modeling uncertainty. The simulation results demonstrate that predictive control is a feasible solution for optimal drug dosing. An analysis of the closed loop performance for significant patient variability shows that controllers tuned using a nominal patient model often fail to achieve desired robustness. To limit the effect of modeling uncertainty, the prediction model should be updated using an online identification tool to extract patient features.
|
|
10:06-10:09, Paper FrA04.3 | Add to My Program |
Approximating Probabilistic Boundary of Future State Trajectory by Minimum-Volume Polynomial Sublevel Sets with Chance Constraints |
|
Shen, Xun | Osaka University |
Wang, Ye | The University of Melbourne |
Keywords: Fault detection, Fault diagnosis, Uncertain systems
Abstract: The probabilistic boundary is necessary for safety-critical validation and control in uncertain dynamical systems. This paper addresses the problem of computing minimum-volume polynomial sublevel sets with chance constraints. Due to chance constraints, the original problem is intractable. To resolve this issue, we propose a sample-based continuous approximation method to approximate the original chance constraints, which leads to an approximate problem. The approximate problem is a tractable nonlinear optimization problem. We show that the optimal solution and cost of the approximate problem converge to those of the original one. The probabilistic feasibility of the approximate solution with finite samples is also discussed. Finally, a numerical example has been conducted to validate the proposed method.
|
|
10:09-10:12, Paper FrA04.4 | Add to My Program |
On the Complexity of Computing the Minimum Mean Square Error of Causal Prediction |
|
Boche, Holger | Technische Universitaet Muenchen |
Pohl, Volker | Technische Universität München |
Poor, H. Vincent | Princeton Univ |
Keywords: Filtering, Kalman filtering, Computational methods
Abstract: This paper gives a complete characterization of the complexity of computing the minimum mean square prediction error for wide-sense stationary stochastic processes. It shows that if the spectral density of the stationary process is a strictly positive, computable continuous function then the minimum mean square error (MMSE) is always a computable number. It is also shown that the computation of the MMSE is a #P 1 complete problem on the set of strictly positive, polynomial-time computable, continuous spectral densities. This means that if, as widely assumed, FP 1 and # P 1 do not coinside, then there exist strictly positive, polynomial-time computable continuous spectral densities for which the computation of the MMSE is not polynomial-time computable. So under the widely accepted assumptions of complexity theory, the computation of the MMSE is generally much harder than NP 1 complete problems.
|
|
10:12-10:15, Paper FrA04.5 | Add to My Program |
Average Cost Optimality of Partially Observed MDPs: Contraction of Non-Linear Filters and Existence of Optimal Solutions and Approximations |
|
Demirci, Yunus emre | Queen's University |
Kara, Ali Devran | University of Michigan |
Yuksel, Serdar | Queen's University |
Keywords: Filtering, Stochastic optimal control, Stability of nonlinear systems
Abstract: The average cost optimality is known to be a challenging problem for partially observable stochastic control, with few results available beyond the finite state, action, and measurement setup, for which somewhat restrictive conditions are available. In this paper, we present explicit and easily testable conditions for the existence of solutions to the average cost optimality equation where the state space is compact. In particular, we present a new contraction based analysis, which is new to the literature to our knowledge, building on recent regularity results for non-linear filters. Beyond establishing existence, we also present several implications of our analysis that are new to the literature: (i) robustness to incorrect priors (ii) near optimality of policies based on quantized approximations, (iii) near optimality of policies with finite memory, and (iv) convergence in Q-learning. In addition to our main theorem, each of these represents a novel contribution for average cost criteria.
|
|
10:15-10:18, Paper FrA04.6 | Add to My Program |
Conditions for Altruistic Perversity in Two-Strategy Population Games |
|
Hill, Colton | University of Colorado Colorado Springs |
Brown, Philip N. | University of Colorado Colorado Springs |
Paarporn, Keith | University of Colorado, Colorado Springs |
Keywords: Game theory, Agents-based systems, Distributed control
Abstract: Self-interested behavior from individuals can collectively lead to poor societal outcomes. These outcomes can seemingly be improved through the actions of altruistic agents, which benefit other agents in the system. However, it is known in specific contexts that altruistic agents can actually induce worse outcomes compared to a fully selfish population --- a phenomenon we term altruistic perversity. This paper provides a holistic investigation into the necessary conditions that give rise to altruistic perversity. In particular, we study the class of two-strategy population games where one sub-population is altruistic and the other is selfish. We find that a population game can admit altruistic perversity only if the associated social welfare function is convex and the altruistic population is sufficiently large. Our results are a first step in establishing a connection between properties of nominal agent interactions and the potential impacts from altruistic behaviors.
|
|
10:18-10:21, Paper FrA04.7 | Add to My Program |
Prosumers Participation in Markets: A Scalar-Parameterized Function Bidding Approach |
|
Alawad, Abdullah | University of Illinois Urbana-Champaign |
Zaman, Muhammad Aneeq uz | UIUC |
Alshehri, Khaled | King Fahd University of Petroleum and Minerals |
Basar, Tamer | Univ of Illinois, Urbana-Champaign |
Keywords: Game theory, Agents-based systems, Energy systems
Abstract: In uniform-price markets, suppliers compete to supply a resource to consumers, resulting in a single market price determined by their competition. For sufficient flexibility, producers and consumers prefer to commit to a function as their strategies, indicating their preferred quantity at any given market price. Producers and consumers may wish to act as both, i.e., prosumers. In this paper, we examine the behavior of profit-maximizing prosumers in a uniform-price market for resource allocation with the objective of maximizing the social welfare. We propose a scalar-parameterized function bidding mechanism for the prosumers, in which we establish the existence and uniqueness of Nash equilibrium. Furthermore, we provide an efficient way to compute the Nash equilibrium through the computation of the market allocation at the Nash equilibrium. Finally, we present a case study to illustrate the welfare loss under different variations of market parameters, such as the market's supply capacity and inelastic demand.
|
|
10:21-10:24, Paper FrA04.8 | Add to My Program |
Optimal Detection for Bayesian Attack Graphs under Uncertainty in Monitoring and Reimaging |
|
Kazeminajafabadi, Armita | Northeastern University |
Ghoreishi, Seyede Fatemeh | Northeastern University |
Imani, Mahdi | Northeastern University |
Keywords: Markov processes, Stochastic systems
Abstract: Bayesian attack graphs (BAGs) are powerful models to capture the time-varying progression of attacks in complex interconnected networks. Network elements are modeled by graph nodes, and connections among components are represented through edges. The nodes take binary values, representing the compromised and uncompromised state of the network components. BAGs also offer a probabilistic representation of the likelihood of external and internal attacks progressing through exploit probabilities. The accuracy and timely detection of attacks are major objectives in the security analysis of networks modeled by BAGs. This can ensure network safety by identifying network vulnerabilities and designing better defense strategies (e.g., reimaging devices, installing firewalls, changing connections, etc.). Two main challenges in achieving accurate detection in complex networks are 1) the partial monitoring of the network components due to the limited available resources and 2) the uncertainty in identifying and removing some compromises in the network due to the ever-evolving complexity of attacks. For a general class of BAGs, this paper presents an optimal minimum mean square error (MMSE) attack detection technique with arbitrary uncertainty in the monitoring and reimaging process. As with the Kalman filtering approach used for linear Gaussian state-space models, the derived solution exhibits the same optimality. A recursive matrix-form implementation of the proposed detection method is introduced, and its performance is examined through numerical experiments using a synthetic BAG.
|
|
10:24-10:27, Paper FrA04.9 | Add to My Program |
Density Steering of Gaussian Mixture Models for Discrete-Time Linear Systems |
|
Balci, Isin M | University of Texas at Austin |
Bakolas, Efstathios | The University of Texas at Austin |
Keywords: Stochastic optimal control, Stochastic systems, Uncertain systems
Abstract: In this paper, we study the finite-horizon optimal density steering problem for discrete-time stochastic linear dynamical systems for the case when the state distribution can be represented by Gaussian mixture models. First, we revisit the covariance steering problem for Gaussian distributions and derive its optimal control policy in closed-form. Subsequently, we leverage the latter (deterministic) control policy to define a randomized control policy which ensures that the state distribution will remain a Gaussian mixture over the whole time horizon. By leveraging these results, we reduce the Gaussian mixture steering problem to a linear program. We also discuss the problem of steering general distributions using Gaussian mixture approximations. Finally, we present the results of non-trivial numerical experiments which demonstrate that our approach can be applied to general distribution steering problems.
|
|
10:27-10:30, Paper FrA04.10 | Add to My Program |
Negative Feedback Regulation Via an Autapse Enhances Neuronal Firing Precision |
|
Vahdat, Zahra | University of Delaware |
Gambrell, Oliver | University of Delaware |
Singh, Abhyudai | University of Delaware |
Keywords: Stochastic systems, Biomolecular systems, Systems biology
Abstract: In a chemical synapse, information flow occurs via the release of neurotransmitters from a presynaptic neuron that triggers an action potential (AP) in the postsynaptic neuron. At its core, this occurs via the postsynaptic membrane potential integrating neurotransmitter-induced synaptic currents, and AP generation occurs when potential reaches a critical threshold. This manuscript investigates feedback implementation via an autapse, where the axon from the postsynaptic neuron forms an inhibitory synapse onto itself. Using a stochastic model of neuronal synaptic transmission, we formulate AP generation as a first-passage time problem and derive expressions for both the mean and noise of AP-firing times. Our analytical results supported by stochastic simulations identify parameter regimes where autaptic feedback transmission enhances the precision of AP firing times consistent with experimental data. These noise attenuating regimes are intuitively based on two orthogonal mechanisms - either expanding the time window to integrate noisy upstream signals; or by linearizing the mean voltage increase over time. In summary, this work explores feedback modulation of the stochastic dynamics of autaptic neurotransmission and reveals its function of creating more regular AP firing patterns.
|
|
10:30-10:33, Paper FrA04.11 | Add to My Program |
Real-Time Spatial Trajectory Planning under Lateral Constraints |
|
Ruof, Jona | Ulm University |
Mertens, Max Bastian | Ulm University |
Buchholz, Michael | Universität Ulm |
Dietmayer, Klaus Christian Jürgen | University of Ulm |
Keywords: Automotive control, Predictive control for nonlinear systems, Control applications
Abstract: Trajectory planning is an essential component in automated driving applications. Especially planning in urban environments imposes a multitude of constraints, which need to be handled within a short computational time frame. Towards this challenge, we propose a novel trajectory planning approach based on a spatial problem formulation, which can update at high rates over long horizons. Complementing our prior work on longitudinal optimization, this approach focuses on planning under lateral constraints. Using a constraint shaping step followed by an optimal control solution in a Frenet frame, a comfortable and anticipatory trajectory is generated. For solving the resulting dynamic optimization objectives, a tailored solution strategy based on the iterative linear quadratic regulator (ILQR) in the Augmented-Lagrangian framework is employed. Simulated results on various urban scenarios show the effectiveness and versatility of the approach.
|
|
10:33-10:36, Paper FrA04.12 | Add to My Program |
Data-Driven Output Feedback Control Based on Behavioral Approach |
|
Qin, Zhaoming | EPFL |
Karimi, Alireza | EPFL |
Keywords: Behavioural systems, Linear systems, Subspace methods
Abstract: In this work, we propose a novel data-driven representation for general linear time-invariant (LTI) systems based on behavioral system theory. This representation relies solely on input-output data, eliminating the need for exact knowledge of the system structure. We also develop stabilizing controllers and finite/infinite horizon optimal linear quadratic (LQ) controllers using this data-driven representation. In the presence of noise-corrupted data, we present a certainty-equivalence LQ controller and demonstrate its effectiveness through performance analysis and a numerical example.
|
|
10:36-10:39, Paper FrA04.13 | Add to My Program |
Flow Sensing and Feedback Control for Maintaining School Cohesion in Uncoordinated Flapping Swimmers |
|
Hang, Haotian | University of Southern California |
Heydari, Sina | Department of Mechanical Engineering, Santa Clara University |
Kanso, Eva | University of Southern California |
Keywords: Biologically-inspired methods, Biological systems, Stability of nonlinear systems
Abstract: Fish often swim in schools. Flow interactions are thought to be beneficial for schooling. Recent work shows that flow interactions cause a pair of free inline swimmers, flapping at the same frequency, to passively stabilize at discrete locations relative to each other and that these passively stable formations are energetically beneficial. However, the stability of these formations is sensitive to finite mismatch in flapping frequencies. Here, we propose a local flow sensing model and feedback controller that stabilize a pair of frequency-uncoordinated swimmers into a cohesive formation. Our findings bear relevance to understanding fish collective behavior and for designing bio-inspired underwater robotics.
|
|
10:39-10:42, Paper FrA04.14 | Add to My Program |
Sampled-Data Output Feedback Control of the Stefan Problem with Explicit Condition of Sampling Scheduling |
|
Koga, Shumon | Honda Research and Development |
Keywords: Distributed parameter systems, Sampled-data control, Nonlinear output feedback
Abstract: This paper provides sampled-data output feedback control of the Stefan problem with an explicit condition of sampling scheduling. The Stefan problem is a well-known physical model of the liquid-solid phase change, governed by a parabolic partial differential equation (PDE) of the temperature profile over a moving domain governed by an Ordinary Differential Equation (ODE). Utilizing two measurements of the liquid-solid interface position and the temperature gradient at the interface position for all time, we design a continuous-time PDE backstepping observer to estimate true temperature profile. Then, the output feedback control law is given based on the temperature estimate, and the sampled-data input is executed as Zero-Order-Hold (ZOH). Under the explicit condition of sampling scheduling, we rigorously prove that the closed-loop system is well-posed and satisfies the required condition of the physical model, and is exponentially stable. Numerical results are provided to illustrate the effectiveness of the proposed method.
|
|
10:42-10:45, Paper FrA04.15 | Add to My Program |
Observability-Based Sensor Selection for a Planar Bending Beam Attached to a Rotating Body |
|
Brace, Natalie | University of Washington |
Morgansen, Kristi A. | University of Washington |
Keywords: Flexible structures, Observers for nonlinear systems, Aerospace
Abstract: Observability of a cantilever beam attached to a rigid body rotating and translating in the plane is considered first using a differential-geometric approach and then using the empirical Gramian. Based on a modal approximation of the beam, the rank condition of the observability codistribution indicates that the body rotation rate and rigid body motion parallel to the length of the beam can be observed with strain sensors and accelerometers located on the flexible beam through the passive motion coupling so long as the body rotation rate is nonzero, however the rigid body motion lateral to the beam cannot. The empirical observability Gramian, generated through MATLAB and finite element analysis simulations, is used to provide further understanding of the observability characteristics and serves as a basis for the sensor selection problem for the cantilevered beam. Multiple objective functions are considered and a comparison of the sensor selection results is performed; differences in performance are demonstrated through the error estimates of an unscented Kalman filter run with simulated measurement data.
|
|
10:45-10:48, Paper FrA04.16 | Add to My Program |
Nonlinear Horizon-One Model Predictive Control for Resource-Limited Applications |
|
Olucak, Jan | University of Stuttgart |
Fichter, Walter | Stuttgart University |
Cunis, Torbjørn | University of Stuttgart |
Keywords: Predictive control for nonlinear systems, Constrained control, Optimal control
Abstract: To reduce the computational footprint of model predictive control during online computation, a horizon-one scheme based on pre-computed inner-approximations of reachable sets is proposed. The inner-approximated reachable set allows to virtually predict the future system behavior over the full-horizon instead of repeatedly solving potentially large-scale optimal control problems. We provide theoretical proofs for recursive feasibility and asymptotic stability under mild assumptions. Furthermore, we illustrate how methods for sum-of-squares reachability analysis can be extended to meet these assumptions. The presented approach is demonstrated in simulation for functional verification and compared to other real-time methods from the literature.
|
|
10:48-10:51, Paper FrA04.17 | Add to My Program |
Discontinuous Barrier Functions for Piecewise Continuous Dynamics |
|
Jimenez Cortes, Carmen | Georgia Institute of Technology |
Thitsa, Makhin | Mercer University |
Coogan, Samuel | Georgia Institute of Technology |
Keywords: Constrained control, Lyapunov methods, Hybrid systems
Abstract: We propose a novel characterization of piecewise defined barrier functions for certifying forward invariant sets of piecewise continuous dynamical systems. Forward invariance is established by checking two conditions: the first condition is a usual barrier-type inequality on the interior of each piece, and the second condition imposes an appropriate interaction of the tangent cone and vector field at the boundary between pieces. We then show that this separation is especially well suited for constructing discontinuous barrier functions that are an appropriate generalization of high-order control barrier functions to the piecewise setting and can be used to construct controllers for forward invariance. In particular, the tangent cone condition at the boundary of pieces does not depend on the particular control strategy and can be checked, e.g., offline, while standard online methods can be used to enforce the barrier-type inequality on the interior of pieces.
|
|
10:51-10:54, Paper FrA04.18 | Add to My Program |
Adaptive Controller with Novel Phase Estimator for LLC Resonant Converter |
|
Mahdizadeh Shalmaei, Amir Hossein | AAU Energy, Aalborg University |
Tavan, Mehdi | IAU |
Soltani, Mohsen | Aalborg University |
Hajizadeh, Amin | Aalborg University |
Keywords: Observers for nonlinear systems, Power electronics, Adaptive systems
Abstract: It is a well-established fact that achieving precise control of an LLC resonant converter operating in sub-resonant mode hinges on the accurate measurement of the phase difference induced by the resonant tank’s parameters. Traditionally, this necessitates complex and costly software and hardware setups, presenting a formidable challenge. In this paper, we present a novel and innovative approach through which the phase difference is estimated. This method distinguishes itself by requiring the fewest sensors, resulting in significant cost savings during fabrication. With this method in hand, we propose an adaptive controller designed to maintain a constant output voltage, impervious to disturbances on the input side. To illustrate the performance of the designed observer and controller, the converter equipped with the suggested controller is simulated in MATLAB/Simulink. The results show that stability and disturbance rejection are achieved for the closed- loop system.
|
|
10:54-10:57, Paper FrA04.19 | Add to My Program |
Robust and Hölder-Continuous Finite-Time Stabilization of Rigid Body Attitude Dynamics Using Rotation Matrices |
|
Wang, Ningshan | Syracuse University |
Hamrah, Reza | Syracuse University |
Sanyal, Amit | Syracuse University |
Keywords: Stability of nonlinear systems, Variable-structure/sliding-mode control, Aerospace
Abstract: This article presents a robust and finite-time stable control scheme for attitude stabilization of a rigid body using a Hölder-continuous differentiator. This scheme is designed directly on the state-space of rigid body rotational motion, which is the tangent bundle of the Lie group of three-dimensional rotations. This article presents the differentiator, its stability and robustness properties in detail. This is followed by its use in the attitude stabilization control scheme. The stability and robustness properties of the proposed Hölder-continuous design are obtained through a Lyapunov stability analysis, and juxtaposed with a sliding-mode design. This is followed by numerical simulation results that compare the performance of the two designs. These comparison results clearly demonstrate the advantages of the proposed Hölder-continuous stabilization scheme for rigid body attitude control.
|
|
10:57-11:00, Paper FrA04.20 | Add to My Program |
Reach-Avoid Analysis for Sampled-Data Systems with Measurement Uncertainties |
|
Wu, Taoran | Institute of Software CAS |
Ren, Dejin | Institute of Software Chinese Academy of Sciences |
Zhang, Shuyuan | Beihang University |
Wang, Lei | Beihang University |
Xue, Bai | Institute of Software, Chinese Academy of Sciences |
Keywords: Robust control, Formal verification/synthesis
Abstract: Digital control has become increasingly prevalent in modern systems, making continuous-time plants controlled by discrete-time (digital) controllers ubiquitous and crucial across industries, including aerospace, automotive, and manufacturing. This paper focuses on investigating the reach-avoid problem in such systems, where the objective is to reach a goal set while avoiding unsafe states, especially in the presence of state measurement uncertainties. We propose an approach that builds upon the concept of exponential control guidance-barrier functions, originally used for synthesizing continuous-time feedback controllers. We introduce a sufficient condition that, if met by a given continuous-time feedback controller, ensures the safe guidance of the system into the goal set in its sampled-data implementation, despite state measurement uncertainties. The event of reaching the goal set is determined based on state measurements obtained at the sampling time instants. Numerical examples are provided to demonstrate the validity of our theoretical developments, showcasing successful implementation in solving the reach-avoid problem in sampled-data systems with state measurement uncertainties.
|
|
FrB01 Regular Session, Metro E/C |
Add to My Program |
Learning |
|
|
Chair: Liu, Jun | University of Waterloo |
Co-Chair: Anderson, James | Columbia University |
|
13:30-13:45, Paper FrB01.1 | Add to My Program |
Risk-Aware Distributed Multi-Agent Reinforcement Learning |
|
Maruf, Abdullah Al | California State University |
Niu, Luyao | University of Washington |
Ramasubramanian, Bhaskar | Western Washington University |
Clark, Andrew | Washington University in St. Louis |
Poovendran, Radha | University of Washington |
Keywords: Learning, Agents-based systems
Abstract: Autonomous cyber and cyber-physical systems need to perform decision-making, learning, and control in unknown environments. Such decision-making can be sensitive to multiple factors, including modeling errors, changes in costs, and impacts of events in the tails of probability distributions. Although multi-agent reinforcement learning (MARL) provides a framework for learning behaviors through repeated interactions with the environment by minimizing an average cost, it is not adequate to overcome the above challenges. In this paper, we develop a distributed MARL approach to solve decision-making problems in unknown environments by learning risk-aware actions. We use the conditional value-at risk (CVaR) to define the cost function that is being minimized, and introduce a Bellman operator to characterize the value function associated to a given state-action pair. We prove that this operator satisfies a contraction property, and that it converges to the optimal value function. We then propose a distributed MARL algorithm called the CVaR QD-Learning algorithm, and establish that value functions of individual agents reach consensus. We identify several challenges that arise in the implementation of the CVaR QD-Learning algorithm, and present solutions to overcome these. We evaluate the CVaR QD-Learning algorithm through simulations, and demonstrate the effect of a risk parameter on value functions at consensus.
|
|
13:45-14:00, Paper FrB01.2 | Add to My Program |
Zubov-Koopman Learning of Maximal Lyapunov Function |
|
Meng, Yiming | University of Illinois Urbana-Champaign |
Zhou, Ruikun | University of Waterloo |
Liu, Jun | University of Waterloo |
Keywords: Learning, Lyapunov methods, Stability of nonlinear systems
Abstract: While there has been increasing interest in solving Zubov’s equation to find the maximal Lyapunov function, it remains a challenge for dynamical systems with limited knowledge of system dynamics. In this paper, we present a Zubov-Koopman approach to learning a Lyapunov function that is nearly maximal for an unknown nonlinear system but has a known equilibrium point. The proposed approach is a lifting approach to map observable data into an infinite dimensional function space, which generates a flow governed by our proposed ‘Zubov-Koopman’ operator. By learning a Zubov-Koopman operator over a fixed time interval, we can indirectly approximate the solution to Zubov’s Equation through iterative application of the learned operator on the identity function. We also demonstrate that a transformation of such an approximator can be readily utilized as a near-maximal Lyapunov function. We present an algorithm for learning Zubov-Koopman operators, asserting that this method not only decreases the necessary data volume but also achieves favorable outcomes in estimating regions of attraction, as illustrated by numerical examples.
|
|
14:00-14:15, Paper FrB01.3 | Add to My Program |
Learning High-Order Control Barrier Functions for Safety-Critical Control with Gaussian Processes |
|
Aali, Mohammad | University of Waterloo |
Liu, Jun | University of Waterloo |
Keywords: Learning, Uncertain systems, Lyapunov methods
Abstract: Control barrier functions (CBFs) have recently introduced a systematic tool to ensure system safety by establishing set invariance. When combined with a nominal control strategy, they form a safety-critical control mechanism. However, the effectiveness of CBFs is closely tied to the system model. In practice, model uncertainty can compromise safety guarantees and may lead to conservative safety constraints, or conversely, allow the system to operate in unsafe regions. In this paper, we use Gaussian processes to mitigate the adverse effects of uncertainty on high-order CBFs (HOCBFs). A particular structure of the covariance function enables us to convert the chance constraints of HOCBFs into a second-order cone constraint, which results in a convex constrained optimization as a safety filter. We analyze the feasibility of the resulting optimization and provide the necessary and sufficient conditions for feasibility. The effectiveness of the proposed strategy is validated through two numerical results.
|
|
14:15-14:30, Paper FrB01.4 | Add to My Program |
Oracle Complexity Reduction for Model-Free LQR: A Stochastic Variance-Reduced Policy Gradient Approach |
|
Toso, Leonardo Felipe | Columbia University |
Wang, Han | Columbia University |
Anderson, James | Columbia University |
Keywords: Learning, Optimal control, Optimization
Abstract: We investigate the problem of learning an epsilon-approximate solution for the discrete-time Linear Quadratic Regulator (LQR) problem via a Stochastic Variance-Reduced Policy Gradient (SVRPG) approach. Whilst policy gradient methods have proven to converge linearly to the optimal solution of the model-free LQR problem, the substantial requirement for two-point cost queries in gradient estimations may be intractable, particularly in applications where obtaining cost function evaluations at two distinct control input configurations is exceptionally costly. To this end, we propose an oracle-efficient approach. Our method combines both one-point and two-point estimations in a dual-loop variance-reduced algorithm. It achieves an approximate optimal solution with only mathcal{O}left(logleft(1/epsilonright)^{beta}right ) two-point cost information for beta in (0,1).
|
|
14:30-14:45, Paper FrB01.5 | Add to My Program |
Detection of Man in the Middle Attacks in Model-Free Reinforcement Learning for the Linear Quadratic Regulator |
|
Rani, Rishi | University of California, San Diego |
Franceschetti, Massimo | UCSD |
Keywords: Learning, Networked control systems, Agents-based systems
Abstract: We consider the problem of a learning-based, man-in-the-middle (MITM) attack in a cyber-physical system. We use a simple abstraction where an agent performs linear quadratic regulation (LQR) of a discrete-time, linear, time-invariant (LTI) system with stochastic disturbances, using model-free reinforcement learning. The system may be subject to an adversarial attack that overrides the feedback signal and the controller actions. We propose a ``Bellman Deviation'' algorithm that can be used by the agent to detect the attack. This algorithm only requires an estimate of the Q-function, and optimal average stage cost, and no explicit information of the system parameters. We show that the proposed algorithm asymptotically guarantees attack detection (AD) with high probability while avoiding false alarms, when an ``informational advantage'' condition is met. This condition compares the amount of information the agent has aquired about the system with the one aquired by the adversary.
|
|
14:45-15:00, Paper FrB01.6 | Add to My Program |
Cooperative Multi-Agent Graph Bandits: UCB Algorithm and Regret Analysis |
|
Paschalidis, Phevos | Harvard University |
Zhang, Runyu | Harvard University |
Li, Na | Harvard University |
Keywords: Agents-based systems, Learning
Abstract: In this paper, we formulate the multi-agent graph bandit problem as a multi-agent extension of the graph bandit problem introduced in (Zhang et al., 2023). In our formulation, N cooperative agents travel on a connected graph G with K nodes. Upon arrival at each node, agents observe a random reward drawn from a node-dependent probability distribution. The reward of the system is modeled as a weighted sum of the rewards the agents observe, where the weights capture some transformation of the reward associated with multiple agents sampling the same node at the same time. We propose an Upper Confidence Bound (UCB)-based learning algorithm, Multi-G-UCB, and prove that its expected regret over T steps is bounded by O(gamma N log(T)[sqrt(KT)+DK]), where D is the diameter of graph G and gamma a boundedness parameter associated with the weight functions. Lastly, we numerically test our algorithm by comparing it to alternative methods.
|
|
FrB02 Regular Session, Harbour |
Add to My Program |
Optimal Control I |
|
|
Chair: Shishika, Daigo | George Mason University |
Co-Chair: Borum, Andy | Vassar College |
|
13:30-13:45, Paper FrB02.1 | Add to My Program |
Real-Time Feasible Usage of Radial Basis Functions for Representing Unstructured Environments in Optimal Ship Control |
|
Tengesdal, Trym | Norwegian University of Science and Technology |
Gros, Sebastien | NTNU |
Johansen, Tor Arne | Norweigian Univ. of Science & Tech |
Keywords: Optimal control, Autonomous systems, Maritime control
Abstract: Navigating the highly unstructured maritime environment poses significant challenges for autonomous ships, particularly in the vicinity of static obstacles and inland waterways. Real-time algorithms capable of comprehending the complexity of nearby grounding hazards are crucial for safe and efficient operations. Electronic Navigational Charts (ENCs) serve as the standard for representing the static environment, providing detailed polygon-based information about obstacles and grounding hazards. However, the non-convex nature of these polygons presents difficulties for optimal control and Model Predictive Control (MPC) schemes. This article introduces an accurate and computationally feasible method for extracting and representing non-convex static obstacle polygons, specifically tailored for use in numerical optimization-based planning, path-following, and trajectory tracking close to static hazards. By employing geometric surface interpolation techniques, Thin Plate Spline (TPS) type of Radial Basis Function (RBF) interpolants are derived from each grounding hazard polygon's point set. These surface approximation functions are then utilized as inequality constraints within a Nonlinear MPC (NMPC) planning scheme to facilitate trajectory tracking with anti-grounding functionality. The integration of surface functions enables the NMPC to consider higher-detail maps, enabling the proposed control system to closely follow trajectories within the unstructured environment's hazardous areas, demonstrated through proof-of-concept simulations.
|
|
13:45-14:00, Paper FrB02.2 | Add to My Program |
A Non-Regular Mixed Constrained Problem Involving Sweeping Processes |
|
T. Khalil, Nathalie | Universidade Do Porto |
Cortez, Karla Lorena | Universidad Autonoma Metropolitana |
Aguiar, A. Pedro | Faculty of Engineering, University of Porto |
Keywords: Optimal control, Constrained control
Abstract: We explore a novel instance of an optimal control problem characterized by dynamics represented as a sweeping process subject to a drift, and incorporating an additional element: a non-regular mixed constraint. We investigate two distinct approaches for establishing the Pontryagin maximum principle. In the first approach, we employ an approximation technique, representing the sweeping term using a sequence of Lipschitz functions. In the second approach, we treat the sweeping as a coupling between an equality mixed constraint and a pure inequality state constraint. Through a rigorous analysis of both approaches, we observe notable similarities. Specifically, we identify the emergence of charges associated with the mixed constraints and the notable absence of the maximization condition within the maximum principle. These outcomes are a direct consequence of the non-regularity inher- ent in the mixed constraint.
|
|
14:00-14:15, Paper FrB02.3 | Add to My Program |
Defending a Static Target Point with a Slow Defender |
|
Das, Goutam | George Mason University |
Dorothy, Michael | US Army Research Laboratory |
Bell, Zachary I. | Air Force |
Shishika, Daigo | George Mason University |
Keywords: Optimal control, Differential-algebraic systems, Agents-based systems
Abstract: This paper studies a target-defense game played between a slow defender and a fast attacker. The attacker wins the game if it reaches the target while avoiding the defender's capture disk. The defender wins the game by preventing the attacker from reaching the target, which includes reaching the target and containing it in the capture disk. Depending on the initial condition, the attacker must circumnavigate the defender's capture disk, resulting in a constrained trajectory. This condition produces three phases of the game, which we analyze to solve for the game of kind. We provide the barrier surface that divides the state space into attacker-win and defender-win regions, and present the corresponding strategies that guarantee win for each region. Numerical experiments demonstrate the theoretical results as well as the efficacy of the proposed strategies.
|
|
14:15-14:30, Paper FrB02.4 | Add to My Program |
Regret-Optimal Control under Partial Observability |
|
Hajar, Joudi | Caltech |
Sabag, Oron | Hebrew University |
Hassibi, Babak | Caltech |
Keywords: Optimal control, H-infinity control, Stochastic optimal control
Abstract: This paper studies online solutions for regret-optimal control in partially observable systems over an infinite-horizon. Regret-optimal control aims to minimize the difference in LQR cost between causal and non-causal controllers while considering the worst-case regret across all l2-norm-bounded disturbance and measurement sequences. Building on ideas from Sabag et. al (2021) on the the full-information setting, our work extends the framework to the scenario of partial observability (measurement-feedback). We derive an explicit state-space solution when the non-causal solution is the one that minimizes the H2 criterion, and demonstrate its practical utility on several practical examples. These results underscore the framework’s significant relevance and applicability in real-world systems.
|
|
14:30-14:45, Paper FrB02.5 | Add to My Program |
Optimal Control of Nonlinear Systems with Input and State Constraints Using Koopman Operator |
|
Wang, Yujia | National University of Singapore |
Wu, Zhe | National University of Singapore |
Keywords: Optimal control, Learning, Chemical process control
Abstract: This work presents a constrained optimization framework for addressing the infinite-time optimal control problem for a class of nonlinear systems with constraints on control inputs and states. Specifically, the Koopman operator theory is employed first to transform the nonlinear system into a linear system. The optimal control problem for a nonlinear system with constraints is then reformulated as the optimal control problem for a linear system with constraints. Subsequently, by using an iterative algorithm and the concept of λ-contractivity, the constrained optimal control for the linear system is solved. Finally, two examples are used to demonstrate the effectiveness and advantages of the proposed strategy.
|
|
14:45-15:00, Paper FrB02.6 | Add to My Program |
Efficient Value Function Upper Bounds for a Class of Constrained Linear Time-Varying Optimal Control Problems |
|
Liu, Vincent | The University of Melbourne |
Manzie, Chris | The University of Melbourne |
Dower, Peter M. | University of Melbourne |
Keywords: Optimal control, Linear systems, Constrained control
Abstract: This paper develops an algorithm for upper-bounding the value function for a class of continuous-time optimal control problems. The upper bound can be used as a conservative estimate for the minimum cost that can be attained by any constraint admissible control from some initial state. Linear time-varying systems subject to convex input constraints and a state-independent running cost are considered. A collection of solutions of an augmented dynamical system is used to characterise viscosity supersolutions of a Hamilton-Jacobi-Bellman equation, which in turn yields an upper bound for the value function. The proposed algorithm has a computational complexity that scales in the number of these solutions as opposed to the dimension of the system, making the algorithm tractable for high dimensional systems.
|
|
FrB03 Invited Session, Frontenac |
Add to My Program |
Mechatronics II |
|
|
Chair: Al Janaideh, Mohammad | University of Guelph |
Co-Chair: Mishra, Richa | UNIVERSTIY of TEXAS at DALLAS |
Organizer: Al Janaideh, Mohammad | University of Guelph |
Organizer: Rakotondrabe, Micky | ENIT Tarbes, INPT, University of Toulouse |
|
13:30-13:45, Paper FrB03.1 | Add to My Program |
Simultaneous Estimation of Differential Surface Parameters with Ultra-Fast Feedback Loop in Scanning Tunneling Microscopy (I) |
|
Mishra, Richa | UNIVERSTIY of TEXAS at DALLAS |
Moheimani, S.O. Reza | University of Texas at Dallas |
Keywords: Closed-loop identification, PID control, Stability of linear systems
Abstract: We report an enhanced feedback control method to enable the simultaneous estimation of differential surface parameters di/dV and d(ln(Ri))/dδ during atomic-scale imaging of a surface with a Scanning Tunneling Microscope (STM). The proposed system enables exceptional signal-to-noise ratio (SNR) measurements of surface parameters by adding notch filters in the feedback loop. We then analyze the performance of a conventional PI controller for the ultra-fast feedback loop and demonstrate that changes in the work function (φ), a quantum mechanical property of the tip-sample junction, can destabilize the closed-loop system, leading to a possible tip crash. These tip crashes can compromise the STM’s efficiency and reliability, thus necessitating measures to address this loss of robustness. The effectiveness of this new STM feedback control system is validated by applying it to a set of STM images obtained from a Si(100) − 2 × 1:H passivated surface. We provide guidelines for PI tuning to optimize the system’s performance.
|
|
13:45-14:00, Paper FrB03.2 | Add to My Program |
Position Servo Control Strategy for a Hydraulic Valve-Controlled Cylinder with a Digital Piezo-Actuator (I) |
|
Zhang, Yunzhi | Nanjing University of Aeronautics and Astronautics |
Rakotondrabe, Micky | ENIT Tarbes, INPT, University of Toulouse |
Feng, Zhao | Wuhan University |
Zhu, Yuchuan | Nanjing University of Aeronautics and Astronautics |
Ling, Jie | Nanjing University of Aeronautics and Astronautics |
Keywords: Mechatronics, Fluid flow systems, Aerospace
Abstract: To improve the performance and reliability of electro-hydraulic servo control system (EHSCS), a position servo control strategy for a hydraulic valve-controlled cylinder with a digital piezo-actuator is proposed in this paper. Analytic model of the system is built firstly for control strategy design. To meet the accurate positioning requirement of the hydraulic cylinder under low and high-speed conditions, a compound control strategy is proposed with a dual control loop, i.e., the layer allocation control (LAC) and layer PWM control (LPC). The core idea of this strategy is a two-step control, where the actuation layers of the digital bits are first determined using the LAC and the LPC further compensates the residual error according to the reference speed. Experimental results show that the position servo control strategy with a digital piezo-actuator can improve the reliability of EHSCS as well as guarantee the position servo performance under different tracking conditions: (a) Under low-speed tracking conditions, the root-mean-square (RMS) errors for sinusoidal tracking at 0.08 Hz and 0.1 Hz using the proposed compound control are reduced by 42.3% and 64.7% compared with the cases using LAC. (b) Under high-speed tracking conditions, the LAC is enough for position servo control with fewer high-frequency on/off switching of the piezoelectric.
|
|
14:00-14:15, Paper FrB03.3 | Add to My Program |
Output Feedback Control of a Nonlinear Galfenol-Based Actuator for Active Vibration Control Systems (I) |
|
Clemente, Carmine | University of Sannio |
Loschiavo, Vincenzo | University of Sannio |
Davino, Daniele | University of Sannio, Benevento |
Monteiro, Giselle | Institute of Mathematics, Czech Academy of Sciences |
Al Saaideh, Mohammad | Memorial University of Newfoundland |
Krejci, Pavel | Academy of Sciences of the Czech Republic |
Al Janaideh, Mohammad | University of Guelph |
Keywords: Mechatronics
Abstract: This paper proposed an output feedback control design of a Galfenol-based actuator for active vibration control systems, considering unknown actuator dynamics under unknown load and external disturbance. The dynamic behavior of the Galfenol-based actuator was described by the constitutive relationship of the magnetostrictive materials. The objective is to devise a control signal, which is the input current of the coil, capable of generating an output force that counteracts any undesired motion of the platform caused by unknown loads or external disturbances. This implies maintaining a displacement at the output equal to zero. The simulation results show the proposed control approach's ability to regulate the platform's output displacement to about zero under different conditions of unknown loads and external disturbances.
|
|
14:15-14:30, Paper FrB03.4 | Add to My Program |
Output Feedback Control of a Piezoelectric Robotic Manipulator During the Characterization of an Object Exhibiting Nonlinear Viscoelastic Deformation (I) |
|
Flores, Gerardo | Center for Research in Optics |
Rakotondrabe, Micky | ENIT Tarbes, INPT, University of Toulouse |
Keywords: Mechatronics, Robotics, Nonlinear output feedback
Abstract: This paper proposes the modeling and control of a piezoelectric robotic manipulator used to characterize the behavior of a deformable object that exhibits nonlinear and viscoelastic deformation. To this aim, the manipulator's behavior, which exhibits nonlinearity, is approximated by a classical Bouc-Wen hysteresis model. Then, an output feedback control that ensures position reference tracking is designed for the manipulator. The output feedback is based on observers that estimate the manipulator's states and the interaction force with the characterized object. Finally, using the estimated force and the controlled position information, the force-deformation characteristics of the object are plotted, accessing its behavior and potentially its model parameters.
|
|
14:30-14:45, Paper FrB03.5 | Add to My Program |
Reachability Analysis for Steerable Drifter Systems (I) |
|
Gaskell, Eric | Michigan State University |
Tan, Xiaobo | Michigan State University |
Keywords: Robotics, Predictive control for nonlinear systems, Constrained control
Abstract: Drifters are energy-efficient sampling platforms for oceanographic and other aquatic measurements. Steerable drifters may exert a small amount of control over their trajectory by modulating the drag on one or more rudders. Due to their limited mobility, it is of particular interest to characterize the reachability of steerable drifters over a range of initial velocity conditions. Established models of steerable drifters are highly nonlinear, and cannot be readily analyzed using existing methods for controllability analysis. In this paper a novel approach is proposed for characterizing the spatial reachability of a steerable drifter by using a modified empirical controllability gramian, which is relatively convenient to compute. In particular, the eigenvalues of the said gramian show strong coupling with the spatial coverage of the drifter as extracted from Monte Carlo simulations. A model is developed to capture the relationship between the eigenvalues and the span of achievable trajectories in the spatial domain. The predictive power of the model is demonstrated by comparing its estimates of the trajectory span with the Monte Carlo simulation results generated from random initial velocity conditions. Using this model to predict the span of the reachable subspace incurs a far lower computational cost than brute force strategies such as the Monte Carlo method.
|
|
14:45-15:00, Paper FrB03.6 | Add to My Program |
On Precision Motion Control for an Industrial Long-Stroke Motion System with a Nonlinear Micropositioning Actuator (I) |
|
Al-Rawashdeh, Yazan Mohammad | Memorial University of Newfoundland |
Al Saaideh, Mohammad | Memorial University of Newfoundland |
Heertjes, Marcel | Eindhoven University of Technology |
Al Janaideh, Mohammad | University of Guelph |
Keywords: Mechatronics
Abstract: In this study, we propose a control technique that can be used to significantly reduce the tracking error of a short-stroke motion system whose dynamics are considered totally unknown with possibly input and output nonlinearities. As an example, the tracking performance of a uni-axial piezoceramic actuated positioning stage is examined under mainly sinusoidal test input signals with various frequencies and amplitudes, where we show that the proposed controller does invert the plant dynamics. Interestingly, neither modeling nor identification of the stage dynamics is needed. Mainly, the indented operation bandwidth is the only needed information when the proposed controller is synthesized. Experimental results demonstrate the effectiveness of the proposed approach when the piezoceramic actuated stage is attached to an existing long-stroke positioning motion system as an add-on to motivate the former usefulness in specifically enhancing the performance of wafer scanner machines used in semiconductor manufacturing.
|
|
FrB04 Invited Session, Metro W |
Add to My Program |
Autonomous Planning and Control |
|
|
Chair: Zhang, Fumin | Georgia Institute of Technology |
Co-Chair: Motee, Nader | Lehigh University |
Organizer: Liu, Guangyi | Lehigh University |
Organizer: Topcu, Ufuk | The University of Texas at Austin |
Organizer: Zhang, Fumin | Georgia Institute of Technology |
Organizer: Motee, Nader | Lehigh University |
|
13:30-13:45, Paper FrB04.1 | Add to My Program |
LP-Planning: Linear Control-Based Planning Using Probability Mass Function Measurements (I) |
|
Kermanshah, Mehdi | Boston University |
Belta, Calin | Boston University |
Tron, Roberto | Boston University |
Keywords: Linear systems, Robust control, Optimization
Abstract: We propose an approach to synthesize linear feedback controllers for linear systems in polygonal environments. Our method focuses on designing a robust controller that can account for uncertainty in measurements. Its inputs are provided by a perception module that generates probability mass functions (PMFs) for predefined landmarks in the environment, such as distinguishable geometric features. We formulate an optimization problem with Control Lyapunov Function (CLF) and Control Barrier Function (CBF) constraints to derive a stable and safe controller. Using the strong duality of linear programs (LPs) and robust optimization, we convert the optimization problem to a linear program that can be efficiently solved offline. At a high level, our approach partially combines perception, planning, and real-time control into a single design problem. An additional advantage of our method is the ability to produce controllers capable of exhibiting nonlinear behavior while relying solely on an offline LP for control synthesis.
|
|
13:45-14:00, Paper FrB04.2 | Add to My Program |
Time-Robust Path Planning with Piece-Wise Linear Trajectory for Signal Temporal Logic Specifications (I) |
|
Le, Nhan-Khanh | Technical University of Munich |
Noorani, Erfaun | University of Maryland College Park |
Hirche, Sandra | Technische Universität München |
Baras, John S. | University of Maryland |
Keywords: Formal verification/synthesis
Abstract: Real-world scenarios are characterized by timing uncertainties, e.g., delays, and disturbances. Algorithms with temporal robustness are crucial in guaranteeing the successful execution of tasks and missions in such scenarios. We study time-robust path planning for synthesizing robots' trajectories that adhere to spatial-temporal specifications expressed in Signal Temporal Logic (STL). In contrast to prior approaches that rely on discretized trajectories with fixed time steps, we leverage Piece-Wise Linear (PWL) signals for the synthesis. PWL signals represent a trajectory through a sequence of time-stamped waypoints. This allows us to encode the STL formula into a Mixed-Integer Linear Program (MILP) with fewer variables. This reduction is more pronounced for specifications with a long planning horizon. To that end, we define time-robustness for PWL signals. Subsequently, we propose quantitative semantics for PWL signals according to the recursive syntax of STL and prove their soundness. We then propose an encoding strategy to transform our semantics into a MILP. Our simulations showcase the soundness and the performance of our algorithm.
|
|
14:00-14:15, Paper FrB04.3 | Add to My Program |
Community Consensus: Converging Locally Despite Adversaries and Heterogeneous Connectivity (I) |
|
Gava, Cristina | Kings College London |
Vékássy, Áron | Harvard University |
Cavorsi, Matthew | Harvard University |
Gil, Stephanie | Harvard University |
Mallmann-Trenn, Frederik | King's College London |
Keywords: Autonomous robots, Agents-based systems
Abstract: We introduce the concept of emph{community consensus} in the presence of malicious agents using a well-known median-based consensus algorithm. We consider networks that have multiple well-connected regions that we term emph{communities}, characterized by specific robustness and minimum degree properties. Prior work derives conditions on properties that are necessary and sufficient for achieving emph{global} consensus in a network. This, however, requires the minimum degree of the network graph to be proportional to the number of malicious agents in the network, which is not very practical in large networks. In this work, we present a natural generalization of this previous result. We characterize cases where, although global consensus is not reached, some subsets of agents V_i will still converge to the same values mathcal{M}_i among themselves. To reach this new type of consensus, we define more relaxed requirements in terms of the number of malicious agents in each community, and the number k of edges connecting an agent in a community to agents external to the community.
|
|
14:15-14:30, Paper FrB04.4 | Add to My Program |
Investigating the Effectiveness of Reinforcement Learning in Closed-Loop Systems with Time Delays (I) |
|
Wafi, Moh. Kamalul | Northeastern University |
Siami, Milad | Northeastern University |
Sznaier, Mario | Northeastern University |
Keywords: Machine learning, Delay systems
Abstract: Data-driven controllers have gained prominence in diverse control applications, attributed to their inherent flexibility and adaptability to complex system dynamics. However, managing time delays in closed-loop systems remains a significant challenge in their deployment. These delays can arise from various sources, such as computational latency, actuator reaction time, and communication delays. Unaddressed, these time lags can induce system instability and degrade performance. This paper rigorously analyzes the impact of time delays on data-driven controllers and introduces methodologies to mitigate their adverse effects. Specifically, we explore the integration of the Smith predictor with Deep Reinforcement Learning (SP-DRL) to formulate a control law capable of effectively managing both time delays and system uncertainties, while ensuring robust performance. We demonstrate that this DRL-based framework, initially trained in stable environments, generalizes well to unstable systems. Our investigation delineates the scenarios conducive to the successful application of this approach and identifies factors influencing its effectiveness. To substantiate our findings, we present a case study involving a first-order delayed linear system with nonlinear actuation modules. Numerical simulations are employed to compare the robustness of SP-DRL scheme against the DRL standalone and the classical controls, such as PID and Linear Quadratic Regulator (LQR), in the presence of delays.
|
|
14:30-14:45, Paper FrB04.5 | Add to My Program |
Hybrid Zonotope-Based Backward Reachability Analysis for Neural Feedback Systems with Nonlinear Plant Models (I) |
|
Zhang, Hang | University of Wisconsin-Madison |
Zhang, Yuhao | University of Wisconsin-Madison |
Xu, Xiangru | University of Wisconsin-Madison |
Keywords: Neural networks, Emerging control applications, Numerical algorithms
Abstract: The increasing prevalence of neural networks in safety-critical control systems underscores the imperative need for rigorous methods to ensure the reliability and safety of these systems. This work introduces a novel approach employing hybrid zonotopes to compute the over-approximation of backward reachable sets for neural feedback systems with nonlinear plant models and general activation functions. Closed-form expressions as hybrid zonotopes are provided for the over-approximated backward reachable sets, and a refinement procedure is proposed to alleviate the potential conservatism of the approximation. Two numerical examples are provided to illustrate the effectiveness of the proposed approach.
|
|
14:45-15:00, Paper FrB04.6 | Add to My Program |
Computing Robust Control Invariant Sets of Nonlinear Systems Using Polynomial Controller Synthesis (I) |
|
Schäfer, Lukas | Technical University of Munich |
Althoff, Matthias | Technische Universität München |
Keywords: Predictive control for nonlinear systems, Computational methods, Robust control
Abstract: Deploying nonlinear sampled-data systems in safety-critical applications requires us to ensure robust constraint satisfaction for an infinite time horizon. To maximize the region of safe operation, we aim to compute a robust control invariant set with maximum volume. In this work, we propose an iterative optimization-based algorithm that computes a sequence of candidate invariant sets, which is volume-wise monotonically increasing. By leveraging polynomialization-based techniques from reachability analysis and controller synthesis, our approach outperforms linearization-based approaches, especially for higher-dimensional systems. We show that the computational complexity of each iteration of our algorithm is polynomial in the state dimension and demonstrate its broad applicability using several examples from the literature with up to 10 dimensions.
|
|
FrB05 Regular Session, Pier 2 |
Add to My Program |
Information-Theoretic Control |
|
|
Chair: Magbool Jan, Nabil | Indian Institute of Technology Tirupati |
Co-Chair: Molloy, Timothy L. | Australian National University |
|
13:30-13:45, Paper FrB05.1 | Add to My Program |
Near-Optimality of Finite-Memory Codes and Reinforcement Learning for Zero-Delay Coding of Markov Sources |
|
Cregg, Liam | Queen's University |
Alajaji, Fady | Queen's University |
Yuksel, Serdar | Queen's University |
Keywords: Information theory and control, Control over communications, Stochastic optimal control
Abstract: We study the problem of zero-delay coding of a Markov source over a noisy channel with feedback. Building and generalizing prior work, we first formulate the problem as a Markov decision process (MDP) where the state is a probability measure valued predictor along with a finite memory of channel outputs and quantizers. We then approximate this state by marginalizing over all possible predictors, so that our policies only use the finite-memory term to encode the source. Under an appropriate notion of predictor stability, we show that such policies are near-optimal for the zero-delay coding problem as the memory length increases. We also give sufficient conditions for predictor stability to hold, and present a reinforcement learning algorithm and establish its convergence to compute near-optimal finite-memory policies. These theoretical results are supported by simulations.
|
|
13:45-14:00, Paper FrB05.2 | Add to My Program |
Active Fixed-Sample-Size Hypothesis Testing Via POMDP Value Function Lipschitz Bounds |
|
Molloy, Timothy L. | Australian National University |
Nair, Girish N. | University of Melbourne |
Keywords: Information theory and control, Markov processes, Stochastic optimal control
Abstract: We establish the Lipschitz continuity of the value functions of an active fixed-sample-size hypothesis testing problem when it is reformulated as a partially observed Markov decision process. These Lipschitz results enable us to develop novel upper and lower bounds on the value of information, which is the expected difference between the value functions before and after performing an experiment. Our novel Lipschitz and value-of-information results provide new practical insight into optimal policies for active fixed-sample-size hypothesis testing without resorting to approximate dynamic programming schemes or asymptotic analysis with infinite numbers of samples. We illustrate the utility of our results by showing that a simple scheme based on selecting experiments that maximize a value-of-information bound achieves near-optimal performance in simulations.
|
|
14:00-14:15, Paper FrB05.3 | Add to My Program |
Information-Seeking Polynomial NARX Model-Predictive Control through Expected Free Energy Minimization |
|
Kouw, Wouter Marco | TU Eindhoven |
Keywords: Information theory and control, Stochastic optimal control, Predictive control for nonlinear systems
Abstract: We propose an adaptive model-predictive controller that balances driving the system to a goal state and seeking system observations that are informative with respect to the parameters of a nonlinear autoregressive exogenous model. The controller's objective function is derived from an expected free energy functional and contains information-theoretic terms expressing uncertainty over model parameters and output predictions. Experiments illustrate how parameter uncertainty affects the control objective and evaluate the proposed controller for a pendulum swing-up task.
|
|
14:15-14:30, Paper FrB05.4 | Add to My Program |
Deceptive Planning for Resource Allocation |
|
Chen, Shenghui | University of Texas at Austin |
Savas, Yagiz | University of Texas at Austin |
Karabag, Mustafa O. | The University of Texas at Austin |
Sadler, Brian | Army Research Laboratory |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Markov processes, Autonomous systems, Information theory and control
Abstract: We consider a team of autonomous agents that navigate in an adversarial environment and aim to achieve a task by allocating their resources over a set of target locations. An adversary in the environment observes the autonomous team's behavior to infer their objective and responds against the team. In this setting, we propose strategies for controlling the density of the autonomous team so that they can deceive the adversary regarding their objective while achieving the desired final resource allocation. We first develop a prediction algorithm based on the principle of maximum entropy to express the team's behavior expected by the adversary. Then, by measuring the deceptiveness via Kullback-Leibler divergence, we devise convex optimization-based planning algorithms that deceive the adversary by either exaggerating the behavior towards a decoy allocation strategy or creating ambiguity regarding the final allocation strategy. A user study with 320 participants demonstrates that the proposed algorithms are effective for deception and reveal the inherent biases of participants towards proximate goals.
|
|
14:30-14:45, Paper FrB05.5 | Add to My Program |
Optimal Ensemble Control of Matter-Wave Splitting in Bose-Einstein Condensates |
|
Paes de Lima, André Luiz | Washington University in St. Louis |
Harter, Andrew | Los Alamos National Laboratory |
Martin, Michael | Los Alamos National Laboratory |
Zlotnik, Anatoly | Los Alamos National Laboratory |
Keywords: Quantum information and control, Computational methods, Optimal control
Abstract: We present a framework for designing optimal optical pulses for the matter-wave splitting of a Bose-Einstein Condensate (BEC) under the influence of experimental inhomogeneities, so that the sample is transferred from an initial rest position into a singular higher diffraction order. To represent the evolution of the population of atoms, the Schrödinger's equation is reinterpreted as a parameterized ensemble of dynamical units that are disparately impacted by the beam light-shift potential in a continuous manner. The derived infinite-dimensional coupled Raman-Nath equations are truncated to a finite system of diffraction levels, and we suppose that the parameter that defines the inhomogeneity in the control applied to the ensemble system is restricted to a compact interval. We first design baseline square pulse sequences for the excitation of BEC beam-splitter states following a previous study, subject to dynamic constraints for either a nominal system assuming no inhomogeneity or for several samples of the uncertain parameter. We then approximate the continuum state-space of the ensemble of dynamics using a spectral approach based on Legendre moments, which is truncated at a finite order. Control functions that steer the BEC system from an equivalent rest position to a desired final excitation are designed using a constrained optimal control approach developed for handling nonlinear dynamics. This representation results in a minimal dimension of the computational problem and is shown to be highly robust to inhomogeneity in comparison to the baseline approach. Our method accomplishes the BEC-splitting state transfer for each subsystem in the ensemble, and is promising for precise excitation in experimental settings where robustness to environmental and intrinsic noise is paramount.
|
|
14:45-15:00, Paper FrB05.6 | Add to My Program |
Robust Optimal Sensor Selection Using Information Theoretic Measures |
|
Kumar, Manjay | Indian Institute of Technology Tirupati |
Ankalugari, Rahul Yadav | Indian Institute of Technology Tirupati |
Magbool Jan, Nabil | Indian Institute of Technology Tirupati |
Keywords: Sensor networks, LMIs, Estimation
Abstract: In this paper, we address the problem of optimal sensor selection to ensure estimability in linear, steady-state processes in case of sensor failures. To this end, we follow the data reconciliation framework to formulate the sensor selection problem using information theoretic measures such as entropy, forward Kullback-Leibler (KL), reverse KL, and symmetric KL divergences. With the help of convex optimization theory, it was shown that all the proposed formulations can be solved to global optimality using a branch and bound method. The process flow network is used to illustrate the efficacy of the proposed formulations.
|
|
FrB06 Regular Session, Queens Quay 1 |
Add to My Program |
Decentralized Control |
|
|
Chair: Pates, Richard | Lund University |
Co-Chair: Huang, Minyi | Carleton University |
|
13:30-13:45, Paper FrB06.1 | Add to My Program |
Exploiting Heterogeneity in the Decentralised Control of Platoons |
|
Pates, Richard | Lund University |
Keywords: Decentralized control, Large-scale systems, Network analysis and control
Abstract: This paper investigates the use of decentralised control architectures with heterogeneous dynamics for improving performance in large-scale systems. Our focus is on two well-known decentralised approaches; the ‘predecessor following’ and ‘bidirectional’ architectures for vehicle platooning. The former, utilising homogeneous control dynamics, is known to face exponential growth in disturbance amplification throughout the platoon, resulting in poor scalability properties. We demonstrate that by incorporating heterogeneous control system dynamics, this limitation disappears entirely, even under bandwidth constraints. Furthermore, we reveal that introducing heterogeneity in the bidirectional architecture allows the platoon’s behaviour to be rendered independent of its length, allowing for highly scalable performance.
|
|
13:45-14:00, Paper FrB06.2 | Add to My Program |
Encrypted Decentralized Model Predictive Control of Nonlinear Processes with Input Delays |
|
Kadakia, Yash Ashit | University of California, Los Angeles |
Alnajdi, Aisha | University of California, Los Angeles |
Abdullah, Fahim | University of California, Los Angeles |
Christofides, Panagiotis D. | Univ. of California at Los Angeles |
Keywords: Decentralized control, Networked control systems, Delay systems
Abstract: This work focuses on enhancing the operational safety, cybersecurity, computational efficiency, and closed-loop performance of large-scale nonlinear processes with input delays. This is achieved by employing a decentralized model predictive controller (MPC) with encrypted networked communication. Within this decentralized setup, the nonlinear process is partitioned into multiple subsystems, each controlled by a distinct Lyapunov-based MPC. These controllers take into account the interactions between subsystems by utilizing full state feedback. To address the performance degradation associated with input delays, we integrate a predictor with each LMPC to compute the states after the input delay period. The LMPC process model is initialized with these predicted states. Furthermore, to enhance cybersecurity, all signals transmitted to and received from each subsystem are encrypted. Guidelines are established to implement this proposed control structure in any nonlinear system with input delays. The simulation results, conducted on a nonlinear chemical process network, illustrate the effective closed-loop performance of the decentralized MPCs alongside the predictor with encrypted communication when dealing with input delays in a large process.
|
|
14:00-14:15, Paper FrB06.3 | Add to My Program |
Learning Decentralized Frequency Controllers for Energy Storage Systems |
|
Sun, Zexin | Boston University |
Yuan, Zhenyi | University of California, San Diego |
Zhao, Changhong | The Chinese University of Hong Kong |
Cortes, Jorge | University of California, San Diego |
Keywords: Power systems, Stability of nonlinear systems, Neural networks
Abstract: This paper designs decentralized controllers for energy storage systems (ESSs) to provide active power control for frequency regulation. We propose a novel safety filter design to gracefully enforce the satisfaction of the limits on the state of charge during transients. Our technical analysis identifies conditions on the proposed design that guarantee the asymptotic stability of the closed-loop system with respect to the desired equilibria. We leverage these results to provide a controller parameterization in terms of a single-hidden-layer neural network that automat- ically satisfies the conditions. We then employ a reinforcement learning approach to train the controller to optimize transient performance in terms of the maximum frequency deviation and the control cost. Simulations in an IEEE 39- bus network validate the significant transient performance improvements of the proposed controller design.
|
|
14:15-14:30, Paper FrB06.4 | Add to My Program |
Mean Field Games on Dense and Sparse Networks: The Graphexon MFG Equations |
|
Caines, Peter E. | McGill University |
Huang, Minyi | Carleton University |
Keywords: Mean field games, Stochastic systems, Decentralized control
Abstract: For sequences of networks embedded in the unit cube [0, 1]^m in {mathbb R}^m (more generally compact sets in Riemannian manifolds), a notion related to that of graphons was introduced in [Caines, CDC 2022] in terms of (weak) measure limits of (sub-) sequences of empirical measures of vertex densities (vertexons) on [0, 1]^m and the associated (weak) measure limits of (sub-) sequences of empirical measures of edge densities (graphexons) on [0, 1]^{2m}, both of which exist regardless of sparsity or density of the limit graphs. This paper presents an extension of the Graphon Mean Field Game (GMFG) theory of [Caines-Huang, SICON, 2021] to the vertexon-graphexon MFG set-up (here denoted GXMFG). In particular, for sparse limit graphexons, an LQG GXMFG example is presented where the influence between agent populations on neighbouring nodes is modeled via a first order PDE.
|
|
14:30-14:45, Paper FrB06.5 | Add to My Program |
A Distributed Buffering Drift-Plus-Penalty Algorithm for Coupling Constrained Optimization |
|
Wang, Dandan | ShanghaiTech University |
Zhu, Daokuan | ShanghaiTech University |
Ou, Zichong | ShanghaiTech University |
Lu, Jie | ShanghaiTech University |
Keywords: Optimization, Decentralized control, Networked control systems
Abstract: This paper focuses on distributed constrained optimization over time-varying directed networks, where all agents cooperate to optimize the sum of their locally accessible objective functions subject to a coupled inequality constraint consisting of all their local constraint functions. To address this problem, we develop a buffering drift-plus-penalty algorithm, referred to as B-DPP. The proposed B-DPP algorithm utilizes the idea of drift-plus-penalty minimization in centralized optimization to control constraint violation and objective error, and adapts it to the distributed setting. It also innovatively incorporates a buffer variable into local virtual queue updates to acquire flexible and desirable tracking of constraint violation. We show that B-DPP achieves O(1/sqrt{t}) rates of convergence to both optimality and feasibility, which outperform the alternative methods in the literature. Moreover, with a proper buffer parameter, B-DPP is capable of reaching feasibility within a finite number of iterations, which is a pioneering result in the area. Simulations on a resource allocation problem over 5G virtualized networks demonstrate the competitive convergence performance and efficiency of B-DPP.
|
|
FrB07 Invited Session, Queens Quay 2 |
Add to My Program |
Modeling and Control of Alternative Powertrains and Mobility Systems |
|
|
Chair: Rajakumar Deshpande, Shreshta | Southwest Research Institute |
Co-Chair: Gupta, Shobhit | General Motors |
Organizer: Gupta, Shobhit | General Motors |
Organizer: Kang, Jun-Mo | General Motors Holdings LLC |
Organizer: Rajakumar Deshpande, Shreshta | Southwest Research Institute |
Organizer: Nazari, Shima | UC Davis |
|
13:30-13:45, Paper FrB07.1 | Add to My Program |
LQTI EGR Rate and Boost Pressure Control of a Diesel Engine Assisted by an EBoost (I) |
|
Gamache, Corey | Michigan State University |
Zhu, Guoming | Michigan State University |
Keywords: Automotive control, Control applications, Optimal control
Abstract: Torque response delay is a major disadvantage for turbocharged engines, especially for large diesel engines, due to turbo-lag. A coordinated control strategy is proposed in this paper for a diesel engine equipped with an electric compressor (eBoost) system to significantly reduce turbo-lag. A multi-input, multi-output Linear Quadratic Tracking with Integral (LQTI) control strategy and scheduling logic is developed for the Ford 6.7L V8 diesel engine equipped with a variable geometry turbocharger (VGT), exhaust gas recirculation (EGR), and added eBoost and bypass valve. Note that the production engine does not have an eBoost and bypass valve. Multiple model-based LQTI controllers were designed at different engine load conditions based on associated linearized models and the control outputs were scheduled using engine load and bypass valve position. The developed control strategy is validated in simulation and experimental studies, and the test results show a reduction of intake manifold pressure response by over 73% compared with the production configuration without a significant impact on NOx emissions.
|
|
13:45-14:00, Paper FrB07.2 | Add to My Program |
Scalable Data Driven Models for Control of Multi-Fuel Compression Ignition Engine (I) |
|
Govind Raju, Sathya Aswath | University of Minnesota - Twin Cities |
Sun, Zongxuan | University of Minnesota |
Kim, Kenneth | DEVCOM Army Research Laboratory |
Kweon, Chol-Bum | DEVCOM Army Research Laboratory |
Keywords: Automotive control, Modeling, Optimization
Abstract: Modeling the combustion characteristics in a multi-fuel compression ignition engine, under varying operating conditions is a challenging problem. Physics-based models can be developed but tend to be quite extensive or limited to certain operating conditions. To achieve reliable combustion under these conditions, the number of actuators required can be high, further increasing the complexity of the model and in turn the difficulty of control design based on it. To simplify the control, feedforward (FF) control is developed by inverting steady state models, built based on data collected at various operating points. Use of data driven models for capturing these steady state characteristics has gained a lot of attraction in the recent years due to the available computational resources and ease of model development. For developing the FF control, data-driven models are inverted by numerically searching for desired control inputs. The time taken for this inversion grows with the complexity of the model and the complexity of the model increases with the number of operating conditions and actuators. In this paper, use of scalable Gaussian process (GP) methods for building computationally efficient models to reduce the time taken for generating FF maps is proposed. The performance of these models and control design is validated using computational fluid dynamics (CFD) and experimental data.
|
|
14:00-14:15, Paper FrB07.3 | Add to My Program |
Vehicle Speed Profile Optimization for Fuel Efficient Eco-Driving Via Koopman Linear Predictor and Model Predictive Control (I) |
|
Nugroho, Sebastian Adi | Cummins Inc |
Chellapandi, Vishnu Pandi | Purdue University |
Borhan, Hoseinali | Cummins Inc |
Keywords: Automotive systems, Emerging control applications, Identification for control
Abstract: Advancements in Vehicle-to-Everything (V2X) technologies have opened new avenues for enhancing fuel efficiency in long-haul trucks through ecological (eco-) driving initiatives. These initiatives are commonly executed via a Model Predictive Control (MPC) framework, relying on lookahead information like road grade and speed limits. However, the performance of this framework relies on a precise model of the vehicle’s longitudinal dynamics, which can be challenging due to the inherent nonlinearities in the vehicle’s behavior. Nonlinear MPC (NLMPC) is often impractical for real-time, embedded implementations of eco-driving programs. To address this challenge, we employ the principles of Koopman operator theory and Extended Dynamic Mode Decomposition (EDMD) to construct a linear dynamical system in an augmented state space. This linear model, known as the Koopman Linear Predictor (KLP), approximates the vehicle’s longitudinal dynamics, providing a valuable tool for designing optimal speed profiles and trajectories that minimize fuel consumption. Numerical simulation results show the computational advantages of the proposed Koopman MPC (KMPC) framework over NLMPC. Moreover, this approach proves to be particularly effective in executing eco-driving programs over long routes. Keywords—Eco-driving, Model Predictive Control, Koopman operator, Extended Dynamic Mode Decomposition.
|
|
14:15-14:30, Paper FrB07.4 | Add to My Program |
LQ Control of Traffic Flow Models Via Variable Speed Limits (I) |
|
Block, Brian | The Ohio State University |
Stockar, Stephanie | The Ohio State University |
Keywords: Traffic control, Distributed control, Optimal control
Abstract: In this paper, an extension of a linear control design for hyperbolic linear partial differential equations is presented for a first-order traffic flow model. Starting from the Lighthill-Whitham-Richards (LWR) model, variable speed limit control (VSL) is applied through a modification of Greenshield's equilibrium flow model. Then, an optimal linear quadratic (LQ) controller is designed on the linear LWR model. The LQ state feedback function is found via the solution of a Riccati differential equation. Unlike previous studies, the control input is the rate of change of the input, not the input itself. The proposed controller is then verified on both the linear and nonlinear models. In both cases, the controller is able to drive the system to a desired density profile. In the nonlinear application, a higher control gain is needed to achieve similar results as in the linear case.
|
|
14:30-14:45, Paper FrB07.5 | Add to My Program |
Model Predictive Control of Diesel Engine Emissions Based on Neural Network Modeling |
|
Zhang, Jiadi | University of Michigan |
Li, Xiao | University of Michigan, Ann Arbor |
Kolmanovsky, Ilya V. | The University of Michigan |
Tsutsumi, Munechika | Hino Motors, Ltd |
Nakada, Hayato | Hino Motors, Ltd |
Keywords: Predictive control for nonlinear systems, Neural networks, Nonlinear systems identification
Abstract: This paper addresses the control of diesel engine nitrogen oxides (NOx) and Soot emissions through the application of Model Predictive Control (MPC). The developments described in the paper are based on a high-fidelity model of the engine airpath and torque response in GT-Power, which is extended with a feedforward neural network (FNN)-based model of engine out (feedgas) emissions identified from experimental engine data to enable the controller co-simulation and performance verification. A Recurrent Neural Network (RNN) is then identified for use as a prediction model in the implementation of a nonlinear economic MPC that adjusts intake manifold pressure and EGR rate set-points to the inner loop airpath controller as well as the engine fueling rate. Based on GT-Power engine model and FNN emissions model, the closed-loop simulations of the control system and the plant model, over different driving cycles, demonstrate the capability to shape engine out emissions response by adjusting weights and constraints in economic MPC formulation.
|
|
14:45-15:00, Paper FrB07.6 | Add to My Program |
Nexus Cognizant Pricing of Workplace Electric Vehicle Charging |
|
Mou, Minghao | Purdue University |
Qian, Sean | Carnegie Mellon University |
Qin, Junjie | Purdue University |
Keywords: Transportation networks, Smart grid
Abstract: This paper studies the problem of designing workplace electric vehicle (EV) charging tariffs (i.e., fee schedules) while considering their impact to the transportation-electricity nexus. In particular, we consider the morning commute problem where a collection of commuters who drive EV to work must go through a common traffic bottleneck. Individual commuters determine when to leave for work and whether to charge their EV at work by optimizing a payoff function accounting for their generalized travel cost and payoff from charging. As an arrival time dependent charging tariff can directly impact the commuter decisions at the user equilibrium, we tackle the problem of designing tariffs that optimize (a) only the transportation component of the social cost, (b) only the electricity component of the social cost, and (c) the total social cost for the coupled transportation and electricity system. Tariffs incentivizing user equilibria that achieve the same performance as centralized social cost minimization are derived for the first two settings. For the last setting, we establish a tight condition under which it is possible to decentralize social optimal decisions via tariffs, and design optimal and suboptimal tariffs when the condition holds and fails, respectively.
|
|
FrB08 Regular Session, Bay |
Add to My Program |
Control Applications I |
|
|
Chair: Xu, Zhe | Arizona State University |
Co-Chair: Beijen, Michiel | Demcon |
|
13:30-13:45, Paper FrB08.1 | Add to My Program |
Performance Analysis of Moving Average Filter Using Allan Variance |
|
Maddipatla, Srivenkata Satya Prasad | Pennsylvania State University |
Brennan, Sean | The Pennsylvania State University |
Keywords: Control applications, Optimization algorithms, Linear systems
Abstract: This work presents the use of the area of Allan VARiance (AVAR) as an alternate measure for Mean Squared Error (MSE) to select an optimal Moving Average (MA) filter that minimizes MSE between noisy and filtered signals. MSE is a standard performance index that quantifies the performance of MA filters. However, for signals with non-white noise characteristics - a category that includes nearly all real-world signals - the calculation of MSE is not quickly done with one but typically requires multiple experiments. This work shows that the area of AVAR estimates noise properties from one iteration of measured data and achieves the same optimization results. While AVAR methods are typically used to analyze the variance of static window averages of data, prior recent work extends this to include moving average calculations. In this work, these results are extended further to illustrate that the time-correlation window in the area of AVAR calculations relates to the window size used in the MA filter. This relationship is then utilized to show that the discrete integration of the AVAR curve yields a performance index that quickly identifies the MSE-optimal filter for input with drift (random walk) corrupted by white noise. AVAR is compared against the MSE to show that both the performance indices give similar results when choosing the optimal MA filter, but with only one iteration of AVAR calculations versus significant iterations (hundreds or more) for MSE calculations.
|
|
13:45-14:00, Paper FrB08.2 | Add to My Program |
Distributed Differentially Private Control Synthesis for Multi-Agent Systems with Metric Temporal Logic Specifications |
|
Baharisangari, Nasim | Arizona State University |
Saravanane, Narendhiran | Arizona State University |
Xu, Zhe | Arizona State University |
Keywords: Formal verification/synthesis, Control applications, Agents-based systems
Abstract: We propose a distributed differentially private receding horizon control (RHC) approach for multi-agent systems (MAS) with metric temporal logic (MTL) specifications. In the MAS considered in this paper, each agent privatizes its sensitive information from other agents using a differential privacy mechanism. In other words, each agent adds privacy noise (e.g., Gaussian noise) to its output to maintain its privacy. We define two types of MTL specifications for the MAS: agent-level specifications and system-level specifications. Agents should collaborate to satisfy the system-level MTL specifications while each agent must satisfy its own agent-level MTL specifications at the same time. In the proposed distributed RHC approach, each agent communicates with its neighboring agents to acquire their estimate of the system-level trajectory and updates its estimate of the system-level trajectory. Then, each agent synthesizes its own control inputs such that the system-level specifications are satisfied with a probabilistic guarantee while the agent-level specifications are also satisfied with a deterministic guarantee. In the proposed optimization formulation of RHC, we directly incorporate Kalman filter equations to calculate the system-level trajectory estimates. We use mixed-integer linear programming (MILP) to encode the MTL specifications as optimization constraints. Finally, we implement the proposed distributed RHC approach in two scenarios.
|
|
14:00-14:15, Paper FrB08.3 | Add to My Program |
Hybrid Control of a Variable-Speed Peristaltic Pump |
|
Beijen, Michiel | Demcon |
Tijman op Smeijers, Thijs | University of Twente |
Boerrigter, Gijs | Demcon Hightech Systems B.V |
van den Eijnden, Sebastiaan | Eindhoven University of Technology |
Keywords: Control applications, Hybrid systems, Mechatronics
Abstract: Peristaltic pumps are used for transporting liquids within disposable tubes, and are commonly found in medical devices. The peristaltic pump principle, however, introduces disturbances, thereby distorting the desired rotational speed of the pump. Proportional plus double integral (PI2) control is commonly used to reject these disturbances, but at the cost of deteriorated transient response and robustness margins. To balance these trade-offs in a more desirable manner, in this paper we propose a hybrid PI2 control strategy that allows for reducing the steady-state error while maintaining robustness margins similar to linear PI2 control. Experiments on a representative setup demonstrate up to 45% improvement in disturbance rejection capabilities.
|
|
14:15-14:30, Paper FrB08.4 | Add to My Program |
Optimal Control of Material Micro-Structures |
|
Sharma, Aayushman | Texas A&M University |
Mao, Zirui | Texas A&M University |
Yang, Haiying | Texas A&M University |
Chakravorty, Suman | Texas A&M University |
Demkowicz, Michael | Texas A&M University |
Kalathil, Dileep | Texas A&M University (TAMU) |
Keywords: Control applications, Materials processing, Optimal control
Abstract: In this paper, we consider the optimal control of material micro-structures. Such material micro-structures are modeled by the so-called phase field model. We study the underlying physical structure of the model and propose a data based approach for its optimal control, along with a comparison to the control using a state of the art Reinforcement Learning (RL) algorithm. Simulation results show the feasibility of optimally controlling such micro-structures to attain desired material properties and complex target micro-structures.
|
|
14:30-14:45, Paper FrB08.5 | Add to My Program |
An Efficiency Scanning Strategy Based on Online Smoothing Variable-Speed for AFM with a Rotating Stage |
|
Chen, Huang-Chih | National Taiwan University |
Peng, Sheng-Wei | National Taiwan University |
Chou, Ting-An | National Taiwan University |
Fu, Li-Chen | National Taiwan University |
Keywords: Control applications, Mechatronics, MEMs and Nano systems
Abstract: Atomic force microscopy (AFM) has found wide application in various fields, including nanotechnology, nano manipulation, and bioscience. Nevertheless, traditional raster or non-raster trajectories do not allow for speed variations in specific regions but are predetermined, resulting in an efficiency shortfall. Addressing this limitation, this paper introduces a novel scanning strategy with online detection of critical regions during the backward scan. This allows for self-adjustment of scanning speed during the forward scan, ensuring the continuity of acceleration throughout the scanning process as well. The proposed online smoothing variable-speed (OSVS) method let the AFM meticulously scan recognized critical regions at a relatively low speed while swiftly traversing uninteresting areas at a much higher speed. This approach reduces scanning time while maintaining imaging performance. In experiments, the developed method efficiently scans a grating sample with higher sidewalls using an AFM equipped with a sample rotating stage, resulting in high-precision scan results.
|
|
14:45-15:00, Paper FrB08.6 | Add to My Program |
Safe Extremum Seeking Applications in Particle Accelerators |
|
Williams, Alan | UCSD |
Scheinker, Alexander | Los Alamos National Lab |
Huang, En-Chuan | Los Alamos National Laboratory |
Taylor, Charles | Los Alamos National Laboratory |
Krstic, Miroslav | University of California, San Diego |
Keywords: Control applications, Adaptive control, Optimization
Abstract: Particle accelerators, complex machines crucial for various scientific endeavors, require regular tuning due to time-varying beams and components. Extremum seeking control proves to be an ideal strategy for this tuning process. Fine-tuning the beam involves modifying electric and magnetic fields within the beampipe to alter the shape or trajectory of the particle bunch. Yet, safety remains paramount, considering the substantial costs associated with particle collisions with components resulting in damage. Like the cost function, the safety of the system with respect to the tuning parameters is analytically unknown. In this study, we showcase the efficacy of our Safe Extremum Seeking (Safe ES) algorithm in particle accelerator applications. Our initial demonstration involves employing the Kapchinsky Vladimirsky (KV) equations to model a beam dominated by so called ``space-charge'' forces. We formulate a beam loss model and conduct a simulation illustrating the capability of Safe ES on the KV equations to tune the beam spot size while ensuring that beam loss remains below a specified threshold. In a second example, we present data obtained from an experimental implementation of Safe ES on the ion beam at the Los Alamos Neutron Science Center.
|
|
FrB09 Invited Session, Dockside 1 |
Add to My Program |
Recent Advancements in Data-Driven Decision-Making and Control |
|
|
Chair: Drgona, Jan | Pacific Northwest National Laboratory |
Co-Chair: Masti, Daniele | IMT School for Advanced Studies Lucca |
Organizer: Masti, Daniele | Gran Sasso Science Institute |
Organizer: Fabiani, Filippo | IMT School for Advanced Studies Lucca |
Organizer: Breschi, Valentina | Eindhoven University of Technology |
Organizer: Drgona, Jan | Pacific Northwest National Laboratory |
|
13:30-13:45, Paper FrB09.1 | Add to My Program |
A Data-Driven Formulation of the Maximal Admissible Set and the Data-Enabled Reference Governor (I) |
|
Ossareh, Hamid | University of Vermont |
Keywords: Constrained control, Linear systems, Predictive control for linear systems
Abstract: The maximal admissible set (MAS) of a stable LTI system characterizes the set of all initial conditions and constant inputs for which the output satisfies pre-specified state/output constraints for all time. The MAS (or its finitely-determined, polytopic approximations) is often employed in set-theoretic methods in control and for constraint management, for example in the Reference Governor (RG) algorithm. The existing MAS (and consequently RG) formulations require a state-space model of the dynamics to characterize the MAS. In this paper, we offer an alternative, data-driven perspective: we leverage output predictors from the behavioral system theory and subspace predictive control literature to formulate a data-driven version of the MAS. As we show, the proposed set is polytopic and has finite complexity, similar to its model-based counterpart, but resides in a higher dimensional space and may have higher complexity. We present the properties of the data-driven MAS including its admissibility index, and compare the data-driven MAS against its model-based formulation, where we show that the two sets are related via a linear map under mild assumptions. Finally, we use the data-driven MAS to introduce a data-enabled RG for constraint management of closed-loop control systems. Numerical simulations are presented to illustrate the results.
|
|
13:45-14:00, Paper FrB09.2 | Add to My Program |
Data-Driven System Interconnections and a Novel Data-Enabled Internal Model Control (I) |
|
Pedari, Yasaman | University of Vermont |
Lee, Jaeho | Daegu Gyeongbuk Institute of Science and Technology |
Eun, Yongsoon | DGIST |
Ossareh, Hamid | University of Vermont |
Keywords: Linear systems, Output regulation, Subspace methods
Abstract: Over the past two decades, there has been a growing interest in control systems research to transition from model-based methods to data-driven approaches. In this study, we aim to bridge a divide between conventional model-based control and emerging data-driven paradigms grounded in Willems' ``fundamental lemma". Specifically, we study how input/output data from two separate systems can be manipulated to represent the behavior of interconnected systems, either connected in series or through feedback. Using these results, this paper introduces the Internal Behavior Control (IBC), a new control strategy based on the well-known Internal Model Control (IMC) but viewed under the lens of Behavioral System Theory. Similar to IMC, the IBC is easy to tune and results in perfect tracking and disturbance rejection but, unlike IMC, does not require a parametric model of the dynamics. We present two approaches for IBC implementation: a component-by-component one and a unified one. We compare the two approaches in terms of filter design, computations, and memory requirements.
|
|
14:00-14:15, Paper FrB09.3 | Add to My Program |
A Parametric Bayesian Optimization Framework for Batch Dynamical Systems (I) |
|
Thompson, Jaron | University of Wisconsin-Madison |
MacKinnon, Lloyd | University of Wisconsin-Madison |
Venturelli, Ophelia | University of Wisconsin-Madison |
Zavala, Victor M. | University of Wisconsin-Madison |
Keywords: Computational methods, Numerical algorithms, Machine learning
Abstract: We present a Bayesian Optimization (BO) framework for optimizing the performance of batch dynamical systems. A key distinctive aspect of this framework is that it uses a parametric machine learning model (a recurrent neural network - RNN) to learn the system dynamics directly from data. The use of a parametric model provides more flexibility to capture complex dynamics and to propose batches of experiments, compared to traditional BO frameworks based on non-parametric Gaussian process (GP) models. However, the use of parametric models introduces challenges in deriving and computing an information measure that can be embedded in the BO acquisition function. The proposed framework uses the expected information gain (EIG) as information measure; we argue that this enables more scalable computations compared to the use of the Fisher Information (FI) measure used in classical design of experiments. We provide a bioreactor case study to illustrate the behavior and benefits of the proposed framework.
|
|
14:15-14:30, Paper FrB09.4 | Add to My Program |
Line-Of-Sight Visual Target Tracking Via Particle-Based Belief Propagation (I) |
|
Lin, Tony | Georgia Institute of Technology |
Gagvani, Manav | Naval Research Laboratory |
Lindstrom, Sean | Naval Research Laboratory |
Sofge, Don | Naval Research Laboratory |
Zhang, Fumin | Georgia Institute of Technology |
Keywords: Autonomous robots
Abstract: This paper considers the problem of controlling a team of camera-equipped robots to ensure a mobile human target is observed by at least one robot at all times. We focus on determining team trajectories over a fixed time horizon such that the human target is in at least one robot's field of view even while the line of sight to the target can be obstructed by obstacles. Our approach to solving this problem lies in using a particle-based Belief Propagation method to estimate the most likely poses for each robot over time such that the visual tracking requirement is satisfied. Our approach is validated in simulation studies and an experimental trial where a human target must be tracked by a pair of miniature autonomous robot blimps.
|
|
14:30-14:45, Paper FrB09.5 | Add to My Program |
Pi-ORFit: One-Pass Learning with Bregman Projection (I) |
|
Cho, Namhoon | Cranfield University |
Min, Youngjae | MIT |
Shin, Hyo-Sang | Cranfield University |
Azizan, Navid | MIT |
Keywords: Optimization algorithms, Machine learning, Learning
Abstract: This paper delves into the challenging problem of one-pass learning, where the objective is to learn each streamed datapoint without revisiting past data while not forgetting them. A prominent prior approach in this context for overparameterized models is ORFit (short for Orthogonal Recursive Fitting), which maintains predictions on previous datapoints by enforcing the orthogonality of parameter updates with respect to past output gradients. For overparameterized linear models, ORFit identifies the parameter that perfectly fits the data and has the minimum ell^2-norm, among the infinitely many such parameters. To generalize this and gain control over the selection of desired parameters, in this paper, we introduce Projected Orthogonal Recursive Fitting (Pi-ORFit). We begin by characterizing all parameters that can precisely fit data in general vector-output linear models, employing a formalism based on nullspace projector matrices. This framework yields an alternative derivation of ORFit. We further extend ORFit to learn a desired parameter by incorporating Bregman projection into the update rule. Importantly, we show that the resulting parameter minimizes the potential function that defines the Bregman projection at each update step. This property enables the selection of a desired parameter among multiple candidates consistent with the data. We provide numerical experiments that not only validate our analytical findings but also underscore the practical significance of this generalized approach.
|
|
14:45-15:00, Paper FrB09.6 | Add to My Program |
Active Perception Using Neural Radiance Fields (I) |
|
He, Siming | University of Pennsylvania |
Hsu, Christopher | University of Pennsylvania |
Ong, Dexter | University of Pennsylvania |
Shao, Yifei | University of Pennsylvania |
Chaudhari, Pratik | University of California, Los Angeles |
Keywords: Vision-based control, Learning, Autonomous robots
Abstract: We study active perception from first principles to argue that an autonomous agent performing active perception should maximize the mutual information that past observations posses about future ones. Doing so requires (a) a representation of the scene that summarizes past observations and the ability to update this representation to incorporate new observations (state estimation and mapping), (b) the ability to synthesize new observations of the scene (a generative model), and (c) the ability to select control trajectories that maximize predictive information (planning). This motivates a neural radiance field (NeRF)-like representation which captures photometric, geometric and semantic properties of the scene grounded. This representation is well-suited to synthesizing new observations from different viewpoints. And thereby, a sampling-based planner can be used to calculate the predictive information from synthetic observations along dynamically-feasible trajectories. We use active perception for exploring cluttered indoor environments and employ a notion of semantic uncertainty to check for the successful completion of an exploration task. We demonstrate these ideas via simulation in realistic 3D indoor environments.
|
|
FrB10 Regular Session, Dockside 2 |
Add to My Program |
Adaptive Systems |
|
|
Chair: Dogan, Kadriye | Embry-Riddle Aeronautical University |
Co-Chair: Anubi, Olugbenga Moses | Florida State University |
|
13:30-13:45, Paper FrB10.1 | Add to My Program |
Fractional-Order Integral Neural-Adaptive Control of Nonlinear Input-Affine Systems |
|
Doctolero, Samuel | University of Calgary |
Westwick, David | Schulich School of Engineering, University of Calgary |
Keywords: Adaptive systems, Robotics, Intelligent systems
Abstract: Long decaying memory is a trademark of fractional calculus operations. These can be incorporated in the feedback and training laws of neural-adaptive controllers; the adaptive laws for feedforward and transform matrix artificial neural networks (ANNs) inherit historical errors. Thus, requiring an analysis of such a scheme on different control problems over prolonged executions; this enables the ability to observe the interactions between ANNs (feedforward and transform matrices) and fractional-order integral (FOI), as both are adaptive memory functions. Moreover, Lyapunov stability methods paved the way to incorporate FOI in feedback and adaptive laws for nonlinear input-affine dynamical systems. A planar 2-degree-of-freedom serial manipulator executes two control problems: task-space trajectory tracking and hybrid force-position control, in separate simulations. The proposed FOI-based method provides significantly better results than a non-FOI baseline method while remaining stable over prolonged cycles.
|
|
13:45-14:00, Paper FrB10.2 | Add to My Program |
Passive Stability and Adaptive Control of Teleoperated System Using Wave Variables and Predictor Techniques |
|
Rajarajan, Naveen Kumar | Florida State University |
Mudhangulla, Sridhar | Florida State University |
Anubi, Olugbenga Moses | Florida State University |
Keywords: Adaptive systems, Time-varying systems, Simulation
Abstract: This paper addresses the challenge of achieving stable This paper addresses the challenge of achieving stable adaptive teleoperation and improving the convergence rate in the presence of high communication time delays. We employ a passivity-based formalism to establish stability using wave variables and wave scattering techniques, and we enhance the convergence rate by combining it with predictor-based approaches. The elevated time delay within the teleoperated communication layer is known to induce an oscillatory behavior, which reduces the convergence rate and increases the settling time in the convergence of power variables. This issue is addressed in this paper by utilizing a Smith predictor on the operator end and Minimum Jerk (MJ) predictors on the remote end. We present experimental and simulation results to demonstrate the improvements, ensuring stable teleoperation under high communication time delays.
|
|
14:00-14:15, Paper FrB10.3 | Add to My Program |
Adaptive Control Allocation for Uncertain Systems with Unknown Effector Degradation |
|
Sarioglu, N. Eren | Embry-Riddle Aeronautical University |
Dogan, Kadriye | Embry-Riddle Aeronautical University |
Keywords: Adaptive systems, Uncertain systems, Direct adaptive control
Abstract: Unknown effector degradation and model uncertainties risk weakening the performance of any system. Model reference adaptive control and adaptive control allocation methods are effective solutions for over-actuated uncertain vehicles to overcome these phenomena because of their ability to estimate unknown effects. Thus, this work proposes a joint structure of adaptive control allocation and model reference adaptive control solutions for compensating the effects of unknown effector degradation and model uncertainties on attitude performance, respectfully. Specifically, Lyapunov stability analysis is provided to prove closed-loop system stability, and simulation results are presented on a multi-rotor to show that the proposed adaptive method improves command tracking performance on attitude dynamics in the presence of unknown effector degradation and uncertain center of gravity location.
|
|
14:15-14:30, Paper FrB10.4 | Add to My Program |
Adaptive Kalman Filtering Developed from Recursive Least Squares Forgetting Algorithms |
|
Lai, Brian | University of Michigan, Ann Arbor |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Kalman filtering, Adaptive systems, Identification
Abstract: Recursive least squares (RLS) is derived as the recursive minimizer of the least-squares cost function. Moreover, it is well known that RLS is a special case of the Kalman filter. This work presents the Kalman filter least squares (KFLS) cost function, whose recursive minimizer gives the Kalman filter. KFLS is an extension of generalized forgetting recursive least squares (GF-RLS), a general framework which contains various extensions of RLS from the literature as special cases. This then implies that extensions of RLS are also special cases of the Kalman filter. Motivated by this connection, we propose an algorithm that combines extensions of RLS with the Kalman filter, resulting in a new class of adaptive Kalman filters. A numerical example shows that one such adaptive Kalman filter provides improved state estimation for a mass-spring-damper with intermittent, unmodeled collisions. This example suggests that such adaptive Kalman filtering may provide potential benefits for systems with non-classical disturbances.
|
|
14:30-14:45, Paper FrB10.5 | Add to My Program |
DATrack: MCMOT Based on Feature Decoupling and Adaptive Motion Association |
|
Cheng, Ao | Wuhan University of Technology |
Wang, Qiang | Wuhan University of Technology |
Liu, Feiyang | Wuhan University of Technology |
Li, Xinyv | Wuhan University of Technology |
Keywords: Neural networks, Kalman filtering
Abstract: Multi-class multi-object tracking (MCMOT) is crucial for risk perception in autonomous vehicles. However, the complex environment and intense camera movement exacerbate false detections and trajectory interruptions. Therefore, an MCMOT algorithm based on feature decoupling for detection and adaptive motion association for online tracking, named DATrack, is proposed. Firstly, we introduce TSCODE to decouple the learned representation into classification-specific and localization-specific features to alleviate the contradiction between the two branches in YOLOX, enhancing the multi-class object detection accuracy. Additionally, an adaptive motion prediction (AMP) module is proposed to enhance the accuracy of trajectory state estimation in ByteTrack from two aspects: (1) adaptively adjusting the process and observation noise in the Kalman filter according to the matching cost and object detection confidence; (2) estimating and mitigating the impact of camera motion through the positional deviation of the initial matching results. The experimental results on the BDD100K MOT validation dataset demonstrate that, compared with other state-of-the-art methods, our approach achieves higher tracking accuracy (MOTA 58.6%, IDF1 63.5%) while maintaining real-time performance (27.6 FPS on an NVIDIA RTX 2080Ti).
|
|
14:45-15:00, Paper FrB10.6 | Add to My Program |
ArUco Based Reference Shaping for Real-Time Precision Motion Control for Suspended Payloads |
|
Stein, Adrian | University at Buffalo |
Vexler, David | Williamsville East High School |
Singh, Tarunraj | State Univ. of New York at Buffalo |
Keywords: Optimization, Adaptive systems, Vision-based control
Abstract: This work presents a real-time time-delay filtering approach for reference shaping for high precision motion control of vibratory systems. The motion of the system is initiated with a judicious (arbitrary) step command and the acquired motion data is used to estimate the modal parameters in real-time. The modal data is subsequently used to synthesize the subsequent step commands to mitigate the residual vibrations. The proposed control algorithm is tested on a gantry crane structure with a suspended payload. Our method estimates the system parameters based on computer vision while tracking a ArUco fiducial marker which is integral with the payload. Computational efficiency is ensured by using C++ to deploy the algorithm. The goal is to minimize the residual energy at the terminal displacement for rest-to-rest maneuvers of a suspended payload with unknown dynamics. An inertial measurement unit is used to track angular velocity at the end of the maneuver and is not used in the model identification process.
|
|
FrB11 Invited Session, Dockside 3 |
Add to My Program |
Spreading Processes in Complex Networks: Analysis, Control and
Observability |
|
|
Chair: Pare, Philip E. | Purdue University |
Co-Chair: Uribe, Cesar A. | Rice University |
Organizer: Gracy, Sebin | South Dakota School of Mines and Technology |
Organizer: Uribe, Cesar A. | Rice University |
Organizer: Pare, Philip E. | Purdue University |
Organizer: Sontag, Eduardo | Northeastern University |
|
13:30-13:45, Paper FrB11.1 | Add to My Program |
Data-Driven Design of Complex Network Structures to Promote Synchronization (I) |
|
Coraggio, Marco | Scuola Superiore Meridionale |
di Bernardo, Mario | University of Naples Federico II |
Keywords: Network analysis and control, Optimization
Abstract: We consider the problem of optimizing the interconnection graphs of complex networks to promote synchronization. When traditional optimization methods are inapplicable, due to uncertain or unknown node dynamics, we propose a data-driven approach leveraging datasets of relevant examples. We analyze two case studies, with linear and nonlinear node dynamics. First, we show how including node dynamics in the objective function makes the optimal graphs heterogeneous. Then, we compare various design strategies, finding the best either use data samples close to a specific Pareto front or combine a neural network and a genetic algorithm, performing statistically better than the best examples in the datasets.
|
|
13:45-14:00, Paper FrB11.2 | Add to My Program |
Predator-Swarm-Guide Dynamics: A Hybrid Approach to Crowd Modeling and Guidance in Mass Shooting Scenarios (I) |
|
Darabi, Atefe | Northeastern University |
Montazeri Hedesh, Hamidreza | Northeastern University |
Siami, Milad | Northeastern University |
Sznaier, Mario | Northeastern University |
Keywords: Network analysis and control, Cooperative control, Agents-based systems
Abstract: This paper introduces the ``Predator-Swarm-Guide" (PSG) model, a hybrid approach for modeling crowd dynamics by considering pairwise repulsive and attractive interactions among individuals. Extending the predator-swarm model, PSG specifically addresses the behavior of individuals during a shooting event within a zoned environment. It accounts for individuals' simultaneous efforts to evade the shooter while seeking guidance from a trusted agent. The guiding agent's movements during evacuation are influenced by two factors: its orientation towards the safe zone, where individuals are protected from the shooter, and the shooter's location. The PSG model incorporates crucial environmental factors, including impermeable walls, psychological elements leading to significant social friction, and a termination procedure to track casualties. Outputs of the PSG model underscore the significance of coordinated cooperation between individuals and the guiding agent in minimizing casualties during an active shooting scenario. Therefore, the objective is to reduce casualties through a hybrid motion optimization approach for both individuals and the guiding agent. Additionally, an equilibrium analysis, based on the continuum-limit version of the PSG model, is conducted to predict the crowd's equilibrium configuration in specific scenarios.
|
|
14:00-14:15, Paper FrB11.3 | Add to My Program |
Competitive Networked Bivirus SIS Spread Over Hypergraphs (I) |
|
Gracy, Sebin | South Dakota School of Mines and Technology |
Anderson, Brian D.O. | Australian National University |
Ye, Mengbin | Centre for Optimisation and Decision Science, Curtin University |
Uribe, Cesar A. | Rice University |
Keywords: Control of networks, Biological systems, Networked control systems
Abstract: The paper deals with the spread of two competing viruses over a network of population nodes, accounting for pairwise interactions and higher-order interactions (HOI) within and between the population nodes. We study the competitive networked bivirus susceptible-infected-susceptible (SIS) model on a hypergraph introduced in Cui et al. We show that the system has, in a generic sense, a finite number of equilibria, and the Jacobian associated with each equilibrium point is nonsingular; the key tool is the Parametric Transversality Theorem of differential topology. Since the system is also monotone, it turns out that the typical behavior of the system is convergence to some equilibrium point. Thereafter, we exhibit a tri-stable domain with three locally exponentially stable equilibria. For different parameter regimes, we establish conditions for the existence of a coexistence equilibrium (both viruses infect separate fractions of each population node).
|
|
14:15-14:30, Paper FrB11.4 | Add to My Program |
A Lyapunov Approach to Stochastic Interaction Dynamics Over Large-Scale Networks (I) |
|
Como, Giacomo | Politecnico Di Torino |
Fagnani, Fabio | Politecnico Di Torino |
Zampieri, Sandro | Univ. Di Padova |
Keywords: Network analysis and control, Large-scale systems, Markov processes
Abstract: We study stochastic interaction network models whereby a finite population of agents, identified with the nodes of a graph, update their states in response to pairwise interactions with their neighbors as well as spontaneous mutations. These include the main epidemic models, such as the Susceptible-Infected-Susceptible, the Susceptible-Infected-Recovered, and the Susceptible-Infected-Recovered-Susceptible models. We analyze the asymptotic behavior of such systems on Erdos-Renyi random graphs, in the limit as the population size grows large. Our approach is based on the use of (approximate) Lyapunov functions for Markov chains through which we can obtain stability results in terms of the corresponding invariant probabilities and on specific concentration results for Erdos-Renyi random graphs.
|
|
14:30-14:45, Paper FrB11.5 | Add to My Program |
Differentially Private Computation of Basic Reproduction Numbers in Networked Epidemic Models (I) |
|
Chen, Bo | University of Florida |
She, Baike | Georgia Institute of Technology |
Hawkins, Calvin | University of Florida |
Benvenuti, Alexander | Georgia Institute of Technology |
Fallin, Brandon | University of Florida |
Pare, Philip E. | Purdue University |
Hale, Matthew | University of Florida |
Keywords: Network analysis and control, Emerging control applications
Abstract: The basic reproduction number of a networked epidemic model, denoted R0, can be computed from a network’s topology to quantify epidemic spread. However, disclosure of R0 risks revealing sensitive information about the underlying network, such as an individual’s relationships within a social network. Therefore, we propose a framework to compute and release R0 in a differentially private way. First, we provide a new result that shows how R0 can be used to bound the level of penetration of an epidemic within a single community as a motivation for the need of privacy, which may also be of independent interest. We next develop a privacy mechanism to formally safeguard the edge weights in the underlying network when computing R0. Then we formalize tradeoffs between the level of privacy and the accuracy of values of the privatized R0. To show the utility of the private R0 in practice, we use it to bound this level of penetration under privacy, and concentration bounds on these analyses show they remain accurate with privacy implemented. We apply our results to real travel data gathered during the spread of COVID-19, and we show that, under real-world conditions, we can compute R0 in a differentially private way while incurring errors as low as 7.6% on average.
|
|
14:45-15:00, Paper FrB11.6 | Add to My Program |
Active Risk Aversion in SIS Epidemics on Networks (I) |
|
Bizyaeva, Anastasia | University of Washington Seattle |
Ordorica Arango, Marcela | Princeton University |
Zhou, Yunxiu | Princeton University |
Levin, Simon | Princeton University |
Leonard, Naomi Ehrich | Princeton University |
Keywords: Networked control systems, Agents-based systems
Abstract: We present and analyze an actively controlled SIS (actSIS) model of interconnected populations to study how risk aversion strategies affect network epidemics. A population using a risk aversion strategy reduces its contact rate with other populations when it perceives an increase in infection risk. The network actSIS model relies on two distinct networks. One is a physical network that defines which populations come into contact with which others, thus how infection spreads. The other is a communication network, such as an online social network, that defines which populations observe the infection level of which others, thus how information spreads. We prove that the system exhibits a transcritical bifurcation where an endemic equilibrium (EE) emerges. For regular graphs, we prove that the endemic infection level is uniform across populations and reduced by the risk aversion strategy, relative to the network SIS endemic level. We show that when communication is sufficiently sparse, this initially stable EE loses stability in a secondary bifurcation. Simulations show that a new stable solution emerges with nonuniform infection levels.
|
|
FrB12 Regular Session, Dockside 9 |
Add to My Program |
Chemical Process Control |
|
|
Chair: Singh, Ravendra | Rutgers |
Co-Chair: Shardt, Yuri | TU Ilmenau |
|
13:30-13:45, Paper FrB12.1 | Add to My Program |
Data-Driven Modeling and Control of Semicontinuous Distillation Process |
|
Aenugula, Sakthi Prasanth | McMaster University |
Chandrasekar, Aswin | McMaster University |
Mhaskar, Prashant | McMaster University |
Adams, Thomas | McMaster University |
Keywords: Chemical process control, Optimization, Modeling
Abstract: A semicontinuous distillation process is effectively used in the separation of a multi-component mixture with low to medium production rates. This work focuses on building a data-driven model predictive control (MPC) framework to optimize the performance of a semicontinuous process by reducing total annualized cost (TAC) per tonne of feed processed while meeting the specified product quality. A data-driven modeling technique is considered in this work because of the unavailability of a highly complex and accurate first-principle model. An Aspen Plus Dynamics simulation is used as a test bed to collect the data from the process. A multi-model framework developed by modifying the traditional subspace algorithm is adapted in the shrinking horizon MPC (SHMPC) scheme to minimize TAC per tonne of feed processed. Visual Basic for Application (VBA) is used as a third tool to communicate the inputs from MPC developed in MATLAB to the process in Aspen Plus Dynamics. The simulation results illustrate that the MPC reduced the TAC/tonne of feed by 11.4% compared to the existing PI control configuration.
|
|
13:45-14:00, Paper FrB12.2 | Add to My Program |
Enhancing Protein Crystal Purity through Adaptive Kinetic Monte Carlo Modeling and Control of Surface Morphology |
|
Nagpal, Satchit | Texas A&M University |
Kwon, Joseph | Texas A&M University |
Keywords: Chemical process control, Process Control, Stochastic systems
Abstract: The escalating demand for producing highly purified proteins, free from contaminants, is paramount in the realm of preparative chromatography. To effectively mitigate crystal impurities and establish optimal operational strategies for crystallization processes, it becomes imperative to comprehensively understand the influence of surface morphology on protein crystals. In the present study, we introduce a novel microscopic kinetic Monte Carlo (kMC) model, specifically designed to account for various growth regimes by incorporating surface thermodynamic effects related to different growth mechanisms. This innovation centers on an adaptive adsorption rate that redefines the driving force behind crystallization. To ensure the model's precision and relevance, we validate it with experimental findings. Subsequently, the confirmed kMC model, which forecasts kink density changes, surface morphology, and crystal growth rates under disturbances, is incorporated into a model-based control strategy. This method calculates an optimal input trajectory that facilitates the achievement of the desired kink density, thereby significantly reducing impurities during the crystallization process. This research offers a novel approach for controlling the growth of protein crystals. Furthermore, the stochastic model presents a valuable framework for enhancing the purity of proteins through tunable kink density of crystals, critical for the biotechnology and pharmaceutical industries.
|
|
14:00-14:15, Paper FrB12.3 | Add to My Program |
A Compact Design for Soft Sensors Based on Information-Bottleneck Theory |
|
Gao, Xinrui | Technical University of Ilmenau |
Zhao, Jiarui | Hisense Commercial Display Co., Ltd |
Shardt, Yuri | TU Ilmenau |
Keywords: Machine learning, Chemical process control, Variational methods
Abstract: Modern industrial production requires real-time control of critical quality variables that are hard to measure, which leads to the development of soft sensors that infer the quality variables online. In this paper, a parsimonious and compact soft-sensor modelling method is proposed based on information-bottleneck (IB) theory. The new method is in the form of a trade-off between model complexity and inferential accuracy. It is notable that this method integrates decoupled representation learning, relevant feature selection, and soft-sensor modelling into one model that can be optimised as a whole using a single cost function. Using a case study on the sulphur recovery unit, soft sensors are obtained with and without the proposed IB module. It is shown that adding the IB module in the model improves R2 from 55.6% to 80.9% and decreases the MSE from 0.039 to 0.026 on the test dataset.
|
|
14:15-14:30, Paper FrB12.4 | Add to My Program |
A Two-Tier Encrypted Control Architecture for Enhanced Cybersecurity of Nonlinear Processes |
|
Kadakia, Yash Ashit | University of California, Los Angeles |
Suryavanshi, Atharva Vijay | Linde |
Alnajdi, Aisha | University of California, Los Angeles |
Abdullah, Fahim | University of California, Los Angeles |
Christofides, Panagiotis D. | Univ. of California at Los Angeles |
Keywords: Networked control systems, Chemical process control, Communication networks
Abstract: This study proposes an approach to enhance the operational safety and cybersecurity of large-scale nonlinear processes by implementing a combination of traditional and advanced controllers through a two-tier control architecture with encrypted networked communication channels. Within this framework, the lower-tier control system utilizes a set of proportional-integral (PI) controllers to stabilize the process, while the upper-tier control system employs a Lyapunov-based model predictive controller (LMPC) to further improve the closed-loop system performance. To implement encryption, the input data must be presented as integers. Accordingly, signals to be encrypted within this framework are mapped from floating-point numbers to an integer subset through quantization, followed by bijective mapping. Different encryption schemes are implemented for the lower-tier and upper-tier control systems, accounting for the linear and nonlinear nature of the respective control systems. This study further delves into the impact of quantization on the closed-loop performance and an in-depth stability analysis of the two-tier control structure, establishing error bounds associated with quantization and sample-and-hold controller implementations. The approach is applied to a large-scale, nonlinear chemical process network example.
|
|
14:30-14:45, Paper FrB12.5 | Add to My Program |
Machine Learning-Based Initialization of Generalized Benders Decomposition for Mixed Integer Model Predictive Control |
|
Mitrai, Ilias | The University of Texas at Austin |
Daoutidis, Prodromos | Univ. of Minnesota |
Keywords: Process Control, Chemical process control, Optimization
Abstract: Model predictive control (MPC) has been widely used to control and operate complex systems. However, the efficient implementation of MPC depends on the efficient solution of the underlying optimization problem. In this work, we propose a machine learning (ML) based warm start initialization strategy for Generalized Benders Decomposition (GBD) to be used for the solution of mixed integer MPC problems. Specifically, the mixed integer MPC problem is first solved using an ML-based branch and check GBD algorithm, which provides a set of high-quality integer feasible solutions. These solutions are subsequently used to compute the exact Benders cuts, which are used to warm start the GBD algorithm. We apply the proposed approach to a case study on the operation of chemical processes where a mixed integer MPC problem is solved to compensate for disturbances. The results show that the proposed approach leads to 39% reduction in solution time compared to the standard application of GBD.
|
|
14:45-15:00, Paper FrB12.6 | Add to My Program |
Optimal Scheduling and Open-Loop Control of Network Batch Processes under Variable Processing Times Using Generalized Benders Decomposition |
|
Liñán, David A. | University of Waterloo |
Reynoso Donzelli, Simone | University of Waterloo |
Ricardez-Sandoval, Luis | University of Waterloo |
Keywords: Optimization, Optimization algorithms, Chemical process control
Abstract: This work addresses the discrete-time simultaneous scheduling and open-loop control (SSOC) of network batch processes with variable processing times through a tailored Generalized Benders Decomposition (GBD) framework. This SSOC problem is a challenging mixed-integer nonlinear programming (MINLP) problem because variable processing times introduce more binary variables to a discrete-time scheduling formulation and may generate new infeasibilities if those variables are poorly selected. Variable processing times are key in SSOC since they affect both the flexibility of the schedule, and the dynamic performance of batch systems. The key novelty of the proposed GBD approach is the addition of initial and auxiliary feasibility cuts to facilitate the handling of infeasibilities generated by variable processing times. The performance of the proposed GBD framework is tested using a case study adapted from the literature. A GBD methodology that implements traditional feasibility cuts is used as a benchmark. While the conventional GBD method was unable to converge to a feasible solution, the proposed GBD framework found a feasible solution within the first two interactions and then converged by closing the absolute MINLP gap. Therefore, the proposed GBD framework is a promising strategy to solve SSOC problems involving batch processes often found in the pharmaceutical, energy, and food industries.
|
|
FrB13 Regular Session, Richmond |
Add to My Program |
Manufacturing and Precision Mechatronic Systems |
|
|
Chair: Labbadi, Moussa | Aix-Marseille University, LIS UMR CNRS 7020, Marseille, France |
Co-Chair: Orosz, Gabor | University of Michigan |
|
13:30-13:45, Paper FrB13.1 | Add to My Program |
Predictive Modeling of Human Fatigue in a Manufacturing-Like Setting |
|
Rafter, Abigail | University of Michigan |
Barton, Kira | University of Michigan, Ann Arbor |
Tilbury, Dawn M. | University of Michigan |
Keywords: Manufacturing systems, Predictive control for linear systems, Estimation
Abstract: Humans are an essential part of Smart Manufacturing systems. While modeling machines based on real-time data and knowledge from subject matter experts has been widely explored, modeling humans has not. Modeling humans presents significant challenges due to the heterogeneity of individuals and the stochasticity that may be introduced through individual decisions based on events. However, we hypothesize that human behavior within a controlled environment and task will lie within a predictable scope that can give insight into future behavioral states of humans, such as fatigue. Human fatigue affects workers' productivity, safety, and performance in manufacturing systems. We define fatigue as measurable tiredness resulting from physical exertion. If we can predict when a human worker will become fatigued, breaks or task changes can be preemptively incorporated into system planning to maintain desired levels of productivity and safety. In this paper, we propose a modeling structure to describe fatigue in humans performing repetitive, manufacturing-like tasks. Using first order modeling techniques the model incorporates task context and physiological sensor data. A case study in which the participant completes a repetitive cable assembly task provides a demonstration of model development. A trial in this case study includes both working and resting periods, during which the participant wore weights of varying amounts to provide variation in task context. We derived linear time-invariant state space models that are capable of predicting fatigue levels with high accuracy over a 20 minute time horizon.
|
|
13:45-14:00, Paper FrB13.2 | Add to My Program |
Control Barrier Functionals for Safety-Critical Control of Registration Accuracy in Roll-To-Roll Printing Systems |
|
Chen, Zhiyi | University of Michigan |
Orosz, Gabor | University of Michigan |
Ni, Jun | University of Michigan |
Keywords: Manufacturing systems and automation, Delay systems, Control applications
Abstract: A control framework that optimizes registration accuracy while ensuring safety in roll-to-roll processes is presented. A primary controller using a modified algebraic Riccati equation is designed to reduce registration errors. This is complemented by a safety-critical controller based on a control barrier functional to maintain tension within safe limits. Our method is supported by numerical simulations, offering great potential to enhance existing industrial controllers.
|
|
14:00-14:15, Paper FrB13.3 | Add to My Program |
Predictable Multi-Core Implementation of Multi-Rate Sensor Fusion for High-Precision Positioning Systems |
|
Jugade, Chaitanya | Eindhoven University of Technology (TU/e) |
Mohamed, Sajid | ITEC B.V., the Netherlands |
Goswami, Dip | Eindhoven University of Technology |
Nelson, Andrew | Eindhoven University of Technology (TU/e) |
Van der veen, Gijs | ITEC B.V., the Netherlands |
Goossens, Kees | Eindhoven University of Technology |
Keywords: Vision-based control, Embedded systems, Manufacturing systems
Abstract: The high-precision and high-speed positioning systems require position feedback with high accuracy at a higher frequency. As reported in recent literature, high accuracy and high operating frequency can be achieved by fusing multiple position sensor data, e.g., the linear encoder (less robust/accurate, but fast) and object detection using camera images (accurate, but slow due to heavy processing load). Typically, image-based object detection incurs a significant computational delay due to computationally intensive processes and is the main performance bottleneck. Moreover, the computation delay varies when implemented on industrial platforms and degrades the performance of the closed-loop control system. In this paper, we present scheduling techniques such as parallelism and pipelining considering predictable multi-core platforms for such a multi-sensor positioning system. On the one hand, the predictable platform nearly removes the variation in execution time, making the delay constant. On the other hand, the parallel and pipeline schedules reduce the computation delay, translating to a shorter sampling period and better closed-loop performance. Furthermore, we perform a design space exploration on various parameters and control performance considering an industrial case study of semiconductor die-bonding equipment.
|
|
14:15-14:30, Paper FrB13.4 | Add to My Program |
Optimal Efficiency Controller Design of Pumping Systems |
|
Nassiri, Samir | Engineering for Smart and Sustainable Systems Research Center, M |
Labbadi, Moussa | Aix-Marseille University, LIS UMR CNRS 7020, Marseille, France |
Chatri, Chakib | Engineering for Smart and Sustainable Systems Research Center, M |
Cherkaoui, Mohamed | Engineering for Smart and Sustainable Systems Research Center, M |
Keywords: Electrical machine control, Energy systems, Optimal control
Abstract: This work presents a strategy to design an optimal efficiency controller for a complete water pumping system, aiming for both high dynamic performance and high efficiency. The novelty of the developed model is based on an optimisation strategy where a compromise is made between minimizing the electric motor power losses and accurate adjustment of flow rate by balancing efficiency and reliability through adjusting the operation point of the pump. To accomplish this goal, this paper presents the design of an optimal controller which integrates both the Minimum Electric Loss (MEL) control strategy, and the Linear Quadratic Regulator (LQR), augmented by adding integral action and tuned using an adaptive Genetic Algorithm optimization tool (GA). In order to further verify the accuracy of the proposed technique, three performance indices as compared to the conventional PI controller in terms of control input and disturbance rejection. Finally, simulation tests performed show that the proposed optimal can effectively improve the adaptability and flexibility of the water pumping system to several complex working conditions and also has the ability to reduce energy conversion efficiency, leading to a significant impact on energy savings.
|
|
14:30-14:45, Paper FrB13.5 | Add to My Program |
Voltage Waveform Optimization through Data-Driven Modeling in Electrohydrodynamic Jet Printing |
|
Hawa, Angelo | University of Michigan |
Barton, Kira | University of Michigan, Ann Arbor |
Keywords: Optimization, Manufacturing systems, Modeling
Abstract: Micro-additive manufacturing techniques pertaining to material jetting have demonstrated strong applicability in the fields of printed electronic and photonic devices. Nano-scale patterning has been achieved using electrohydrodynamic jet (e-jet) printing, which utilizes a series of high voltage pulses to precisely deposit ink in the form of printed patterns. Previous studies have successfully implemented learning control frameworks to achieve desired printing performance by adjusting the magnitude and timing of the voltage pulse. However, optimization of the input shape from a process-oriented perspective has not been analyzed, and the risks of nozzle clogging and printing regime fluctuations remain as challenges in maintaining stable performance. Additionally, a knowledge gap persists in characterizing the effects of modulating the baseline voltage on temporal and volumetric dynamics of the jetting process, which serve to provide critical time constants in the design of the input shape. This work implements data-driven modelling techniques to quantify the effects of varying the pulsed and baseline voltages while developing a process-oriented optimization algorithm for promoting stable jetting, furthering the foundation for implementation of control strategies for e-jet printing.
|
|
14:45-15:00, Paper FrB13.6 | Add to My Program |
Modeling and Control of Continuous Countercurrent Tangential Chromatography |
|
Dighe, Anish Vikas | Massachusetts Institute of Technology |
Lu, Amos | Massachusetts Institute of Technology |
Braatz, Richard D. | Massachusetts Institute of Technology |
Keywords: Biotechnology, Control applications, Manufacturing systems
Abstract: A model-based control system is developed for continuous countercurrent tangential chromatography. The mechanistic model is formulated as a distributed parameter system. The computational cost of the mechanistic model is reduced by reformulating the partial differential equations as ordinary differential equations via the method of characteristics. The model parameters are fit to experimental data for the capture of a monoclonal antibody from clarified bioreactor material. A control problem is formulated for the objective of maximizing system productivity subject to a constraint on the protein recovery, and analyzed to provide insight into the process parameters that strongly affect the closed-loop performance.
|
|
FrB14 Invited Session, Wellington |
Add to My Program |
ASME‐IEEE Joint Invited Session on Healthcare and Medical Systems |
|
|
Chair: Allen, Brendon C. | Auburn University |
Co-Chair: Frigge, Anna Franziska | Uppsala University |
Organizer: Rose, Chad | Auburn University |
Organizer: Allen, Brendon C. | Auburn University |
Organizer: Zhang, Wenlong | Arizona State University |
Organizer: Hahn, Jin-Oh | University of Maryland |
Organizer: Medvedev, Alexander V. | Uppsala University |
|
13:30-13:45, Paper FrB14.1 | Add to My Program |
On the Fisher Identifiability of Coupled Transport Processes in Animal Hypoxia Experiments (I) |
|
Abdelazim, Eman | Mechanical Eng. Ph.D. Student, Univ. of Maryland, College Park |
Fathy, Hosam K. | University of Maryland |
Keywords: Healthcare and medical systems, Identification, Modeling
Abstract: This letter examines the Fisher identifiability of two coupled transport processes with substantially different transport coefficients. This examination is motivated by the problem of estimating the efficacy of a novel life support technology for respiratory failure patients. The idea is to circulate an oxygen carrier through the patient’s abdomen, thereby utilizing abdominal gas diffusion for life support. The letter presents a third-order nonlinear model of the coupled dynamics of gas transport in the lungs and abdomen during this treatment. We linearize this model, reduce its order, and analyze its parameter identifiability. The main insight is that the stronger transport process in the lungs acts as a feedback mechanism that weakens the identifiability of the parameter governing the weaker abdominal transport process. Manipulating the stronger transport process through active control and/or passive design can, therefore, improve identifiability. The letter illustrates these insights using Monte Carlo simulation, showing a fourfold improvement in abdominal transport coefficient estimation accuracy through simple experimental redesign.
|
|
13:45-14:00, Paper FrB14.2 | Add to My Program |
Neuromechanical Model-Free Epistemic Risk Guided Exploration (NeuroMERGE) for Safe Autonomy in Human-Robot Interaction (I) |
|
Baskaran, Avinash | Auburn University |
Basyal, Sujata | Auburn University |
Allen, Brendon C. | Auburn University |
Rose, Chad | Auburn University |
Keywords: Human-in-the-loop control, Machine learning, Robotics
Abstract: Optimal human-robot interaction (HRI) necessitates the ability to track and compensate nonlinear neuromuscular and biomechanical dynamics that are challenging to identify online during movement. Model-free reinforcement learning approaches are well-suited to identifying such system dynamics through stochastic exploration and subsequent exploitation of learned low-dimensional probabilistic models to maximize reward. However, achieving safe and efficient stochastic exploration in HRI environments is an unsolved challenge. This work presents the development and experimental validation of a Neuromechanical Model-Free Epistemic Risk-Guided Exploration (NeuroMERGE) algorithm for stochastic iterative identification of HRI dynamics, a novel approach which integrates a measurement model of neuromechanical impedances to dynamically constrain the exploration-exploitation tradeoff. We validate NeuroMERGE in the control of a simulated cart-pole system as well as in a soft robotic hand exoskeleton in a case study with three participants. The results demonstrate safe and efficient convergence to stable control policies, achieving performance competitive with model- and learning-based control schemes.
|
|
14:00-14:15, Paper FrB14.3 | Add to My Program |
Intersection Point-Based Analysis of Neural Balance Control Strategies by Parkinson's Patients During Quiet Stance (I) |
|
Sreenivasan, Gayatri | Rutgers University |
Zhu, Chunchu | Rutgers University |
Yi, Jingang | Rutgers University |
Keywords: Biomedical, Modeling, Human-in-the-loop control
Abstract: This study employs intersection point height frequency analysis to quantitatively assess the balance control strategies used by individuals with Parkinson's disease (PD) during quiet stance. The changes in balance strategy are quantified using a triple inverted pendulum human model with a linear quadratic regulator as the neural balance controller. By considering both translational and angular body accelerations, we extract intersection point frequency curves that contain crucial information about the neuromuscular balance strategy of the PD patients. To contextualize our findings, we compare the observed frequency behavior with previous studies examining quiet stance in individuals without PD. This comprehensive investigation furnishes valuable insights into the disparities between the balance strategies of the PD patients and the healthy counterparts, shedding light on the influence of PD on balance control dynamics. The findings hold promising potential for applications in PD diagnostics and the development of robotic assistive devices for PD patient rehabilitation.
|
|
14:15-14:30, Paper FrB14.4 | Add to My Program |
Neural Fiber Activation in Unipolar vs Bipolar Deep Brain Stimulation (I) |
|
Frigge, Anna Franziska | Uppsala University |
Medvedev, Alexander V. | Uppsala University |
Jiltsova, Elena | Uppsala University Hospital |
Nyholm, Dag | Uppsala University Hospital |
Keywords: Biomedical, Computational methods, Modeling
Abstract: Deep Brain Stimulation (DBS) is an established and powerful treatment method in various neurological disorders. It involves chronically delivering electrical pulses to a certain stimulation target in the brain in order to alleviate the symptoms of a disease. Traditionally, the effect of DBS on neural tissue has been modeled based on the geometrical intersection of the static Volume of Tissue Activated (VTA) and the stimulation target. Recent studies suggest that the Dentato-Rubro-Thalamic Tract (DRTT) may serve as a potential common underlying stimulation target for tremor control in Essential Tremor (ET). However, clinical observations highlight that the therapeutic effect of DBS, especially in ET, is strongly influenced by the dynamic DBS parameters such as pulse width and frequency, as well as stimulation polarity. This study introduces a computational model to elucidate the effect of the stimulation signal shape on the DRTT under neural input. The simulation results suggest that achieving a specific pulse amplitude threshold is necessary before eliciting the therapeutic effect through adjustments in pulse widths and frequencies becomes feasible. Longer pulse widths proved more likely to induce firing, thus requiring a lower stimulation amplitude. Additionally, the modulation effect of bipolar configurations on neural traffic was found to vary significantly depending on the chosen stimulation polarity and the direction of neural traffic. Further, bipolar configurations demonstrated the ability to selectively influence firing patterns in different fiber tracts.
|
|
14:30-14:45, Paper FrB14.5 | Add to My Program |
Closed-Loop Multimodal Neuromodulation of Vagus Nerve for Control of Heart Rate (I) |
|
Bender, Shane | Case Western Reserve University |
Green, David | MetroHealth Medical Center |
Kilgore, Kevin | MetroHealth Medical Center |
Bhadra, Niloy | MetroHealth Medical Center |
Ardell, Jeffery | University of California, Los Angeles |
Vrabec, Tina | MetroHealth Medical Center |
Keywords: Adaptive control, Biomedical, Biological systems
Abstract: The use of electrical current to modulate neurons for autonomic regulation requires the ability to both up-regulate and down-regulate the nervous system. An implanted system employing this electrical neuromodulation would also need to adapt to changes in autonomic state in real-time. Stimulation of autonomic nerves at frequencies in the range 1-30 Hz has been a well-established technique for increasing neural activity. Vagus nerve stimulation (VNS) has been shown to be sensitive to frequency adjustments, which can be used to more precisely control the effect as compared to amplitude modulation. Kilohertz frequency alternating current (KHFAC) is a proven technique for blocking action potential conduction to reduce neural activity. Additionally, KHFAC can be reliably modulated by simple amplitude modulation. Although there are many types of commonly used closed-loop controllers, many conventional methods do not respond well to long system delays or discontinuities. Fuzzy logic control (FLC) is a state-based controller that can describe the discontinuities of the system linguistically and then translate the state transition to a continuous output signal. In our preparation, a single bipolar electrode was placed on the vagus nerve and controlled by a fuzzy logic controller to deliver both stimulation and KHFAC to control heart rate. The FLC was able to both change the heart rate to selected values and maintain the heart rate at a constant value in response to a physiological perturbation.
|
|
14:45-15:00, Paper FrB14.6 | Add to My Program |
Guaranteeing Safety of Patients under Mechanical Ventilation |
|
Hosseinzadeh, Mehdi | Washington State University |
Keywords: Biomedical, Constrained control, Control applications
Abstract: Mechanical ventilation is a life-saving device for patients who are unable to breathe on their own. In the pressure-controlled ventilation mode, a mechanical ventilator frequently increases and decreases the pressure at the patient's airway; this process induces a flow in an out of the patient's lungs. Prior work has shown that a poor pressure tracking performance can lead to lung injury, and might contribute significantly to the morbidity and mortality of critically ill patients. Also, a large overshoot in the induced flow can cause false ventilator-induced triggered breaths and tachypnoea. Thus, any control scheme designed for mechanical ventilators should ensure that not only the reference pressure profile is tracked, but also the induced flow does not exceed the maximum allowable overshoot. In general, these two objectives are conflicting, and addressing them is challenging due to the unknownness of the system parameters. This paper uncouples the problem of addressing tracking performance from that of guaranteeing safety of patients and proposes a two-level control scheme to tackle the challenge, wherein a low-level controller addresses pressure tracking performance and a high-level controller guarantees safety of patients. Effectiveness of the proposed scheme is evaluated via extensive simulation studies.
|
|
FrB15 Invited Session, Yonge |
Add to My Program |
Estimation and Control of Distributed Parameter Systems V |
|
|
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 FrB15.1 | Add to My Program |
Viability under Degraded Control Authority (I) |
|
El-Kebir, Hamza | University of Illinois at Urbana-Champaign |
Berlin, Richard | University of Illinois at Urbana-Champaign |
Bentsman, Joseph | University of Illinois at Urbana-Champaign |
Ornik, Melkior | University of Illinois Urbana-Champaign |
Keywords: Fault diagnosis, Identification for control, Fault tolerant systems
Abstract: In this work, we solve the problem of quantifying and mitigating control authority degradation in real time. Here, our target systems are controlled nonlinear affine-in-control evolution equations with finite control input and finite- or infinite-dimensional state. We consider two cases of control input degradation: finitely many affine maps acting on unknown disjoint subsets of the inputs and general Lipschitz continuous maps. These degradation modes are encountered in practice due to actuator wear and tear, hard locks on actuator ranges due to over-excitation, as well as more general changes in the control allocation dynamics. We derive sufficient conditions for identifiability of control authority degradation, and propose a novel real-time algorithm for identifying or approximating control degradation modes. We demonstrate our method on a nonlinear distributed parameter system, namely a one-dimensional heat equation with a velocity-controlled moveable heat source, motivated by autonomous energy-based surgery.
|
|
13:45-14:00, Paper FrB15.2 | Add to My Program |
Representation of PDE Systems with Delay and Stability Analysis Using Convex Optimization (I) |
|
Jagt, Declan S. | Arizona State University |
Peet, Matthew M. | Arizona State University |
Keywords: Distributed parameter systems, Delay systems, Stability of linear systems
Abstract: Partial Integral Equations (PIEs) have been used to represent both systems with delay and systems of Partial Differential Equations (PDEs) in one or two spatial dimensions. In this paper, we show that these results can be combined to obtain a PIE representation of any suitably well-posed 1D PDE model with constant delay. In particular, we represent these delayed PDE systems as coupled systems of 1D and 2D PDEs, obtaining a PIE representation of both subsystems. Taking the feedback interconnection of these PIE subsystems, we then obtain a 2D PIE representation of the 1D PDE with delay. Next, based on the PIE representation, we formulate the problem of stability analysis as convex optimization of positive operators which can be solved using the PIETOOLS software suite. We apply the result to PDE examples with delay in the state and boundary conditions.
|
|
14:00-14:15, Paper FrB15.3 | Add to My Program |
Neumann Boundary Control of the Wave Equation Via Linear Quadratic Regulation (I) |
|
Krener, Arthur J | Naval Postgraduate School |
Keywords: Distributed parameter systems, Computational methods
Abstract: We consider Linear Quadratic Regulation (LQR) for the boundary control of the one dimensional, undamped, linear wave equation under Neumann actuation. We present a Riccati partial differential equation, the derivation of which is by the simple and explicit techniques of integration by parts and completing the square. The Fourier expansion of the solution of the Riccati PDE leads to an infinite dimensional algebraic Riccati equation that can be approximately solved by policy iteration. Since the system is undamped, all the open loop eigenvalues lie on the imaginary axis. Under suitable assumptions a Neumann LQR feedback moves all these eigenvalues into the open left half plane. The closed loop eigenvalues converge to the open loop eigenvalues as the wave number increases so the closed loop system is asymptotically stable but not exponentially stable. An interesting fact is that the closed loop modal shapes are complex sinusoids and they appear to converge to real sinusoids as the wave number increases.
|
|
14:15-14:30, Paper FrB15.4 | Add to My Program |
Adaptive Cluster-Dynamic Mode Decomposition with Application to the Burgers’ Equation (I) |
|
Wu, Tumin | University of Tennessee |
Wilson, Dan | University of Tennessee |
Djouadi, Seddik, M. | University of Tennessee |
Keywords: Reduced order modeling, Nonlinear systems identification, Fluid flow systems
Abstract: This paper proposes a new model reduction method that improves the prediction accuracy of dynamic modes decomposition with control (DMDc), DMD is a data-driven technique that extracts low-order models from high-dimensional complex dynamic systems with actuation. With DMDc, an input-output reduced-order model can be obtained for system identification and prediction. In this work, in order to better capture the nonlinear behavior, an adaptive clustering method is introduced to group the snapshots obtained by experimental data or numerical simulation into several sub-regions that display similar behavior to construct a reduced-order model. Cluster methods with DMDc are combined to construct the local reduced-order model. Furthermore, with the prediction process, new incoming data is fed into the clusters to update the cluster-DMDc reduced order model to obtain more accurate predictions. Time clustering is applied to the snapshots generated by the Burgers' equations with boundary actuation, and the adaptive cluster DMDc reduced-order model outperforms the standard DMD.
|
|
14:30-14:45, Paper FrB15.5 | Add to My Program |
Linear-Quadratic Control Problem on a Finite-Horizon for a Class of Differential-Algebraic Equations (I) |
|
Alalabi, Ala' | University of Waterloo |
Morris, Kirsten | University of Waterloo |
Keywords: Differential-algebraic systems, Optimal control, Optimization
Abstract: We study the linear-quadratic (LQ) control problem on a finite-horizon for linear differential-algebraic equations (DAEs) of arbitrary index. By means of a projection, we derive a differential Riccati equation whose solution yields the optimal control. No index reduction is performed. Numerical simulations are given to illustrate the theoretical findings.
|
|
14:45-15:00, Paper FrB15.6 | Add to My Program |
Strict Dissipativity and Turnpike for LQ Optimal Control Problems with Possibly Boundary Reference (I) |
|
Li, Zhuqing | University of California San Diego |
Guglielmi, Roberto | Gran Sasso Science Institute |
Keywords: Optimal control, Stability of linear systems, Linear systems
Abstract: In this paper we investigate the turnpike property for constrained LQ optimal control problem in connection with dissipativity of the control system. We determine sufficient conditions to ensure the turnpike property in the case of a turnpike reference possibly occurring on the boundary of the state constraint set.
|
|
FrB16 Invited Session, Dockside 4 |
Add to My Program |
Modeling and Control for Thermal Management Systems |
|
|
Chair: Pangborn, Herschel | The Pennsylvania State University |
Co-Chair: Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Organizer: Koeln, Justin | University of Texas at Dallas |
Organizer: Bird, Trevor, J. | PC Krause and Associates |
Organizer: Pangborn, Herschel | The Pennsylvania State University |
Organizer: Nash, Austin | Kettering University |
Organizer: Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Organizer: Drgona, Jan | Pacific Northwest National Laboratory |
Organizer: Blizard, Audrey | The Ohio State University |
|
13:30-13:45, Paper FrB16.1 | Add to My Program |
Stochastic Model Predictive Control for Electric Vehicles Thermal Management |
|
Hu, Qiuhao | University of Michigan |
Amini, Mohammad Reza | University of Michigan |
Kolmanovsky, Ilya V. | The University of Michigan |
Sun, Jing | University of Michigan |
Keywords: Optimal control, Stochastic optimal control, Automotive control
Abstract: In this paper, a stochastic Model Predictive Control (S-MPC) approach is developed to efficiently optimize the thermal management of electric vehicles and accommodate scenarios with multiple routes. To account for the uncertainties, the cost function is modified to minimize the expected (average) cost across all possible routes over the prediction horizon. Thermal constraints are treated as soft constraints using slack variables. This approach allows for flexibility in satisfying the constraints while optimizing the performance. Through simulations, the performance of the proposed method is evaluated using a fleet of vehicles. We demonstrate that the proposed method achieves a good trade-off between multiple competing performance metrics. Furthermore, an adaptation strategy is introduced, which dynamically adjusts the penalty weight value. This adaptive approach eliminates the need for offline calibration and further enhances performance. The results indicate that the time-varying penalty weight significantly reduces the total constraint violations by up to 20% without impacting the performance on energy consumption.
|
|
13:45-14:00, Paper FrB16.2 | Add to My Program |
Experimental Validation of Control-Oriented Dynamic Modeling of Pumped Two-Phase Cooling Systems (I) |
|
Shaikh, Juned | University of Texas at Dallas |
Koeln, Justin | University of Texas at Dallas |
Keywords: Modeling, Simulation, Control applications
Abstract: Pumped Two-phase Cooling (PTC) systems use the evaporation and condensation of a refrigerant to provide isothermal, high-heat flux, cooling using minimal pumping power. A basic PTC system consists of a pump to drive refrigerant flow, an evaporator to absorb the heat load, a condenser to reject heat from the system, and a separator to ensure that only liquid refrigerant returns to the pump. Control-oriented dynamic models of these systems are needed to develop model-based controllers capable of safely maximizing the performance and efficiency of the systems. However, existing first-principles modeling approaches are typically not well suited to be directly used in model-based control design. Therefore, this paper proposes a dynamic modeling approach for PTC systems with several key features that result in a model that can be simulated using a fixed-step size numerical solver with a relatively large timestep size. Additionally, a new separator model is proposed that captures the complex mass and energy dynamics within this component that significantly affect the overall behavior of the system. A laboratory-scale experimental PTC system is used to demonstrate the accuracy of this modeling framework and the impact of the key features of the proposed approach. The simulation and experimental results show that a model with only nine dynamic states is able to accurately capture the steady-state and transient pressure and temperature dynamics of the system while using the first-order forward Euler method with a fixed step size of 0.01 seconds to simulate the system.
|
|
14:00-14:15, Paper FrB16.3 | Add to My Program |
A Multi-Agent Approach to Safe Control of Energy Systems Using Control Barrier Functions (I) |
|
Marvi, Zahra | University of Minnesota |
Alleyne, Andrew G. | University of Minnesota |
Keywords: Energy systems, Constrained control, Control applications
Abstract: This paper presents a novel multi-agent-based approach for safety-aware control of energy systems while accounting for sub-system coupling. The proposed method employs graph modeling to represent the dynamics of each sub-system and its control objectives in the energy domain. This unified representation in the energy domain allows for defining each sub-system with an independent control objective as an energy agent. The interactions among energy agents exhibit either collaboration on energy transfer or conflict over energy resource usage. For collaborative scenarios, a control barrier function (CBF)-based quadratic programming approach is utilized to achieve collective energy objectives while respecting individual safety constraints. On the other hand, decision-making in conflicting scenarios is resolved locally through a min-max problem with a CBF payoff function, ensuring the feasibility of a safe solution for all agents under worst-case conditions. The effectiveness of the proposed approach is demonstrated through its application in an electro-thermal system comprising both collaborative and conflicting agents.
|
|
14:15-14:30, Paper FrB16.4 | Add to My Program |
Understanding the Role of Thermal Energy Storage Location in the Optimal Performance and Operation of a District Cooling Network (I) |
|
Andujar Lugo, Frank | University of Illinois Urbana Champaign |
Alleyne, Andrew G. | University of Minnesota |
Keywords: Network analysis and control, Optimization, Energy systems
Abstract: The need to handle cooling loads more efficiently from geographically near locations has brought attention to the use of district cooling networks. District cooling networks can provide significant energy and economic benefits but only if designed and operated correctly. The location of thermal energy storage (TES) can impact both the operation and performance of the system. We formulate an optimization framework for a simplified cooling network for which we solve for the optimal TES location and system open loop control that reduces the 2-norm of the chiller energy consumption, serving as a surrogate for flattening the energy demand. The benefit of considering storage location is captured using the centrality of the TES in the network. The centrality metric allows us to present the benefit of reducing the centrality of the storage in the optimization objective. It shows that there exists a coupling between the optimal storage location, system operation, and power consumption objective.
|
|
14:30-14:45, Paper FrB16.5 | Add to My Program |
Physics-Constrained Deep Kalman Filters for Estimating Vapor Compression System States (I) |
|
Deshpande, Vedang M. | Mitsubishi Electric Research Laboratories |
Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
P. Vinod, Abraham | Mitsubishi Electric Research Laboratories |
Laughman, Christopher R. | Mitsubishi Electric Research Labs |
Keywords: Energy systems, Machine learning, Kalman filtering
Abstract: Physics-based computational models of vapor compression systems (VCSs) enable high-fidelity simulations but typically require a high-dimensional state representation. Furthermore, the underlying VCS dynamics are stiff, constrained by conservation laws, and only a small fraction of the states can be measured online. While recent advances on constrained extended Kalman filtering (EKF) have provided a systematic framework for estimating states of VCSs using simulation models, two major bottlenecks to efficient implementation include: (i) expensive forward predictions requiring customized stiff solvers; and, (ii) frequent and computationally expensive linearization operations on high-dimensional nonlinear models. In this paper, we circumvent these bottlenecks by constructing neural state-space models (SSMs) from simulation data for which both forward predictions and linearization operations via automatic differentiation can be performed efficiently. In addition, we incorporate physical constraints based on pressure gradients explicitly into the neural SSM architecture, and demonstrate that the physics-constrained model improves the estimation performance compared to an neural SSM that does not enforce the physics information. We integrate the proposed physics-constrained neural SSM within an EKF framework and show that we can accurately reconstruct the states of a Julia-based high-fidelity VCS simulator with high efficiency, outperforming baselines and ablations.
|
|
14:45-15:00, Paper FrB16.6 | Add to My Program |
Smooth Sliding Control of Van Der Pol Oscillators with a Single Input: Application to Micro-Thermal-Fluid Cooling Systems |
|
Silva, Luiz | Federal University of Rio De Janeiro |
Lizarralde, Fernando | Federal Univ. of Rio De Janeiro |
Peixoto, Alessandro Jacoud | Federal University of Rio De Janeiro (UFRJ) |
Keywords: Variable-structure/sliding-mode control, Stability of nonlinear systems, Control applications
Abstract: In this letter, a smooth sliding control for robustly regulating a set of identical oscillatory systems, interconnected in parallel and with only one common input for all, is discussed. Our focus is primarily on oscillators resembling the Van der Pol type. To achieve this goal, a control strategy for synchronizing the oscillators is evaluated, using their phase response curve (PRC), thereby aligning them under identical conditions. The proposed control law, the combined synchronization plus regulation control actions, is applied to a flow micro-thermal-fluid cooling system in the two-phase regime, which has similarities to Van der Pol oscillators. In this application, the idea is to control the mass flow rate of the refrigerant fluid circulating in the microchannels and, consequently, the temperature at the walls of these channels, achieving better performance in heat transfer. Simulation results are presented to validate the proposed control strategy.
|
|
FrB17 Regular Session, Dockside 5 |
Add to My Program |
Modeling and Identification II |
|
|
Chair: Kim, Jin Sung | Hanyang University |
Co-Chair: Shen, Minghao | University of Michigan |
|
13:30-13:45, Paper FrB17.1 | Add to My Program |
Optimal Control for Antivirus Routing in Epidemiological-Based Heterogeneous Computer Network Clusters |
|
Wang, Shuangge | Yale University |
He, Zhilin | University of Southern California |
Xu, Zihao | University of Southern California |
Haskell, Cymra | University of Southern California |
Krishnamachari, Bhaskar | USC |
Keywords: Modeling, Networked control systems, Optimal control
Abstract: Maintaining productivity in computer networks under virus threats has been an ongoing research. Existing works have adopted epidemiological-based ordinary differentiation equations (ODEs) to model virus and antivirus propagation. However, these models tend to oversimplify by not accounting for the heterogeneity among different computer network clusters and ignoring real-world protocol constraints, e.g., nodes cannot communicate simultaneously with nodes in different groups. In this work, we develop a novel model that acknowledges these constraints and incorporates heterogeneity. We first propose a single-cluster ODE model in which both the virus and antivirus propagate. We then generalize this single-cluster model to a model for networks with heterogeneous clusters. Leveraging these models, we formulate the maximum productivity objective as an optimization problem that could be solved using quasi-Newton methods. We also numerically formalize the optimal control's validity in the single-cluster model through Pontryagin's Maximum Principle (PMP). By experimentation and simulation, we find that the optimal control policy follows a bang-bang structure and performs guided prioritization for the heterogeneity of clusters.
|
|
13:45-14:00, Paper FrB17.2 | Add to My Program |
Uncertainty Quantification of Autoencoder-Based Koopman Operator |
|
Kim, Jin Sung | Hanyang University |
Quan, Yingshuai | Hanyang University |
Chung, Chung Choo | Hanyang University |
Keywords: Modeling, Nonlinear systems identification, Neural networks
Abstract: This paper proposes a method for uncertainty quantification of an autoencoder-based Koopman operator. The main challenge of using the Koopman operator is to design the basis functions for lifting the state. To this end, this paper builds an autoencoder to automatically search the optimal lifting basis functions with a given loss function. We approximate the Koopman operator in a finite-dimensional space with the autoencoder, while the approximated Koopman has an approximation uncertainty. To resolve the problem, we compute a robust positively invariant set for the approximated Koopman operator to consider the approximation error. Then, the decoder of the autoencoder is analyzed by robustness certification against approximation error using the Lipschitz constant in the reconstruction phase. The forced Van der Pol model is used to show the validity of the proposed method. From the numerical simulation results, we confirmed that the trajectory of the true state stays in the uncertainty set centered by the reconstructed state.
|
|
14:00-14:15, Paper FrB17.3 | Add to My Program |
A Model for Multi-Agent Heterogeneous Interaction Problems |
|
Hsu, Christopher | University of Pennsylvania |
Haile, Mulugeta | US Army Research Laboratory |
Chaudhari, Pratik | University of California, Los Angeles |
Keywords: Modeling, Large-scale systems, Biologically-inspired methods
Abstract: We introduce a model for multi-agent interaction problems to understand how a heterogeneous team of agents should organize its resources to tackle a heterogeneous team of attackers. This model is inspired by how the human immune system tackles a diverse set of pathogens. The key property of this model is a “cross-reactivity” kernel which enables a particular defender type to respond strongly to some attacker types but weakly to a few different types of attackers. We show how due to such cross-reactivity, the defender team can optimally counteract a heterogeneous attacker team using very few types of defender agents, and thereby minimize its resources. We study this model in different settings to characterize a set of guiding principles for control problems with heterogeneous teams of agents, e.g., sensitivity of the harm to sub-optimal defender distributions, and competition between defenders gives near-optimal behavior using decentralized computation of the control. We also compare this model with existing approaches including reinforcement-learned policies, perimeter defense, and coverage control.
|
|
14:15-14:30, Paper FrB17.4 | Add to My Program |
A Harmonic Framework for the Identification of Linear Time-Periodic Systems |
|
Vernerey, Flora | Université De Lorraine, CNRS |
Riedinger, Pierre | Université De Lorraine - CNRS |
Iannelli, Andrea | University of Stuttgart |
Daafouz, Jamal | Université De Lorraine, CRAN, CNRS |
Keywords: Identification, Time-varying systems, Modeling
Abstract: This paper presents a novel approach for the identification of linear time-periodic (LTP) systems in continuous time. This method is based on harmonic modeling and consists in converting any LTP system into an equivalent LTI system with infinite dimension. Leveraging specific harmonic properties, we demonstrate that solving this infinite-dimensional identification problem can be reduced to solving a finite-dimensional linear least-squares problem. The result is an approximation of the original solution with an arbitrarily small error. Our approach offers several significant advantages. The first one is closely tied to the inherent LTI characteristic of the harmonic system, along with the Toeplitz structure exhibited by its elements. The second advantage is related to the regularization property achieved through the integral action when computing the phasors from input and state trajectories. Finally, our method avoids the computation of signals' derivative. This sets our approach apart from existing methods that rely on such computations, which can be a notable drawback, especially in continuous-time settings. We provide numerical simulations that convincingly demonstrate the effectiveness of the proposed method, even in scenarios where signals are corrupted by noise.
|
|
14:30-14:45, Paper FrB17.5 | Add to My Program |
Control-Oriented 2D Thermal Modelling of Cylindrical Battery Cells for Optimal Tab and Surface Cooling |
|
Peprah, Godwin | Chalmers University of Technology |
Wik, Torsten | Chalmers University of Technology |
Huang, Yicun | Chalmers University of Technology |
Faisal, Altaf | Volvo Group Trucks Technology |
Zou, Changfu | Chalmers University of Technology |
Keywords: Modeling
Abstract: Minimising cell thermal gradients and the average temperature rise requires an optimal combination of tab and surface cooling methods to leverage their unique advantages. This work presents a computationally efficient two dimensional (2D) thermal model for cylindrical lithium-ion battery cells that is developed based on the Chebyshev Spectral-Galerkin method and allows the independent control of tab and surface cooling channels for effective thermal performance optimisa- tion. This obtained model is validated against a high-fidelity finite element model under the worldwide harmonised light vehicle test procedure (WLTP). Results show that the reduced- order model with as few as two states can predict the spatially resolved temperature distribution throughout the cell, and that in aggressive cooling scenarios, a model order of nine states can improve accuracy by about 84%. It is also shown that even though cooling all sides of the cylindrical cell achieves the lowest average temperature rise, cooling only the top and bottom sides provides minimum radial thermal gradients.
|
|
FrB18 Regular Session, Dockside 6 |
Add to My Program |
Hybrid Systems |
|
|
Chair: Trivedi, Ashutosh | University of Colorado Boulder |
Co-Chair: Phillips, Sean | Air Force Research Laboratory |
|
13:30-13:45, Paper FrB18.1 | Add to My Program |
Falsification Via Barrier Certificates |
|
Murali, Vishnu | University of Colorado, Boulder |
Trivedi, Ashutosh | University of Colorado Boulder |
Zamani, Majid | University of Colorado Boulder |
Keywords: Hybrid systems, Automata
Abstract: Barrier certificates enable a deductive approach to safety verification by characterizing an over-approximation of the reachable state space via their level sets. Dual to verification, falsification approaches often rely on a smart search by simulating the system for different operating conditions in the search of an unsafe behavior. While falsification approaches are effective in discovering shallow bugs, they fail to uncover deep counterexamples due to “plateaus” in the search space. For this purpose, we present two characterizations of barrier certificates to provide a deductive approach to falsification. We show these two characterizations are incomparable, i.e, for a fixed template one may falsify the system using one kind but not the other. Finally, we demonstrate the effectiveness of the proposed approaches in our case studies.
|
|
13:45-14:00, Paper FrB18.2 | Add to My Program |
A Switched Reference Governor for High Performance Trajectory Tracking Control under State and Input Constraints |
|
Wang, Nan | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Hybrid systems, Constrained control
Abstract: This paper proposes a switched reference governor (RG) algorithm to achieve rapid and non-oscilliatory convergence to a given reference signal while satisfying the imposed constraints by switching between a fast controller and a slow controller. The proposed algorithm computes the set of state and admissible reference pairs for both controllers offline. At each iteration, it computes the admissible reference sets for each controller at the current state and activates one of the controllers based on the distance between the state and the reference. After a controller is activated, a lightweight optimization problem is solved to find an admissible reference that is closest to the reference signal. The solution, which is referred to as the virtual reference, is used as the reference signal. Recursive feasibility and convergence of the virtual reference to the given reference signal, among other key properties of the proposed switched RG, are shown and illustrated in a system
|
|
14:00-14:15, Paper FrB18.3 | Add to My Program |
Robust Hybrid Wide-Area Damping Control for Power Systems with Communication Errors |
|
Copp, David A. | University of California, Irvine |
Phillips, Sean | Air Force Research Laboratory |
Keywords: Hybrid systems, Distributed control, Power systems
Abstract: The broad deployment of phasor measurement units has enabled effective wide-area damping control for enhancing small-signal stability of large and interconnected power systems. However, this requires networked communication between systems that may be subjected to intermittent, noisy, and delayed feedback measurements. In this paper, we present a distributed wide-area damping controller that applies local power injections via a sample-and-hold mechanism to synchronize the states of the interconnected power systems, thereby damping inter-area oscillations. We model the nomi- nal closed-loop system as a hybrid system. Then, leveraging analytical hybrid systems tools, we apply sufficient conditions that guarantee that the set characterizing synchronization is globally exponentially stable. Moreover, due to the hybrid system construction, we show that this set is robust to certain classes of perturbations, which include both perturbations and delays on the communication between the power systems. We demonstrate the damping controller’s performance in a numerical example that considers interconnected heterogeneous nonlinear systems with intermittent communication that is subjected to significant noise and time-delays.
|
|
14:15-14:30, Paper FrB18.4 | Add to My Program |
Parameter Estimation for Hybrid Dynamical Systems with Delayed Jump Detection |
|
Johnson, Ryan S. | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Estimation, Optimization
Abstract: We consider the problem of estimating a vector of unknown constant parameters for a class of hybrid dynamical systems with bounded delays in the detection of jumps. Using a hybrid systems framework, we propose an algorithm that estimates the jump times of the trajectories and uses stored data to update the parameter estimate at jumps. We show that the algorithm guarantees convergence of the parameter estimate to the true value, except possibly on the intervals wherein detection of jumps is delayed. Simulation results show the merits of the proposed approach.
|
|
14:30-14:45, Paper FrB18.5 | Add to My Program |
Dynamic Event-Triggered Control for LTI Systems with Asynchronous Input/Output Transmissions |
|
Abdelrahim, Mahmoud | Prince Sultan Univeristy |
Almakhles, Dhafer J | Prince Sultan University |
Keywords: Control over communications, Hybrid systems, Networked control systems
Abstract: We consider the problem of output feedback stabilization of LTI systems under event-triggering implementation. In particular, we assume that both the plant output and the control input are both transmitted over the network in an asynchronous manner. To that end, two independent event-triggering rules are constructed to generate the transmission instants of the submitted signals. The proposed approach is dynamic in the sense that the triggering rules involve internal dynamical variables to allow for further reduction in the communication load. Moreover, the inter-transmission times for both sides of the channel are lower bounded by enforced dwell times to prevent the occurrence of Zeno phenomena. The problem is challenging due to mutual interactions between the sampling errors of the plant output and the control input, which requires careful handling to ensure the closed-loop stability. The triggering mechanisms are designed by emulation as we first ignore the effect of the network and stabilize the plant in continuous-time. Then, the communication constraints are taken into account to derive the triggering conditions such that the stability of the networked control system is preserved. The required conditions are formulated in terms of a linear matrix inequality. The effectiveness of the technique is demonstrated by numerical simulations.
|
|
14:45-15:00, Paper FrB18.6 | Add to My Program |
Fault-Tolerant Control of Hybrid UAV Using Weighted Control Allocation Scheme |
|
Ijaz, Salman | University of Nottingham Ningbo China |
Javaid, Umair | Ningbo University of Technology, Ningbo China |
Nasr, Ahmed | University of Nottingham Ningbo China |
Sun, Donglei | University of Nottingham Ningbo China |
Keywords: Fault tolerant systems, Hybrid systems, Linear systems
Abstract: This study presents a methodology to enhance the operating safety of hybrid unmanned aerial vehicles by employing an active fault-tolerant control technique. The idea is to incorporate the weighted control allocation scheme with integral-sliding mode control law to attain accurate tracking performance while accounting for the impact of actuator faults and failures. One notable benefit of this methodology lies in its ability to attain tracking accuracy in all operational modes of hybrid UAVs through the careful creation of a suitable weighting matrix. The efficiency of the suggested system is demonstrated by numerical simulations conducted on a longitudinal model of an octoplane aircraft. The proposed controller demonstrates satisfactory performance both in nominal conditions and under faults occurring in the elevator and rotors 1, 2, 7, and 8 at 20s and 40s.
|
|
FrB19 Regular Session, Pier 7 |
Add to My Program |
Stochastic Systems and Control I |
|
|
Chair: Hsu, Shun-Pin | National Chung-Hsing University |
Co-Chair: Halder, Abhishek | Iowa State University |
|
13:30-13:45, Paper FrB19.1 | Add to My Program |
Path Structured Multimarginal Schrödinger Bridge for Probabilistic Learning of Hardware Resource Usage by Control Software |
|
Bondar, Georgiy Antonovich | UC Santa Cruz |
Gifford, Robert | University of Pennsylvania |
Phan, Linh Thi Xuan | University of Pennsylvania |
Halder, Abhishek | Iowa State University |
Keywords: Stochastic systems, Computational methods, Machine learning
Abstract: The solution of the path structured multimarginal Schr"{o}dinger bridge problem (MSBP) is the most-likely measure-valued trajectory consistent with a sequence of observed probability measures or distributional snapshots. We leverage recent algorithmic advances in solving such structured MSBPs for learning stochastic hardware resource usage by control software. The solution enables predicting the time-varying distribution of hardware resource availability at a desired time with guaranteed linear convergence. We demonstrate the efficacy of our probabilistic learning approach in a model predictive control software execution case study. The method exhibits rapid convergence to an accurate prediction of hardware resource utilization of the controller. The method can be broadly applied to any software to predict cyber-physical context-dependent performance at arbitrary time.
|
|
13:45-14:00, Paper FrB19.2 | Add to My Program |
Consensus Sets Based on Sarymsakov Matrices |
|
Hsu, Shun-Pin | National Chung-Hsing University |
Keywords: Stochastic systems, Cooperative control, Network analysis and control
Abstract: In the study of convergence property of infinite products of stochastic matrices, a pivotal concern revolves around the characterization of a subset from the family of stochastic, indecomposable and aperiodic (SIA) matrices such that the subset is closed under matrix multiplication. Historically, the collection of Sarymsakov matrices stood as the most expansive subset known to possess such a closure property. Consequently, an infinite product involving Sarymsakov matrices guarantees convergence toward a rank-one matrix. In recent times, a subset larger than the Sarymsakov matrix collection has been proposed, demonstrating an equivalent closure property. In this exposition, we establish that an even more extensive col- lection possessing the aforementioned property can be devised utilizing a similar yet generalized approach. During the formulation of our subset, we also address the unresolved quandary of verifying a scrambling matrix by scrutinizing the powers of an SIA matrix. We offer a solution to this quandary by providing a sharp upper bound for the powers required for verification. This particular outcome streamlines the construction process of our extended set. Numerical examples are provided to illustrate our work.
|
|
14:00-14:15, Paper FrB19.3 | Add to My Program |
Distributionally Robust Output-Feedback Control of Markov Jump Linear Systems |
|
Mark, Christoph | Robert Bosch GmbH |
Pazzaglia, Paolo | Robert Bosch GmbH |
Schmidt, Kevin | Robert Bosch GmbH |
Keywords: Stochastic optimal control, Uncertain systems, Networked control systems
Abstract: In this paper, we develop distributionally robust controllers and observers for Markov Jump Linear Systems (MJLS) with observable Markov modes and unknown transition probabilities that must be inferred from observations. We introduce the notation of distributionally robust stabilizability and detectability, and propose design procedures for both the controller and observer, so that the resulting closed-loop system is mean-square stable with high confidence, by using an empirical estimate of the Markov transition matrix. The second part of the paper deals with networked control systems that are representable as MJLS. The paper closes with a numerical example of a distance controller for a platoon of cars to highlight the benefits of our approach.
|
|
14:15-14:30, Paper FrB19.4 | Add to My Program |
Turing-Type Instabilities and Pattern Formation Induced by Saturation Effects and Randomness in Nonlinear, Diffusive Epidemic Spread |
|
Singh, Aman Kumar | Vellore Institute of Technology, Vellore, India |
Boltz, Noelle | University of Dayton |
Kumar, Manish | University of Cincinnati |
Ramakrishnan, Subramanian | University of Dayton |
Keywords: Stochastic systems, Stability of nonlinear systems, Biological systems
Abstract: The COVID-19 pandemic has reinvigorated mathematical analysis of epidemic spread dynamics. We analytically investigate a partial differential equation (PDE) based, compartmental model of spatiotemporal epidemic spread, incorporating nonlinear infection forces accounting for saturation effects in the infection transmission mechanism. Using higher-order perturbation analysis and computing the local Lyapunov exponent, we find the emergence of dynamic instabilities induced both by the saturation parameter and stochastic environmental forces driving the epidemic spread. Notably, a second-order perturbation is found to be essential to uncover the noise-induced instabilities since they are not observed under first-order perturbations. We also analyze the effects of saturation and noise on such instabilities. Finally, using numerical, stationary solutions of the governing PDEs, we study the formation of spatial patterns of the infection spread corresponding to the instabilities. We find the emergence of diffusion-driven patterns in the deterministic case and noise-induced patterns in cases when diffusion alone does not induce steady-state patterns.
|
|
14:30-14:45, Paper FrB19.5 | Add to My Program |
Guaranteed Region of Attraction of Stochastic Nonlinear Quadratic Systems |
|
Tartaglione, Gaetano | Università Di Napoli Parthenope |
Montefusco, Francesco | University of Naples Parthenope |
Ariola, Marco | Univ. Degli Studi Di Napoli Parthenope |
Cosentino, Carlo | Università Degli Studi Magna Graecia |
Merola, Alessio | Università Degli Studi Magna Graecia Di Catanzaro |
Amato, Francesco | Università Degli Studi Di Napoli Federico II |
Keywords: Stochastic systems, Stochastic optimal control, LMIs
Abstract: We present new results regarding the stability properties of a stochastic nonlinear quadratic system (NLQS). The paper extends to the stochastic context a previous work concerning the domain of attraction (DA) of the zero equilibrium point of a nonlinear quadratic system. A stabilizing control law is designed by considering the concept of (Omega,alpha)-stability in probability. The devised procedure requires the solution of a convex optimization problem. An example based on a stochastic epidemic model illustrates how to implement the developed approach.
|
|
14:45-15:00, Paper FrB19.6 | Add to My Program |
On the Contraction Coefficient of the Schrödinger Bridge for Stochastic Linear Systems |
|
Teter, Alexis | University of California Santa Cruz |
Chen, Yongxin | Georgia Institute of Technology |
Halder, Abhishek | Iowa State University |
Keywords: Stochastic systems, Stochastic optimal control, Uncertain systems
Abstract: Schrödinger bridge is a stochastic optimal control problem to steer a given initial state density to another, subject to controlled diffusion and deadline constraints. A popular method to numerically solve the Schrödinger bridge problems, in both classical and in the linear system settings, is via contractive fixed point recursions. These recursions can be seen as dynamic versions of the well-known Sinkhorn iterations, and under mild assumptions, they solve the so-called Schrödinger systems with guaranteed linear convergence. In this work, we study a priori estimates for the contraction coefficients associated with the convergence of respective Schrödinger systems. We provide new geometric and control-theoretic interpretations for the same. Building on these newfound interpretations, we point out the possibility of improved computation for the worst-case contraction coefficients of linear SBPs by preconditioning the endpoint support sets.
|
|
FrB20 Regular Session, Pier 8 |
Add to My Program |
Observers for Nonlinear Systems |
|
|
Chair: Bainier, Gustave | Université De Lorraine |
Co-Chair: Raïssi, Tarek | Conservatoire National Des Arts Et Métiers |
|
13:30-13:45, Paper FrB20.1 | Add to My Program |
Confidently Incorrect: Nonlinear Observers with Online Error Bounds |
|
Bunton, Jonathan | University of California, Los Angeles |
Tabuada, Paulo | University of California at Los Angeles |
Keywords: Observers for nonlinear systems, Estimation, Nonlinear output feedback
Abstract: Feedback control typically relies on an estimate of the system state provided by an estimation scheme. These estimates, however, are always affected by errors that have non-negligible impacts on control performance. Various stabilizing and safety-critical control frameworks address this issue, but all require some characterization of the current estimation error to determine when to apply more or less conservative control inputs. Current methods of bounding these errors either take a very coarse worst-case bound or employ computationally expensive time-varying set-valued methods. This paper fills the missing gap in these works, presenting new deterministic worst-case error bounds for a state estimation scheme for generic nonlinear systems. Crucially, these error bounds can be efficiently computed in real-time and shrink or grow depending on the current system behavior and the current measurement quality. These new, lightweight, ``online'' error bounds can directly interface with the aforementioned measurement-robust control frameworks, resulting in less conservative control actions while retaining safety and stability guarantees.
|
|
13:45-14:00, Paper FrB20.2 | Add to My Program |
Moving-Horizon Estimators for Hyperbolic and Parabolic PDEs in 1-D |
|
Bhan, Luke | University of California, San Diego |
Shi, Yuanyuan | University of California San Diego |
Karafyllis, Iasson | National Technical University of Athens |
Krstic, Miroslav | University of California, San Diego |
Rawlings, James B. | University of California, Santa Barbara |
Keywords: Lyapunov methods, Observers for nonlinear systems
Abstract: Observers for PDEs are themselves PDEs. Therefore, producing real time estimates with such observers is computationally burdensome. For both finite-dimensional and ODE systems, moving-horizon estimators (MHE) are operators whose output is the state estimate, while their inputs are the initial state estimate at the beginning of the horizon as well as the measured output and input signals over the moving time horizon. In this paper we introduce MHEs for PDEs which remove the need for a numerical solution of an observer PDE in real time. We accomplish this using the PDE backstepping method which, for certain classes of both hyperbolic and parabolic PDEs, produces moving-horizon state estimates explicitly. Precisely, to explicitly produce the state estimates, we employ a backstepping transformation of a hard-to-solve observer PDE into a target observer PDE, which is explicitly solvable. The MHEs we propose are not new observer designs but simply the explicit MHE realizations, over a moving horizon of arbitrary length, of the existing backstepping observers. Our PDE MHEs lack the optimality of the MHEs that arose as duals of MPC, but they are given explicitly, even for PDEs. In the paper we provide explicit formulae for MHEs for both hyperbolic and parabolic PDEs, as well as simulation results that illustrate theoretically guaranteed convergence of the MHEs.
|
|
14:00-14:15, Paper FrB20.3 | Add to My Program |
Interval State Estimation Based on Ellipsoid for Wastewater Treatment Bioprocess |
|
Zhou, Meng | North China University of Technology |
Wu, Yan | North China University of Technology |
Wang, Jing | North China University of Technology |
Xue, Tonglai | North China University of Technology |
Raïssi, Tarek | Conservatoire National Des Arts Et Métiers |
Keywords: Observers for nonlinear systems, Fuzzy systems, Biological systems
Abstract: In this paper, a two-stage state interval estimation method is proposed for the basic process of microbial growth in wastewater treatment based on an L∞ observer and set-membership technique. Firstly, the continuous-time nonlinear microbial growth model is converted to a discrete time Takagi-Sugeno (T-S) fuzzy system to deal with nonlinearities. Next, an L∞ T-S fuzzy observer is designed for the generated T-S fuzzy uncertain system to generate the state point estimation, then the interval bounds of state estimation error is calculated by combining with ellipsoidal analysis. Furthermore, the interval estimation of the state for the bioprocess in wastewater treatment can be derived from the point estimate of the state and the range of error in state estimation. Ultimately, the effectiveness of the proposed approach of the interval state estimation for wastewater treatment bioprocess is confirmed through simulation.
|
|
14:15-14:30, Paper FrB20.4 | Add to My Program |
Sampled Data Radial Basis Function Neural Network Observer Design for Nonlinear Vehicle Dynamics |
|
Abdl Ghani, Hasan | University of Evry Val D'Essonne |
Ahmed Ali, Sofiane | Université d'Evry Val d'Essonne, 23 Boulevard François Mitterran |
Laghmara, Hind | INSA Rouen Normandie |
Ainouz, Samia | INSA Rouen Normandie |
Khemmar, Redouane | ESIGELEC, IRSEEM |
Keywords: Observers for nonlinear systems, Neural networks, Autonomous systems
Abstract: Accurately estimating the lateral velocity of automatic ground vehicles is a complex task, especially when faced with sensor-sampled measurements and unfamiliar mathematical models. In order to overcome these difficulties, the study presented here proposes a novel approach that makes use of a sampled-data neural network observer. In order to fill in the information gap between successive samples, a compensating injector is introduced to the continuous state observer on which the observer is based. In order to replicate unknown dynamic vehicle systems, a radial basis function neural network is also implemented. A special weight update mechanism is used to update the weights continually. The Lyapunov methodology is used to demonstrate the stability of the suggested method. Experimental findings validate the effectiveness of the sampled-data neural network observer, providing promising insights for improving lateral velocity estimation and enhancing the control and stability of autonomous vehicle systems.
|
|
14:30-14:45, Paper FrB20.5 | Add to My Program |
Bezier Controllers and Observers for Takagi-Sugeno Models |
|
Bainier, Gustave | Université De Lorraine |
Marx, Benoit | University of Lorraine |
Ponsart, Jean-Christophe | Université De Lorraine |
Keywords: Fuzzy systems, Observers for nonlinear systems, LMIs
Abstract: This paper presents Bézier controller and observer designs for T-S models with n local models. These designs are based on the m-th multi-sum generalization of the Parallel Distributed Compensation (PDC) and non-PDC control laws, but where a Bézier interpolation of the gain matrices is considered: the gain matrices are weighted by multivariate Bernstein polynomials of the activation functions. This reduces the number of gains from n^m to (m+n-1)!/m!(n-1)! without hindering the capabilities of the control law. For quadratic and nonquadratic Lyapunov functions, the resulting stabilization problems can be solved using simple LMIs. Some examples are provided to illustrate numerically the reduced conservatism of the optimization problems compared to the usual PDC and non-PDC approaches.
|
|
14:45-15:00, Paper FrB20.6 | Add to My Program |
Observer-Based Stabilization of Lipschitz Nonlinear Systems by Using a New Matrix-Multiplier Based LMI Approach |
|
Mohite, Shivaraj | Research Assitant, RPTU, Kaiserslautern, Germany |
Alma, Marouane | CRAN Lorraine University |
Zemouche, Ali | CRAN UMR CNRS 7039 & Université De Lorraine |
Keywords: Nonlinear output feedback, LMIs, Observers for nonlinear systems
Abstract: This letter deals with observer-based control design for a class of Lipschitz nonlinear systems with nonlinear outputs. Based on the use of Lipschitz property and Young inequality in convenient ways, a novel LMI-based design technique is proposed. The method is also mainly based on exploiting new matrix-multiplier techniques, which allow the involvement of extra decision variables in the LMI conditions while improving the feasibility of the proposed LMI conditions. All these mathematical tools, used in a judicious manner, made it possible to obtain less conservative LMI conditions compared to previous LMIs existing in the literature. Furthermore, the established approach ensures a real-time ISS bound on the observer-based stabilization error. The validity and superiority of the developed methodology are validated through a numerical example.
|
|
FrB21 Regular Session, Pier 3 |
Add to My Program |
Lyapunov Methods |
|
|
Chair: Sforni, Lorenzo | Alma Mater Studiorum - Università Di Bologna |
Co-Chair: Poveda, Jorge I. | University of California, San Diego |
|
13:30-13:45, Paper FrB21.1 | Add to My Program |
Receding Horizon CBF-Based Multi-Layer Controllers for Safe Trajectory Generation |
|
Sforni, Lorenzo | Alma Mater Studiorum - Università Di Bologna |
Notarstefano, Giuseppe | University of Bologna |
Ames, Aaron D. | California Institute of Technology |
Keywords: Lyapunov methods, Optimal control, Autonomous systems
Abstract: In this paper, we present a safe trajectory generation strategy for multi-layer control architectures. We develop a high-level, continuous-time trajectory generation strategy based on optimal control, which ensures the satisfaction of safety-critical constraints via Control Barrier Functions (CBFs). The proposed strategy leverages a receding horizon CBF-based optimal control problem formulation that, as the prediction horizon goes to infinity, generates system trajectories equivalent to the solution of the original (constrained) optimal control problem. Conversely, as the horizon approaches zero, the resulting trajectory is equivalent to the one obtained by applying a safety filter to the optimal (unconstrained) controller. Instrumental to our results is a novel characterization of CBFs in the context of control invariance of safe sets. The proposed approach is realized through a multi-layer implementation on a unicycle system in the context of autonomous navigation.
|
|
13:45-14:00, Paper FrB21.2 | Add to My Program |
Characterizing Smooth Safety Filters Via the Implicit Function Theorem |
|
Cohen, Max | California Institute of Technology |
Ong, Pio | California Institute of Technology |
Bahati, Gilbert | California Institute of Technology |
Ames, Aaron D. | California Institute of Technology |
Keywords: Lyapunov methods, Constrained control, Stability of nonlinear systems
Abstract: Optimization-based safety filters, such as control barrier function (CBF) based quadratic programs (QPs), have demonstrated success in controlling autonomous systems to achieve complex goals. These CBF-QPs can be shown to be continuous, but are generally not smooth, let alone continuously differentiable. In this paper, we present a general characterization of smooth safety filters -- smooth controllers that guarantee safety in a minimally invasive fashion -- based on the Implicit Function Theorem. This characterization leads to families of smooth universal formulas for safety-critical controllers that quantify the conservatism of the resulting safety filter, the utility of which is demonstrated through illustrative examples.
|
|
14:00-14:15, Paper FrB21.3 | Add to My Program |
Stabilization under Arbitrary Tight and One Sided Control Constraints: A Variational Equations Approach |
|
Kolmanovsky, Ilya V. | The University of Michigan |
Garone, Emanuele | Université Libre De Bruxelles |
Keywords: Lyapunov methods, Constrained control, Stability of nonlinear systems
Abstract: Stabilization of a linear system under control constraints is approached by combining the classical variation of parameters method for solving ODEs and a straightforward construction of a feedback law for the variational system based on a quadratic Lyapunov function. Sufficient conditions for global closed-loop stability under control constraints with zero in the interior and zero on the boundary of the control set are derived, and several examples are reported. The extension of the method to nonlinear systems with control constraints is described.
|
|
14:15-14:30, Paper FrB21.4 | Add to My Program |
On Fixed-Time Stability for a Class of Singularly Perturbed Systems Using Composite Lyapunov Functions |
|
Tang, Michael | University of California, San Diego |
Krstic, Miroslav | University of California, San Diego |
Poveda, Jorge I. | University of California, San Diego |
Keywords: Lyapunov methods, Stability of nonlinear systems, Optimization algorithms
Abstract: Fixed-time stable dynamical systems are capable of achieving exact convergence to an equilibrium point within a fixed time that is independent of the initial conditions of the system. This property makes them highly appealing for designing control, estimation, and optimization algorithms in applications with stringent performance requirements. However, the set of tools available for analyzing the interconnection of fixed-time stable systems is rather limited compared to their asymptotic counterparts. In this paper, we address some of these limitations by exploiting the emergence of multiple time scales in nonlinear singularly perturbed dynamical systems, where the fast dynamics and the slow dynamics are fixed-time stable on their own. By extending the so-called composite Lyapunov method from asymptotic stability to the context of fixed-time stability, we provide a novel class of Lyapunov-based sufficient conditions to certify fixed-time stability in a class of singularly perturbed dynamical systems. The results are illustrated, analytically and numerically, using a fixed-time gradient flow system interconnected with a fixed-time plant and an additional high-order example.
|
|
14:30-14:45, Paper FrB21.5 | Add to My Program |
Compositionally Verifiable Vector Neural Lyapunov Functions for Stability Analysis of Interconnected Nonlinear Systems |
|
Liu, Jun | University of Waterloo |
Meng, Yiming | University of Illinois Urbana-Champaign |
Fitzsimmons, Maxwell | University of Waterloo |
Zhou, Ruikun | University of Waterloo |
Keywords: Lyapunov methods, Learning, Formal verification/synthesis
Abstract: While there has been increasing interest in using neural networks to compute Lyapunov functions, verifying that these functions satisfy the Lyapunov conditions and certifying stability regions remain challenging due to the curse of dimensionality. In this paper, we demonstrate that by leveraging the compositional structure of interconnected nonlinear systems, it is possible to verify neural Lyapunov functions for high-dimensional systems beyond the capabilities of current satisfiability modulo theories (SMT) solvers using a monolithic approach. Our numerical examples employ neural Lyapunov functions trained by solving Zubov's partial differential equation (PDE), which characterizes the domain of attraction for individual subsystems. These examples show a performance advantage over sums-of-squares (SOS) polynomial Lyapunov functions derived from semidefinite programming.
|
|
14:45-15:00, Paper FrB21.6 | Add to My Program |
Optimal Recursive Terminal Sliding-Mode Control Using Super-Twisting Algorithm for Improving High Efficiency and Reliability of Pump Systems |
|
Nassiri, Samir | Engineering for Smart and Sustainable Systems Research Center, M |
Labbadi, Moussa | Aix-Marseille University, LIS UMR CNRS 7020, Marseille, France |
Chatri, Chakib | Engineering for Smart and Sustainable Systems Research Center, M |
Cherkaoui, Mohamed | Engineering for Smart and Sustainable Systems Research Center, M |
Keywords: Lyapunov methods, Optimal control, Optimization
Abstract: In this letter, we propose an optimal recursive terminal sliding-mode control (ORTSMC) combined with super-twisting algorithm (STA) for a pump system under uncertainties. The main objective of the approach developed is to ensure rapid convergence of the pumping system with minimal power losses. To calculate the optimal input parameters of the pump system, a quantum particle swarm optimization algorithm (QPSO) is used. Next, we introduce a non-linear sliding variable into the cost function of the linear quadratic regulator (LQR). This proposal, along with the ORTSM manifold, aims to achieve fast convergence, dynamic stability, and minimize energy consumption. Additionally, the STA is employed to enhance performance during the reaching phase and reduce the chattering problem. The stability of the closed-loop control system is guaranteed using the Lyapunov theory. Finally, we conduct a comparative simulation analysis with two existing control schemes to demonstrate the superiority and effectiveness of our proposed control strategy.
|
|
FrC01 Invited Session, Metro E/C |
Add to My Program |
Convergence Behavior and Applications in Iterative Learning Control |
|
|
Chair: Koscielniak, Shane | TRIUMF |
Co-Chair: Bristow, Douglas A. | Missouri University of Science & Technology |
Organizer: Bristow, Douglas A. | Missouri University of Science & Technology |
Organizer: Koscielniak, Shane | TRIUMF |
|
15:30-15:45, Paper FrC01.1 | Add to My Program |
Observations on Causal Iterative-Learning-Control & Transients |
|
Koscielniak, Shane | TRIUMF |
Keywords: Iterative learning control, Adaptive control, Linear systems
Abstract: Iterative Learning Control (ILC) is a technique for adaptive feed-forward control of electro-mechanical plant. This paper and companion deals with ILC behaviors encountered before the widespread adoption of Q-ILC, the quadratic optimization. This paper explains, for the first time, the structural causes of ``bad learning transients'' for causal learning in terms of the cumulant iteration matrix - which can only be constructed by the method of forward-substitution. This paper underscores the importance of the linear weighted-sums of the column elements of the iteration matrix, and their relation to the convergence of sum of squares and Parseval's theorem. These criteria have the advantage that no model is required; the measured impulse response is sufficient information. Finally, the paper reminds readers that there are also wave-like (soliton) solutions of the ILC equations that may occur even when all convergence criteria are satisfied.
|
|
15:45-16:00, Paper FrC01.2 | Add to My Program |
Observations on Noncausal Iterative-Learning-Control & Transients |
|
Koscielniak, Shane | TRIUMF |
Keywords: Iterative learning control, Adaptive control, Linear systems
Abstract: Iterative Learning Control (ILC) is a technique for adaptive feed-forward control of electro-mechanical plant. We consider the simpler form of ILC, without quadratic optimization. This paper, for the first time, explains the structural causes of ``bad learning transients'' for noncausal learning in terms of their eigen-system properties. This paper demonstrates how to apply the z-transform monotonic convergence criteria to noncausal learning. These criteria have an enormous advantage over the matrix formulation because the algorithm scales as N^2 (or smaller) versus N^3, where N is the length of the column vector containing the time series.
|
|
16:00-16:15, Paper FrC01.3 | Add to My Program |
Constrained Reinforcement Learning for Building Demand Response |
|
Sanchez, Jerson | University of Oklahoma |
Cai, Jie | University of Oklahoma |
Keywords: Iterative learning control, Building and facility automation, Smart grid
Abstract: This paper presents a constrained reinforcement learning-based control strategy for building demand response. Compared to conventional (unconstrained) reinforcement learning (RL) controllers where indoor comfort constraints are addressed by adding a comfort violation penalty in the reward function, the proposed strategy handles the constraints explicitly, by upper bounding the expected cumulative constraint violation, to avoid the use of arbitrarily set penalty factors that can significantly affect control performance. To demonstrate its efficacy, simulation tests of the proposed strategy as well as baseline model predictive controllers (MPC) and conventional (unconstrained) policy optimization methods were conducted. The simulation tests show that the constrained RL strategy achieved utility cost savings of up to 22%, similar to the MPC baselines, with minimum constraint violation, while the unconstrained RL controllers led to either high utility costs or constraint violations, depending on the penalty factor setting.
|
|
16:15-16:30, Paper FrC01.4 | Add to My Program |
Iterative Learning Control of Direct Write Additive Manufacturing Using Online Process Monitoring (I) |
|
Urbanski, Christopher J. | University of Illinois at Urbana-Champaign |
Alleyne, Andrew G. | University of Minnesota |
Keywords: Iterative learning control, Manufacturing systems
Abstract: The spatial and dimensional errors that arise during fabrication using extrusion-based additive manufacturing (AM) methods like direct write printing inhibit manufacturing parts with increased geometric fidelity. Part fidelity can be improved by applying control strategies to correct geometric errors detected by directly measuring the material placement. This work presents a process monitoring and control strategy for AM that reduces the geometric errors in parts while they are fabricated. A laser scanner integrated into the AM system directly measures the deposited material in situ during fabrication, but not in real time, while the measurements are processed concurrently to determine the material's spatial placement and bead width errors online. Models relating the deposition process inputs to the resulting part geometry are combined with an Iterative Learning Control (ILC) algorithm to compensate for the measured geometric errors. The proposed strategy is implemented on a direct write printing system to monitor and control the bead width in 3D periodic functionally graded scaffolds. Here, the ILC algorithm uses the online measurements to learn the errors in the structure's repetitive elements as they are printed, then corrects the errors in subsequently fabricated elements. The experimental results show that the proposed process monitoring and control strategy reduced errors in the material bead width by 61–78% during scaffold fabrication.
|
|
16:30-16:45, Paper FrC01.5 | Add to My Program |
Artificial Neural Network Based ILC with Application to Stroke Rehabilitation (I) |
|
Sun, Xiaoru | University of Southampton |
Freeman, Christopher T. | University of Southampton |
Keywords: Iterative learning control, Machine learning, Control applications
Abstract: This paper develops a model-free iterative learning control (ILC) approach that combines gradient descent and an artificial neural network (ANN) for application to a general class of nonlinear discrete-time systems. The algorithm recursively trains the ANN using all previous data collected from the system and employs a passivity condition to determine when the ANN can be used to compute the next ILC update, or whether an identification test is needed. Convergence properties are derived, as well as design choices that satisfy the passivity condition. By reducing the need to perform identification tests, the approach is shown to be significantly faster than existing model-free ILC algorithms. It is tested on a key stroke rehabilitation problem using functional electrical stimulation (FES) for hand/wrist tracking. Results using the new ILC approach show that 4 references can be tracked using only 24.8% of the experiments required by conventional ILC algorithms.
|
|
16:45-17:00, Paper FrC01.6 | Add to My Program |
L∞ Bounds for Transient Growth in Repetitive and Iterative Learning Control Systems (I) |
|
Bristow, Douglas A. | Missouri University of Science & Technology |
Singler, John | Missouri University of Science and Technology |
Keywords: Iterative learning control
Abstract: This paper revisits the problem of large transient growth in Iterative Learning Control (ILC) and Repetitive Process Control (RPC) systems. In ILC and RPC problems a process is repeated iteratively, with new control calculations occurring in between each iteration. Large transient growth refers to the propensity of some control algorithms to grow error exponentially before eventually converging. While robust monotonic convergence algorithms (in which monotonic convergence is guaranteed usually in exchange for a small loss in performance) have largely eliminated the concern for large transient growth in ILC, similar results cannot always be obtained in RPC. The emergence of additive manufacturing processes as an important RPC problem, in which each iteration is a layer of deposition, encourages the revisit to large transient growth. Using time-bounded convolution operations, we show here new results for bounding large transient growth with causal ILC and RPC systems. The results show surprising new insights, such as guaranteed convergence, an exponential relationship between peak transient growth and time-length of the iteration, and faster than exponential convergence. The so-called lambda-norm, classically used in ILC analysis, is reconsidered with respect to the new results.
|
|
FrC02 Regular Session, Harbour |
Add to My Program |
Optimal Control II |
|
|
Chair: Borum, Andy | Vassar College |
Co-Chair: Gurpegui, Alba | Lund University |
|
15:30-15:45, Paper FrC02.1 | Add to My Program |
Poisoning Actuation Attacks against the Learning of an Optimal Controller |
|
Fotiadis, Filippos | Georgia Institute of Technology |
Kanellopoulos, Aris | KTH Royal Institute of Technology |
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Hugues, Jerome | Carnegie Mellon University / Software Engineering Institute |
Keywords: Optimal control, Linear systems, Learning
Abstract: In this paper, we study the problem of poisoning the learning of an optimal controller by means of an actuation attack. We specifically consider a user who is gathering data from a linear system in the form of input and state measurements, and who uses these data to learn an optimal controller. Nevertheless, these measurements are corrupted by an attacker who has access to the system's actuators, and who is using them to launch an actuation attack during the learning process. We design this actuation attack so that it optimally corrupts the data used by the user: it forces the user to learn as closely as possible a gain that the attacker has selected, and which is unrelated to the actual optimal control gain. We prove that this poisoning actuation attack design boils down to the solution of certain coupled matrix equations, which we solve using the block successive over-relaxation (SOR) iterative procedure. Simulations on an aircraft model demonstrate theoretical findings, showing how the poisoning attack is effective in misleading the user towards learning an incorrect gain for the system.
|
|
15:45-16:00, Paper FrC02.2 | Add to My Program |
Pointwise Sufficient Conditions for One-Dimensional Optimal Control Problems |
|
Borum, Andy | Vassar College |
Bretl, Timothy | Univ of Illinois, Urbana-Champaign |
Keywords: Optimal control, Linear systems
Abstract: In this paper, we consider optimal control problems with scalar states and inputs. For these problems, evaluating the second-order sufficient conditions for local optimality requires solving a time-varying linear Hamiltonian system. We describe two closed-form expressions for the solution of this linear system, one of which has appeared in previous literature, and one of which does not appear the standard literature on linear Hamiltonian systems. In the scalar problems that we consider, these expressions arise from a conserved quantity in the linear Hamiltonian system. Using these closed-form expressions, we derive a collection of sufficient conditions for local optimality. In contrast to most sufficient conditions for optimality, which require verifying a global condition along a stationary solution, the sufficient conditions that we establish in this paper depend on pointwise conditions.
|
|
16:00-16:15, Paper FrC02.3 | Add to My Program |
Modeling Model Predictive Control: A Category Theoretic Framework for Multistage Control Problems |
|
Hanks, Tyler | University of Florida |
She, Baike | Georgia Institute of Technology |
Patterson, Evan | Topos Institute |
Hale, Matthew | University of Florida |
Klawonn, Matthew | Air Force Research Laboratory, Information Directorate |
Fairbanks, James | University of Florida |
Keywords: Optimal control, Optimization
Abstract: Model predictive control (MPC) is an optimal control technique which involves solving a sequence of constrained optimization problems across a given time horizon. In this paper, we introduce a category theoretic framework for constructing complicated MPC problem formulations by composing subproblems. Specifically, we construct a monoidal category - called Para(Conv) - whose objects are Euclidean spaces and whose morphisms represent constrained convex optimization problems. We then show that the multistage structure of typical MPC problems arises from sequential composition in Para(Conv), while parallel composition can be used to model constraints across multiple stages of the prediction horizon. This framework comes equipped with a rigorous, diagrammatic syntax, allowing for easy visualization and modification of complex problems. Finally, we show how this framework allows a simple software realization in the Julia programming language by integrating with existing mathematical programming libraries to provide high-level, graphical abstractions for MPC.
|
|
16:15-16:30, Paper FrC02.4 | Add to My Program |
Minimax Linear Optimal Control of Positive Systems |
|
Gurpegui, Alba | Lund University |
Tegling, Emma | Lund University |
Rantzer, Anders | Lund University |
Keywords: Optimal control
Abstract: We present a novel class of minimax optimal control problems with positive dynamics, linear objective function and homogeneous constraints. The proposed problem class can be analyzed with dynamic programming and an explicit solution to the Bellman equation can be obtained, revealing that the optimal control policy (among all possible policies) is linear. This policy can in turn be computed through standard value iterations. Moreover, the feedback matrix of the optimal controller inherits the sparsity structure from the constraint matrix of the problem statement. This permits structural controller constraints in the problem design and simplifies the application to large-scale systems. We use a simple example of voltage control in an electric network to illustrate the problem setup.
|
|
16:30-16:45, Paper FrC02.5 | Add to My Program |
Privacy-Preserving Cloud Computation of Algebraic Riccati Equations |
|
Malladi, Surya | University of Groningen |
Monshizadeh, Nima | University of Groningen |
Keywords: Algebraic/geometric methods, Optimal control
Abstract: We address the problem of securely outsourcing the solution of algebraic Riccati equations (ARE) to a cloud. Our proposed method explores a middle ground between privacy preserving algebraic transformations and perturbation techniques, aiming to achieve simplicity of the former and strong guarantees of the latter. Specifically, we modify the coefficients of the ARE in such a way that the cloud computation on the modified ARE returns the same solution as the original one, which can be then readily used for control purposes. Notably, the approach obviates the need for any algebraic decoding step. We present privacy preserving algorithms with and without a realizability requirement, which asks for preserving sign-definiteness of certain ARE coefficients in the modified ARE. For the LQR problem, this amounts to ensuring that the modified ARE coefficients can be realized again as an LQR problem for a (dummy) linear system. The algorithm and its computational load is illustrated through a numerical example.
|
|
FrC03 Regular Session, Frontenac |
Add to My Program |
Robotics II |
|
|
Chair: Sharma, Nitin | North Carolina State University |
Co-Chair: Hashim, Hashim A | Carleton University |
|
15:30-15:45, Paper FrC03.1 | Add to My Program |
Dynamic Active Subspaces for Model Predictive Allocation in Over-Actuated Systems |
|
Singh, Mayank | North Carolina State Univeristy |
Lambeth, Krysten | North Carolina State University |
Iyer, Ashwin | North Carolina State University |
Sharma, Nitin | North Carolina State University |
Keywords: Robotics, Predictive control for nonlinear systems, Model/Controller reduction
Abstract: In this letter, we analyze dynamic optimization problem for robotic systems utilizing dynamic active subspaces (Dymathcal{AS}) to obtain a lower-dimensional control input space by performing a global sensitivity analysis. In doing so, we set up a Model Predictive Control Allocation (MPCA) problem wherein the actuators are dynamically allocated to track a desired stabilizing torque while satisfying state and control constraints. To improve computational efficiency of the MPCA, we develop Koopman operator-based linear prediction dynamics of an over-actuated nonlinear robotic system. We demonstrate the derived results on a hybrid neuroprosthesis model for a trajectory tracking task wherein we show a muscle fatigue-based joint torque allocation among motor and functional electrical stimulation (FES) actuators.
|
|
15:45-16:00, Paper FrC03.2 | Add to My Program |
Adaptive Backstepping and Non-Singular Sliding Mode Control for Quadrotor UAVs with Unknown Time-Varying Uncertainties |
|
Shevidi, Arezo | Carleton University |
Hashim, Hashim A | Carleton University |
Keywords: Robotics, Stability of nonlinear systems, Adaptive control
Abstract: This paper presents a novel quaternion-based nonsingular control system for underactuated vertical-take-off and landing (VTOL) Unmanned Aerial Vehicles (UAVs). Position and attitude tracking is challenging regarding singularity and accuracy. Quaternion-based Adaptive Backstepping Control (QABC) is developed to tackle the underactuated issues of UAV control systems in a cascaded way. Leveraging the virtual control (auxiliary control) developed in the QABC, desired attitude components and required thrust are produced. Afterwards, we propose Quaternion-based Sliding Mode Control (QASMC) to enhance the stability and mitigate chattering issues. The sliding surface is modified to avoid singularity compared to conventional SMC. To improve the robustness of controllers, the control parameters are updated using adaptation laws. Furthermore, the asymptotic stability of translational and rotational dynamics is guaranteed by utilizing Lyapunov stability and Barbalet Lemma. Finally, the comprehensive comparison results are provided to verify the effectiveness of the proposed controllers in the presence of unknown time-varying parameter uncertainties and significant initial errors.
|
|
16:00-16:15, Paper FrC03.3 | Add to My Program |
Optimized Control Invariance Conditions for Uncertain Input-Constrained Nonlinear Control Systems |
|
Brunke, Lukas | University of Toronto |
Zhou, Siqi | University of Toronto |
Che, Mingxuan | Technical University of Munich |
Schoellig, Angela P | Technical University of Munich & University of Toronto |
Keywords: Robotics, Uncertain systems
Abstract: Providing safety guarantees for learning-based controllers is important for real-world applications. One approach to realizing safety for arbitrary control policies is safety filtering. If necessary, the filter modifies control inputs to ensure that the trajectories of a closed-loop system stay within a given state constraint set for all future time, referred to as the set being positive invariant or the system behavior being safe. Under the assumption of fully known dynamics, safety can be certified using control barrier functions (CBFs). However, in practice, the dynamics model is often either unknown or only partially known. Learning-based methods have been proposed to approximate the CBF condition for unknown or uncertain systems from data; however, these techniques do not account for input constraints and, as a result, may not yield a valid CBF condition to render the safe set invariant. In this work, we study conditions that guarantee control invariance of the system under input constraints and propose an optimization problem to reduce the conservativeness of CBF-based safety filters. Building on these theoretical insights, we further develop a probabilistic learning approach that allows us to build a safety filter that guarantees safety for uncertain, input-constrained systems with high probability. We demonstrate the efficacy of our proposed approach in simulation and real-world experiments on a quadrotor and show that we can achieve safe closed-loop behavior for a learned system while satisfying state and input constraints.
|
|
16:15-16:30, Paper FrC03.4 | Add to My Program |
Human Torque Estimation for an LMI-Based Convex Control Rehabilitation Strategy Using Assistive Robots |
|
Ibarra, Jorge | LAMIH |
Moussa, Kaouther | INSA Hauts-De-France and LAMIH |
Lauber, Jimmy | Polytechnic University Hauts-De-France |
Keywords: LMIs, Estimation, Robotics
Abstract: The number of people affected by motor impairment has increased considerably in recent years, raising, in consequence, the interest in the use of assistive robotic devices for additional motricity and rehabilitation purposes. The main challenge for this kind of devices is dealing with the interaction between the human and the robot for a cooperative movement, especially in active rehabilitation schemes, where patients are incited to participate in the movement tasks, in order to increase efficiency of the rehabilitation protocol. A question that arises in this specific context is how to estimate human contribution in order to personalize the rehabilitation tasks. Current solutions being based on cumbersome measurement devices, this paper suggest an observer-based solution, allowing to estimate the human torque based on few dynamical measurements, in addition to an LMI-based computed-torque controller. This suggested scheme has been tested and validated using OpenSim software, which is widely used for biomechanical modeling, simulation and analysis.
|
|
16:30-16:45, Paper FrC03.5 | Add to My Program |
Optimizing Energy Efficiency with Configuration Constraints for AMR Trajectory Planning |
|
Chu, Jian | University of Texas at Austin |
Huang, Joey | The University of Texas at Austin |
Bakshi, Soovadeep | The University of Texas at Austin |
Zhu, Yongye | The University of Texas at Austin |
Ohman, Ethan | The University of Texas at Austin |
Chen, Dongmei | The University of Texas at Austin |
Keywords: Mechanical systems/robotics
Abstract: Autonomous Mobile Robots (AMRs) play a crucial role in transporting materials across expansive manufacturing facilities and warehouses. Their successful deployment relies on three major factors: task allocation, task scheduling, and trajectory planning. These processes collectively shape the efficiency and effectiveness of AMRs in complex manufacturing and warehouse environments. This study focuses on AMR trajectory planning, emphasizing energy efficiency beyond traditional methods. We present a physics-oriented AMR model and an optimal control strategy to generate energy-optimized routes. Through simulation studies across different scenarios, we evaluate the efficacy of diverse numerical solutions and compare two different AMR designs, one with Ackermann steering and the other with Mecanum steering. Our results indicate that the proposed approach yields a 5-10% energy advantage over traditional shortest-path algorithms, without compromising computational integrity and efficiency. The saving is more pronounced for the AMR with Ackermann steering. These findings are also validated with an experimental study.
|
|
16:45-17:00, Paper FrC03.6 | Add to My Program |
Trajectory Tracking and Disturbance Rejection for Euler-Lagrange Systems with High-Order Actuator Dynamics |
|
He, Changran | The Chinese University of Hong Kong |
Huang, Jie | The Chinese University of Hong Kong |
Keywords: Output regulation, Observers for nonlinear systems, Robotics
Abstract: In this paper, we study the trajectory tracking and disturbance rejection problem of a class of Euler-Lagrange (EL) systems with high-order actuator dynamics. This type of EL system takes into account not only the dynamics of the rigid component of the plant but also the dynamics of the actuators. Thus, the trajectory tracking and disturbance rejection problem for this type of EL system poses some specific challenges. Assuming that the disturbance is a multi-tone sinusoidal function, we first establish a nonlinear observer for the unknown disturbance based on the internal model principle. Then, we propose a control law through a backstepping-like design procedure for the EL system to solve the problem. A numerical example is provided to demonstrate the efficacy of the proposed approach.
|
|
FrC04 Regular Session, Metro W |
Add to My Program |
Autonomous Vehicles |
|
|
Chair: Ramadan, Mohammad | Argonne National Laboratory |
Co-Chair: Zemouche, Ali | CRAN UMR CNRS 7039 & Université De Lorraine |
|
15:30-15:45, Paper FrC04.1 | Add to My Program |
Developing Driving Strategies Efficiently: A Skill-Based Hierarchical Reinforcement Learning Approach |
|
Gurses, Yigit | Bilkent University |
Buyukdemirci, Kaan | Bilkent University |
Yildiz, Yildiray | Bilkent University |
Keywords: Autonomous vehicles, Hierarchical control, Machine learning
Abstract: Driving in dense traffic with human and autonomous drivers is a challenging task that requires high-level planning and reasoning. Human drivers can achieve this task comfortably, and there has been many efforts to model human driver strategies. These strategies can be used as inspirations for developing autonomous driving algorithms or to create high-fidelity simulators. Reinforcement learning is a common tool to model driver policies, but conventional training of these models can be computationally expensive and time-consuming. To address this issue, in this paper, we propose "skill-based" hierarchical driving strategies, where motion primitives, i.e. skills, are designed and used as high-level actions. This reduces the training time for applications that require multiple models with varying behavior. Simulation results in a merging scenario demonstrate that the proposed approach yields driver models that achieve higher performance with less training compared to baseline reinforcement learning methods.
|
|
15:45-16:00, Paper FrC04.2 | Add to My Program |
RNN Controller for Lane-Keeping Systems with Robustness and Safety Verification |
|
Quan, Yingshuai | Hanyang University |
Kim, Jin Sung | Hanyang University |
Chung, Chung Choo | Hanyang University |
Keywords: Autonomous vehicles, Neural networks, Robust control
Abstract: This paper proposes a Recurrent Neural Network (RNN) controller for lane-keeping systems, effectively handling model uncertainties and disturbances. First, quadratic constraints cover the nonlinearities brought by the RNN controller, and the linear fractional transformation method models the dynamics of system uncertainties. Second, we prove the robust stability of the lane-keeping system in the presence of uncertain vehicle speed using a linear matrix inequality. Then, we define a reachable set for the lane-keeping system. Finally, to confirm the safety of the lane-keeping system with tracking error bound, we formulate semidefinite programming to approximate the outer set of the reachable set. Numerical experiments demonstrate that this approach confirms the stabilizing RNN controller and validates the safety with an untrained dataset with untrained varying road curvatures.
|
|
16:00-16:15, Paper FrC04.3 | Add to My Program |
Radar Sensor-Based Longitudinal Motion Estimation by Using a Generalized High-Gain Observer |
|
Bessafa, Hichem | Université De Lorraine |
Belkhatir, Zehor | University of Southampton |
Delattre, Cedric | Université De Lorraine (IUT De Longwy) |
Khemmar, Redouane | ESIGELEC, IRSEEM |
Zemouche, Ali | CRAN UMR CNRS 7039 & Université De Lorraine |
Rajamani, Rajesh | Univ. of Minnesota |
Keywords: Autonomous vehicles, Observers for nonlinear systems, LMIs
Abstract: This study explores vehicle longitudinal dynamic estimation using a noisy radar sensor. By incorporating additional velocity information, we propose an improved generalized high-gain observer that ensures exponential Input to State Stability (ISS) of estimation errors with explicit bound. The observer of this work deals with the extra measurement differently than our recent paper, that does not account for noisy measurement. The observer outperforms standard high gain in convergence speed, accuracy, and noise rejection. The proposed algorithm is tested and validated using a tracking scenario designed using the CARLA simulation environment. It is shown through the results that the proposed observer outperforms the standard high-gain observer in terms of convergence speed, accuracy and noise rejection.
|
|
16:15-16:30, Paper FrC04.4 | Add to My Program |
A Control Approach for Nonlinear Stochastic State Uncertain Systems with Probabilistic Safety Guarantees |
|
Ramadan, Mohammad | Argonne National Laboratory |
Alsuwaidan, Mohammad | UCSD |
Atallah, Ahmed | University of California San Diego |
Herbert, Sylvia | UC San Diego (UCSD) |
Keywords: Autonomous vehicles, Randomized algorithms, Stochastic systems
Abstract: This paper presents an algorithm to apply nonlinear control design approaches to the case of stochastic systems with partial state observation. Deterministic nonlinear control approaches are formulated under the assumption of full state access and, often, relative degree one. We propose a control design approach that initially generates a control policy for nonlinear deterministic models with full state observation. The resulting control policy is then employed to construct an importance-like probability distribution over the space of control sequences which are to be evaluated for the true stochastic and state-uncertain dynamics. In the sampling step of a random search control optimization procedure, this distribution serves to focus the exploration effort on certain regions of the control space. The sampled control sequences are assigned costs determined by a prescribed finite-horizon performance and safety measure that considers stochastic dynamics. This sampling algorithm is parallelizable, exhibits computational complexity indifferent to the state dimension, and probabilistically guarantees safety over the prescribed prediction horizon. A numerical simulation is provided to compare the presented approach to the certainty equivalence controller.
|
|
16:30-16:45, Paper FrC04.5 | Add to My Program |
Trajectory-Tracking Hybrid Prescribed-Time Control for Wheeled Mobile Robots with Disturbances |
|
Rodriguez-Arellano, Jesus Abraham | Instituto Politecnico Nacional |
Miranda Colorado, Roger | Consejo Nacional De Ciencia Y Tecnologia CONACYT |
Aguilar, Luis T. | Instituto Politecnico Nacional |
Keywords: Autonomous vehicles, Robotics, Variable-structure/sliding-mode control
Abstract: This manuscript presents a prescribed-time control for a wheeled mobile robot in trajectory-tracking tasks under the effect of kinematic disturbances, such as skidding and slipping. The control strategy aims to track a desired trajectory in a prescribed time despite any arbitrary initial condition by implementing a hybrid controller encompassed by time-varying state feedback and a twisting controller. The hybrid control structure compensates for the effect of the disturbances and attains trajectory tracking in prescribed time by performing a coordinate transformation, which facilitates its implementation. Furthermore, a comparison with finite-time and feedback controllers is conducted to assess the hybrid controller's performance. To this end, numerical simulations employing Matlab-Simulink were performed, demonstrating the superiority of the novel methodology over current methodologies for trajectory-tracking tasks.
|
|
16:45-17:00, Paper FrC04.6 | Add to My Program |
Hierarchical Motion Planning and Offline Robust Model Predictive Control for Autonomous Vehicles |
|
Duy Nguyen, Hung | Automation and Control Institute (ACIN), TU Wien |
Vu, Minh Nhat | TU Wien |
Nam, Nguyen Ngoc | Kyungpook National University |
Han, Kyoungseok | Kyungpook National University |
Keywords: Autonomous vehicles, Robust control, Linear parameter-varying systems
Abstract: Driving vehicles in complex scenarios under harsh conditions is the biggest challenge for automated vehicles (AVs). To address this issue, we propose hierarchical motion planning and robust control strategy using the front active steering system in complex scenarios with various slippery road adhesion coefficients while considering vehicle uncertain parameters. Behaviors of human vehicles (HVs) are considered and modeled in the form of a car-following model via the Intelligent Driver Model (IDM). Then, in the upper layer, the motion planner first generates an optimal trajectory by using the artificial potential field (APF) algorithm to formulate any surrounding objects, e.g., road marks, boundaries, and static/dynamic obstacles. To track the generated optimal trajectory, in the lower layer, an offline-constrained output feedback robust model predictive control (RMPC) is employed for the linear parameter varying (LPV) system by applying linear matrix inequality (LMI) optimization method that ensures the robustness against the model parameter uncertainties. Furthermore, by augmenting the system model, our proposed approach, called offline RMPC, achieves outstanding efficiency compared to three existing RMPC approaches, e.g., offset-offline RMPC, online RMPC, and offline RMPC without an augmented model (offline RMPC w/o AM), in both improving computing time and reducing input vibrations.
|
|
FrC05 Regular Session, Pier 2 |
Add to My Program |
Computational Methods |
|
|
Chair: Hafstein, Sigurdur | University of Iceland |
Co-Chair: Yedavalli, Rama K. | Ohio State Univ |
|
15:30-15:45, Paper FrC05.1 | Add to My Program |
Lyapunov Functions for Switched Linear Systems: Proof of Convergence for an LP Computational Approach |
|
Hafstein, Sigurdur | University of Iceland |
Keywords: Computational methods, Lyapunov methods, Switched systems
Abstract: A recent approach uses linear programming (LP) to compute continuous and piecewise affine Lyapunov functions for arbitrary switched linear systems. Such a Lyapunov function is a common Lyapunov function for all the respective linear subsystems and asserts the exponential stability of the equilibrium at the origin for the switched system. In this paper, we prove that this LP approach is constructive, i.e., that it succeeds in computing a Lyapunov function for the switched system, whenever the origin is exponentially stable.
|
|
15:45-16:00, Paper FrC05.2 | Add to My Program |
A Necessary and Sufficient Condition for the Existence of Static Output Feedback Stabilization Gain Via Non-Lyapunov, Null Plant Matrix (NPM) Approach |
|
Yedavalli, Rama K. | Ohio State Univ |
Keywords: Computational methods, Stability of linear systems, Uncertain systems
Abstract: In this paper, with its IP protected contents, we present a complete solution to the problem of Static Output Feedback (SOF) Stabilization problem, which is touted as one of the unsolved problems in the stability theory of Linear Time Invariant State Space (LTISS) systems. We use a Non-Lyapunov philosophy, specifically labeled as the Transformation Allergic (TA) Approach (or philosophy). In this proposed TA Approach, the definitions of A^0 and the State Transition Matrix (STM) are quite different from the traditional Lyapunov/Routh-Hurwitz/Cayley Hamilton Theorem based Transformation Compliant (TC) methods. The complete solution to the SOF Stabilization problem is made possible using the concept of Convex Stability recently proposed in the sign pattern based TA Approach of this author, which in turn works with the new definitions for the A^0 matrix and the State Transition Matrix (STM) of any LTISS system, unencumbered by the popular eigenvalue and frequency domain based control theory of the current literature. In this paper, we give necessary and sufficient conditions for the Null Plant Matrix (NPM) LTISS system only, relegating the case of Non-NPM case (needing a different set of necessary and sufficient conditions), to a separate set of papers.
|
|
16:00-16:15, Paper FrC05.3 | Add to My Program |
Construction of Robust NCR for Input-Constrained Discrete Nonlinear Systems Using Backward Reachability |
|
Kothyari, Ashish | Indian Institute of Technology Bombay |
Bannerjee, Addyay | Electrical Engineering, Sapienza University of Rome, Italy |
Mhaskar, Prashant | McMaster University |
Keywords: Computational methods, Stability of nonlinear systems, Uncertain systems
Abstract: In this paper, we address the problem of constructing an under-approximation of the null-controllable region for input constrained discrete nonlinear systems with additive disturbances. The robust null-controllable region (RNCR) refers to the set of states for which robust stabilization is achievable subject to input constraints. In this paper, we propose a computationally tractable algorithm for computation of the robust null-controllable region which involves computation of backward reachable sets, i.e the set of states that can be driven to an given set of states in finite time, subject to disturbances and input constraints. The key ingredient in our RNCR region construction is the efficient computation of backward reachable sets without steps like sequential linearization, guessing of linearization error, etc which are essential part of state of the art backward reachability algorithms. Finally, we demonstrate the efficacy of our algorithm through numerical examples.
|
|
16:15-16:30, Paper FrC05.4 | Add to My Program |
Sensor Placement for Flapping Wing Model Using Stochastic Observability Gramians |
|
Boyacioglu, Burak | University of Nevada, Reno |
Babaei, Mahnoush | Carnegie Mellon University |
Mamo, Amanuel | University of Washington |
Bergbreiter, Sarah | Carnegie Mellon University |
Daniel, Thomas | University of Washington |
Morgansen, Kristi A. | University of Washington |
Keywords: Observers for nonlinear systems, Computational methods, Stochastic systems
Abstract: Systems in nature are stochastic as well as nonlinear. In traditional applications, engineered filters aim to minimize the stochastic effects caused by process and measurement noise. Conversely, a previous study showed that the process noise can reveal the observability of a system that was initially categorized as unobservable when deterministic tools were used. In this paper, we develop a stochastic framework to explore observability analysis and sensor placement. This framework allows for direct studies of the effects of stochasticity on optimal sensor placement and selection to improve filter error covariance. Numerical results are presented for sensor selection that optimizes stochastic empirical observability in a bioinspired setting.
|
|
16:30-16:45, Paper FrC05.5 | Add to My Program |
A Computation Governor for ADMM-Based MPC with Constraint Satisfaction and Setpoint Tracking |
|
van Leeuwen, Steven | Johns Hopkins University Applied Physics Lab |
Kolmanovsky, Ilya V. | The University of Michigan |
Keywords: Optimal control, Predictive control for linear systems, Computational methods
Abstract: Model Predictive Control (MPC) exploits the numerical solution of an Optimal Control Problem (OCP). In this paper, we consider the application of Alternating Direction Method of Multipliers (ADMM) to solving quadratic programs for linear-quadratic MPC. The ADMM algorithm may only achieve primal feasibility at convergence in the limit of an infinite number of iterations. Considering this, two strategies are developed which facilitate use of ADMM when only an inexact solution can be computed with a limited number of iterations per time step. These strategies involve constraint tightening and a computational governor which modifies the reference command in the MPC problem. Simulation examples are reported that illustrate the benefits of the proposed approaches.
|
|
16:45-17:00, Paper FrC05.6 | Add to My Program |
A Computational Framework for the Numerical Solution of Optimal Control Problems Governed by Partial Differential Equations |
|
Davies, Alexander | University of Florida |
Dennis, Miriam | Air Force Research Laboratory |
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 with time-dependent partial differential equations (PDEs) is presented. The optimal control problem is transformed from a continuous time and space optimal control problem to a sparse nonlinear programming problem through state parameterization with Lagrange polynomials and discrete controls defined at Legendre-Gauss-Radau (LGR) points. The standard LGR collocation method is coupled with a modified Radau method to produce a collocation point on the typically noncollocated boundary. The newly collocated endpoint allows for a representation of the state derivative and control on the originally noncollocated boundary such that Neumann boundary conditions may be satisfied. Finally, the method developed in this paper is demonstrated on a viscous Burgers' tracking problem and the results are compared to an existing solution.
|
|
FrC06 Regular Session, Queens Quay 1 |
Add to My Program |
Large-Scale Systems |
|
|
Chair: Boker, Almuatazbellah | Virginia Tech |
Co-Chair: Song, Ziyou | University of Michigan, Ann Arbor |
|
15:30-15:45, Paper FrC06.1 | Add to My Program |
Efficient Near-Optimal Control of Large-Size Second-Order Linear Time-Varying Systems |
|
Rustagi, Vishvendra | Virginia Tech |
Baddam, Vasanth Reddy | Virginia Tech |
Boker, Almuatazbellah | Virginia Tech |
Sultan, Cornel | Virginia Tech |
Eldardiry, Hoda | Virginia Tech |
Keywords: Large-scale systems, Linear systems, Optimal control
Abstract: Building on the two time-scale decomposition method, we propose a solution to the optimal control problem for second-order Linear Time-Varying (LTV) systems. This solution achieves convergence to that provided by standard numerical solvers such as Pontryagin’s Maximum Principle (PMP), and significantly enhances computational efficiency, making it applicable to large-size systems. We achieve this by developing closed-form solutions to the Continuous Algebraic Riccati Equations (CARE) for second- order systems. We also show through a spring-mass-damper system that our approach is significantly faster and more computationally efficient than standard methods.
|
|
15:45-16:00, Paper FrC06.2 | Add to My Program |
A Scalable Charging Algorithm for Heterogeneous EV Fleets Based on Clustering and Learning Methods |
|
Xu, Liangcai | National University of Singapore |
Gu, Xubo | National University of Singapore |
Song, Ziyou | University of Michigan, Ann Arbor |
Keywords: Large-scale systems, Optimal control, Machine learning
Abstract: As the number of electric vehicles (EVs) surges, the optimal real-time management of their charging processes poses a significant challenge. While centralized control methods have garnered attention for the potential to achieve global optimality, they are primarily suitable for small or medium-sized EV fleets due to their high computational costs. To harness the benefits of centralized control strategies more effectively, we introduce a novel clustering model, which is trained by learning substantial optimal scheduling datasets backward to categorize heterogenous EVs with similar charging power but distinct states in the dynamic charging processes. Subsequently, a scalable optimal charging strategy is developed by efficiently managing distinct groups of vehicles identified by the clustering model, rather than individual EVs. This approach significantly reduces the control dimension without substantially impairing performance. Simulation results validate that when compared to the centralized charging strategy, the proposed charging strategy achieves similar performance, with only a 1.33% increase in total charging costs in the case where 100 random EVs participate in energy and ancillary electricity markets, and notably, compared to benchmark method, the computational cost of the proposed method is reduced by 99.8%.
|
|
16:15-16:30, Paper FrC06.4 | Add to My Program |
Exploring Non-Submodular Scheduling for Large-Scale Sensor Networks |
|
Vafaee, Reza | Northeastern University |
Siami, Milad | Northeastern University |
Keywords: Large-scale systems, Sensor networks, Kalman filtering
Abstract: This paper addresses the intricate issue of non-submodular sensor scheduling within the context of large-scale linear time-varying dynamics. The problem involves optimizing the configuration of sensors, a task that is inherently combinatorial, non-convex, and NP-hard. We delve into the utility of a simple greedy algorithm for problem resolution. We provide evidence of the algorithm's effectiveness by presenting an approximation bound for its solutions based on the submodularity and curvature concepts. It is shown that the proposed approximation bound outperforms the competitors in the literature through a discussion on a simple setup. The paper culminates in a comprehensive set of simulation results, which validate the theoretical underpinnings.
|
|
16:30-16:45, Paper FrC06.5 | Add to My Program |
Data-Driven Moment-Based Control of Linear Ensemble Systems |
|
Vu, Minh | Washington University in St. Louis |
Singhal, Bharat | Washington University in St. Louis |
Li, Jr-Shin | Washington University in St. Louis |
Zeng, Shen | Washington University in St. Louis |
Keywords: Linear parameter-varying systems, Large-scale systems, Identification for control
Abstract: The problem of controlling ensembles of similar dynamical systems appears in many scientific domains, ranging from quantum physics and neuroscience to robotic engineering. These applications have led to the development of a variety of ensemble control methods. These methods, although effective, rely on a critical assumption, namely, the availability of an accurate parametric model for the entire population. In this paper, we relax such assumptions and present a data-driven framework for designing both open-loop and feedback control schemes for ensemble systems, which only uses the measurement of a small number of subsystems within the population. We validate our approach through numerical analysis and simulation, showing its effectiveness in regulating large populations with just a few of their subsystems measured.
|
|
16:45-17:00, Paper FrC06.6 | Add to My Program |
Mean Field Limits for Discrete-Time Dynamical Systems Via Kernel Mean Embeddings |
|
Fiedler, Christian | RWTH Aachen University |
Herty, Michael | RWTH Aachen University |
Trimpe, Sebastian | RWTH Aachen University |
Keywords: Mean field games, Large-scale systems, Optimal control
Abstract: Mean field limits are an important tool in the context of large scale dynamical systems, in particular, when studying multiagent and interacting particle systems. While the continuous-time theory is well-developed, few works have considered mean field limits for deterministic discrete-time systems, which are relevant for the analysis and control of large scale discrete time multiagent system. We prove existence results for the mean field limit of very general discrete-time control systems, for which we utilize kernel mean embeddings. These results are then applied in a typical optimal control setup, where we establish the mean field limit of the relaxed dynamic programming principle. Our results can serve as a rigorous foundation for many applications of mean field approaches for discrete-time dynamical systems.
|
|
FrC07 Regular Session, Queens Quay 2 |
Add to My Program |
Automotive Control |
|
|
Chair: Benciolini, Tommaso | Technical University of Munich |
Co-Chair: Ghasemi, Masood | Worcester Polytechnic Institute |
|
15:30-15:45, Paper FrC07.1 | Add to My Program |
Mobility Control of an In-Wheel-Motor Electric Vehicle in Severe Off-Road Terrain Conditions |
|
Ghasemi, Masood | Worcester Polytechnic Institute |
Vantsevich, Vladimir | Worcester Polytechnic Institute |
Moradi, Lee | The University of Alabama at Birmingham |
Gorsich, David | U.S. Army Tank Automotive Res, Dev & Engr Center (TARDEC) |
Cole, Michael | The U.S. Army Ground Vehicle Systems Center |
Keywords: Automotive control, Hierarchical control, Variable-structure/sliding-mode control
Abstract: This paper investigates a control design problem for an electric vehicle (EV) with in-wheel-motor (IWM) powertrains to enhance its mobility in severe off-road terrain conditions. The proposed methodology uses a hierarchical design architecture including three layers. The upper-level vehicle trajectory control is a model-free design and is based on the sliding mode control (SMC) technique. In the mid-level, the tire-terrain terramechanics attributes are considered. Specifically, weighted independent control channels are identified how different tire forces contribute to vehicle navigation. Thus, a constrained optimal allocation problem is solved considering vehicle mobility that distribute the upper-level control in terms of tires' circumferential forces. In the lower-level, the tires' circumferential forces are reproduced using an integrated control design for wheel force tracking and electric motor operations. Finally, the design is verified through a numerical simulation and its efficacy and robustness are demonstrated.
|
|
15:45-16:00, Paper FrC07.2 | Add to My Program |
Power Losses Aware Nonlinear Model Predictive Control Design for Active Cell Balancing |
|
Uppal, Ali Arshad | COMSATS University Islamabad |
Syed, Bilal Javed | COMSATS University Islamabad |
Ahmed, Qadeer | The Ohio State University |
Keywords: Automotive control, Optimal control, Predictive control for nonlinear systems
Abstract: Active cell balancing guarantees good performance, slow degradation, and long life of a battery pack. In this paper a high-fidelity model, considering the static and dynamic parameters, is developed for computing the balancing currents and power losses of an active cell balancing network (ACBN). The model comprises any two adjacent Li-ion cells connected in series and a buck-boost converter. This model is employed to design a nonlinear model predictive controller (NMPC), which minimizes the balancing speed and power losses of ACBN. The cells’ state of charge (SoC) required for NMPC is estimated by a state dependent Kalman filter (SDKF). The control scheme is solved using CasADi toolbox, employing the interior point optimizer (Ipopt) algorithm. The robust evaluation shows that the difference in SoC of cells stays in a legitimate range of |2|%, despite the modeling uncertainties, sensors’ noises, and input disturbance. Moreover, it has been shown that for the same controller, there is a 46% deviation in the balancing time if static and dynamic model parameters (e.g. charging and discharging path resistances, time delays, and time constants) are ignored.
|
|
16:00-16:15, Paper FrC07.3 | Add to My Program |
Stability Analysis and Control Design for Automated Vehicles Based on Data-Aided Model Augmentation |
|
Nemeth, Balazs | SZTAKI Institute for Computer Science and Control |
Lelkó, Attila | SZTAKI Institute for Computer Science and Control |
Hegedus, Tamas | Institute for Computer Science and Control (SZTAKI) |
Gaspar, Peter | SZTAKI |
Keywords: Automotive control, Linear parameter-varying systems
Abstract: This paper focuses on the stability analysis and control design methods for systems which contain data-driven elements. The motivation of the work is to bridge the gap between the results of physical models and experiments that are found during vehicle tests. It is presented a data-aided model augmentation method, which improves the accuracy of the formulated system model. Due to the incorporation of data-driven state observer, the resulted augmented model is a set of discrete time linear systems in a Linear Parameter Varying (LPV) structure. It is developed a control synthesis method for the formulated system, which results in a controller with two loops. It is also provided a stability analysis method for the closed-loop system based on the parameter-memorized approach. The developed method are applied to steering control design for automated vehicles, in which problem reinforcement learning is used for achieving the state observer. This paper presents the training of the observer, the augmentation of the physical model, the results of the control design and the stability analysis through a simulation example.
|
|
16:15-16:30, Paper FrC07.4 | Add to My Program |
Weakly Coupled Systems of Eikonal Equations in Path-Planning Problems |
|
Teresa, Maria | Queen's Univerisity |
Czuprynski, Kenneth | The Pennsylvania State University |
Zikatanov, Ludmil | National Science Foundation |
Keywords: Automotive control, Simulation, Optimal control
Abstract: In this paper, we study solutions for a weakly coupled system of eikonal equations arising in an optimal path-planning problem with random breakdown. The model considered takes into account two types of breakdown for the vehicle, partial and total, which happen at a known, spatially inhomogeneous rate. In particular, we analyze the complications due to the delicate degenerate coupling condition by using existing results on weakly coupled systems of Hamilton-Jacobi equations. Then we consider finite element method schemes built for convection-diffusion problems to construct approximate solutions for this system and produce some numerical simulations.
|
|
16:30-16:45, Paper FrC07.5 | Add to My Program |
Combining Belief Function Theory and Stochastic Model Predictive Control for Multi-Modal Uncertainty in Autonomous Driving |
|
Benciolini, Tommaso | Technical University of Munich |
Yan, Yuntian | Technical University of Munich |
Wollherr, Dirk | Technische Universität München |
Leibold, Marion | TU Muenchen |
Keywords: Automotive control, Stochastic optimal control, Automotive systems
Abstract: In automated driving, predicting and accommodating the uncertain future motion of other traffic participants is challenging, especially in unstructured environments in which the high-level intention of traffic participants is difficult to predict. Several possible uncertain future behaviors of traffic participants must be considered, resulting in multi-modal uncertainty. We propose a novel combination of Belief Function Theory and Stochastic Model Predictive Control for trajectory planning of the autonomous vehicle in presence of significant uncertainty in the intention estimation of traffic participants. A misjudgment of the intention of traffic participants may result in dangerous situations. At the same time, excessive conservatism must be avoided. Therefore, the measure of reliability of the estimation provided by Belief Function Theory is used in the design of collision-avoidance safety constraints, in particular to increase safety when the intention of traffic participants is not clear. We discuss two methods to leverage on Belief Function Theory: we introduce a novel belief-to-probability transformation designed not to underestimate unlikely events if the information is uncertain, and a constraint tightening mechanism using the reliability of the estimation. We evaluate our proposal through simulations comparing to state-of-the-art approaches.
|
|
16:45-17:00, Paper FrC07.6 | Add to My Program |
Distributed Road-Map Monitoring Using Onboard Sensors |
|
Zhang, Yanyu | University of California, Riverside |
Greiff, Marcus Carl | Mitsubishi Electric Research Laboratries |
Ren, Wei | University of California, Riverside |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Keywords: Automotive systems, Autonomous systems
Abstract: Road maps for vehicle control and navigation systems are typically generated by mapping systems that are highly accurate but updated infrequently. However, changes to the roads are made at a higher frequency. Stored road maps may therefore not capture the true road well. To resolve this, we consider online road-map estimation using the type of sensors found in production cars. The map estimation for a given vehicle is based on a global positioning system, camera, steering wheel, and wheel-speed sensors. As each vehicle covers a limited amount of road, we leverage crowdsourced map estimates from multiple vehicles to get a more complete representation of the road map. High-fidelity simulation results indicate a reduction of the estimation error of roughly 15% when using 5 agents compared to the best single agent. Furthermore, we show that the method is capable of updating map segments that have large errors, for example, as may occur during road maintenance.
|
|
FrC08 Regular Session, Bay |
Add to My Program |
Control Applications II |
|
|
Chair: Parkinson, Christian | University of Arizona |
Co-Chair: Labbadi, Moussa | Aix-Marseille University, LIS UMR CNRS 7020, Marseille, France |
|
15:30-15:45, Paper FrC08.1 | Add to My Program |
An Efficient Semi-Real-Time Algorithm for Path Planning in the Hamilton-Jacobi Formulation |
|
Parkinson, Christian | University of Arizona |
Polage, Kyle | Washington State University |
Keywords: Control applications, Optimization algorithms, Optimal control
Abstract: We present a semi-real-time algorithm for minimal-time optimal path planning based on optimal control theory, dynamic programming, and Hamilton-Jacobi (HJ) equations. Partial differential equation (PDE) based optimal path planning methods are well-established in the literature, and provide an interpretable alternative to black-box machine learning algorithms. However, due to the computational burden of grid-based PDE solvers, many previous methods do not scale well to high dimensional problems and are not applicable in real-time scenarios even for low dimensional problems. We present a semi-real-time algorithm for optimal path planning in the HJ formulation, using grid-free numerical methods based on Hopf-Lax formulas. In doing so, we retain the intepretablity of PDE based path planning, but because the numerical method is grid-free, it is efficient and does not suffer from the curse of dimensionality, and thus can be applied in semi-real-time and account for realistic concerns like obstacle discovery. This represents a significant step in averting the tradeoff between interpretability and efficiency. We present the algorithm with application to synthetic examples of isotropic motion planning in two-dimensions, though with slight adjustments, it could be applied to many other problems.
|
|
15:45-16:00, Paper FrC08.2 | Add to My Program |
Intra-Cavity Control of an Adaptive Thin-Disk Laser with Multiple Pneumatically Actuated Deformable Mirrors |
|
Heining, André | University of Stuttgart |
Esser, Stefan | Institut Für Strahlwerkzeuge (IFSW), University of Stuttgart, Pf |
Mrzyglod, Stephanie | Universität Stuttgart |
Abdou Ahmed, Marwan | Universität Stuttgart, Institut Für Strahlwerkzeuge |
Graf, Thomas | Institut Für Strahlwerkzeuge (IFSW), University of Stuttgart, Pf |
Sawodny, Oliver | University of Stuttgart |
Keywords: Control applications, PID control, Mechatronics
Abstract: We report on the closed-loop controlled operation of a thin-disk laser oscillator with adaptive beam radii. Using two pneumatically actuated deformable intra-cavity mirrors in combination with a sophisticated control strategy, we present a framework for controlling the beam radii at two different positions in the cavity. The beam radius at the laser crystal is kept constant in order to ensure single-transverse mode operation while the beam radius at the end mirror is adjusted to be able to tune the fluence of the intra-cavity beam at that position for the purpose of demonstration. The framework covers a description of the derived cavity model written in a matrix formalism and gives details on the cascaded control structure. Finally, a first experimental validation of this closed-loop control approach is presented.
|
|
16:00-16:15, Paper FrC08.3 | Add to My Program |
An Agent-Based Behavioral Change Model with Behavioral Intervention Control Techniques |
|
Fernandes, Keegan | University of Waterloo |
Davison, Daniel E. | University of Waterloo |
Wang, David | Univ. of Waterloo |
Keywords: Control applications, Simulation, Agents-based systems
Abstract: Human behavior is complicated and can be difficult to predict. In this paper we use an agent-based model to predict behavioral change. This model is based on sociological and psychological theories such as reasoned action, conformity, internal biases, and outcome feedback. This model is used to simulate and evaluate the effectiveness of different behavioral intervention control techniques. A sufficient criteria is developed for allowing an external source of influence (i.e. a control agent) to be able to change agents' behaviors. Control techniques investigated via simulation are as follows: ``one to all", ``influencer", ``rotating", ``targeted belief", ``targeted behavior", ``targeted low bias", and a ``targeted high bias" approach. From the simulations the ``targeted belief", ``targeted behavior", and ``rotating" approaches show the most promise with a large increase in agent behavior. The ``targeted bias" simulations indicate that targeting individuals with low bias is more effective than those with high bias, knowledge of which can be used in further studies.
|
|
16:15-16:30, Paper FrC08.4 | Add to My Program |
Multi-Population Mean Field Games with Multiple Major Players: Application to Carbon Emission Regulations |
|
Dayanikli, Gokce | University of Illinois Urbana-Champaign |
Lauriere, Mathieu | NYU Shanghai |
Keywords: Mean field games, Stochastic optimal control, Control applications
Abstract: In this paper, we propose and study a mean field game model with multiple populations of minor players and multiple major players, motivated by applications to the regulation of carbon emissions. Each population of minor players represent a large group of electricity producers and each major player represents a regulator. We first characterize the minor players' equilibrium controls using forward-backward differential equations, and show existence and uniqueness of the minor players' equilibrium. We then express the major players' equilibrium controls through analytical formulas given the other players' controls. Finally, we provide a method to solve the Nash equilibrium between all the players, and we illustrate numerically the sensitivity of the model to its parameters.
|
|
16:30-16:45, Paper FrC08.5 | Add to My Program |
Extremum Seeking Control Techniques for Antenna Pointing |
|
Shore, Scott | University of New Mexico |
Lane, Steven | Air Force Research Laboratory |
Danielson, Claus | University of New Mexico |
Keywords: Control applications
Abstract: This paper considers the application of extremum-seeking control (ESC) to the problem of ground station antenna pointing to maximize the received power. We compare three ESC algorithms from the literature: batch least square (BLS), recursive least squares with exponential forgetting factor (eRLS), and classical ESC (CESC). The three ESC algorithms are also compared with an existing algorithm from the field conical scan (CONSCAN). We present the models for the ground station dynamics, transmitting satellite motion, and received power developed from the literature. The four algorithms are compared under three different simulation scenarios: a static optimum point, a static optimum point with noise on the received power, and tracking a moving optimum point. The static scenario evaluates algorithm performance under ideal conditions. The perturbation scenario adds noise to the power measurements. Finally, the tracking scenario considers a more realistic scenario where the optimum pointing is changing due to satellite motion.
|
|
16:45-17:00, Paper FrC08.6 | Add to My Program |
Design of an Easy-To-Implement Fixed-Time Stable Sliding Mode Control |
|
Labbadi, Moussa | Aix-Marseille University, LIS UMR CNRS 7020, Marseille, France |
Incremona, Gian Paolo | Politecnico Di Milano |
Ferrara, Antonella | University of Pavia |
Keywords: Variable-structure/sliding-mode control
Abstract: This letter introduces a new methodology for the design and tuning of sliding mode controllers with fixed-time stability property for a class of second-order uncertain nonlinear systems. Exploiting the Gauss error function, a novel sliding variable is designed, giving rise to a new control law, whose the main strengths are its ease of implementation and robustness. Indeed, differently from other fixed-time stable techniques in the literature, it only requires the tuning of two design parameters in order to ensure fixed-time convergence, while making the controlled system robust in front of disturbance and uncertainty terms. The properties of the closed-loop systems are theoretically analysed, and the effectiveness of the proposal is shown in simulation on a benchmark example.
|
|
FrC09 Regular Session, Dockside 1 |
Add to My Program |
Data-Driven Modeling and Control |
|
|
Chair: Zinage, Vrushabh | University of Texas at Austin |
Co-Chair: Seiler, Peter | University of Michigan, Ann Arbor |
|
15:30-15:45, Paper FrC09.1 | Add to My Program |
Data-Driven Control of Adaptive Cruise Control Systems Using Differential Flatness and Gaussian Processes |
|
Jeloka, Bhavini | Georgia Institute of Technology |
Nicolau, Florentina | Ensea Cergy |
Saoud, Adnane | University Mohammed VI Polytechnic |
Banavar, Ravi N. | Indian Institute of Technology |
Keywords: Stability of nonlinear systems, Robust control, Uncertain systems
Abstract: This paper develops a novel control methodology for the adaptive cruise control system under external, unknown dynamics to attain set point regulation. The approach employs differential flatness for controller design, along with Gaussian Processes to estimate the unknown components in the dynamics. In order to ensure robustness to this data-driven technique, a robust control law is also introduced, that further exploits the Gaussian Process framework.The error dynamics is shown to converge to zero with high probability. Numerical experiments to support the results are presented.
|
|
15:45-16:00, Paper FrC09.2 | Add to My Program |
Big Data-Driven Predictive Control Using Multi-View Clustering |
|
Han, Shuangyu | University of New South Wales |
Yan, Yitao | University of New South Wales |
Bao, Jie | The University of New South Wales |
Huang, Biao | Univ. of Alberta |
Keywords: Behavioural systems, Subspace methods
Abstract: This work presents a big data-driven predictive control (BDPC) approach using multi-view clustering to approximate nonlinear system behaviors (represented by a set of input-output variable trajectories) with local linear sub-behaviors (represented by Hankel matrices). The nonlinear behavior space is partitioned based on two views: Euclidean distance of trajectories, and the angle of linear subspaces that trajectories belong to. Subsequently, a BDPC controller is designed to locate the online trajectory into the most relevant linear sub-behavior and determine control actions subject to optimization in every receding horizon. Finally, the BDPC approach is illustrated using an example of controlling the Hall-Heroult process.
|
|
16:00-16:15, Paper FrC09.3 | Add to My Program |
Data-Driven Safety Filter: An Input-Output Perspective |
|
Bajelani, Mohammad | The University of British Columbia |
van Heusden, Klaske | University of British Columbia |
Keywords: Identification for control, Predictive control for linear systems, Behavioural systems
Abstract: Implementation of learning-based control remains challenging due to the absence of safety guarantees. Safe control methods have turned to model-based safety filters to address these challenges, but this is paradoxical when the ultimate goal is a model-free, data-driven control solution. Addressing the core question of ``Can we ensure the safety of any learning-based algorithm without explicit prediction models and state estimation?'' this paper proposes a Data-Driven Safety Filter (DDSF) grounded in Behavioral System Theory (BST). The proposed method needs only a single system trajectory available in an offline dataset to modify unsafe learning inputs to safe inputs. This contribution addresses safe control in the input-output framework and therefore does not require full state measurements or explicit state estimation. Since no explicit model is required, the proposed safe control solution is not affected by unmodeled dynamics and unstructured uncertainty and can provide a safe solution for deterministic Linear Time-Invariant (LTI) systems with unknown time delays. The effectiveness of the proposed DDSF is illustrated in simulation for a high-order six-degree-of-freedom aerial robot and a time-delay adaptive cruise control system.
|
|
16:15-16:30, Paper FrC09.4 | Add to My Program |
Optimality of POD for Data-Driven LQR with Low-Rank Structures |
|
Newton, Rachel | University of Michigan |
Du, Zhe | University of Michigan |
Seiler, Peter | University of Michigan, Ann Arbor |
Balzano, Laura | University of Michigan |
Keywords: Model/Controller reduction, Optimal control, Identification
Abstract: The optimal state-feedback gain for the Linear Quadratic Regulator (LQR) problem is computationally costly to compute for high-order systems. Reduced-order models (ROMs) can be used to compute feedback gains with reduced computational cost. However, the performance of this common practice is not fully understood. This letter studies this practice in the context of data-driven LQR problems. We show that, for a class of LQR problems with low-rank structures, the controllers designed via their ROM, based on the Proper Orthogonal Decomposition (POD), are indeed optimal. Experimental results not only validate our theory but also demonstrate that even with moderate perturbations on the low-rank structure, the incurred suboptimality is mild.
|
|
16:30-16:45, Paper FrC09.5 | Add to My Program |
Data-Driven Controller Synthesis Via Finite Abstractions with Formal Guarantees |
|
Ajeleye, Daniel | University of Colorado Boulder |
Lavaei, Abolfazl | Newcastle University |
Zamani, Majid | University of Colorado Boulder |
Keywords: Supervisory control, Hybrid systems, Quantized systems
Abstract: Construction of finite-state abstractions (a.k.a. symbolic abstractions) is a promising approach for formal verification and controller synthesis of complex systems. Finite-state abstractions provide simpler models that can replicate the behaviors of original complex systems. These abstractions are usually constructed by leveraging precise knowledge of systems' dynamics, which is often unknown in real-life applications. In this work, we develop a data-driven technique for constructing finite abstractions for continuous-time control systems with unknown dynamics. In our data-driven context, we collect samples from trajectories of unknown systems to construct finite abstractions with a guarantee of correctness. We propose a data-based gridding method to efficiently determine state-set discretization parameters while minimizing the expected number of transitions in the abstraction construction, thus reducing computational efforts. By establishing a feedback refinement relationship between an unknown system and its data-driven finite abstraction, one can design a controller over the data-driven finite abstraction. The controller can then be refined back to the original unknown system to meet a desired property of interest. We illustrate our proposed data-driven approach using a vehicle motion planning benchmark.
|
|
FrC10 Regular Session, Dockside 2 |
Add to My Program |
Neural Networks |
|
|
Chair: Sivaranjani, S | Purdue University |
Co-Chair: Saoud, Adnane | University Mohammed VI Polytechnic |
|
15:30-15:45, Paper FrC10.1 | Add to My Program |
Lyapunov-Based Long Short-Term Memory (Lb-LSTM) Neural Network-Based Adaptive Observer |
|
Griffis, Emily | University of Florida |
Patil, Omkar Sudhir | University of Florida |
Hart, Rebecca | University of Florida |
Dixon, Warren E. | University of Florida |
Keywords: Neural networks, Adaptive control, Lyapunov methods
Abstract: Long short-term memory (LSTM) neural networks excel at capturing short- and long-term dependencies, making them powerful tools for system identification and state estimation. Their unique design improves memory capabilities by retaining important information and discarding irrelevant data over time. However, due to mathematical challenges involved in developing adaptive control methods for LSTMs, their training is predominantly limited to offline methods. This paper develops a Lyapunov-based (Lb-) LSTM observer for state estimation in nonlinear systems. The Lb-LSTM weights adapt in real-time using Lyapunov-based stability-driven adaptation laws. A nonsmooth Lyapunov-based stability analysis ensures state estimation error convergence and stability of the overall Lb-LSTM architecture. To validate the developed observer design, simulations were performed to estimate the unknown angular velocity states of a two-link robot manipulator. The developed method yielded a 41.13% improvement in the root mean square estimation error when compared to an adaptive RNN observer.
|
|
15:45-16:00, Paper FrC10.2 | Add to My Program |
Lyapunov-Based Physics-Informed Long Short-Term Memory (LSTM) Neural Network-Based Adaptive Control |
|
Hart, Rebecca | University of Florida |
Griffis, Emily | University of Florida |
Patil, Omkar Sudhir | University of Florida |
Dixon, Warren E. | University of Florida |
Keywords: Neural networks, Adaptive control, Stability of nonlinear systems
Abstract: Deep neural networks (DNNs) and long short-term memory networks (LSTMs) have grown in recent popularity due to their function approximation performance when compared to traditional NN architectures. However, the predictions that may result from these networks often do not align with physical principles. This paper introduces the first physics-informed LSTM (PI-LSTM) controller composed of DNNs and LSTMs, where the weight adaptation laws are designed from a Lyapunov-based analysis. The developed PI-LSTM combines DNNs and LSTMs for the purpose of function approximation and memory while respecting the underlying system physics. Simulations were performed to demonstrate feasibility and resulted in a root mean square tracking error of 0.0185 rad and a 33.76% improvement over the baseline method.
|
|
16:00-16:15, Paper FrC10.3 | Add to My Program |
Recurrent Neural Network ODE Output for Classification Problems Follows the Replicator Dynamics |
|
Barreiro-Gomez, Julian | New York University Abu Dhabi (NYUAD) |
Poveda, Jorge I. | University of California, San Diego |
Keywords: Neural networks, Game theory, Machine learning
Abstract: This paper establishes a novel relationship between a class of recurrent neural networks and certain evolutionary dynamics that emerge in the context of population games. Specifically, it is shown that the output of a recurrent neural network, in the context of classification problems, coincides with the evolution of the population state in a population game. This connection is established via replicator evolutionary dynamics with dynamic payoffs. The connection provides insights into the neural network’s behavior from both dynamical systems and game-theoretical perspectives and aligns with recent literature suggesting that the outputs of neural networks may exhibit similarities to the Nash equilibria of suitable games. It also uncovers potential connections between the neural network classification problem and mechanism design. The results are illustrated via different numerical examples.
|
|
16:15-16:30, Paper FrC10.4 | Add to My Program |
Learning Dissipative Neural Dynamical Systems |
|
Xu, Yuezhu | Purdue University |
Sivaranjani, S | Purdue University |
Keywords: Neural networks, Identification for control, Nonlinear systems identification
Abstract: Consider an unknown nonlinear dynamical system that is known to be dissipative. The objective of this paper is to learn a neural dynamical model that approximates this system, while preserving the dissipativity property in the model. In general, imposing dissipativity constraints during neural network training is a hard problem for which no known techniques exist. In this work, we address the problem of learning a dissipative neural dynamical system model in two stages. First, we learn an unconstrained neural dynamical model that closely approximates the system dynamics. Next, we derive sufficient conditions to perturb the weights of the neural dynamical model to ensure dissipativity, followed by perturbation of the biases to retain the fit of the model to the trajectories of the nonlinear system. We show that these two perturbation problems can be solved independently to obtain a neural dynamical model that is guaranteed to be dissipative while closely approximating the nonlinear system.
|
|
16:30-16:45, Paper FrC10.5 | Add to My Program |
Safety Verification of Neural-Network-Based Controllers: A Set Invariance Approach |
|
Jouret, Louis | EPFL |
Saoud, Adnane | University Mohammed VI Polytechnic |
Olaru, Sorin | CentraleSupélec |
Keywords: Neural networks
Abstract: This paper presents a novel approach to ensure the safety of continuous-time linear dynamical systems controlled by a neural network (NN) based state-feedback. Our method capitalizes on the use of continuous piece-wise affine (PWA) activation functions (e.g. ReLU) which render the NN a PWA continuous function. By computing the affine regions of the latter and applying Nagumo's theorem, a subset of boundary points can effectively verify the invariance of a potentially non-convex set. Consequently, an algorithm that partitions the state space in affine regions is proposed. The scalability of our approach is thoroughly analyzed, and extensive tests are conducted to validate its effectiveness.
|
|
16:45-17:00, Paper FrC10.6 | Add to My Program |
Multi-Class Temporal Logic Neural Networks |
|
Li, Danyang | Boston University |
Tron, Roberto | Boston University |
Keywords: Formal verification/synthesis, Neural networks, Network analysis and control
Abstract: Time-series data can represent the behaviors of autonomous systems, such as drones and self-driving cars. The task of binary and multi-class classification for time-series data has become a prominent area of research. Neural networks represent a popular approach to classifying data; However, they lack interpretability, which poses a significant challenge in extracting meaningful information from them. Signal Temporal Logic (STL) is a formalism that describes the properties of timed behaviors. We propose a method that combines all of the above: neural networks that represent STL specifications for multi-class classification of time-series data. We offer two key contributions: 1) We introduce a notion of margin for multi-class classification, and 2) we introduce STL-based attributes for enhancing the interpretability of the results. We evaluate our method on two datasets and compare it with state-of-the-art baselines.
|
|
FrC11 Regular Session, Dockside 3 |
Add to My Program |
Sampled-Data Control |
|
|
Chair: Ong, Pio | California Institute of Technology |
Co-Chair: Kim, Jung Hoon | Pohang Univeristy of Science and Technology |
|
15:30-15:45, Paper FrC11.1 | Add to My Program |
Data-Driven Retrospective-Cost-Based Adaptive Digital PID Control |
|
Chee, Yin Yong | University of Michigan Ann Arbor |
Paredes Salazar, Juan Augusto | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control, PID control, Sampled-data control
Abstract: This paper develops an adaptive digital controller for sampled-data systems with unknown dynamics. The adaptive digital PID controller is based on data-driven retrospective cost adaptive control (DDRCAC) with online closed-loop system identification. Online system identification is based on recursive least squares (RLS) with variable-rate forgetting (VRF), which is used to construct a target model that provides the controller based on retrospective cost adaptive control (RCAC) with the required modeling information. For SISO plants, this modeling information includes the sign of the leading numerator coefficient as well as nonminimum-phase (NMP) zeros. The present paper illustrates the performance of DDRCAC-based digital PID control on a first-order linear plant with unknown gain sign, a NMP second-order linear plant, and a multicopter with unknown dynamics.
|
|
15:45-16:00, Paper FrC11.2 | Add to My Program |
Sample-And-Hold Safety with Control Barrier Functions |
|
Bahati, Gilbert | California Institute of Technology |
Ong, Pio | California Institute of Technology |
Ames, Aaron D. | California Institute of Technology |
Keywords: Sampled-data control, Discrete event systems, Constrained control
Abstract: A common assumption on the deployment of safeguarding controllers on the digital platform is that high sampling frequency translates to a small violation of safety. This paper investigates and formalizes this assumption through the lens of Input-to-State Safety. From this perspective, and leveraging control barrier functions (CBFs), we propose an alternative solution for maintaining safety of sample-and-hold control systems without any violation to the original safe set. Our approach centers around modulating the sampled control input in order to guarantee a more robust safety condition. We analyze both the time-triggered and the event-triggered sample-and-hold implementations, including the characterization of sampling frequency requirements and trigger conditions. We demonstrate the effectiveness of our approach in the context of adaptive cruise control through simulations.
|
|
16:00-16:15, Paper FrC11.3 | Add to My Program |
Generalized Kernel Approximation Approach to L1 Control of Sampled-Data Systems |
|
Kwak, Dohyeok | POSTECH |
Kim, Jung Hoon | Pohang Univeristy of Science and Technology |
Hagiwara, Tomomichi | Kyoto Univ |
Keywords: Sampled-data control, Optimal control, Numerical algorithms
Abstract: This paper introduces a new approach to the L1 optimal control of sampled-data systems, in which the problem of minimizing their L∞-induced norm is concerned with. After establishing an operator-based representation of sampled-data systems via the lifting approach, the hold function of the output operator and the kernel function of the input operator are approximated by piecewise constant functions. More precisely, we divide the sampling interval [0, h) into M subintervals with an equal width, and take the freedom to select a point for each subinterval, at which Taylor expansions of the relevant functions are derived. This developed approach is regarded as a generalized version of the conventional kernel approximation (KA) approach, in which Taylor expansions are considered only at the beginning point for each subinterval. Based on the generalization, we derive a discretization procedure of the continuous-time plant in terms of the L1 optimal control. We then show that the discrete-time l1 optimal controller with respect to the discretized plant also approximately minimizes the L∞-induced norm of the original sampled-data system with the associated convergence rate of 1/M. It is further shown that taking the central point for each subinterval minimizes a relevant performance deterioration occurring from employing the generalized KA approach when the approximation parameter M is fixed.
|
|
16:15-16:30, Paper FrC11.4 | Add to My Program |
Robust Control Barrier Functions for Sampled-Data Systems |
|
Oruganti, Pradeep Sharma | The Ohio State University |
Naghizadeh, Parinaz | University of California, San Diego |
Ahmed, Qadeer | The Ohio State University |
Keywords: Robust control, Sampled-data control, Lyapunov methods
Abstract: This letter studies the problem of safe control of sampled-data systems under bounded disturbance and measurement errors with piecewise-constant controllers. To achieve this, we first propose the High-Order Doubly Robust Control Barrier Function (HO-DRCBF) for continuous-time systems where the safety enforcing constraint is of relative degree 1 or higher. We then extend this formulation to sampled-data systems with piecewise-constant controllers by bounding the evolution of the system state over the sampling period given a state estimate at the beginning of the sampling period. We demonstrate the proposed approach on a kinematic obstacle avoidance problem for wheeled robots using a unicycle model. We verify that with the proposed approach, the system does not violate the safety constraints in the presence of bounded disturbance and measurement errors.
|
|
16:30-16:45, Paper FrC11.5 | Add to My Program |
A Novel Switching Asynchronous Sampled-Data Scheme: Implementations in Interconnected Feedback Systems |
|
Wang, Xiaoyu | North China Electric Power University |
Xiao, Feng | North China Electric Power University |
Feng, Qian | North China Electric Power University |
Keywords: Networked control systems, Sampled-data control, Distributed control
Abstract: Sampled-data control is continually under research exploration and development to optimally coordinate the limited communication resources in networked control systems. In this paper, a novel switching asynchronous sampled-data framework with double-checking consisting of two distinct sampling schemes is proposed. An established method involves designing the switching sampling scheme with event-triggered and time-triggered mechanisms. We also introduce the concept of switching event-triggered control (SETC), by which a positive minimum sampling interval can be guaranteed effectively. By an integral method and Barbalat's Lemma, sufficient conditions that ensure the stability of interconnected linear systems are derived under the SETC. Numerical examples are presented to demonstrate the effectiveness of the proposed methodology.
|
|
FrC12 Regular Session, Dockside 9 |
Add to My Program |
Network Analysis and Control |
|
|
Chair: Aminzare, Zahra | University of Iowa |
Co-Chair: Bianchin, Gianluca | University of Louvain |
|
15:30-15:45, Paper FrC12.1 | Add to My Program |
Topology Reconstruction of Heterogeneous Networked Dynamical Systems with Unknown Input Matrices |
|
Sun, Weiyang | Zhejiang University |
Xu, Jinming | Zhejiang University |
Chen, Jiming | Zhejiang University |
Keywords: Network analysis and control, Identification, Subspace methods
Abstract: We consider the topology reconstruction problem of heterogeneous networked dynamical systems (HNDSs) with unknown input matrices. In particular, we aim to reconstruct a heterogeneous network comprising a state interaction network (SIN) and an external input network (EIN), which differs from most existing works where the EIN network is assumed to be known a priori when reconstructing the SIN network. To this end, we employ subspace analysis to establish necessary-and-sufficient conditions for ensuring the solvability of the topology reconstruction problem of heterogeneous networks. Moreover, we develop a sufficient condition based on coupled matrix equations (CMEs), which allows us to exactly reconstruct both the SIN and EIN networks of the HNDS system when the CMEs permit a unique solution. A numerical example is provided to verify the effectiveness of the proposed method.
|
|
15:45-16:00, Paper FrC12.2 | Add to My Program |
Cycle Families and Resilience of Dynamical Networks |
|
Bianchin, Gianluca | University of Louvain |
Delvenne, Jean-Charles | Universite Catholique De Louvain |
Keywords: Network analysis and control, Stability of linear systems, Control system architecture
Abstract: Dynamical network models are a flexible framework to describe groups of dynamical systems interacting through a network and have been widely used in several applications to model real-world systems, including transportation, communication, and biology. In this paper, we investigate the resilience of dynamical network models under structured perturbations of their edges. Given a linear dynamical network with the property that poles are confined to a prescribed region, we ask whether it is possible to compromise this property by perturbing a single communication edge. We prove that only a subset of the edges, if perturbed, could compromise stability and we provide a graph-theoretic characterization to determine these edges. Interestingly, our results show that only edges that belong to some cycles of the communication graph play a role in the considered measure of resilience, thus identifying cycles as the basic element that determines resilience in dynamical networks. The theoretical guarantees are illustrated through simulations applied to a nonlinear epidemic model.
|
|
16:00-16:15, Paper FrC12.3 | Add to My Program |
The Reactability of Discrete Time Systems |
|
Nazerian, Amirhossein | University of New Mexico |
Phillips, David | Office of Naval Research |
Frasca, Mattia | University of Catania |
Sorrentino, Francesco | University of New Mexico |
Keywords: Network analysis and control
Abstract: An important property of a dynamical system is its reactivity, i.e., the initial rate of growth of the norm of the state vector. However, most literature on reactivity has focused on continuous-time systems. Here we define the reactivity of discrete-time systems and apply it to characterize the dynamics of network systems and Markov chains. We also introduce the concept of reactability, which measures the ability of a system to be made reactive, under the condition that the system is stable. We identify certain properties of a system which provide minimal reactability. Then we formulate and solve two optimization problems that perturb an existing discrete-time system to make it minimally reactable.
|
|
16:15-16:30, Paper FrC12.4 | Add to My Program |
Neural Network Learning-Based Control for Nonlinear Systems with Time-Varying Powers |
|
Liu, Jianan | Southeast University |
Zhao, Long | Southeast University |
Li, Shihua | Southeast University |
Liu, Rongjie | Florida State University |
Keywords: Network analysis and control, Stability of nonlinear systems, Lyapunov methods
Abstract: This paper focuses on the design of a state feedback controller for nonlinear systems with time-varying powers that utilize neural network (NN) to approximate unknown nonlinear functions. The dual homogeneity-based control is designed to recursively set up a controller with time-varying monotone degrees and a set of recursive Lyapunov functions. Neural networks approximate complex nonlinear functions by stacking multiple linear and nonlinear layers and adjusting their weights and biases through training. Approximation theory is developed to illustrate the relationship between the sophisticated architecture of neural networks and the intrinsic structure of unknown nonlinear functions that require approximation. Under the designed dual homogeneity-based control approach, the considered nonlinear system is globally uniformly asymptotically stable and the neural network error analysis is performed on unknown functions.
|
|
16:30-16:45, Paper FrC12.5 | Add to My Program |
Stochastic Control on Large Networks: A Q-Noise Formulation |
|
Dunyak, Alexander | McGill University |
Caines, Peter E. | McGill University |
Keywords: Network analysis and control, Stochastic optimal control, Linear systems
Abstract: Solving linear quadratic Gaussian optimal control problems on large complex networks is computationally intractable and may be impossible due to data-collection costs or privacy concerns. Graphon theory provides an approach to overcome these issues by defining limit objects for infinite sequences of graphs permitting one to approximate arbitrarily large networks by infinite dimensional operators. By building on the foundations of Dunyak and Caines (2022), linear quadratic problems on graphon systems with Q-noise disturbances are defined and shown to be the limit of the finite graph optimal control problem. The result is demonstrated with a numerical example showing that even relatively small networks (N = 500) show this emergent limit behavior.
|
|
FrC13 Regular Session, Richmond |
Add to My Program |
Mechatronic Systems |
|
|
Chair: Gordon, David Carl | University of Alberta |
Co-Chair: Al Janaideh, Mohammad | University of Guelph |
|
15:30-15:45, Paper FrC13.1 | Add to My Program |
Motion Controller Design with Automatic Loop Shaping and Minimum Tracking Errors |
|
Hsiao, Tesheng | National Yang Ming Chiao Tung University |
Liu, Chih-Wei | National Yang Ming Chiao Tung University |
Keywords: Mechatronics, Mechanical systems/robotics, Linear systems
Abstract: Loop shaping is a widely applied technique for controller design. In particular, the frequency constrained time-domain optimization (FreCTO) controller uses a set of discrete frequency constraints for loop shaping and achieves excellent performance. However, manual loop shaping is inefficient and the result cannot be optimal. To solve this problem, this paper proposes a dual-loop automatic loop shaping algorithm. The inner loop minimizes tracking errors, boosts the bandwidth, and suppresses resonant peaks and “leakage of gains”, whereas the outer loop reduces the length of control parameters and adjusts the number of constraints while reserving the desired phase margin. Experiments on a biaxial table verify that the desired loop shape is automatically attained by the proposed algorithm, and the controller with automatic loop shaping outperforms the one with manual loop shaping.
|
|
15:45-16:00, Paper FrC13.2 | Add to My Program |
Introducing a Deep Neural Network-Based Model Predictive Control Framework for Rapid Controller Implementation |
|
Gordon, David Carl | University of Alberta |
Winkler, Alexander | RWTH Aachen University |
Bedei, Julian | RWTH Aachen University |
Schaber, Patrick | RWTH Aachen University |
Pischinger, Stefan | RWTH Aachen University |
Andert, Jakob | Institute for Combustion Engines |
Koch, Charles Robert | University of Alberta |
Keywords: Mechatronics, Optimal control, Machine learning
Abstract: Model Predictive Control (MPC) provides an optimal control solution based on a cost function while allowing for the implementation of process constraints. As a model-based optimal control technique, the performance of MPC strongly depends on the model used where a trade-off between model computation time and prediction performance exists. One solution is the integration of MPC with a machine learning (ML) based process model which are quick to evaluate online. This work presents the experimental implementation of a deep neural network (DNN) based nonlinear MPC for Homogeneous Charge Compression Ignition (HCCI) combustion control. The DNN model consists of a Long Short-Term Memory (LSTM) network surrounded by fully connected layers which was trained using experimental engine data and showed acceptable prediction performance with under 5% error for all outputs. Using this model, the MPC is designed to track the Indicated Mean Effective Pressure (IMEP) and combustion phasing trajectories, while minimizing several parameters. Using the acados software package to enable the real-time implementation of the MPC on an ARM Cortex A72, the optimization calculations are completed within 1.4 ms. The external A72 processor is integrated with the prototyping engine controller using a UDP connection allowing for rapid experimental deployment of the NMPC. The IMEP trajectory following of the developed controller was excellent, with a root-mean-square error of 0.133 bar, in addition to observing process constraints.
|
|
16:00-16:15, Paper FrC13.3 | Add to My Program |
Intention-Aware Reverse Passivity-Based Teleopeartion Stabilizer for Physical Human-(tele)Robot Interaction |
|
Zhou, Xingyuan | NYU |
Paik, Peter | New York University |
Atashzar, S. Farokh | New York University |
Keywords: Mechatronics, Robotics, Control of networks
Abstract: In networked robotic systems, specifically haptics-enabled teleoperation, ensuring stability and trackig performance is of paramount importance. Recently, several stabilizers have leveraged the concept of "excess of passivity" (EoP) from non-linear control theory to decode the dissipative energetic behavior of human biomechanics and to incorporate that in the design of the stabilizers. This is done to counterbalance the effect of energy accumulation in the system due to the suboptimal non-passive communication behavior (which includes delays, jitter and packet losses). However, the dissipative behavior of human biomechanics would naturally degrade the perceived force transparency/tracking when considering the "intended force" as the desired signal to be tracked. In other words, there is a ``force gap'' between the tracked forces and the intended forces. This is because parts of the energy production is compensated to move human biomechanics. This paper focuses on filling the gap by designing a networked robotic architecture that recovers parts of the dissipated active force of the operator so that the remote task is conducted according to the intended action of the operator rather than dissipated action. This goal that can significantly improve the perceived transparency of task conduction requires a reformulation of telerobotic architecture and the corresponding controllers. In this paper, we mathematically formulate a reverse telerobotic design and synthesize a new passivity-based stabilization, named here as Intention-aware reverse Time Domain Passivity-Based teleoperation stabilizer (ITDPB) so that system stability is guaranteed while perceived transparency is recovered. In addition, we conduct extensive grid simulations, comparing the results of our proposed stabilizer to the state-of-the-art approach. The results indicate that the proposed approach performs superior in terms of maximizing the ratio between the force intended by the user and the actual force transmitted to the environment while guaranteeing the system's stability. The proposed stabilizer is suitable for various telerobotic applications requiring accurate intentional force, such as telerehabilitation and telesurgery.
|
|
16:15-16:30, Paper FrC13.4 | Add to My Program |
Time-Aware Non-Uniform Rational Basis Spline (NURBS) |
|
Al-Rawashdeh, Yazan Mohammad | Memorial University of Newfoundland |
Heertjes, Marcel | Eindhoven University of Technology |
Al Janaideh, Mohammad | University of Guelph |
Keywords: Mechatronics
Abstract: Explicitly adopting time as a parameter, the definition of non-uniform rational basis spline profile known short as NURBS is revisited and updated. This results in another NURBS definition that is aware of time, and not only the geometry. Also, it can jointly exist as-is at the CAD-CAM side, and at the motion numeric controller side without resorting to segmentation, curve fitting, and interpolation techniques usually used when extracting motion information from the standard geometric NURBS profiles. This gives rise to the notion of "what you see is what you get" when the proposed NURBS definition is used. First, working at the jerk signal level and by using quadratic polynomials with time as the independent variable, quintic polynomials are obtained at the position level and are smoothly glued together to form the needed basis functions that facilitate introducing time-aware splines. Similarly, the trigonometric sine function is used to define another set of time-aware basis functions. Second, and as with standard NURBS, the herein-defined time-aware splines are extended and put into the rational polynomial form such that the proposed time-aware NURBS structure is revealed. Despite being normalized, the time signature used to define the basis functions persists once velocity, acceleration, and jerk profiles are obtained. At the coefficients level, these kinematical quantities are neatly written using vector notation that- with the aid of a developed algorithm- reduces the computation burden at the motion numeric controller side during real-time execution. This results in a smooth motion with reduced feedrate variation while adhering to any imposed kinematical constraints. The usefulness, and simplicity of the proposed approach is mainly demonstrated through numeric simulation, and experimental validation where the proposed concept of "what you see is what you get" is verified.
|
|
16:30-16:45, Paper FrC13.5 | Add to My Program |
Nonsmooth-Optimization-Based Bandwidth Optimal Control for Precision Motion Systems |
|
Wu, Jingjie | University of Wisconsin-Madison |
Zhou, Lei | University of Wisconsin-Madison |
Keywords: Optimal control, Mechatronics, PID control
Abstract: Precision motion systems are at the core of various manufacturing equipment. The rapidly increasing demand for higher productivity necessitates higher control bandwidth in the motion systems to effectively reject disturbances while maintaining excellent positioning accuracy. However, most existing optimal control methods do not explicitly optimize for control bandwidth, and the classic loop-shaping method suffers from conservative designs and fails to address cross-couplings, which motivates the development of new control solutions for bandwidth optimization. This paper proposes a novel bandwidth optimal control formulation based on nonsmooth optimization for precision motion systems. Our proposed method explicitly optimizes the system's MIMO control bandwidth while constraining the H-infinity norm of the closed-loop sensitivity function for robustness. A nonsmooth optimization solver, GRANSO, is used to solve the proposed program, and an augmented quadratic programming (QP)--based descent direction search is proposed to facilitate convergence. Simulation evaluations show that the bandwidth optimal control method can achieve a 23% higher control bandwidth than conventional loop-shaping design, and the QP-based descent direction search can reduce iteration number by 60%, which illustrates the effectiveness and efficiency of the proposed approach.
|
|
16:45-17:00, Paper FrC13.6 | Add to My Program |
Quasi Time-Optimal Path Tracking for Pneumatic Robots Considering Third-Order Actuator Constraints |
|
Kanagalingam, Gajanan | University of Stuttgart |
Hoffmann, Kathrin | University of Stuttgart |
Baumgärtner, Jan | Karlsruhe Institute of Technology |
Bertschinger, Bernd Markus | University Stuttgart |
Reichelt, Stephan | University of Stuttgart |
Fleischer, Jürgen | Karlsruhe Institute of Technology |
Sawodny, Oliver | University of Stuttgart |
Keywords: Robotics, Control applications, Mechatronics
Abstract: The class of pneumatic robots with rigid links and pneumatic actuators is well suited as collaborative robots because, unlike electric robots, they have direct drives. The low inertia of direct drives results in less energy having to be transferred in the event of a collision. However, pneumatic direct drives come with their own challenges. Due to the compressibility and the flow characteristics of air, the pressure build-up in such a drive has its own dynamics, depending on the current state of motion of the robot. These dynamics are not negligibly fast compared to the kinetics of the robot and need to be taken into account when generating trajectories for the robot to ensure their feasibility. This paper presents a model of a pneumatic actuator to account for the dynamics of its pressure build-up. Based on this model, a solution to the quasi time-optimal path tracking problem, i. e. generating trajectories to a given path, is given for a robot driven by such pneumatic actuators. The proposed approach to the quasi time-optimal path tracking problem is evaluated by executing the generated trajectory on a real pneumatic robot. From this experiment, it was found that the robot can execute the trajectory precisely, confirming its feasibility.
|
|
FrC14 Regular Session, Wellington |
Add to My Program |
Biological Systems |
|
|
Chair: Punta, Elisabetta | CNR-IEIIT |
Co-Chair: Stolpe, Phoebus Raphael | Maastricht University |
|
15:30-15:45, Paper FrC14.1 | Add to My Program |
Neuromimetic Dynamic Networks with Hebbian Learning |
|
Sun, Zexin | Boston University |
Baillieul, John | Boston Univ |
Keywords: Biological systems, Control of networks, Hybrid systems
Abstract: Continuing work on what we have called neuromimetic control system designs is reported. The focus here is on control system models in which the dynamics of networks of neuron-like states are governed by hybrid continuous/discrete, linear/nonlinear models. The models studied support Hebbian-like learning of network structure, and formal analysis grounded in graph theory and classical control allows us to prove that the biological model exhibits boundedness, stability, and structural controllability. The results make contact with previous results involving sym-cactus graphs. Simulations using a 14-node generalized sym-cactus network with two input types validate the model’s effectiveness in capturing key neural dynamics.
|
|
15:45-16:00, Paper FrC14.2 | Add to My Program |
Model Based Regulation of Thyroid Hormones in Patients with Hypothyroidism |
|
Srinivasan, Vittal | Purdue University |
Zak, Stanislaw H. | Purdue Univ |
Mariash, Cary | Indiana University |
Keywords: Biological systems, Predictive control for nonlinear systems, Observers for nonlinear systems
Abstract: A combined model predictive controller (MPC) and observer compensator is proposed to aid a physician in prescribing thyroid replacement therapy for patients with hypothyroidism. Hypothyroidism is a condition caused by underactive thyroid, where the thyroid gland is unable to produce a sufficient quantity of hormones. The thyroid malfunctioning could lead to other associated conditions like nausea, fatigue, heart conditions, high cholesterol, and elevated blood pressure. Thus, it is essential to ensure that the levels of thyroid hormones, Triiodothyronine ( T3) and Thyroxine ( T4), are at healthy levels. The production of these hormones is governed by the hypothalamus-pituitary-thyroid (HPT) axis, a part of the endocrine system. Hypothyroidism cannot be cured but can be regulated through medication. The standard practice to control hypothyroidism is to prescribe a constant daily dosage of synthetic T4 (Levothyroxine) and, in some cases, an additional dose of synthetic T3 (Liothyronine). In this paper, a combined MPC-observer compensator is proposed that generates the amount of medication doses that the patient should receive. The compensator's prescription can then be used by physicians to prescribe constant daily doses of the synthetic hormone replacements.
|
|
16:00-16:15, Paper FrC14.3 | Add to My Program |
Explicit Approximation of Stochastic Optimal Feedback Control for Combined Therapy of Cancer |
|
Alamir, Mazen | CNRS / University of Grenoble |
Keywords: Biological systems, Stochastic optimal control, Uncertain systems
Abstract: In this paper, a tractable methodology is proposed to approximate stochastic optimal feedback treatment in the context of mixed immuno-chemothrapy therapy of cancer. The method uses a fixed-point value iteration that approximately solves a stochastic dynamic programming-like equation. It is in particular shown that the introduction of a variance-related penalty in the latter induces better results that cope with the consequences of softening the health safety constraints in the cost function. The convergence of the value function iteration is revisited in the presence of the variance related term. The implementation involves some Machine Learning tools in order to represent the optimal function and to perform complexity reduction by clustering. Quantitative illustration is given using a commonly used model of combined therapy involving twelve highly uncertain parameters.
|
|
16:15-16:30, Paper FrC14.4 | Add to My Program |
Experimental Modelling and Variable Structure Control for Cyborg Cockroaches |
|
Caforio, Antonio | Politecnico Di Torino |
Punta, Elisabetta | CNR-IEIIT |
Morishima, Keisuke | Osaka University |
Keywords: Biological systems, Variable-structure/sliding-mode control, Uncertain systems
Abstract: Cyborg insects are rapidly becoming the frontier in research into alternative robotic systems. They are particularly suitable for applications where it is necessary to move in unstructured environments. On the other hand, it is still difficult to precisely model their movements due to the highly nonlinear behavior of biological systems compared to engineered robots. In this paper, the kinematic mathematical model of the Madagascar Hissing Cockroach obtained through experiments is presented. The model is then used to show the feasibility of the proposed variable structure control algorithm to obtain trajectory tracking for a biological system with the aim of improving trajectory planning for the cyborg insect. The obtained results are presented.
|
|
16:30-16:45, Paper FrC14.5 | Add to My Program |
Robust Optimal Control of Nonlinear Systems Via Homotopy Shooting Method |
|
Stein, Adrian | University at Buffalo |
Singh, Tarunraj | State Univ. of New York at Buffalo |
Keywords: Optimal control, Biological systems, Robust control
Abstract: This paper introduces an algorithm for solving robust optimal controllers for nonlinear systems using the homotopy shooting method. Robustness is ensured by penalizing the sensitivity states of the models during the transition and at the final time. In two examples the cost is represented by the tracking error and terminal residual energy for a rest-to-rest maneuver. The proposed approach is illustrated on a double mass-spring-damper system and on a Type 1 Diabetes model where the cost function include the integral of the tracking error. Our method can be readily extended for de-sensitization of multiple states over the whole time interval.
|
|
16:45-17:00, Paper FrC14.6 | Add to My Program |
Output-Prediction Based Nonlinear Control of a Class of Neuro-Musculoskeletal Systems |
|
Stolpe, Phoebus Raphael | Maastricht University |
Morel, Yannick | Maastricht University, Faculty of Psychology |
Keywords: Stability of nonlinear systems, Lyapunov methods, Biological systems
Abstract: Motion control of neuro-musculoskeletal systems constitutes a challenging problem. The presented work proposes an approach exploiting the use of a prediction-based control technique to mitigate some of the issues involved. In particular, the skeletal actuators (muscle-tendon complexes) are replaced with a virtual system, emulating the corresponding input/output behavior in the control design process. A control law, exploiting this predictor, prescribes the rate of change of system input (descending signals). It is shown to guarantee uniform ultimate boundedness of the tracking errors. To illustrate efficacy of the approach, the control law is applied to a simple two degree of freedom skeletal system, actuated by a set of five muscle-tendon complexes, activated by a simple neural model representative of a range of spinal functions.
|
|
FrC15 Regular Session, Yonge |
Add to My Program |
Distributed Parameter Systems |
|
|
Chair: Koga, Shumon | Honda Research and Development |
Co-Chair: Xu, Xiaodong | University of Texas at Austin |
|
15:30-15:45, Paper FrC15.1 | Add to My Program |
Event-Triggered Control of Neuron Growth with Actuation at Soma |
|
Demir, Cenk | University of California, San Diego |
Koga, Shumon | Honda Research and Development |
Krstic, Miroslav | University of California, San Diego |
Keywords: Distributed parameter systems, Cellular dynamics, Discrete event systems
Abstract: We introduce a dynamic event-triggering mechanism for regulating the axonal growth of a neuron. We apply boundary actuation at the soma (the part of a neuron that contains the nucleus) and regulate the dynamics of tubulin concentration and axon length. The control law is formulated by applying a Zero-Order Hold (ZOH) to a continuous-time controller which guides the axon to reach the desired length. The proposed dynamic event-triggering mechanism determines the specific time instants at which control inputs are sampled from the continuous-time control law. We establish the existence of a minimum dwell-time between two triggering times that ensures avoidance of Zeno behavior. Through employing the Lyapunov analysis with PDE backstepping, we prove the local stability of the closed-loop system in L_2-norm, initially for the target system, and subsequently for the original system. The effectiveness of the proposed method is showcased through numerical simulations.
|
|
15:45-16:00, Paper FrC15.2 | Add to My Program |
Adaptive Boundary Observer Design for Euler-Bernoulli Beam Systems with Parameter Uncertainties |
|
Wu, Ruixin | Central South University |
Yin, Xunyuan | Nanyang Technological University |
Xu, Xiaodong | University of Texas at Austin |
Dubljevic, Stevan | University of Alberta |
Keywords: Distributed parameter systems, Indirect adaptive control, Uncertain systems
Abstract: In this paper, the problem of state estimation for a class of Euler-Bernoulli beam systems is considered, where the state over the length of the beam is estimated using only measurements at the boundary points of the Euler-Bernoulli beam system. We particularly consider unknown parameters that may occur in the domain and at the boundary, which creates difficulties in accurately estimating the system state. The goal of this paper is to simultaneously estimate the system state and the parameter uncertainties. The crucial element in the design process of the adaptive observer for the Euler-Bernoulli beam system in this study is the introduction of the appropriate finite-dimensional backstepping-like transformation, based on which the design of the parameter adaptive law can be decoupled from the choice of the state estimator. By Lyapunov stability analysis, it can be concluded that the observer converges exponentially under persistent excitation conditions. Furthermore, the effectiveness of the observer is corroborated through numerical simulations.
|
|
16:00-16:15, Paper FrC15.3 | Add to My Program |
Performance-Barrier-Based Event-Triggered Boundary Control of a Class of Reaction-Diffusion PDEs |
|
Rathnayake, Bhathiya | Student (University of California San Diego) |
Diagne, Mamadou | University of California San Diego |
Cortes, Jorge | University of California, San Diego |
Krstic, Miroslav | University of California, San Diego |
Keywords: Distributed parameter systems, Sampled-data control, Stability of hybrid systems
Abstract: This paper presents a novel event-triggered boundary control technique named performance-barrier-based event-triggered control for a class of reaction-diffusion PDEs under Neumann actuation of a Robin boundary condition. At its core, rather than insisting on a strictly monotonic decrease of the Lyapunov function of the closed-loop system, we allow it to increase as long as it remains within an established performance barrier. This approach integrates a performance residual—the difference between the performance barrier and the Lyapunov function—into the triggering mechanism. This integration provides the system's Lyapunov function with enhanced flexibility, thereby allowing for longer dwell-times compared to ``regular" strategies demanding a monotonic decrease of the Lyapunov function. Notably, while adhering to the performance barrier, the closed-loop system globally exponentially converges to zero in the spatial L^2 norm without encountering Zeno phenomenon. We provide numerical simulations to illustrate the proposed technique and to compare it with the regular event-triggered control design, the latter being associated with strictly decreasing Lyapunov functions.
|
|
16:15-16:30, Paper FrC15.4 | Add to My Program |
Towards Metachronal Coordination of Coupled Flexible Filaments for Terrestrial Robot Locomotion |
|
Spinello, Davide | University of Ottawa |
Konidala, Bhargav | University of Ottawa |
Keywords: Mechanical systems/robotics, Distributed parameter systems, Modeling
Abstract: Multi-legged autonomous robots are an attractive solution for various applications ranging from health care to military and defence operations in hazardous and inaccessible environments. For a robust and reliable robot operation, it is necessary to have a terrestrial locomotion mechanism that can adapt to unstructured and uncertain workspaces. An approach for designing such a mechanism is to mimic desirable features evolved in biological organisms. Specifically of interest is the emergence of collective beating patterns in coupled arrays of flexible protrusions in various organisms, which are used for locomotion in fluid and terrestrial environments. This paper presents the formulation and simulation of a system of flexible elastic filaments coupled through a solid medium as a simplified model for the locomotion mechanism for a legged terrestrial robot. The base coupling is modelled via linear elastic lumped elements, and metachronal wave patterns are induced upon individual moment actuation. Simulation results pave the ground for future work focused on understanding how to induce sustained metachronal coordination, with the ultimate goal of designing legged robot locomotion.
|
|
16:30-16:45, Paper FrC15.5 | Add to My Program |
The Exponential Stabilization of a Heat and Piezoelectric Beam Interaction with Static or Hybrid Feedback Controllers |
|
Ozer, Ahmet Ozkan | Western Kentucky University |
Khalilullah, Sk Md Ibrahim | Western Kentucky University |
Rasaq, Uthman | Western Kentucky University |
Keywords: Smart structures, Distributed parameter systems, Mechanical systems/robotics
Abstract: This study explores a system of partial differential equations (PDE) governing the heat transfer in a copper rod and the longitudinal vibrations, as well as total charge accumulation at the electrodes, in a magnetizable piezoelectric beam. The analysis is conducted within the transmission line framework, where magnetizable piezoelectric beams exhibit strong interactions between traveling electromagnetic and mechanical waves, despite notable differences in their velocities. The study establishes that in the open-loop setting, the interplay of heat and beam dynamics lacks exponential stability when considering thermal effects alone. To address this challenge, two types of boundary-type state feedback controllers are proposed: (i) employing completely static feedback controllers and (ii) opting for a hybrid approach where the electrical controller is chosen dynamically to enhance system dynamics. For both scenarios, solutions of the PDE systems demonstrate exponential stability through the implementation of meticulously crafted Lyapunov functions with diverse multipliers. The proposed proof technique lays a solid foundation for proving the exponential stability of Finite-Difference-based robust model reductions as the discretization parameter approaches zero.
|
|
16:45-17:00, Paper FrC15.6 | Add to My Program |
Robust Boundary Stabilization of Stochastic Hyperbolic PDEs |
|
Zhang, Yihuai | The Hong Kong University of Science and Technology(Guangzhou) |
Auriol, Jean | CNRS |
Yu, Huan | The Hong Kong University of Science and Technology(Guangzhou) |
Keywords: Stochastic systems, Distributed parameter systems, Fluid flow systems
Abstract: This paper proposes a backstepping boundary control design for robust stabilization of linear first-order coupled hyperbolic partial differential equations (PDEs) with Markov-jumping parameters. The PDE system consists of 4 times 4 coupled hyperbolic PDEs whose first three characteristic speeds are positive and the last one is negative. We first design a full-state feedback boundary control law for a nominal, deterministic system using the backstepping method. Then, by applying Lyapunov analysis methods, we prove that the nominal backstepping control law can stabilize the PDE system with Markov jumping parameters if the nominal parameters are sufficiently close to the stochastic ones on average. The mean-square exponential stability conditions are theoretically derived and then validated via numerical simulations.
|
|
FrC16 Regular Session, Dockside 4 |
Add to My Program |
Energy Systems |
|
|
Chair: Ellis, Matthew | University of California, Davis |
Co-Chair: Donkers, M.C.F. | Eindhoven University of Technology |
|
15:30-15:45, Paper FrC16.1 | Add to My Program |
Accounting for the Effects of Probabilistic Uncertainty During Fast Charging of Lithium-Ion Batteries |
|
Kim, Minsu | Massachusetts Institute of Technology |
Schaeffer, Joachim | Technischen Universität Darmstadt |
Berliner, Marc D. | Massachusetts Institute of Technology |
Sagnier, Berta Pedret | Massachusetts Institute of Technology |
Findeisen, Rolf | TU Darmstadt |
Braatz, Richard D. | Massachusetts Institute of Technology |
Keywords: Energy systems, Control applications, Uncertain systems
Abstract: Batteries are nonlinear dynamical systems which can be modeled by Porous Electrode Theory (PET) models. The aim of optimal fast charging is to reduce the charging time while keeping battery degradation low. Most past studies assume that the ambient temperature is a fixed known value and that all PET model parameters are perfectly known. In real battery operation, however, the ambient temperature and the model parameters are uncertain. To ensure that operational constraints are satisfied at all times in the context of model-based optimal control, uncertainty quantification is required. Here, we analyze optimal fast-charging for modest uncertainty in the ambient temperature. Uncertainty quantification of the battery model is carried out using polynomial chaos expansion and the results are verified with Monte Carlo simulations. The method is investigated for a constant current–constant voltage charging strategy for a battery for which the strategy is known to be optimal for fast charging subject to operating below maximum current and voltage constraints. Our results demonstrate that uncertainty in ambient temperature results in violations in constraints on the voltage and temperature. Then the transition time from constant current to constant voltage charging is adjusted to ensure that the probability of violating the degradation constraints is below some pre-specified value. This approach demonstrates a computationally efficient approach for determining fast-charging protocols that take probabilistic uncertainties into account.
|
|
15:45-16:00, Paper FrC16.2 | Add to My Program |
Optimal Mode Selection of Multi-Functional Heat Pumps with Simultaneous Water Heating and Space Cooling Mode |
|
Kalantar-Neyestanaki, Hossein | University of California, Davis |
Chakraborty, Subhrajit | University of California Davis |
dela Rosa, Loren | University of California Davis |
Ellis, Matthew | University of California, Davis |
Keywords: Energy systems, Smart grid, Control applications
Abstract: Multi-functional heat pumps (MFHPs) serving space heating, space cooling, and domestic water heating have attracted considerable attention for their potential to reduce costs and enhance energy efficiency compared to separate heating, cooling, and hot water systems. This study focuses on an air-to-air integrated refrigerant circuit MFHP that features a high-efficiency simultaneous space cooling and domestic water heating mode (SIM). However, rule-based controllers (RBCs) employed in MFHPs often lead to suboptimal performance as they do not account for utility signals like time-varying electricity rates or anticipate future system behavior. To address these limitations and optimize energy costs, proactive control strategies such as economic model predictive control (EMPC) become essential. EMPC enables real-time optimization of MFHP operations by incorporating real-time utility signals and forecasts of future system behavior to make optimal control decisions. This study develops an EMPC framework for residential MFHP mode optimization under time-varying electricity prices to minimize operating costs while maintaining thermal comfort. Closed-loop EMPC simulations for a summer day reveal proactive utilization of the high-efficiency SIM mode and a reduction in energy costs compared to RBC.
|
|
16:00-16:15, Paper FrC16.3 | Add to My Program |
Analysis on the Distinguishability of Ageing Mechanisms within a Doyle-Fuller-Newman Framework |
|
le Roux, Francis Anne | Eindhoven University of Technology |
van Beers, Joash | Eindhoven University of Technology |
Bergveld, Hendrik Johannes | Eindhoven University of Technology |
Donkers, M.C.F. | Eindhoven University of Technology |
Keywords: Energy systems, Modeling, Simulation
Abstract: Battery models play an important role in the application of Li-ion batteries, allowing battery management systems to make the most out of Li-ion cells. Electrochemistry-based models can provide detailed information about internal states. However, toolboxes and implementations of electrochemistry-based models rarely consider ageing phenomena. Furthermore, those that do model ageing mechanisms in their implementation, do not address issues with identifiability of model parameters and the distinguishability of different ageing mechanisms. In this work, the most-studied ageing phenomena are implemented into the Doyle-Fuller-Newman model and their distinguishability is studied. It will be shown that Solid-Electrolyte-Interphase formation and Lithium Plating are indistinguishable at a constant temperature and some of their model parameters are unidentifiable. We further show that operating conditions such as C-rate and upper cut-off voltage (UCV) can be used to distinguish loss of active material and cathode degradation, respectively, since they respond proportionally more to the operating conditions than other ageing phenomena.
|
|
16:15-16:30, Paper FrC16.4 | Add to My Program |
Dynamic Optimization and Optimal Control of Hydrogen Blending Operations in Natural Gas Networks |
|
Kazi, Saif R. | Los Alamos National Laboratory |
Sundar, Kaarthik | Los Alamos National Laboratory |
Zlotnik, Anatoly | Los Alamos National Laboratory |
Keywords: Energy systems, Network analysis and control, Optimal control
Abstract: We present a dynamic model for the optimal control problem (OCP) of hydrogen blending into natural gas pipeline networks subject to inequality constraints. The dynamic model is derived using the first principles partial differential equations (PDEs) for the transport of heterogeneous gas mixtures through long distance pipes. Hydrogen concentration is tracked together with the pressure and mass flow dynamics within the pipelines, as well as mixing and compatibility conditions at nodes, actuation by compressors, and injection of hydrogen or natural gas into the system or withdrawal of the mixture from the network. We implement a lumped parameter approximation to reduce the full PDE model to a differential algebraic equation (DAE) system that can be easily discretized and solved using nonlinear optimization or programming (NLP) solvers. We examine a temporal discretization that is advantageous for time-periodic boundary conditions, parameters, and inequality constraint bound values. The method is applied to solve case studies for a single pipe and a multi-pipe network with time-varying parameters in order to explore how mixing of heterogeneous gases affects pipeline transient optimization.
|
|
16:30-16:45, Paper FrC16.5 | Add to My Program |
Impact of Model Mismatch on MPC Performance for Heat Pump Water Heaters |
|
dela Rosa, Loren | University of California Davis |
Mande, Caton | UC Davis Western Cooling Efficiency Center |
Ellis, Matthew | University of California, Davis |
Keywords: Energy systems, Smart grid, Control applications
Abstract: This study investigates the impact of model mismatch on economic model predictive control (MPC) for heat pump water heaters (HPWHs) equipped with a single heat pump and two backup electric resistance heating elements. We present a detailed model to simulate the thermal dynamics of the HPWH tank and develop a control-oriented, lumped HPWH thermal model as the prediction model in the MPC. Logic-based constraints for the MPC are proposed to address concerns tied to using a lumped HPWH prediction model, such as overheating and unnecessary tank heating. These constraints include a temperature-driven constraint to determine when resistance heating can be considered by the MPC, as well as a threshold-based logic for resistance heating element selection. Simulation results evaluate the closed-loop performance of the HPWH under the MPC with the proposed constraints in a model mismatch scenario. The results are compared against a conventional rule-based control approach for HPWHs.
|
|
FrC17 Regular Session, Dockside 5 |
Add to My Program |
Modeling and Identification III |
|
|
Chair: Shen, Minghao | University of Michigan |
Co-Chair: Kwon, Joseph | Texas A&M University |
|
15:30-15:45, Paper FrC17.1 | Add to My Program |
Integrating Deep Neural Networks for Hybrid Modeling of Complex Chemical Processes: Estimation of Spatiotemporally Varying Parameters in Moving Boundary Problems |
|
Pahari, Silabrata | Texas A&M |
Shah, Parth | Texas A&M University |
Kwon, Joseph | Texas A&M University |
Keywords: Grey-box modeling, Machine learning, Computational methods
Abstract: Hybrid modeling has gained substantial traction due to its capacity to combine machine learning techniques with the preservation of the model's physical essence. While these hybrid models have primarily tackled temporal processes governed by ordinary differential equations (ODEs), the complexity of many real-world systems - mirroring diverse physical processes - surpasses this scope. This work examines hybrid modeling methods extensively applied to an intricate biological system governed by the reaction-diffusion equation, which is a partial differential equation (PDE), targeting the challenges arising from latent chemical mechanisms. The methodology introduces a hybrid modeling architecture that synergizes neural networks and mathematical methods to estimate varying parameters across both space and time within a class of moving boundary problems like reaction-diffusion, all while upholding boundary conditions. The training of the model is done using a backpropagation algorithm that efficiently updates these parameters while ensuring numerical stability. The hybrid model is applied to Reaction-Diffusion models, and the results discuss the accurate estimation of spatiotemporally varying diffusivity, and temporally varying cell proliferation rate and cell carrying density.
|
|
15:45-16:00, Paper FrC17.2 | Add to My Program |
A Hybrid Modeling Framework for Catalytic Systems: Sensitivity Analysis and Estimation of Activation Energies |
|
Pahari, Silabrata | Texas A&M |
Shah, Parth | Texas A&M University |
Lee, Chi Ho | Texas A&M University |
Kwon, Joseph | Texas A&M University |
Keywords: Grey-box modeling, Machine learning, Computational methods
Abstract: In recent years there has been a growing need for novel electrocatalysts to produce green ammonia via Nitrogen Reduction Reaction (NRR). Screening new catalyst materials requires a detailed understanding of the pathways underlying these reactions. To this end, coming up with a framework that allows us to easily identify feasible reaction pathways associated with the NRR reactions is of significant value. In this regard, it is important to identify and capture the underlying latent mechanisms governing these reaction pathways. To this end, hybrid models that combine machine learning techniques with first-principles models have extensively been utilized to model such complex chemical processes and capture these latent mechanisms. As of now, the application of hybrid models has stayed limited to the systems governed by simple differential equations. In this work, extending the application of hybrid models to the field of catalysis has been explored. Specifically, the ability of these models to decipher reaction pathways is further understood in great detail by comparing the same with the values from density functional theory (DFT).
|
|
16:00-16:15, Paper FrC17.3 | Add to My Program |
Neural Network Augmented Model Predictive Control: Application to Active Brownian Particles |
|
Quah, Titus | University of California Santa Barbara |
Takatori, Sho | University of California, Santa Barbara |
Rawlings, James B. | University of California, Santa Barbara |
Keywords: Grey-box modeling, Neural networks, Identification for control
Abstract: Model Predictive Control (MPC) is an effective algorithm that has been widely successful in various fields such as chemical processing and manufacturing. However, MPC is reliant on an accurate dynamic model to constrain the state dynamics in the optimal control problem. In practice, obtaining a high fidelity dynamical model is difficult and as the system changes over time, the model prediction accuracy worsens. Thus, we propose a data-driven method that combines MPC with Neural Network Augmented Models (NNAMs). NNAMs take partially known dynamics obtained from domain knowledge, e.g., mass or momentum balances, and approximate the unknown terms that are difficult to model with Neural Network (NNs). The NN parameters are estimated by solving a multi-step ahead prediction error minimization problem. This model is then used in MPC to control the system. We apply this method to control a partial differential equation describing the number density evolution of a large number of active Brownian particles under an actuated orienting field between two plates. A NNAM is used to model the number density which contains unknown terms corresponding to orientation states. We approximate the orientation states with a NN parameterized by the current number density and the recent history of number density and inputs. For a sequence of test inputs, our results show the NNAM number density prediction error is low. Thus, we use the NNAM with MPC for control and show that NNAM with MPC can achieve a similar stage costs compared to MPC with the full model.
|
|
16:15-16:30, Paper FrC17.4 | Add to My Program |
Memory Sketching for Data-Driven Prediction of Dynamical Systems |
|
Shen, Minghao | University of Michigan |
Orosz, Gabor | University of Michigan |
Keywords: Grey-box modeling, Automotive control, Identification
Abstract: In this paper, we introduce a sketching method for data-driven prediction problems in an online setting. We show that sketching the memory of dynamical systems in a randomized way can achieve a constant time and space complexity in each update. We demonstrate the effectiveness of the proposed sketch-based data-driven prediction on trajectory prediction in vehicular traffic. We show that the sketching method can achieve high prediction accuracy with limited memory space, thus enabling online deployment.
|
|
16:30-16:45, Paper FrC17.5 | Add to My Program |
Enforcing Stability of Linear Interpolants in the Loewner Framework |
|
Simard, Joel David | Imperial College London |
Moreschini, Alessio | Imperial College London |
Keywords: Model/Controller reduction, Differential-algebraic systems, Modeling
Abstract: This article considers the problem of constructing exponentially stable interpolants in the Loewner framework for linear systems of differential-algebraic equations. A designer must solve the static output feedback problem to construct a stable interpolant of minimal order without compromising the interpolation conditions. Yet, this problem is not always solvable even for controllable and observable systems. We provide a motivating example where sets of tangential interpolation data are given for which it is impossible to construct a stable interpolant of minimal order. Following this, two new parameterized families of interpolants are given, which embed an observer with state-feedback into the interpolant. Hence, with the cost of some additional states, the existence of a stable interpolant is guaranteed with standard controllability and observability conditions. Finally, the results are demonstrated by using these new families to construct stable interpolants of the tangential data given in the motivating example.
|
|
16:45-17:00, Paper FrC17.6 | Add to My Program |
State-Space System Identification Beyond the Nyquist Frequency with Collaborative Non-Uniform Sensing Data |
|
Hu, Xiaohai | University of Washington |
Chu, Thomas | University of Washington |
Chen, Xu | University of Washington |
Keywords: Identification, Mechatronics, Subspace methods
Abstract: In a multirate sampled-data system encompassing a continuous-time process and multiple output samplers with periods n1T and n2TmT for the input, we introduce an innovative approach that leverages non-uniform data collated through a coprime collaborative sensing mechanism. The ultimate aim is to identify the intricate dynamics governing the system. The predominant challenge - relating to the accurate identification and representation of the multirate system dynamics - is addressed by pioneering a lifted state-space model for the system. This model is achieved by building upon and extending the subspace system identification. Moving forth, using this elevated model as a foundational basis, we seamlessly extract the single-rate system through an eigenvalue decomposition process. The proposed methodology's efficacy is empirically tested through demonstrative examples with multiple orders and varying coefficients.
|
|
FrC18 Regular Session, Dockside 6 |
Add to My Program |
Discrete Event Systems |
|
|
Chair: Rudie, Karen | Queen's Univ |
Co-Chair: Medvedev, Alexander V. | Uppsala University |
|
15:30-15:45, Paper FrC18.1 | Add to My Program |
On the Near Controllability of Single-Input Rank-One Bilinear Systems |
|
Hadizadeh Kafash, Sahand | University of Texas at Dallas |
Ruths, Justin | University of Texas at Dallas |
Keywords: Discrete event systems, Algebraic/geometric methods, Networked control systems
Abstract: In this exposition, we study the controllability of discrete-time bilinear systems. It is well known that in the case of rank-one bilinear systems, bilinear controllability requires the controllability and observability of its associated linear system. A third criterion, known as the greatest common divisor (GCD) condition, is also necessary to ensure controllability. In our recent work we showed that this condition can be relaxed, resulting in a nearly controllable bilinear system. Here we present a new constructive proof, capturing the interplay between the pseudo-inputs (inputs of the associated linear system) and the original inputs driving the bilinear system. This constructive proof provides insights to derive an algorithm to design an input sequence for the original bilinear system, based on the sequence of pseudo-inputs of the associated linear system.
|
|
15:45-16:00, Paper FrC18.2 | Add to My Program |
Existence Conditions for Confidentiality in Discrete-Event Systems |
|
Schonewille, Bryony H. | Queen's University |
Rudie, Karen | Queen's Univ |
Keywords: Discrete event systems, Automata
Abstract: Confidentiality as it has been formulated for discrete-event systems is a way of defining security which allows friendly agents to recover obscured secret information. This work presents two new definitions for confidentiality in discrete-event systems that model the scenario when an adversary is eavesdropping from the beginning of a system's evolution. Necessary and sufficient conditions are also provided for each version of confidentiality that describe the properties a system needs for an encryption function to exist that enforces confidentiality on the system.
|
|
16:00-16:15, Paper FrC18.3 | Add to My Program |
Output Corridor Control Via Design of Impulsive Goodwin’s Oscillator |
|
Medvedev, Alexander V. | Uppsala University |
Proskurnikov, Anton V. | Politecnico Di Torino |
Zhusubaliyev, Zhanybai | South West State University (Kursk State Technical University) |
Keywords: Discrete event systems, Hybrid systems, Biomedical
Abstract: In the Impulsive Goodwin's oscillator (IGO), a continuous positive linear time-invariant (LTI) plant is controlled by an amplitude- and frequency-modulated feedback into an oscillating solution. This paper proposes an algorithm to design the feedback of the IGO so that the output of the continuous plant is kept (at stationary conditions) within a pre-defined corridor, i.e. within a bounded interval of values. The presented framework covers single-input single-output LTI plants as well as positive Wiener and Hammerstein models that often appear in process and biomedical control. A potential application of the developed impulsive control approach to a minimal Wiener model of pharmacokinetics and pharmacodynamics of a muscle relaxant used in general anesthesia is discussed.
|
|
16:15-16:30, Paper FrC18.4 | Add to My Program |
Limited-Capacity Supervisors for Discrete-Event Systems |
|
Moulton, Richard Hugh | Queen's University |
Rudie, Karen | Queen's Univ |
Keywords: Discrete event systems, Supervisory control, Biologically-inspired methods
Abstract: Modern applications seek to develop agents that are capable of performing tasks in real-world environments whose complexity may overshadow the agent's ability to act. These environments require intelligent agents that are capable of achieving their goals with relatively limited capacity. Here we introduce the Limited-Capacity Supervisor Problem, where capacity captures the control and observation capabilities of agents in the system. We formalize the notion of capacity for discrete-event systems, and present a heuristic for reducing a supervisor's capacity usage while enforcing a specification.
|
|
16:30-16:45, Paper FrC18.5 | Add to My Program |
Generalizing Discrete-Event System Control Problems to Optimal Control |
|
Mertin, Nicholas Frederick Andreas | Queen's University |
Rudie, Karen | Queen's Univ |
Keywords: Discrete event systems, Supervisory control, Optimal control
Abstract: Conventional supervisory control of discrete-event systems (DESs), opacity enforcement of DESs, and optimal control of DESs are broadly viewed in existing literature as distinct classes of problems. In this light, a novel class of optimal control problems for discrete-event systems (DESs) is proposed. Comparisons are made to the existing optimal control framework of Sengupta and Lafortune and the design decisions behind such problem formulations are discussed. It is shown that two known control problems in DES - the minimally-restrictive enforcement of a legal sublanguage and of current-state opacity with respect to an observer - can be recast as instances of the novel problem.
|
|
16:45-17:00, Paper FrC18.6 | Add to My Program |
Deterministic Decentralized Supervisors for Bisimilarity Control of Nondeterministic Discrete Event Systems |
|
Kimura, Akari | Osaka University |
Takai, Shigemasa | Osaka Univ |
Keywords: Discrete event systems, Supervisory control
Abstract: We consider the decentralized bisimilarity control problem for nondeterministic discrete event systems with nondeterministic specifications. This problem requires us to synthesize a decentralized supervisor that consists of multiple local supervisors so that the supervised system is bisimilar to the specification. In this paper, to solve it, we restrict local supervisors to deterministic ones. We synthesize deterministic local supervisors based on the specification model, and show that the decentralized bisimilarity control problem is solvable by deterministic local supervisors if and only if it is solved by the synthesized local supervisors.
|
|
FrC19 Regular Session, Pier 7 |
Add to My Program |
Stochastic Systems and Control II |
|
|
Chair: Zarrouki, Baha | Technical University Munich |
Co-Chair: Ghoreishi, Seyede Fatemeh | Northeastern University |
|
15:30-15:45, Paper FrC19.1 | Add to My Program |
Distributed Estimation by Two Agents with Different Feature Spaces |
|
Raghavan, Aneesh | KTH Royal Insitute of Technology |
Johansson, Karl H. | KTH Royal Institute of Technology |
Keywords: Statistical learning, Estimation, Intelligent systems
Abstract: We consider the problem of estimation of a function by a system consisting of two agents and a fusion center. The two agents collect data comprising of samples of an independent variable and the corresponding value of a dependent variable. The objective of the system is to collaboratively estimate the function without any exchange of data among the members of the system. To this end, we propose the following framework. The agents are given a set of features using which they construct suitable function spaces to formulate and solve the estimation problems locally. The estimated functions are uploaded to a fusion space where an optimization problem is solved to fuse the estimates (also known as meta-learning) to obtain the system estimate of the mapping. The fused function is then downloaded by the agents to gather knowledge about the other agents estimate of the function. With respect to the framework, we present the following: a systematic construction of fusion space given the features of the agents; the derivation of an uploading operator for the agents to upload their estimated functions to a fusion space; the derivation of a downloading operator for the fused function to be downloaded. Through an example on least squares regression, we illustrate the distributed estimation architecture that has been developed.
|
|
15:45-16:00, Paper FrC19.2 | Add to My Program |
Implicit Human Perception Learning in Complex and Unknown Environments |
|
Ravari, Amirhossein | Northeastern University |
Ghoreishi, Seyede Fatemeh | Northeastern University |
Imani, Mahdi | Northeastern University |
Keywords: Statistical learning, Stochastic systems, Markov processes
Abstract: Autonomy through humans and autonomous agents becomes more prevalent in many complex domains, including time-sensitive and unknown environments. Examples include crisis response or operational planning, where partial knowledge about casualties, locations, and the number of victims in disaster zones might be available. Several approaches have been developed to tackle the issue arising from the partial knowledge of the environment by establishing communication among agents and humans. However, communication might be limited or non-existent in complex domains with no access to communication tools or no time to process information or respond to queries. This paper develops a perception learning approach that allows agents to implicitly reason about humans' perception of the environment using limited human data without direct communication. Human is modeled as a non-optimal reinforcement learning agent in a partially known Markov decision process. A recursive method is derived to optimally build a probabilistic model of the environment using agents' experience and quantified humans' perception. We demonstrate that the learned perception models can be incorporated into various decision-making policies relying on the environment model. The performance of the proposed method is investigated using a rescue operation team consisting of a human and an agent.
|
|
16:00-16:15, Paper FrC19.3 | Add to My Program |
Risk-Aware Stochastic Control of a Sailboat |
|
Wang, MingYi | Cornell University |
Patnaik, Natasha | Rice University |
Somalwar, Anne | University of Pennsylvania |
Wu, Jingyi | New York University |
Vladimirsky, Alexander | Cornell University |
Keywords: Stochastic optimal control, Hybrid systems, Numerical algorithms
Abstract: Sailboat path-planning is a natural hybrid control problem (due to continuous steering and occasional “tack-switching” maneuvers), with the actual path-to-target greatly affected by stochastically evolving wind conditions. Previous studies have focused on finding risk-neutral policies that minimize the expected time of arrival. In contrast, we present a robust control approach, which maximizes the probability of arriving before a specified deadline/threshold. Our numerical method recovers the optimal risk-aware (and threshold-specific) policies for all initial sailboat positions and a broad range of thresholds simultaneously. This is accomplished by solving two quasi-variational inequalities based on second-order Hamilton-Jacobi-Bellman (HJB) PDEs with degenerate parabolicity. Monte-Carlo simulations show that risk-awareness in sailing is particularly useful when a carefully calculated bet on the evolving wind direction might yield a reduction in the number of tack-switches.
|
|
16:15-16:30, Paper FrC19.4 | Add to My Program |
A Stochastic Nonlinear Model Predictive Control with an Uncertainty Propagation Horizon for Autonomous Vehicle Motion Control |
|
Zarrouki, Baha | Technical University of Munich |
Wang, Chenyang | Technical University of Munich |
Betz, Johannes | Technical University of Munich |
Keywords: Stochastic optimal control, Uncertain systems, Automotive control
Abstract: Employing Stochastic Nonlinear Model Predictive Control (SNMPC) for real-time applications is challenging due to the complex task of propagating uncertainties through nonlinear systems. This difficulty becomes more pronounced in high-dimensional systems with extended prediction horizons, such as autonomous vehicles. To enhance closed-loop performance and feasibility in SNMPCs, we introduce the Uncertainty Propagation Horizon (UPH) concept. The UPH limits the time for uncertainty propagation through system dynamics, preventing the divergence of uncertain states' evolution and too tightened constraints, leveraging feedback loop advantages, and reducing computational overhead. Our SNMPC approach utilizes Polynomial Chaos Expansion (PCE) to propagate uncertainties and incorporates nonlinear hard constraints on state expectations and nonlinear probabilistic constraints. We transform the probabilistic constraints into deterministic constraints by estimating the nonlinear constraints' expectation and variance and then formulate a general SNMPC problem. We showcase our algorithm's effectiveness in real-time control of a high-dimensional, highly nonlinear system—the motion control of an autonomous passenger vehicle, modeled with a dynamic nonlinear single-track model. Experimental results demonstrate our approach's robust capability to follow an optimal racetrack trajectory at speeds up to 37.5m/s while dealing with state estimation disturbances, achieving a minimum solving frequency of 97Hz. Additionally, our experiments illustrate that limiting the UPH renders previously infeasible SNMPC problems feasible, even when incorrect uncertainty assumptions or strong disturbances exist. The code used in this research is publicly accessible as open-source software: https://github.com/bzarr/TUM-CONTROL
|
|
16:30-16:45, Paper FrC19.5 | Add to My Program |
Dynamic Resource Allocation to Minimize Concave Costs of Shortfalls |
|
Bhimaraju, Akhil | University of Illinois Urbana-Champaign |
Chatterjee, Avhishek | The University of Texas at Austin |
Varshney, Lav R. | University of Illinois at Urbana-Champaign |
Keywords: Stochastic systems, Optimization, Smart grid
Abstract: We study a resource allocation problem over time, where a finite (random) resource needs to be distributed among a set of users at each time instant. Shortfalls in the resource allocated result in user dissatisfaction, which we model as an increasing function of the long-term average shortfall for each user. In many scenarios such as wireless multimedia streaming, renewable energy grid, or supply chain logistics, a natural choice for this cost function turns out to be concave, rather than usual convex cost functions. We consider minimizing the (normalized) cumulative cost across users. Depending on whether users' mean consumption rates are known or unknown, this problem can be reduced to two different structured non-convex problems. The "known" case is a concave minimization problem subject to a linear constraint. By exploiting a well-chosen linearization of the cost functions, we solve this provably within O(1/m) of the optimum, in O(mlog m) time, where m is the number of users in the system. In the "unknown" case, we are faced with minimizing the sum of functions that are concave on part of the domain and convex on the rest, subject to a linear constraint. We present a provably exact algorithm when the cost functions and prior distributions on mean consumption are the same across all users.
|
|
16:45-17:00, Paper FrC19.6 | Add to My Program |
Adaptive Control for Lignin-First Biomass Fractionation: An Experimentally Verified Multiscale kMC Approach |
|
Kim, Juhyeon | Texas A&M University |
Pahari, Silabrata | Texas A&M |
Zhang, Mairui | State University of New York College of Environmental Science An |
Ryu, Jiae | State University of New York College of Environmental Science An |
Yoo, Chang Geun | State University of New York College of Environmental Science An |
Kwon, Joseph | Texas A&M University |
Keywords: Model/Controller reduction, Stochastic systems, Direct adaptive control
Abstract: Lignin is regarded as a promising alternative to petrochemical resources, but its effective utilization is still limited due to the absence of an appropriate mathematical model for the lignin reactions. In this regard, we propose a kinetic model to simulate delignification and de/repolymerization happening simultaneously but in different length and time scales. To account for this multiscale nature, we adopted a bilayer structure of the ordinary differential equations and kinetic Monte Carlo algorithm. This model provides the lignin content in the bulk chip and lignin molecular weight distribution validated with the experiments. However, it still cannot handle any uncertainties that may arise from the unknown factors, such as the feedstock variability and unexplored interaction between the novel reagent and the lignin chains. Motivated by this issue, the direct model-reference adaptive control scheme is adopted to demonstrate that the controller can drive the system toward the desired state following our multiscale model as a reference, without particularly knowing the process uncertainties.
|
|
FrC20 Regular Session, Pier 8 |
Add to My Program |
Delay Systems |
|
|
Chair: Dani, Ashwin | University of Connecticut |
Co-Chair: Zhao, Congran | Jiangsu University |
|
15:30-15:45, Paper FrC20.1 | Add to My Program |
Sampled-Data Output Feedback Control of Time-Delay Uncertain Systems with Strong Nonlinearity |
|
Zhao, Congran | Jiangsu Normal University |
Lin, Wei | Case Western Reserve University |
Keywords: Delay systems, Sampled-data control, Stability of hybrid systems
Abstract: Sampled-data control problem via output feedback is studied for a class of strongly nonlinear systems with state and input delays. Under sample and hold, a delay-free output feedback control scheme is developed based on the emulation method, adding a power integrator (AAPI) technique, and recursive design of nonlinear observers. With the aid of Lyapunov-Krasovskii functional theorem, together with the idea of homogeneous domination, we prove that the proposed sampled-data output feedback controller makes the hybrid closed-loop systems with delays and uncertainty globally asymptotically stable, if the input delay and sampling period are limited. The class of time-delay uncertain systems under consideration goes beyond the Lipschitz or linear growth condition and is genuinely nonlinear as it contains uncontrollable/unobservable linearization and is not stabilizable, even locally, by any linear or smooth feedback. Application of the sampled-data control scheme presented in this paper is illustrated by an example with simulation.
|
|
15:45-16:00, Paper FrC20.2 | Add to My Program |
On Boundary Control of the Transport Equation. Assigning Real Spectra & Exponential Decay |
|
Schmoderer, Timothée | Université D'Orléans |
Boussaada, Islam | Universite Paris Saclay, CNRS-CentraleSupelec-Inria |
Niculescu, Silviu-Iulian | University Paris-Saclay, CNRS, CentraleSupelec |
Keywords: Delay systems
Abstract: Recently, an intriguing property called coexistent-real-roots-induced-dominancy (CRRID) has been set and emphasized for some classes of linear time-invariant dynamical systems represented by retarded delay-differential equations. In this paper, we extend such a property to a class of neutral systems, and exploit it in the boundary control of the standard transport equation. Namely, by using the CRRID property, we show that one can arbitrarily and robustly prescribe the exponential decay of the closed-loop transport solution, yielding the prospect of applying the CRRID partial poles placement methodology to hyperbolic PDE's.
|
|
16:00-16:15, Paper FrC20.3 | Add to My Program |
Integral Inequalities for the Analysis of Distributed Parameter Systems: A Complete Characterization Via the Least-Squares Principle |
|
Feng, Qian | North China Electric Power University |
Seuret, Alexandre | University of Sevilla |
Nguang, Sing Kiong | The University of Auckland |
Xiao, Feng | North China Electric Power University |
Keywords: Linear systems, Delay systems, Distributed parameter systems
Abstract: A wide variety of integral inequalities (IIs) have been developed and studied for the stability analysis of distributed parameter systems using the Lyapunov functional approach. However, no unified mathematical framework has been proposed that could characterize the similarity and connection between these IIs, as most of them was introduced in a dispersed manner for the analysis of specific types of systems. Additionally, the extent to which the generality of these IIs can be expanded and the optimality of their lower bounds (LBs) remains open questions. In this study, we introduce two general classes of IIs that can generalize nearly all IIs in the literature. The integral kernels of the LBs of our IIs can contain an unlimited number of weighted fL^2 functions that are linearly independent in a Lebesgue sense. Moreover, we not only estalish the equivalence relations between the LBs of our IIs, but also demonstrate that these LBs are guaranteed by the least squares principle, implying asymptotic convergence to the upper bound when the kernels functions constitutes a Schauder basis of the underlying Hilbert space. Owing to their general structures, our IIs are applicable in a variety of contexts, such as the stability analysis of coupled PDE-ODE systems or cybernetic systems with delay structures.
|
|
16:15-16:30, Paper FrC20.4 | Add to My Program |
Delay-Induced Watermarking for Detection of Replay Attacks in Linear Systems |
|
Somarakis, Christoforos | Merck & Co |
Goyal, Raman | Palo Alto Research Center |
Noorani, Erfaun | University of Maryland College Park |
Rane, Shantanu | Palo Alto Research Center |
Keywords: Fault detection, Delay systems, Stochastic systems
Abstract: A state-feedback watermarking signal design for the detection of replay attacks in linear systems is proposed. The control input is augmented with a random time-delayed term of the system state estimate, in order to secure the system against attacks of replay type. We outline the basic analysis of the closed-loop response of the state-feedback watermarking in a LQG controlled system. Our theoretical results are applied on a temperature process control example. While the proposed secure control scheme requires very involved analysis, it, nevertheless, holds promise of being superior to conventional, feed-forward, watermarking schemes, in both its ability to detect attacks as well as the secured system performance.
|
|
16:30-16:45, Paper FrC20.5 | Add to My Program |
Adaptive Trajectory Synchronization with Time-Delayed Information |
|
Bhattacharya, Rounak | Univeristy of Connecticut |
Guthikonda, Vrithik Raj | University of Connecticut |
Dani, Ashwin | University of Connecticut |
Keywords: Robotics, Delay systems, Adaptive control
Abstract: In this paper, an adaptive trajectory synchronization controller is presented that synchronizes the robot joint trajectory to the human joint trajectory in the presence of communication time delay and uncertainty in robot model parameters. The controller synchronizes to the human trajectory by accounting for time delays that arise in human-robot collaboration tasks such as, estimating the human trajectory using image processing, or sensor fusion for trajectory intent estimation, or computational limitations. The developed adaptive time-delayed synchronization controller utilizes integral concurrent learning (ICL)-based parameter update law for parameter estimation. Exponential stability of the synchronization and parameter estimation errors are proved using a Lyapunov-Krasovskii functional analysis. Simulation results are presented to validate the proposed synchronization controller using a 2 degree of freedom (DoF) human-robot collaboration example.
|
| |