| |
Last updated on April 2, 2023. This conference program is tentative and subject to change
Technical Program for Friday June 2, 2023
To show or hide the keywords and abstract (text summary) of a paper (if available), click on the paper title
Open all abstracts
Close all abstracts
Presentation  In person  On-line  No presentation  No information
|
FrA01 RI Session, Sapphire MN |
Add to My Program |
Automotive Systems (RI) |
|
|
Chair: Dai, Ran | Purdue University |
Co-Chair: Hashemi, Ehsan | University of Alberta |
|
10:00-10:04, Paper FrA01.1 | Add to My Program |
Integral Action NMPC for Tight Maneuvers of Articulated Vehicles (I) |
|
You, Sixiong | Purdue University |
Greiff, Marcus Carl | Mitsubishi Electric Research Laboratries |
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Ran, Shuangxuan | University of Michigan |
Wang, Yebin | Mitsubishi Electric Research Labs |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Dai, Ran | Purdue University |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Automotive systems, Automotive control, Predictive control for nonlinear systems
Abstract: We propose an integral action nonlinear model predictive controller (NMPC) for trajectory tracking of an articulated vehicle with an uncertain hitching offset. The controller is intended for complex parking maneuvers including forward and backward movement with tight specifications on the lateral positional tracking error of the trailer. In order to assess performance with uncertain hitching offsets, disturbances, and sensor noise, we conduct extensive hardware-in-the-loop simulations using a dSPACE Scalexio unit. With high-grade sensing, we demonstrate that the closed-loop control system achieves a lateral tracking error of <3 [cm] in expectation, and an absolute terminal error of <15 [cm] with high probability p>0.97. The proposed integral action is shown to be essential in achieving this performance, and the efficacy of the proposed NMPC is evaluated by comparison to previously reported MPCs.
|
|
10:04-10:08, Paper FrA01.2 | Add to My Program |
Optimization-Based Coordination and Control of Traffic Lights and Mixed Traffic in Multi-Intersection Environments (I) |
|
Suriyarachchi, Nilesh | University of Maryland |
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Baras, John S. | University of Maryland |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Automotive control, Traffic control, Optimal control
Abstract: Coordinating the flow of traffic through urban areas with multiple intersections is a complex problem whose solution has the potential to improve safety, increase throughput, and optimize energy efficiency. In addition to controlling traffic lights, the introduction of connected and automated vehicles (CAVs) offers opportunities in terms of additional sensing and actuation points within the traffic network. This paper proposes a centralized and a decentralized implementation for the joint coordination and control of both traffic signals and mixed traffic, including CAVs and human driven vehicles (HDVs), in a network of multiple connected traffic intersections. Mixed-integer linear programming (MILP) is used to compute safe control trajectories for both CAVs and traffic light signals, which minimize overall congestion and fuel consumption. Our approaches are validated using extensive traffic simulations on the SUMO platform and they are shown to provide improvements of around 32-60%, 90-96% and 40-60% in travel time, waiting time and fuel consumption, respectively, when compared to gap-based adaptive and timed traffic lights.
|
|
10:08-10:12, Paper FrA01.3 | Add to My Program |
Heavy-Duty Vehicle Air Drag Coefficient Estimation: From an Algebraic Perspective (I) |
|
Wang, Zejiang | Oak Ridge National Laboratory |
Cook, Adian | Oak Ridge National Laboratory |
Shao, Yunli | Oak Ridge National Lab |
Sujan, Vivek | Oak Ridge National Laboratory |
Chambon, Paul | Oak Ridge National Laboratory |
Deter, Dean | Oak Ridge National Laboratory |
Perry, Nolan | Oak Ridge National Laboratory |
Keywords: Automotive systems, Identification
Abstract: When a heavy-duty vehicle (HDV) operates at the nominal highway speed, over two-thirds of its total resistive force comes from the air drag, contributing to more than half of its fuel consumption. One effective countermeasure to reduce the fuel consumption of HDVs is platooning, which employs connectivity and automated driving technologies to link two or more HDVs in convoy. Platooning allows HDVs to drive closer together and yields improved fuel economy and less CO2 emission thanks to the reduced air drag. Maximizing the energy benefits of an HDV platoon requires quantifying the drag interaction between vehicles. In practice, modeling the drag reduction in a platoon boils down to identifying the relationship between the air drag coefficient and the inter-vehicle distance. Existing approaches to identify the air drag coefficient include vehicle field test, wind tunnel experiment, and computational fluid dynamics simulation, which can howbeit be time-consuming and cost prohibitive. In contrast, this paper proposes an algebraic approach, which relies on onboard-measurable variables, to estimate the air drag coefficient of an HDV in a platoon. Its algebraic nature avoids the classical persistence of excitation condition for parameter identification and can yield the identified parameter almost instantaneously. Simulation results demonstrate its effectiveness and the improved estimation speed over a recursive least squares identifier.
|
|
10:12-10:16, Paper FrA01.4 | Add to My Program |
Hydrodynamics and Friction Estimation for Wet Tire/Ground Interactions (I) |
|
Gong, Yongbin | Rutgers, the State University of New Jersey |
Chen, Xunjie | Rutgers, the State University of New Jersey |
Yi, Jingang | Rutgers University |
Wang, Hao | Rutgers University |
Keywords: Modeling, Automotive control
Abstract: Understanding wet tire/road interactions is critical for predicting unstable operating conditions such as hydroplaning and, therefore, for vehicle safety operation. We present an analytical method to compute water film pressure distribution on the viscous hydrodynamic region between the tire and the ground. The hydrodynamic models and analysis are obtained for the smooth tire surface and tires with transverse tread elements. We present analytical conditions to predict the hydroplaning occurrence. The impact of the wet ground condition on tire/road friction forces is also discussed through the effective length of the contact patch and a LuGre friction model. Simulation results are presented to demonstrate the modeling development. Comparison results with other existing models illustrate the advantage of the proposed model and analysis.
|
|
10:16-10:20, Paper FrA01.5 | Add to My Program |
On XYZ-Motion Planning for Autonomous Vehicles with Active Suspension Systems |
|
Jiang, Yu | ClearMotion, Inc |
Graves, Billy | ClearMotion |
Giovanardi, Marco | ClearMotion, Inc |
Anderson, Zackary | ClearMotion |
Keywords: Automotive control, Emerging control applications, Optimal control
Abstract: This paper analyzes the xyz-motion planning problem for autonomous vehicles with active suspension systems. A generic nonlinear optimization problem based on a 3D quarter car model is formulated, where vertical motion planning and the knowledge of road surface data are taken into consideration for planning the motion of the vehicle body in 3D space. A novel z-motion planning methodology is proposed and integrated with a sampling-based xyz-motion planning framework. Finally, simulated driving scenarios are presented to illustrate the advantages of using the proposed planning framework.
|
|
10:20-10:24, Paper FrA01.6 | Add to My Program |
A Recursive Gaussian Process Based Online Driving Style Analysis |
|
Fink, Daniel | Leibniz University Hannover |
Dues, Tobias | Leibniz Universität Hannover |
Kortmann, Karl-Philipp | Leibniz University Hannover, Institute of Mechatronic Systems |
Blum, Pascal | IAV GmbH Berlin |
Schweers, Christoph | IAV GmbH Berlin |
Trabelsi, Ahmed | IAV Automotive Engineering |
Keywords: Automotive systems, Learning, Automotive control
Abstract: Advanced driver assistance systems improve the driving comfort and contribute to enhance safety and energy efficiency in automotive traffic. However, whether these systems are actually used, depends on the driver's satisfaction with the system's way of driving. A promising approach to met the driver's individual preferences, is to personalize the assistance system. This paper presents a recursive Gaussian Process based analysis to determine the driver's preferences, during manual vehicle guidance, separately for various driving maneuvers. The recursive process enables an online-capable analysis where no maneuver data has to be stored. In addition, an event detection approach to identify relevant driving situations is proposed. The gained information about the driver's preferences can be accessed by modern assistance systems to individually parameterize the driving behavior for example in curves or for general velocity adjustments at speed limit changes.
|
|
10:24-10:28, Paper FrA01.7 | Add to My Program |
Learning Autonomous Vehicle Safety Concepts from Demonstrations |
|
Leung, Karen | University of Washington |
Veer, Sushant | NVIDIA |
Schmerling, Edward | Stanford University |
Pavone, Marco | Stanford University |
Keywords: Learning, Constrained control, Automotive control
Abstract: Evaluating the safety of an autonomous vehicle (AV) depends on the behavior of surrounding agents which can be heavily influenced by factors such as environmental context and informally-defined driving etiquette. A key challenge is in determining a minimum set of assumptions on what constitutes reasonable foreseeable behaviors of other road users for the development of AV safety models and techniques. In this paper, we propose a data-driven AV safety design methodology that first learns "reasonable" behavioral assumptions from data, and then synthesizes an AV safety concept using these learned behavioral assumptions. We borrow techniques from control theory, namely high order control barrier functions and Hamilton-Jacobi reachability, to provide inductive bias to aid interpretability, verifiability, and tractability of our approach. In our experiments, we learn an AV safety concept using demonstrations collected from a highway traffic-weaving scenario, compare our learned concept to existing baselines, and showcase its efficacy in evaluating real-world driving logs.
|
|
10:28-10:32, Paper FrA01.8 | Add to My Program |
Control-Minimal Time-Assigned Path-Constrained Trajectory Optimization |
|
Morrissett, Adam | Virginia Commonwealth University |
Martin, Patrick | Virginia Commonwealth University |
Keywords: Autonomous robots, Automotive control, Optimal control
Abstract: Path-constrained trajectory optimization research normally focuses on time or energy optimality. However, some applications seek trajectories that satisfy other constraints. In this paper, we formulate a control-minimal time-assigned path-constrained trajectory optimization problem: a mobile ground robot must traverse a given path in a specific amount of time using minimal control effort. Through a nonlinear change of variables, we solve this problem using convex optimization. We evaluate our solution on a scenario from the intelligent transportation domain. An autonomous vehicle must cross an intersection in a specific amount of time while following the turn lane's geometric center.
|
|
10:32-10:36, Paper FrA01.9 | Add to My Program |
Spatio-Temporal Motion Planning for Autonomous Vehicles with Trapezoidal Prism Corridors and Bézier Curves |
|
Deolasee, Srujan | Birla Institute of Technology and Science (BITS), Pilani |
Lin, Qin | Cleveland State University |
Li, Jialun | Shanghai Jiao Tong University |
Dolan, John | Carnegie Mellon University |
Keywords: Autonomous robots, Automotive systems, Optimization
Abstract: Safety-guaranteed motion planning is critical for self-driving cars to generate collision-free trajectories. A layered motion planning approach with decoupled path and speed planning is widely used for this purpose. This approach is prone to be suboptimal in the presence of dynamic obstacles. Spatial-temporal approaches deal with path planning and speed planning simultaneously; however, the existing methods only support simple-shaped corridors like cuboids, which restrict the search space for optimization in complex scenarios. We propose to use trapezoidal prism-shaped corridors for optimization, which significantly enlarges the solution space compared to the existing cuboidal corridors-based method. Finally, a piecewise Bézier curve optimization is conducted in our proposed corridors. This formulation theoretically guarantees the safety of the continuous-time trajectory. We validate the efficiency and effectiveness of the proposed approach in numerical and CommonRoad simulations.
|
|
10:36-10:40, Paper FrA01.10 | Add to My Program |
Distributed Robust Control Framework for Adaptive Cruise Control Systems |
|
Mahmoudi, Mohammad | Sharif University of Technology |
Hashemi, Ehsan | University of Alberta |
Keywords: Automotive control, Robust adaptive control, Multivehicle systems
Abstract: A distributed robust adaptive control framework is proposed for an adaptive cruise control system. The proposed approach is designed based on the model reference adaptive control approach. A robust control term is employed to make the system robust to any bounded disturbances, and a concurrent learning framework is leveraged to ensure the convergence of estimated parameters. The main feature of the developed robust adaptive cruise controller is that it does not require the speed of the lead vehicle. It also considers uncertainties in both position and speed in the double integrator model. The string stability notion of the proposed approach is also investigated, and the performance of the control framework is evaluated in simulations in the presence of parametric uncertainties, disturbances, and noise.
|
|
FrA02 RI Session, Sapphire IJ |
Add to My Program |
Control Applications I (RI) |
|
|
Chair: Garcia Carrillo, Luis Rodolfo | New Mexico State University |
Co-Chair: Wan, Yan | University of Texas at Arlington |
|
10:00-10:04, Paper FrA02.1 | Add to My Program |
High-Confidence Trajectory Planning for Off-Road Automated Vehicles under Energy Constraints (I) |
|
Goulet, Nathan | Clemson University |
Ayalew, Beshah | Clemson University |
Castanier, Matthew | US Army CCDC Ground Vehicle Systems Center |
Skowronska, Annette | US Army CCDC Ground Vehicle Systems Center |
Keywords: Autonomous robots, Control applications, Stochastic optimal control
Abstract: For automated vehicles operating in off-road environments, there is substantial uncertainty in their energy needs and utilization. To account for this uncertainty, we propose a high-confidence global planner that obtains the path with the highest-confidence energy constraints are met. We outline a sampling-based method to approximate the energy stage cost uncertainty as a normal random variable, and then transform the uncertain optimal control problem to a deterministic one that can be solved using standard methods. We couple this with a local nominal model predictive controller that employs a dynamics model of the off-road vehicle on deformable terrains. We show through Monte-Carlo simulations that the framework is robust in the face of uncertainty in terms of energy consumption and outperforms approaches that simply plan for the minimum expected energy consumption.
|
|
10:04-10:08, Paper FrA02.2 | Add to My Program |
LQG Cycle-To-Cycle Knock Control Based on Identified Exhaust Temperature Model (I) |
|
Tang, Jian | Robert Bosch LLC |
Dai, Wen | Ford Motor Company |
Archer, Chad | Ford Motor Company |
Yi, James | Ford Motor Company |
Zhu, Guoming | Michigan State University |
Keywords: Control applications, Automotive control, Identification for control
Abstract: Spark ignition engines are often calibrated to operate as close to its knock borderline as possible when MBT (maximum brake torque) cannot be achieved. However, the existing combustion cycle-to-cycle variations result in a relative conservative borderline knock control. To reduce these variations, a real-time cycle-wised knock variation control is proposed in this paper using measured exhaust temperature as feedback. Q-Markov COVER (COVariance Equivalent Realization) system identification was used to obtain a linearized engine exhaust system model from spark timing deviation to associated exhaust temperature and knock intensity variations. Accordingly, a Linear–Quadratic–Gaussian (LQG) controller is designed, based on the identified model, to minimizing the knock fluctuations based on exhaust temperature deviations. Note that the cycle-based compensation adds spark timing deviation control to the baseline so that knock combustion variations can be reduced. With the help of the LQG control, the engine bench test shows a significant reduction of knock combustion variations with its variance reduced by 28%.
|
|
10:08-10:12, Paper FrA02.3 | Add to My Program |
Stabilization and Trajectory Tracking of a Subactuated Aircraft Based on a Geometric Algebra Approach |
|
Escamilla, Leonardo | New Mexico State University |
Garcia Carrillo, Luis Rodolfo | New Mexico State University |
Sandoval, Steven | New Mexico State University |
Espinoza Quesada, Eduardo Steed | Center for Research and Advanced Studies of the National Polytec |
Keywords: Control applications, Autonomous systems, Modeling
Abstract: A novel approach to the modeling and control of a subactuated aircraft is performed based on Geometric Algebra (GA). The selected platform for analysis is a quad rotorcraft. The derived model leverages objects from GA, such as the rotor, to perform rotations, replacing the need for Euler angles and quaternions. Controllers, which operate exclusively on GA objects, are developed to regulate the altitude, attitude, and translation of the quad rotorcraft. Numerical examples, including way-point navigation and trajectory tracking, illustrate the feasibility of the GA approach.
|
|
10:12-10:16, Paper FrA02.4 | Add to My Program |
A Transmission Rate Estimator & Controller for Infectious Disease SIR Models - Constant Case |
|
Barbieri, Enrique | University of Houston |
Tzouanas, Vassilios | University of Houston - Downtown |
Keywords: Control applications, Biomedical, Biological systems
Abstract: A widely studied susceptible S(t), infectious I(t), and removed R(t) (SIR) family of deterministic, lumped-parameter models of directly transmitted infectious diseases is considered to estimate the transmission rate assumed to be piecewise constant via a linear, extended-state observer. Then, although the transmission rate is not a control signal in the traditional sense, the application of feedback control design offers guidance in implementing mitigating actions that curb the disease spread. A linearized model at each measurement point is used for offline observer design with the transmission rate treated as an unknown but constant disturbance. The observer-based controller simulations in discrete time explore heuristic policies that may be implemented by public health and government organizations.
|
|
10:16-10:20, Paper FrA02.5 | Add to My Program |
Optimal Control of Stochastic Power Buffers in DC Microgrids |
|
Valsala Priyadarsini Premakumar, Abhiram | University of Texas at Arlington |
Qian, Yang-Yang | University of Virginia |
Wan, Yan | University of Texas at Arlington |
Davoudi, Ali | University of Texas-Arlington |
Keywords: Control applications, Energy systems, Uncertain systems
Abstract: Power buffers are DC-DC converters where a large capacitor helps shield the DC grid from abrupt load changes. While point of load converters (PoLC)s are mainly tasked with meeting the terminal load requirements, power buffers add inertia to the DC grid during transients. The stochastic behaviour of loads could necessitate an adaptive optimal control strategy for power buffers. The optimal control of power buffers is usually formulated as a nonzero-sum differential game. The load behaviour can be captured using a multivariate probabilistic collocation method (MPCM) to sample its uncertainty. An integral reinforcement learning (IRL) algorithm, applied to the multiplayer differential game, finds the optimal control policy. Simulation studies demonstrate the performance of the IRL-based stochastic optimal control of power buffers in a DC microgrid.
|
|
10:20-10:24, Paper FrA02.6 | Add to My Program |
Model Predictive Control of Cadmium Telluride (CdTe) Quantum Dot(QD) Crystallization |
|
Sitapure, Niranjan | Texas A&M University |
Kwon, Joseph | Texas A&M University |
Keywords: Control applications, Materials processing, Chemical process control
Abstract: Inorganic semiconducting quantum dots (QDs) have emerged as a promising alternative to silicon with widespread applications in next-generation displays and highefficiency solar cells. Generally, the optoelectronic properties of QDs are majorly dictated by their bandgap energy (related to their size), which makes it important to accurately predict and control size of QD crystals. Unfortunately, unlike protein or sugar crystallization, there are very few models that describe QD crystallization. Moreover, the existing QD models are either based on computationally demanding multiscale modeling approaches making them unsuitable for direct implementation in a controller framework or based on black-box modeling providing little insight into crystallization kinetics. To address this knowledge gap, we present a population balance equation (PBE)-based model for QD crystallization. Specifically, the PBE along with mass and energy balance equations, growth and nucleation kinetics are decomposed into first-order ordinary differential equations (ODEs) that can be easily solved using present-day python solvers. Further, a model predictive controller (MPC) is demonstrated for set-point tracking of crystal size and distribution (CSD). Also, given the high computational efficiency of the developed simulation it can be directly incorporated within the MPC without the requirement of a surrogate model, thereby reducing the plant-model mismatch. Further, the case study of CdTe QDs, which are widely utilized in displays and solar cells, has been investigated. The simulation results are in good agreement with experimental observations, and the proposed MPC demonstrates effective size-control of CdTe QDs by manipulating the solute-concentration using a semi-batch addition operation. Overall, to the best of our knowledge, the current work is the first instance of utilizing well-established PBE-based crystallization model for accurate modeling and MPC-based control of QDs, and will serve as a foundation for modeling other QD systems.
|
|
10:24-10:28, Paper FrA02.7 | Add to My Program |
Improving Accuracy of Optical Sorters Using Closed-Loop Control of Material Recirculation |
|
Vieth, Jonathan | Hamburg University of Technology |
Reith-Braun, Marcel | Karlsruhe Institute of Technology (KIT) |
Bauer, Albert | Technical University of Berlin |
Pfaff, Florian | Karlsruhe Institute of Technology (KIT) |
Maier, Georg | Fraunhofer Institute of Optronics, System Technologies and Image |
Gruna, Robin | Fraunhofer Institute of Optronics, System Technologies and Image |
Längle, Thomas | Fraunhofer Institute of Optronics, System Technologies and Image |
Kruggel-Emden, Harald | Technische Universität Berlin |
Hanebeck, Uwe D. | Karlsruhe Institute of Technology (KIT) |
Keywords: Control applications, Materials processing, Modeling
Abstract: Optical sorting is a key technology for the circular economy and is widely applied in the food, mineral, and recycling industries. Despite its widespread use, one typically resorts to expensive means of adjusting the accuracy, e.g., by reducing the mass flow or changing mechanical or software parameters, which typically requires manual tuning in a lengthy, iterative process. To circumvent these drawbacks, we propose a new layout for optical sorters along with a controller that allows re-feeding of controlled fractions of the sorted mass flows. To this end, we build a dynamic model of the sorter, analyze its static behavior, and show how material recirculation affects the sorting accuracy. Furthermore, we build a model predictive controller (MPC) employing the model and evaluate the closed-loop sorting system using a coupled discrete element–computational fluid dynamics (DEM–CFD) simulation, demonstrating improved accuracy.
|
|
10:28-10:32, Paper FrA02.8 | Add to My Program |
A Control-Oriented Reduced-Order Model for Lithium-Metal Batteries |
|
Kawakita de Souza, Aloisio Henrique | University of Colorado at Colorado Springs |
Wesley, Hileman | University of Colorado Colorado Springs |
Trimboli, Michael | University of Colorado, Colorado Springs |
Plett, Gregory L. | University of Colorado Colorado Springs |
Keywords: Control applications, Model/Controller reduction, Modeling
Abstract: Lithium-metal batteries (LMB) are attractive for energy-storage applications because of their high specific energy and energy density. Unlike lithium-ion batteries (LIB), LMB have metallic lithium anodes which introduce complications to modeling their long-term behavior. In particular, a dead-lithium layer grows over time, and this must be described in any battery-management-system (BMS) model to enable producing good long-term estimates of state-of-charge, state-of-health, and power limits. This paper shows how to convert an LMB PDE model from the literature into a reduced-order control-oriented format suitable for implementation in BMS algorithms.
|
|
10:32-10:36, Paper FrA02.9 | Add to My Program |
2D Density Control of Micro-Particles Using Kernel Density Estimation |
|
Matei, Ion | Palo Alto Research Center |
de Kleer, Johan | Palo Alto Research Center |
Zhenirovskyy, Maksym | Palo Alto Research Center |
Keywords: Control applications, Modeling, Optimal control
Abstract: We address the challenge of controlling the density of particles in two dimensions by manipulating the electric field acting on the particles immersed in a dielectric fluid. An array of electrodes is used to control the electric field, which applies dielectrophoretic forces to achieve the desired pattern of particle density. To model the motion of a particle, we use a lumped, 2D, capacitive-based, and nonlinear model. We estimate the spatial dependence of the capacitances using electrostatic COMSOL simulations. We formulate an optimal control problem to determine the electrode potentials that will produce the desired particle density pattern. The loss function is defined in terms of the difference between the target density and the particle density at a specific final time. To estimate the particle density, we use a kernel density estimator (KDE) computed from the particle positions that vary with the electrode potentials. The effectiveness of our approach is demonstrated through numerical simulations that illustrate how the particle positions and electrode potentials change when shaping the particle density from a uniform to a Gaussian distribution.
|
|
10:36-10:40, Paper FrA02.10 | Add to My Program |
Implementation and Initial Testing of a Model Predictive Controller for Safety Factor Profile and Energy Regulation in the EAST Tokamak |
|
Wang, Zibo | Lehigh University |
Wang, Hexiang | Shanghai Institute of Applied Physics, Chinese Academy of Scienc |
Schuster, Eugenio | Lehigh University |
Luo, Zhengping | Institute of Plasma Physics, Chinese Academy of Sciences |
Huang, Yao | Institute of Plasma Physics, Chinese Academy of Sciences |
Yuan, Quiping | Institute of Plasma Physics, Chinese Academy of Sciences |
Xiao, B. J. | Institute of Plasma Physics, Chinese Academy of Sciences |
Humphreys, D.A. | General Atomics |
Paruchuri, Sai Tej | Lehigh University |
Keywords: Control applications, Predictive control for linear systems, Optimal control
Abstract: The tokamak, a potential candidate for realizing nuclear fusion energy on Earth, uses strong magnetic fields to confine a hot ionized gas (plasma) in a toroidal vacuum chamber. The ability of tokamaks to run in high-performance modes of operation demands advanced control capabilities to regulate the spatial distribution (profile) of several plasma properties such as the safety factor q. A model predictive control (MPC) approach has been followed to further advance such control capabilities for the EAST tokamak. The proposed controllers have the capability of simultaneously regulating the q-profile and the plasma stored energy W by controlling the plasma current I_p, the individual powers of four neutral beam injectors (NBI_{1L}, NBI_{1R}, NBI_{2L}, NBI_{2R}), and the powers of two lower hybrid wave sources with different frequencies (2.45~GHz, 4.60~GHz). An active-set algorithm has been employed to solve the Quadratic Programming (QP) problem arising from the MPC formulation. Initial experimental tests of the MPC show that the real-time optimization is successfully carried out within the time constraints imposed by the dynamics of the plasma.
|
|
FrA03 Regular Session, Sapphire EF |
Add to My Program |
Autonomous Robots |
|
|
Chair: Tanaka, Takashi | University of Texas at Austin |
Co-Chair: Esna Ashari, Alireza | General Motors |
|
10:00-10:15, Paper FrA03.1 | Add to My Program |
Time-Varying ALIP Model and Robust Foot-Placement Control for Underactuated Bipedal Robot Walking on a Swaying Rigid Surface |
|
Gao, Yuan | University of Massachusetts Lowell |
Gong, Yukai | University of Michgan |
Paredes, Victor | The Ohio State University |
Hereid, Ayonga | Ohio State University |
Gu, Yan | Purdue University |
Keywords: Autonomous robots, Feedback linearization, Optimization
Abstract: Controller design for bipedal walking on dynamic rigid surfaces (DRSes), which are rigid surfaces moving in the inertial frame (e.g., ships and airplanes), remains largely underexplored. This paper introduces a hierarchical control approach that achieves stable underactuated bipedal walking on a horizontally oscillating DRS. The highest layer of our approach is a real-time motion planner that generates desired global behaviors (i.e., center of mass trajectories and footstep locations) by stabilizing a reduced-order robot model. One key novelty of this layer is the derivation of the reduced-order model by analytically extending the angular momentum based linear inverted pendulum (ALIP) model from stationary to horizontally moving surfaces. The other novelty is the development of a discrete-time foot-placement controller that exponentially stabilizes the hybrid, linear, time-varying ALIP. The middle layer translates the desired global behaviors into the robot's full-body reference trajectories for all directly actuated degrees of freedom, while the lowest layer exponentially tracks those reference trajectories based on the full-order, hybrid, nonlinear robot model. Simulations confirm that the proposed framework ensures stable walking of a planar underactuated biped under different swaying DRS motions and gait types.
|
|
10:15-10:30, Paper FrA03.2 | Add to My Program |
Effectiveness of Warm-Start PPO for Guidance with Highly Constrained Nonlinear Fixed-Wing Dynamics |
|
Coletti, Christian | Sandia National Labs; Georgia Institute of Technology |
Williams, Kyle A | Sandia National Labs |
Lehman, Hannah | Sandia National Laboratory; Texas A&M University |
Kakish, Zahi | Arizona State University |
Whitten, Daniel | Sandia National Laboratory |
Parish, Julie | Sandia National Labs |
Keywords: Autonomous robots, Flight control, Intelligent systems
Abstract: Reinforcement learning (RL) may enable fixed-wing unmanned aerial vehicle (UAV) guidance to achieve more agile and complex objectives than typical methods. However, RL has yet struggled to achieve even minimal success on this problem; fixed-wing flight with RL-based guidance has only been demonstrated in literature with reduced state and/or action spaces. In order to achieve full 6-DOF RL-based guidance, this study begins training with imitation learning from classical guidance, a method known as warm-staring (WS), before further training using Proximal Policy Optimization (PPO). We show that warm starting is critical to successful RL performance on this problem. PPO alone achieved a 2% success rate in our experiments. Warm-starting alone achieved 32% success. Warm-starting plus PPO achieved 57% success over all policies, with 40% of policies achieving 94% success.
|
|
10:30-10:45, Paper FrA03.3 | Add to My Program |
Exploration of Unknown Scalar Fields with Multifidelity Gaussian Processes under Localization Uncertainty |
|
Coleman, Demetris | Michigan State University |
Bopardikar, Shaunak D. | Michigan State University |
Srivastava, Vaibhav | Michigan State University |
Tan, Xiaobo | Michigan State University |
Keywords: Autonomous robots, Statistical learning, Uncertain systems
Abstract: Autonomous marine vehicles are deployed in oceans and lakes to collect spatio-temporal data. GPS is often used for localization, but is inaccessible underwater. Poor localization underwater makes it difficult to pinpoint where data are collected, to accurately map, or to autonomously explore the ocean and other aquatic environments. This paper proposes the use of multifidelity Gaussian process regression to incorporate data associated with uncertain locations. With the proposed approach, an adaptive sampling algorithm is developed for exploration and mapping of unknown scalar fields. The reconstruction performance based on the multifidelity model is compared to that based on a single-fidelity Gaussian process model that only uses data with known locations, and to that based on a single-fidelity Gaussian process model that ignores the localization error. Numerical results show that the proposed multifidelity approach outperforms both single-fidelity approaches in terms of the reconstruction accuracy.
|
|
10:45-11:00, Paper FrA03.4 | Add to My Program |
A Smoothing Algorithm for Minimum Sensing Path Plans in Gaussian Belief Space |
|
Pedram, Ali Reza | University of Texas at Austin |
Tanaka, Takashi | University of Texas at Austin |
Keywords: Autonomous robots, Stochastic systems, Optimization
Abstract: This paper explores minimum sensing navigation of robots in environments cluttered with obstacles. The general objective is to find a path plan to a goal region that requires minimal sensing effort. In [1], the information-geometric RRT* (IG-RRT*) algorithm was proposed to efficiently find such a path. However, like any stochastic sampling-based planner, the computational complexity of IG-RRT* grows quickly, impeding its use with a large number of nodes. To remedy this limitation, we suggest running IG-RRT* with a moderate number of nodes, and then using a smoothing algorithm to adjust the path obtained. To develop a smoothing algorithm, we explicitly formulate the minimum sensing path planning problem as an optimization problem. For this formulation, we introduce a new safety constraint to impose a bound on the probability of collision with obstacles in continuous-time, in contrast to the common discrete-time approach. The problem is amenable to solution via the convex-concave procedure (CCP). We develop a CCP algorithm for the formulated optimization and use this algorithm for path smoothing. We demonstrate the efficacy of the proposed approach through numerical simulations.
|
|
11:00-11:15, Paper FrA03.5 | Add to My Program |
CHAMP: Integrated Logic with Reinforcement Learning for Hybrid Decision Making for Autonomous Vehicle Planning |
|
Jafari, Rouhollah | General Motors |
Esna Ashari, Alireza | General Motors |
Huber, Marcus | GM LLC |
Keywords: Autonomous robots, Hybrid systems, Machine learning
Abstract: A Cognitive Hybrid Autonomous Motion Planner (CHAMP) is developed for autonomous driving applications in challenging driving scenarios. The proposed hybrid planner unifies a hierarchical rule-based decision-making architecture with Reinforcement Learning (RL). For challenging intersection scenarios, RL agents are trained to replace a subset of the rules in the logical planner. The hybrid planner is systematically tested and benchmarked to demonstrate its effectiveness in handling challenging road scenario with congested and chaotic traffic conditions.
|
|
11:15-11:30, Paper FrA03.6 | Add to My Program |
RGB-LiDAR Pipeline for 3D Bounding Box Estimation in Low SWaP-C Indoor Navigation Applications |
|
Hoobler, Richard | University of Texas at Austin |
Wiberg, Dallin | University of Texas at Austin |
Akella, Maruthi | The University of Texas at Austin |
Keywords: Autonomous robots, Vision-based control, Autonomous systems
Abstract: The generation of 3D bounding boxes from a combination of RGB images and depth data is an important area of research for autonomous systems. Additional constraints must be considered in order for any method to be implemented in a small form factor unmanned aerial vehicle (UAV) or other robotic system. In this work, an ``ultra-lightweight'' pipeline is developed and used to generate 3D bounding boxes from aligned RGB-LiDAR images. Different from current implementations, the design of this pipeline was made to maintain a similar performance to more computationally intensive algorithms while also being implementable onboard low SWaP-C systems. The pipeline is demonstrated in a computationally restricted indoor environment by a small rover to navigate around obstacles while searching for a target object.
|
|
FrA04 Invited Session, Sapphire AB |
Add to My Program |
Methods in Robotics, Optimization, Learning, and Safety for Control of
Cyber-Physical Systems |
|
|
Chair: Cao, Yongcan | University of Texas, San Antonio |
Co-Chair: Garcia, Eloy | Air Force Research Laboratory |
Organizer: Sinha, Abhinav | University of Texas at San Antonio |
Organizer: Cao, Yongcan | University of Texas, San Antonio |
Organizer: Garcia, Eloy | Air Force Research Laboratory |
|
10:00-10:15, Paper FrA04.1 | Add to My Program |
Future-Focused Control Barrier Functions for Autonomous Vehicle Control (I) |
|
Black, Mitchell | University of Michigan |
Jankovic, Mrdjan | Ford Research (retired) |
Sharma, Abhishek | Ford Motor Company |
Panagou, Dimitra | University of Michigan, Ann Arbor |
Keywords: Constrained control, Autonomous systems, Predictive control for nonlinear systems
Abstract: In this paper, we introduce a class of future-focused control barrier functions (ff-CBF) aimed at improving traditionally myopic CBF based control design and study their efficacy in the context of an unsignaled four-way intersection crossing problem for collections of both communicating and non-communicating autonomous vehicles. Our novel ff-CBF encodes that vehicles take control actions that avoid collisions predicted under a zero-acceleration policy over an arbitrarily long future time interval. In this sense the ff-CBF defines a virtual barrier, a loosening of which we propose in the form of a relaxed future-focused CBF (rff-CBF) that allows a relaxation of the virtual ff-CBF barrier far from the physical barrier between vehicles. We study the performance of ff-CBF and rff-CBF based controllers on communicating vehicles via a series of simulated trials of the intersection scenario, and in particular highlight how the rff-CBF based controller empirically outperforms a benchmark controller from the literature by improving intersection throughput while preserving safety and feasibility. Finally, we demonstrate our proposed ff-CBF control law on an intersection scenario in the laboratory environment with a collection of 5 non-communicating AION ground rovers.
|
|
10:15-10:30, Paper FrA04.2 | Add to My Program |
On the Complexity and Approximability of Optimal Sensor Selection for Mixed-Observable Markov Decision Processes (I) |
|
Bhargav, Jayanth | Purdue University |
Ghasemi, Mahsa | Purdue University |
Sundaram, Shreyas | Purdue University |
Keywords: Estimation, Optimization algorithms, Markov processes
Abstract: Mixed-Observable Markov Decision Processes (MOMDPs) are used to model systems where the state space can be decomposed as a product space of a set of state variables, and the controlling agent is able to measure only a subset of those state variables. In this paper, we consider the setting where we have a set of potential sensors to select for the MOMDP, where each sensor measures a certain state variable and has a selection cost. We formulate the problem of selecting an optimal set of sensors for MOMDPs (subject to certain budget constraints) to maximize the expected infinite-horizon reward of the agent and show that this sensor placement problem is NP-Hard, even when one has access to an oracle that can compute the optimal policy for any given instance. We then study a greedy algorithm for approximate optimization and show that there exist instances of the MOMDP sensor selection problem where the greedy algorithm can perform arbitrarily poorly. Finally, we provide experimental results for the greedy algorithm for randomly generated MOMDP instances and show that, in practice, the greedy algorithm provides near-optimal solutions for many cases, but one cannot provide general theoretical guarantees for its performance. In total, our work establishes fundamental complexity results for the problem of optimal sensor placement for MOMDPs.
|
|
10:30-10:45, Paper FrA04.3 | Add to My Program |
Dynamic Component-Based Design Optimization of Multirotor Aircraft (I) |
|
Renkert, Philip | University of Illinois at Urbana-Champaign |
Alleyne, Andrew G. | University of Minnesota |
Keywords: Optimization algorithms, Optimal control, Energy systems
Abstract: Rising complexity of engineered systems, increasing needs for coordination among specialized design teams, and the emergence of component-based design modalities have created a need for component-based design optimization tools. Further, many modern systems are dynamic, and dynamic performance is a core component of the design objective. This work builds on a hybrid methodology for component-based design optimization by expanding the formulation to dynamic systems. The method is applied to select a planar quadrotor’s components and input trajectory to minimize the to complete a dynamic mission.
|
|
10:45-11:00, Paper FrA04.4 | Add to My Program |
Two-Player Reconnaissance Game with Half-Planar Target and Retreat Regions (I) |
|
Lee, Yoonjae | The University of Texas at Austin |
Bakolas, Efstathios | The University of Texas at Austin |
Keywords: Agents-based systems, Autonomous systems, Game theory
Abstract: This paper is concerned with the reconnaissance game that involves two mobile agents: the Intruder and the Defender. The Intruder is tasked to reconnoiter a territory of interest (target region) and then return to a safe zone (retreat region), where the two regions are disjoint half-planes, while being chased by the faster Defender. This paper focuses on the scenario where the Defender is not guaranteed to capture the Intruder before the latter agent reaches the retreat region. The goal of the Intruder is to minimize its distance to the target region, whereas the Defender's goal is to maximize the same distance. The game is decomposed into two phases based on the Intruder's myopic goal. The complete solution of the game corresponding to each phase, namely the Value function and state-feedback equilibrium strategies, is developed in closed-form using differential game methods. Numerical simulation results are presented to showcase the efficacy of our solutions.
|
|
11:00-11:15, Paper FrA04.5 | Add to My Program |
Perimeter Defense Using a Turret with Finite Range and Startup Times (I) |
|
Bajaj, Shivam | Michigan State University |
Bopardikar, Shaunak D. | Michigan State University |
Von Moll, Alexander | Air Force Research Laboratory |
Torng, Eric | Michigan State University |
Casbeer, David W. | Air Force Research Laboratory |
Keywords: Autonomous robots, Game theory, Autonomous systems
Abstract: We consider a perimeter defense problem in a planar conical environment comprising a turret that has a finite range and non-zero startup time. The turret seeks to defend a concentric perimeter against N>1 intruders. Upon release, each intruder moves radially towards the perimeter with a fixed speed. To capture an intruder, the turret’s angle must be aligned with that of the intruder’s angle and must spend a specified startup time at that orientation. We address offline and online versions of this optimization problem. Specifically, in the offline version, we establish that in general parameter regimes, this problem is equivalent to solving a Travelling Repairperson Problem with Time Windows (TRP-TW). We then identify specific parameter regimes in which there is a polynomial time algorithm that maximizes the number of intruders captured. In the online version, we present a competitive analysis technique in which we establish a fundamental guarantee on the existence of at best (N-1)-competitive algorithms. We also design two online algorithms that are provably 1 and 2-competitive in specific parameter regimes.
|
|
11:15-11:30, Paper FrA04.6 | Add to My Program |
An Optimization-Based Human Behavior Modeling and Prediction for Human-Robot Collaborative Disassembly (I) |
|
Tian, Sibo | University at Buffalo |
Liang, Xiao | University at Buffalo |
Zheng, Minghui | University at Buffalo |
Keywords: Robotics, Human-in-the-loop control, Optimization
Abstract: To achieve a safe and seamless human-robot collaboration in intelligent remanufacturing, robot agents should be able to understand human behaviors, predict human future motion, and incorporate motion prediction into their planning process. While most existing human prediction algorithms suffer from poor generalization and huge training data requirements, this paper models the human agent as a rational model seeking to minimize an unknown cost function along the motion trajectory. With such modeling, we design a set of features, such as collision avoidance, maintaining comfort during the motion, and reaching the goal point without too much detour, that could capture human intents during HRC. Maximum-Entropy inverse reinforcement learning is then leveraged to learn the underlying cost function from noisy human demonstrations. The human motion prediction is obtained by solving an optimization problem with a learned cost function. We particularly build an HRC dataset for human-robot-collaborative disassembly tasks and applied the proposed algorithm to this new dataset. Experimental studies are extensively conducted to validate our human motion prediction model.
|
|
FrA05 Regular Session, Sapphire 411A |
Add to My Program |
Optimal Control III |
|
|
Chair: Chakravorty, Suman | Texas A&M University |
Co-Chair: Sharma, Nitin | North Carolina State University |
|
10:00-10:15, Paper FrA05.1 | Add to My Program |
Reinforcement Learning Based Approximate Optimal Control of Nonlinear Systems Using Carleman Linearization |
|
Kar, Jishnudeep | North Carolina State University |
Bai, He | Oklahoma State University |
Chakrabortty, Aranya | North Carolina State University |
Keywords: Optimal control, Learning, Predictive control for linear systems
Abstract: We develop a policy iteration-based model-free reinforcement learning (RL) control for nonlinear systems with single input. First, Carleman linearization, a commonly used linearization technique in the Hilbert space, is applied to express the nonlinear system as an infinite-dimensional Carleman state-space model, followed by derivation of an online state-feedback RL controller using state and input data in this infinite-dimensional space. Next, the practicality of using {it any} finite-order truncation of this controller, and the corresponding closed-loop stability of the nonlinear plant is established. Results are validated using two numerical examples, where we show how our proposed method provides solutions close to the optimal control resulting from the model-based Carleman controllers. We also compare our controller to alternative data-driven methods, showing its advantage in terms of shorter learning time.
|
|
10:15-10:30, Paper FrA05.2 | Add to My Program |
Iterative Convex Optimization for Model Predictive Control with Discrete-Time High-Order Control Barrier Functions |
|
Liu, Shuo | Boston University |
Zeng, Jun | University of California, Berkeley |
Sreenath, Koushil | University of California, Berkeley |
Belta, Calin | Boston University |
Keywords: Optimal control, Lyapunov methods, Predictive control for nonlinear systems
Abstract: Safety is one of the fundamental challenges in control theory. Recently, multi-step optimal control problems for discrete-time dynamical systems were formulated to enforce stability, while subject to input constraints as well as safety-critical requirements using discrete-time control barrier functions within a model predictive control (MPC) framework. Existing work usually focus on the feasibility or the safety for the optimization problem, and the majority of the existing work restrict the discussions to relative-degree one control barrier functions. Additionally, the real-time computation is challenging when a large horizon is considered in the MPC problem for relative-degree one or high-order control barrier functions. In this paper, we propose a framework that solves the safety-critical MPC problem in an iterative optimization, which is applicable for any relative-degree control barrier functions. In the proposed formulation, the nonlinear system dynamics as well as the safety constraints modeled as discrete-time high-order control barrier functions (DHOCBF) are linearized at each time step. Our formulation is generally valid for any control barrier function with an arbitrary relative-degree. The advantages of fast computational performance with safety guarantee are analyzed and validated with numerical results.
|
|
10:30-10:45, Paper FrA05.3 | Add to My Program |
Nonsmooth Herglotz Variational Principle |
|
Lopez Gordon, Asier | Instituto De Ciencias Matematicas |
Colombo, Leonardo Jesus | Spanish National Research Council |
de Leon, Manuel | ICMAT, CSIC |
Keywords: Variational methods, Algebraic/geometric methods, Hybrid systems
Abstract: In this paper, the theory of smooth action-dependent Lagrangian mechanics (also known as contact Lagrangians) is extended to a non-smooth context appropriate for collision problems. In particular, we develop a Herglotz variational principle for non-smooth action-dependent Lagrangians which leads to the preservation of energy and momentum at impacts. By defining appropriately a Legendre transform, we can obtain the Hamilton equations of motion for the corresponding non-smooth Hamiltonian system. We apply the result to a billiard problem in the presence of dissipation.
|
|
10:45-11:00, Paper FrA05.4 | Add to My Program |
Continuous-Time Policy Optimization |
|
Zhan, Guojian | Tsinghua University |
Jiang, Yuxuan | Tsinghua University |
Duan, Jingliang | National University of Singapore |
Li, Shengbo Eben | Tsinghua University |
Cheng, Bo | TSINGHUA UNIVERSITY |
Li, Keqiang | Tsinghua University, Beijing, China |
Keywords: Optimal control, Machine learning, Neural networks
Abstract: Discretized dynamics is widespread in numerical optimization and optimal control. However, the physical system is inherently continuous at the macroscopic scale, thus handling the original continuous-time problem is desirable. In this paper, we focus on learning an optimal policy under the continuous-time finite-horizon optimal control setting. We introduce continuous-time policy optimization (CTPO), which employs the adjoint method to calculate the policy gradient, then implements optimization by gradient descent. The nature of CTPO is to minimize the integral of Hamiltonian over the time horizon to approach optimality, which fits the framework of Pontryagin's minimum principle. We further reveal that the intrinsic connection to its discrete-time counterpart lies in the different order of differentiation and discretization operations. Finally we conduct experiments on a linear quadratic regulator (LQR) and a nonlinear vehicle trajectory tracking task. The results demonstrate that the trained policy retains continuous-time system information and achieves high accuracy.
|
|
11:00-11:15, Paper FrA05.5 | Add to My Program |
A Reduced Order Iterative Linear Quadratic Regulator (ILQR) Technique for the Optimal Control of Nonlinear Partial Differential Equations |
|
Sharma, Aayushman | Texas A&M University |
Chakravorty, Suman | Texas A&M University |
Keywords: Optimal control, Model/Controller reduction, Nonlinear systems identification
Abstract: In this paper, we introduce a reduced order Iterative Linear Quadratic Regulator (RO-ILQR) approach for the optimal control of nonlinear Partial Differential Equations (PDE). The approach proposes a novel modification of the ILQR technique: it uses the Method of Snapshots to identify a reduced order Linear Time Varying (LTV) approximation of the nonlinear PDE dynamics around a current estimate of the optimal trajectory, utilizes the identified LTV model to solve a time varying reduced order LQR problem to obtain an improved estimate of the optimal trajectory along with a new reduced basis, and iterates till convergence. The proposed approach is tested on the viscous Burger's equation and two phase field models for microstructure evolution in materials, and the results show that there is a significant reduction in the computational burden over the standard ILQR approach, without sacrificing performance.
|
|
11:15-11:30, Paper FrA05.6 | Add to My Program |
Continual Optimal Adaptive Tracking of Uncertain Nonlinear Continuous-Time Systems Using Multilayer Neural Networks |
|
Ganie, Irfan Ahmad | Missouri University of Science and Technology Rolla MO 65401 |
Jagannathan, Sarangapani | Missouri Univ of Science & Tech |
Keywords: Optimal control, Neural networks, Learning
Abstract: This study provides a lifelong integral reinforcement learning (LIRL)-based optimal tracking scheme for uncertain nonlinear continuous-time (CT) systems using multilayer neural network (MNN). In this LIRL framework, the optimal control policies are generated by using both the critic neural network (NN) weights and single-layer NN identifier. The critic MNN weight tuning is accomplished using an improved singular value decomposition (SVD) of its activation function gradient. The NN identifier, on the other hand, provides the control coefficient matrix for computing the control policies. An online weight velocity attenuation (WVA)-based consolidation scheme is proposed wherein the significance of weights is derived by using Hamilton-Jacobi-Bellman (HJB) error. This WVA term is incorporated in the critic MNN update law to overcome catastrophic forgetting. Lyapunov stability is employed to demonstrate the uniform ultimate boundedness of the overall closed-loop system. Finally, a numerical example of a two-link robotic manipulator supports the theoretical claims.
|
|
FrA06 Regular Session, Sapphire 411B |
Add to My Program |
Markov Processes |
|
|
Chair: Han, Shuo | University of Illinois Chicago |
Co-Chair: Dahlin, Nathan | University of Illinois at Urbana-Champaign |
|
10:00-10:15, Paper FrA06.1 | Add to My Program |
Controlling a Markov Decision Process with an Abrupt Change in the Transition Kernel |
|
Dahlin, Nathan | University of Illinois at Urbana-Champaign |
Bose, Subhonmesh | University of Illinois at Urbana Champaign |
Veeravalli, Venugopal V. | Univ of Illinois, Urbana-Champaign |
Keywords: Markov processes, Stochastic optimal control, Stochastic systems
Abstract: We consider the control of a Markov decision process (MDP) that undergoes an abrupt change in its transition kernel (mode). We formulate the problem of minimizing regret under control switching based on mode change detection, compared to a mode-observing controller, as an optimal stopping problem. Using a sequence of approximations, we reduce it to a quickest change detection (QCD) problem with Markovian data, for which we characterize a state-dependent threshold-type optimal change detection policy. Numerical experiments illustrate various properties of our control-switching policy.
|
|
10:15-10:30, Paper FrA06.2 | Add to My Program |
Fixed-Point Equations Solving Risk-Sensitive MDP with Constraint |
|
Singh, Vartika | IIT Bombay |
Veeraruna, Kavitha | IIT Bombay, India |
Keywords: Markov processes, Optimization algorithms, Stochastic systems
Abstract: There are no computationally feasible algorithms that provide solutions to the finite horizon Risk-sensitive Constrained Markov Decision Process (Risk-CMDP) problem, even for problems with moderate horizon. With an aim to design the same, we derive a fixed-point equation such that the optimal policy of Risk-CMDP is also a solution. We further provide two optimization problems equivalent to the Risk-CMDP. These formulations are instrumental in designing a global algorithm that converges to the optimal policy. The proposed algorithm is based on random restarts and a local improvement step, where the local improvement step utilizes the solution of the derived fixed-point equation; random restarts ensure global optimization. We also provide numerical examples to illustrate the feasibility of our algorithm for inventory control problem with risk-sensitive cost and constraint. The complexity of the algorithm grows only linearly with the time-horizon.
|
|
10:30-10:45, Paper FrA06.3 | Add to My Program |
Synthesis of Proactive Sensor Placement in Probabilistic Attack Graphs |
|
Li, Lening | Worcester Polytechnic Institute |
Ma, Haoxiang | University of Florida |
Han, Shuo | University of Illinois Chicago |
Fu, Jie | University of Florida |
Keywords: Markov processes, Game theory, Control applications
Abstract: This paper studies the deployment of joint moving target defense (MTD) and deception against multi-stage cyberattacks. Given the system equipped with MTD that randomizes between different configurations, we investigate how to allocate a bounded number of sensors in each configuration to optimize the probability of detecting the attack before the attacker achieves its objective. Specifically, two types of sensors are considered: intrusion detectors that are observable by the attacker and stealthy sensors that are not observable to the attacker. We propose a two-step optimization-based approach: Firstly, the defender allocates intrusion detectors assuming the attacker will best respond to evade detection. Secondly, the defender will allocate stealthy sensors, given the best response attack strategy computed in the first step, to further reduce the attacker's chance of success. We illustrate the effectiveness of the proposed methods using a cyber defense example.
|
|
10:45-11:00, Paper FrA06.4 | Add to My Program |
Provable-Correct Partitioning Approach for Continuous-Observation POMDPs with Special Observation Distributions |
|
Zheng, Wei | University of Notre Dame |
Lin, Hai | University of Notre Dame |
Keywords: Markov processes, Optimization algorithms, Optimal control
Abstract: The partially observable Markov decision process with continuous observations has emerged as a popular model for system modeling and sequential decision-making for many real-world problems. The main challenge induced by continuous observations is its high computational complexity in the planning process because it is impossible to enumerate all observations in a continuous space. In this paper, we propose a static observation space partitioning approach to solve a continuous-observation POMDP approximately. Although observation space partitioning approaches have been investigated in the literature, a formal analysis of the partitioning effect on the system performance is still missing. We aim to fill this gap by providing a formal analysis of the approximation error. For this, the belief update function is shown to be Lipschitz continuous for the observation when the observation function satisfies certain properties. With this property, we formally prove that the approximation error of each value iteration is bounded. Meanwhile, we show that the proposed approach can be integrated into the heuristic search value iteration algorithm with performance guarantees. Finally, the advantage of using the static partitioning approach rather than the Monte Carlo sampling approach is validated by experimental results.
|
|
11:00-11:15, Paper FrA06.5 | Add to My Program |
Finite-Region Asynchronous Fault-Tolerant Control of 2-D Markov Jump Systems with Sensor Faults (I) |
|
Ren, Chengcheng | Anhui University |
Xia, Zeliang | Anhui University |
He, Shuping | Anhui University |
Keywords: Fault tolerant systems, Markov processes, H-infinity control
Abstract: This paper investigates the finite-region asynchronous fault-tolerant control problem for 2-D Markov jump systems with sensor faults. Considering the system mode and controller mode are asynchronized, we aim to derive a suitable asynchronous fault-tolerant controller such that the closed-loop 2-D Markov jump systems be finite-region stabilizable and satisfies the given H_{infty} performance index. Applying the stochastic Lyapunov-Krasovskii functional methods, some sufficient conditions are given to obtain the finite-region controller. Finally, a numerical example is used to show the feasibility and validity of the main results.
|
|
FrA07 Regular Session, Aqua 303 |
Add to My Program |
Computational Methods |
|
|
Chair: Liu, Jinfeng | University of Alberta |
Co-Chair: Hafstein, Sigurdur | University of Iceland |
|
10:00-10:15, Paper FrA07.1 | Add to My Program |
Computing Forward Reachable Sets for Nonlinear Adaptive Multirotor Controllers |
|
Han, Juyeop | Korea Advanced Institute of Science and Technology |
Choi, Han-Lim | KAIST |
Keywords: Computational methods, Uncertain systems, Optimal control
Abstract: In multirotor systems, guaranteeing safety while considering unknown disturbances is essential for robust trajectory planning. The Forward reachable set (FRS), the set of feasible states subject to bounded disturbances, can be utilized to identify robust and collision-free trajectories by checking the intersections with obstacles. However, in many cases, the FRS is not calculated in real time and is too conservative to be used in actual applications. In this paper, we address these issues by introducing a nonlinear disturbance observer (NDOB) and an adaptive controller to the multirotor system. We express the FRS of the closed-loop multirotor system with an adaptive controller in augmented state space using Hamilton-Jacobi reachability analysis. Then, we derive a closed-form expression that over-approximates the FRS as an ellipsoid, allowing for real-time computation. By compensating for disturbances with the adaptive controller, our over-approximated FRS can be smaller than other ellipsoidal over-approximations. Numerical examples validate the computational efficiency and the smaller scale of our proposed FRS.
|
|
10:15-10:30, Paper FrA07.2 | Add to My Program |
Neural Koopman Control Barrier Functions for Safety-Critical Control of Unknown Nonlinear Systems |
|
Zinage, Vrushabh | University of Texas at Austin |
Bakolas, Efstathios | The University of Texas at Austin |
Keywords: Computational methods, Modeling, Robotics
Abstract: We consider the problem of synthesis of safe controllers for nonlinear systems with unknown dynamics using Control Barrier Functions (CBF). We utilize Koopman operator theory (KOT) to associate the (unknown) nonlinear system with a higher dimensional bilinear system and propose a data-driven learning framework that uses a learner and a falsifier to simultaneously learn the Koopman operator based bilinear system and a corresponding CBF. We prove that the learned CBF for the latter bilinear system is also a valid CBF for the unknown nonlinear system by characterizing the ell^2-norm error bound between these two systems. We show that this error can be partially tuned by using the Lipschitz constant of the Koopman based observables. The CBF is then used to formulate a quadratic program to compute inputs that guarantee safety of the unknown nonlinear system. Numerical simulations are presented to validate our approach.
|
|
10:30-10:45, Paper FrA07.3 | Add to My Program |
Multiscale Modeling, Experimental Validation, and Optimal Operation for a Batch Pulp Digester with a Novel Solvent |
|
Pahari, Silabrata | Texas A&M |
Kim, Juhyeon | Texas A&M University |
Zhang, Mairui | State University of New York College of Environmental Science An |
Ji, Anqi | 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: Computational methods, Reduced order modeling, Materials processing
Abstract: The rising need for reducing the usage and wastage of paper has mandated the production of mechanically superior papers, and it is known that maintaining a high degree of polymerization (DP) for cellulose microfibers ensures the high tensile strength of the pulp. To mitigate the cellulose degradation and establish the optimum operating strategies of the pulping processes, it is necessary to understand the effect of the operation conditions on cellulose DP. In this sense, we proposed a novel multiscale model which can predict the mesoscopic properties (e.g., Kappa number, and fiber morphology) alongside the microscopic properties (e.g., cellulose DP). The model incorporates a multi-layered kinetic Monte Carlo (kMC) framework that allows us to capture the temporal evolution of Kappa number, fiber morphology, and cellulose DP in a computationally tractable fashion. Furthermore, the model predictions are validated with the experimental results, which are then used to find an optimal operation profile to achieve desired Kappa number and cellulose DP.
|
|
10:45-11:00, Paper FrA07.4 | Add to My Program |
Sensor Placement for Post-Combustion CO2 Capture Plants |
|
Liu, Siyu | Jiangnan University |
Yin, Xunyuan | Nanyang Technological University |
Liu, Jinfeng | University of Alberta |
Keywords: Computational methods, Control applications, Process Control
Abstract: The process monitoring and control of post-combustion CO2 capture plants (PCCPs) is crucial. In this work, we consider the problem of placing sensors for PCCPs and propose a computationally efficient method to perform sensor placement. The objective is to find the (near-)optimal set of sensors that gives the maximum degree of observability for state estimation while satisfying certain budget constraint. Specifically, we resort to the information contained in the sensitivity matrix calculated around the operating region of a PCCP to quantify the degree of observability of the states corresponding to the placed sensors. The sensor placement problem is formulated as an optimization problem and is efficiently solved by a one-by-one removal approach through orthogonalization. The proposed approach is demonstrated to be applicable and efficient through simulations.
|
|
11:00-11:15, Paper FrA07.5 | Add to My Program |
Common Lyapunov Functions for Switched Linear Systems: Linear Programming Based Approach |
|
Andersen, Stefania | University of Iceland |
Giesl, Peter | University of Sussex |
Hafstein, Sigurdur | University of Iceland |
Keywords: Switched systems, Lyapunov methods, Computational methods
Abstract: We study the stability of an equilibrium of arbitrarily switched, autonomous, continuous-time systems through the computation of a common Lyapunov function (CLF). The switching occurs between a finite number of individual subsystems, each of which is assumed to be linear. We present a linear programming (LP) based approach to compute a continuous and piecewise affine (CPA) CLF and compare this approach with different methods in the literature. In particular we compare it with the prevalent use of linear matrix inequalities (LMIs) and semidefinite optimization to parameterize a quadratic common Lyapunov function (QCLF) for the linear subsystems.
|
|
11:15-11:30, Paper FrA07.6 | Add to My Program |
An Iterative Approach to Optimal Control Design for Oscillator Networks |
|
Singhal, Bharat | Washington University in St. Louis |
Vu, Minh | Washington University in St. Louis |
Zeng, Shen | Washington University in St. Louis |
Li, Jr-Shin | Washington University in St. Louis |
Keywords: Control of networks, Numerical algorithms, Biological systems
Abstract: We propose a computational framework for optimal control design of oscillator networks. We first introduce a new system representation to eliminate challenges arising from the periodic nature of oscillators. The representation allows us to consider the general problem of pattern formation for oscillators as a classical point-to-point steering. We then develop a novel control design technique that offers the flexibility to blend the time-optimal and energy-optimal considerations with a parameter of choice. We demonstrate the applicability of the proposed framework to a variety of neuroscience applications.
|
|
FrA08 Invited Session, Aqua 305 |
Add to My Program |
Resiliency and Privacy Throughout Networked Cyber-Physical Systems |
|
|
Chair: Khajenejad, Mohammad | University of California, San Diego |
Co-Chair: Le Ny, Jerome | Polytechnique Montréal |
Organizer: Khajenejad, Mohammad | University of California, San Diego |
Organizer: Brown, Scott | University of California, San Diego |
Organizer: Pasqualetti, Fabio | University of California, Riverside |
Organizer: Martinez, Sonia | University of California at San Diego |
|
10:00-10:15, Paper FrA08.1 | Add to My Program |
Disturbance Propagation Stability in Droop-Controlled Microgrids |
|
Roy, Sandip | Washington State University |
Nandanoori, Sai Pushpak | Pacific Northwest National Laboratory |
Sarker, Subir | Washington State University |
Kundu, Soumya | Pacific Northwest National Laboratory |
Adetola, Veronica | Pacific Northwest National Lab |
Keywords: Network analysis and control, Power systems, Control of networks
Abstract: The disturbance response of the angle dynamics for a droop-controlled islanded microgrid is characterized. Specifically, a notion of propagation stability is defined, which is concerned with spatial attenuation vs amplification of input-output responses in the network in a H-infty or H-2 sense. Criteria for propagation stability are developed, phrased in terms of the microgrid's inverter control parameters. The input frequency range over which the network is susceptible to amplification is also characterized, in the case that the criteria are not met. Based on the formal analysis, the design of resilient controls that trade off coherence and disturbance propagation goals is briefly conceptualized. Finally, the propagation stability analysis is illustrated using a 15-bus example microgrid network.
|
|
10:15-10:30, Paper FrA08.2 | Add to My Program |
Resilient Distributed Parameter Estimation in Sensor Networks (I) |
|
Yan, Jiaqi | Tokyo Institute of Technology |
Li, Kuo | Tsinghua University |
Ishii, Hideaki | Tokyo Institute of Technology |
Keywords: Estimation, Cooperative control, Sensor networks
Abstract: In this paper, we study the problem of parameter estimation in a sensor network, where the measurements and updates of some sensors might be arbitrarily manipulated by adversaries. Despite the presence of such misbehaviors, normally behaving sensors make successive observations of an unknown d-dimensional vector parameter and aim to infer its true value by cooperating with their neighbors over a directed communication graph. To this end, by leveraging the so-called dynamic regressor extension and mixing procedure, we transform the problem of estimating the vector parameter to that of estimating d scalar ones. For each of the scalar problem, we propose a resilient combine-then-adapt diffusion algorithm, where each normal sensor performs a resilient combination to discard the suspicious estimates in its neighborhood and to fuse the remaining values, alongside an adaptation step to process its streaming observations. With a low computational cost, this estimator guarantees that each normal sensor exponentially infers the true parameter even if some of them are not sufficiently excited.
|
|
10:30-10:45, Paper FrA08.3 | Add to My Program |
On the Resilience of Traffic Networks under Non-Equilibrium Learning (I) |
|
Pan, Yunian | New York University |
Li, Tao | New York University |
Zhu, Quanyan | New York University |
Keywords: Transportation networks, Learning, Traffic control
Abstract: We investigate the resilience of learning-based textit{Intelligent Navigation Systems} (INS) to informational flow attacks, which exploit the vulnerabilities of IT infrastructure and manipulate traffic condition data. To this end, we propose the notion of textit{Wardrop Non-Equilibrium Solution} (WANES), which captures the finite-time behavior of dynamic traffic flow adaptation under a learning process. The proposed non-equilibrium solution, characterized by target sets and measurement functions, evaluates the outcome of learning under a bounded number of rounds of interactions, and it pertains to and generalizes the concept of approximate equilibrium. Leveraging finite-time analysis methods, we discover that under the mirror descent (MD) online-learning framework, the traffic flow trajectory is capable of restoring to the Wardrop non-equilibrium solution after a bounded INS attack. The resulting performance loss is of order tilde{mathcal{O}}(T^{beta}) (-frac{1}{2} leq beta < 0 )), with a constant dependent on the size of the traffic network, indicating the resilience of the MD-based INS. We corroborate the results using an evacuation case study on a Sioux-Fall transportation network.
|
|
10:45-11:00, Paper FrA08.4 | Add to My Program |
Cooperative Differentially Private LQG Control with Measurement Aggregation (I) |
|
Degue, Kwassi Holali | Massachusetts Institute of Technology |
Le Ny, Jerome | Polytechnique Montréal |
Keywords: Stochastic optimal control, Kalman filtering, Large-scale systems
Abstract: When multiple agents solve cooperatively a joint optimal control problem, it is generally beneficial for them to coordinate their control signals. However, such strategies require that the agents share their local measurements, which may be privacy-sensitive. Motivated by this issue, this paper considers the Linear Quadratic Gaussian (LQG) control problem subject to differential privacy constraints. Differential privacy ensures that the published signals of an algorithm are not too sensitive to the data of any single participating agent. We propose a two-stage architecture for differentially private LQG control and show how to optimize it by leveraging a solution that we previously developed for the Kalman filtering problem. The first stage of this architecture is most easily implemented by a coordinator aggregating and perturbing the agents’ measurements appropriately, but it can also be implemented without a trusted aggregator by using a secure sum protocol. Numerical simulations illustrate the performance improvement of this architecture over simpler alternatives such as directly perturbing the agents' measurements.
|
|
11:00-11:15, Paper FrA08.5 | Add to My Program |
Statistical Verification of Traffic Systems with Expected Differential Privacy (I) |
|
Yen, Mark | University of Florida |
Dullerud, Geir E. | Univ of Illinois, Urbana-Champaign |
Wang, Yu | University of Florida |
Keywords: Model Validation, Randomized algorithms, Traffic control
Abstract: Traffic systems are multi-agent cyber-physical systems whose performance is closely related to human welfare. They work in open environments and are subject to uncertainties from various sources, making their performance hard to verify by traditional model-based approaches. Alternatively, statistical model checking (SMC) can verify their performance by sequentially drawing sample data until the correctness of a performance specification can be inferred with desired statistical accuracy. This work aims to verify traffic systems with privacy, motivated by the fact that the data used may include personal information (e.g., daily itinerary) and get leaked unintendedly by observing the execution of the SMC algorithm. To formally capture data privacy in SMC, we introduce the concept of expected differential privacy (EDP), which constrains how much the algorithm execution can change in the expectation sense when data change. Accordingly, we introduce an exponential randomization mechanism for the SMC algorithm to achieve the EDP. Our case study on traffic intersections by Vissim simulation shows the high accuracy of SMC in traffic model verification without significantly sacrificing computing efficiency. The case study also shows EDP successfully bounding the algorithm outputs to guarantee privacy.
|
|
11:15-11:30, Paper FrA08.6 | Add to My Program |
Distributed Resilient Interval Observers for Bounded-Error LTI Systems Subject to False Data Injection Attacks |
|
Khajenejad, Mohammad | University of California, San Diego |
Brown, Scott | University of California, San Diego |
Martinez, Sonia | University of California at San Diego |
Keywords: Estimation, Fault detection, Uncertain systems
Abstract: Abstract— This paper proposes a novel distributed interval-valued simultaneous state and input observer for linear time-invariant (LTI) systems that are subject to attacks or unknown inputs, injected both on their sensors and actuators. Each agent in the network leverages a singular value decomposition (SVD) based transformation to decompose its observations into two components, one of them unaffected by the attack signal, which helps to obtain local interval estimates of the state and unknown input and then uses intersection to compute the best interval estimate among neighboring nodes. We show that the computed intervals are guaranteed to contain the true state and input trajectories, and we provide conditions under which the observer is stable. Furthermore, we provide a method for designing stabilizing gains that minimize an upper bound on the worst-case steady-state observer error. We demonstrate our algorithm on an IEEE 14-bus power system.
|
|
FrA09 Regular Session, Aqua 307 |
Add to My Program |
Formal Verification/Synthesis |
|
|
Chair: Coogan, Samuel | Georgia Institute of Technology |
Co-Chair: Rutledge, Kwesi | University of Michigan - Ann Arbor |
|
10:00-10:15, Paper FrA09.1 | Add to My Program |
Controller Synthesis for Unknown-Mode Linear Systems with an Epistemic Variant of LTL |
|
Rutledge, Kwesi | Massachusetts Institute of Technology |
Mei, Yuhang | University of Michigan, Ann Arbor |
Ozay, Necmiye | Univ. of Michigan |
Keywords: Formal verification/synthesis, Autonomous robots, Fault tolerant systems
Abstract: Linear temporal logic (LTL) with the knowledge operator, denoted as KLTL, is a variant of LTL that incorporates what an agent knows or learns at run-time into its specification. Therefore it is an appropriate logical formalism to specify tasks for systems with unknown components that are learned or estimated at run-time. In this paper, we consider a linear system whose system matrices are unknown but come from an a priori known finite set. We introduce a form of KLTL that can be interpreted over the trajectories of such systems. Finally, we show how controllers that guarantee satisfaction of specifications given in fragments of this form of KLTL can be synthesized using optimization techniques. Our results are demonstrated in simulation and on hardware in a drone scenario where the task of the drone is conditioned on its health status, which is unknown a priori and discovered at run-time.
|
|
10:15-10:30, Paper FrA09.2 | Add to My Program |
Iterative Planner/Controller Design to Satisfy Signal Temporal Logic Specifications |
|
Buyukkocak, Ali Tevfik | University of Minnesota |
Seiler, Peter | University of Michigan, Ann Arbor |
Aksaray, Derya | Northeastern University |
Gupta, Vijay | Purdue University |
Keywords: Formal verification/synthesis, Optimization
Abstract: This paper considers the design of a planner/tracker for a dynamical system with complex mission specifications expressed as a Signal Temporal Logic (STL) formula. The design consists of two parts: (i) a high-level planner to generate a reference trajectory to satisfy the desired STL formula, and (ii) a low-level controller to generate the control inputs to track the given reference trajectory. Traditionally, these two parts are often designed in a decoupled fashion. Moreover, the planner is often designed using an open-loop plant model that neglects (or only loosely accounts for) the low-level controller. We propose a control synthesis framework in which the high-level planner and the low-level controller are designed simultaneously in an iterative process. We demonstrate our results using a quadcopter scenario and benchmark our results with existing methods in the literature.
|
|
10:30-10:45, Paper FrA09.3 | Add to My Program |
A Hybrid Partitioning Strategy for Backward Reachability of Neural Feedback Loops |
|
Rober, Nicholas | MIT |
Everett, Michael | Northeastern University |
Zhang, Songan | Ford Motor Company |
How, Jonathan, P. | MIT |
Keywords: Formal verification/synthesis, Machine learning, Autonomous systems
Abstract: As neural networks become more integrated into the systems that we depend on for transportation, medicine, and security, it becomes increasingly important that we develop methods to analyze their behavior to ensure that they are safe to use within these contexts. The methods used in this paper seek to certify safety for closed-loop systems with neural network controllers, i.e., neural feedback loops, using backward reachability analysis. Namely, we calculate backprojection (BP) set over-approximations (BPOAs), i.e., sets of states that lead to a given target set that bounds dangerous regions of the state space. The system's safety can then be certified by checking its current state against the BPOAs. While over-approximating BPs is significantly faster than calculating exact BP sets, solving the relaxed problem leads to conservativeness. To combat conservativeness, partitioning strategies can be used to split the problem into a set of sub-problems, each less conservative than the unpartitioned problem. We introduce a hybrid partitioning method that uses both target set partitioning (TSP) and backreachable set partitioning (BRSP) to overcome a lower bound on estimation error that is present when using BRSP. Numerical results demonstrate a near order-of-magnitude reduction in estimation error compared to BRSP or TSP given the same computation time.
|
|
10:45-11:00, Paper FrA09.4 | Add to My Program |
Robust Multi-Agent Coordination from CaTL+ Specifications |
|
Liu, Wenliang | Boston University |
Leahy, Kevin | MIT Lincoln Laboratory |
Serlin, Zachary | MIT Lincoln Laboratory |
Belta, Calin | Boston University |
Keywords: Formal verification/synthesis, Cooperative control, Optimal control
Abstract: We consider the problem of controlling a heterogeneous multi-agent system required to satisfy temporal logic requirements. Capability Temporal Logic (CaTL) was recently proposed to formalize such specifications for deploying a team of autonomous agents with different capabilities and cooperation requirements. In this paper, we extend CaTL to a new logic CaTL+, which is more expressive than CaTL and has semantics over a continuous workspace shared by all agents. We define a novel robustness metric for CaTL+, which is sound, differentiable almost everywhere and eliminates masking, which is one of the main limitations of existing traditional robustness metrics. We formulate a control synthesis problem to maximize CaTL+ robustness and propose a two-step optimization method to solve this problem. Simulation results are included to illustrate the increased expressivity of CaTL+ and the efficacy of the proposed control synthesis approach.
|
|
11:00-11:15, Paper FrA09.5 | Add to My Program |
Runtime Assurance from Signal Temporal Logic Safety Specifications |
|
Baird, Luke | Georgia Institute of Technology |
Coogan, Samuel | Georgia Institute of Technology |
Keywords: Formal verification/synthesis, Model Validation, Predictive control for linear systems
Abstract: In this paper, we propose a runtime assurance mechanism for online verification of a control system given a signal temporal logic (STL) specification that, at each time step, must hold for the remaining state trajectory. Given a nominal control input, we propose a mechanism that minimally adjusts the input at each time step in order to ensure existence of future inputs that maintain satisfaction of the STL specification. Because STL constraints generally impose requirements on future states, the runtime assurance mechanism also enforces continued satisfaction of the STL constraint evaluated at all past time steps. Lastly, to ensure a feasible input is always available, we provide a novel characterization of a persistently feasible set and require that the system state is always able to reach this set. We formulate this approach as a mixed integer convex program and demonstrate it on examples.
|
|
11:15-11:30, Paper FrA09.6 | Add to My Program |
Opportunistic Qualitative Planning in Stochastic Systems with Incomplete Preferences Over Reachability Objectives |
|
Kulkarni, Abhishek | University of Florida at Gainesville |
Fu, Jie | University of Florida |
Keywords: Formal verification/synthesis, Markov processes, Stochastic systems
Abstract: Preferences play a key role in determining what goals/constraints to satisfy when not all constraints can be satisfied simultaneously. In this paper, we study how to synthesize preference-satisfying plans in a stochastic system modeled as an MDP, given a (possibly incomplete) combinative preference model over temporally extended goals. We start by introducing new semantics to interpret preferences over infinite plays of the stochastic system. Then, we introduce a new notion of `improvement' to enable comparison between two prefixes of an infinite play. Based on this, we define two solution concepts called Safe and Positively Improving (SPI) and Safe and Almost-Sure Improving (SASI) that enforce improvements with a positive probability and with probability one, respectively. We construct a model called an improvement MDP, in which the synthesis of SPI and SASI strategies that guarantee at least one improvement, reduces to computing positive and almost-sure winning strategies in an MDP. We present an algorithm to synthesize the SPI and SASI strategies that induce multiple sequential improvements. We demonstrate the proposed approach using a robot motion planning problem.
|
|
FrA10 Regular Session, Aqua 309 |
Add to My Program |
Hybrid Systems |
|
|
Chair: Li, Zhaojian | Michigan State University |
Co-Chair: Sanfelice, Ricardo G. | University of California at Santa Cruz |
|
10:00-10:15, Paper FrA10.1 | Add to My Program |
Optimal Safety for Constrained Differential Inclusions Using Nonsmooth Control Barrier Functions |
|
Ghanbarpour Mamaghani, Masoumeh | University of California Santa Cruz |
Isaly, Axton | University of Florida |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Dixon, Warren E. | University of Florida |
Keywords: Hybrid systems
Abstract: For a broad class of nonlinear systems, we formulate the problem of guaranteeing safety with optimality under constraints. Specifically, we define controlled safety for differential inclusions with constraints on the states and the inputs. Through the use of nonsmooth analysis tools, we show that a continuous optimal control law can be selected from a set-valued constraint capturing the system constraints and conditions guaranteeing safety using control barrier functions. Our results guarantee optimality and safety via a continuous state-feedback law designed using nonsmooth control barrier functions. An example pertaining to obstacle avoidance with a target illustrates our results and the associated benefits of using nonsmooth control barrier functions.
|
|
10:15-10:30, Paper FrA10.2 | Add to My Program |
Global Accelerated Nonconvex Geometric Optimization Methods on SO(3) |
|
Akhtar, Adeel | University of California at Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Optimization, Optimization algorithms
Abstract: This paper proposes global accelerated nonconvex geometric (GANG) optimization algorithms for optimizing a class of nonconvex functions on a compact Lie group, i.e., SO(3). Nonconvex optimization is a challenging problem because the objective function may have multiple critical points, including saddles points. We propose two accelerated geometric algorithms to escape maxima and saddle points using random perturbations. The first algorithm uses the value of the Hessian of the objective functions and random perturbations to escape the undesired critical points. In contrast, the second algorithm uses only the gradient information and random perturbation to escape maxima and saddle points. The results of these geometric algorithms are verified in simulations.
|
|
10:30-10:45, Paper FrA10.3 | Add to My Program |
A Discretization of the Hybrid Gradient Algorithm for Linear Regression with Sampled Hybrid Signals |
|
Wu, Nathan | University of California, Santa Cruz |
Johnson, Ryan S. | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Hybrid systems, Identification, Estimation
Abstract: We consider the problem of estimating a vector of unknown constant parameters for a linear regression model whose inputs and outputs are discretized hybrid signals – that is, they are samples of hybrid signals that exhibit both continuous (flow) and discrete (jump) evolution. Using a hybrid systems framework, we propose a hybrid gradient descent algorithm that operates during both flows and jumps. We show that this algorithm guarantees exponential convergence of the parameter estimate to the unknown parameter under a new notion of discretized hybrid persistence of excitation that relaxes the classical discrete-time persistence of excitation condition. Simulation results validate the properties guaranteed by the new algorithm.
|
|
10:45-11:00, Paper FrA10.4 | Add to My Program |
Jump Law of Co-State in Optimal Control for State-Dependent Switched Systems and Applications |
|
Zhou, Mi | Georgia Institute of Technology |
Verriest, Erik I. | Georgia Inst. of Tech |
Guan, Yue | Georgia Institute of Technology |
Abdallah, Chaouki T. | Georgia Institute of Technology |
Keywords: Hybrid systems, Switched systems, Optimal control
Abstract: This paper presents the jump law of co-states in optimal control for state-dependent switched systems. The number of switches and the switching modes are assumed to be known a priori. A proposed jump law is rigorously derived by theoretical analysis and illustrated by simulation results. An algorithm is then proposed to solve optimal control for state-dependent hybrid systems. Through numerical simulations, we further show that the proposed approach is more efficient than existing methods in solving optimal control for state-dependent switched systems.
|
|
11:00-11:15, Paper FrA10.5 | Add to My Program |
Design of the Impulsive Goodwin’s Oscillator: A Case Study |
|
Medvedev, Alexander V. | Uppsala University |
Proskurnikov, Anton V. | Politecnico Di Torino |
Zhusubaliyev, Zhanybai | South West State University (Kursk State Technical University) |
Keywords: Hybrid systems, Biological systems, Modeling
Abstract: The impulsive Goodwin's oscillator (IGO) is a hybrid model composed of a third-order continuous linear part and a pulse-modulated feedback. This paper introduces a design problem of the IGO to admit a desired periodic solution. The dynamics of the continuous states represent the plant to be controlled, whereas the parameters of the impulsive feedback constitute design degrees of freedom. The design objective is to select the free parameters so that the IGO exhibits a stable 1-cycle with desired characteristics. The impulse-to-impulse map of the oscillator is demonstrated to always possess a positive fixed point that corresponds to the desired periodic solution; the closed-form expressions to evaluate this fixed point are provided. Necessary and sufficient conditions for orbital stability of the 1-cycle are presented in terms of the oscillator parameters and exhibit similarity to the problem of static output control. An IGO design procedure is proposed and validated by simulation. The nonlinear dynamics of the designed IGO are reviewed by means of bifurcation analysis. Applications of the design procedure to dosing problems in chemical industry and biomedicine are envisioned.
|
|
11:15-11:30, Paper FrA10.6 | Add to My Program |
Piecewise Quantization-Dependent Approach to Quantized Stabilization of Piecewise-Affine Systems |
|
Ning, Zepeng | Nanyang Technological University |
Cheng, Yiming | Harbin Institute of Technology |
Li, Zhaojian | Michigan State University |
Yin, Xunyuan | Nanyang Technological University |
Keywords: Quantized systems, Hybrid systems, Stability of hybrid systems
Abstract: This paper studies the stability and stabilization problems for discrete-time piecewise-affine (PWA) systems with single input and state quantization. The PWA controller is considered to have dependence on the controlled PWA system modes; the adopted logarithmic quantization scheme is in a piecewise form, which is synchronized with the operating mode of the PWA system. A piecewise Lyapunov function that is dependent on the sector-bounded uncertainties of both the control input and the state-feedback signal is constructed. Then, the stability and the stabilization criteria are derived based on the constructed Lyapunov function. The proposed quantized control strategy is illustrated via an application to a simulated temperature control system.
|
|
FrA11 Regular Session, Aqua Salon AB |
Add to My Program |
Networked Control Systems I |
|
|
Chair: Werner, Herbert | Hamburg University of Technology |
Co-Chair: Rabi, Maben | Østfold University College |
|
10:00-10:15, Paper FrA11.1 | Add to My Program |
Scalable Stability of Nonlinear Interconnected Systems in Case of Amplifying Perturbations |
|
Mirabilio, Marco | University of L'Aquila |
Iovine, Alessio | CNRS |
Keywords: Large-scale systems, Network analysis and control, Stability of nonlinear systems
Abstract: This paper investigates the stability of large-scale systems (LSSs) in the presence of subsystems that amplify the perturbations propagated by their neighborhood, possibly leading to undesired behaviors of the overall interconnected system. Then, sufficient conditions ensuring the system trajectories boundedness and the subsequent LSS asymptotic stability in the sense of scalable Mesh Stability are proven to exist. The theoretical results show that there exists a dependence between the stability and the topology of the interconnected system. The obtained framework is then exploited for the stability analysis of a network of electrical microgrids, showing the effectiveness of the theoretical results.
|
|
10:15-10:30, Paper FrA11.2 | Add to My Program |
Minimum Perfect Critical Sets with 4 Vertices of Tree Graphs |
|
Dai, Li | NUDT |
Keywords: Control of networks, Networked control systems, Network analysis and control
Abstract: Minimal Laplacian Controllability problem plays an important role in the field of network control. A new way to construct the Minimum Leader Set is proposed. For S(|S|=4), this work proved that there are two and only two types of MPCSs of tree graphs. To illustrate how to use MPCSs to find all of the Minimum Leader Sets, three examples are given.
|
|
10:30-10:45, Paper FrA11.3 | Add to My Program |
Differentially Private Timeseries Forecasts for Networked Control |
|
Li, Po-han | The University of Texas at Austin |
Chinchali, Sandeep | UT Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Networked control systems, Predictive control for linear systems, Optimal control
Abstract: We analyze a cost-minimization problem in which the controller relies on an imperfect timeseries forecast. Forecasting models generate imperfect forecasts because they use anonymization noise to protect input data privacy. However, this noise increases the control cost. We consider a scenario where the controller pays forecasting models incentives to reduce the noise and combines the forecasts into one. The controller then uses the forecast to make control decisions. Thus, forecasting models face a trade-off between accepting incentives and protecting privacy. We propose an approach to allocate economic incentives and minimize costs. We solve a biconvex optimization problem on linear quadratic regulators and compare our approach to a uniform incentive allocation scheme. The resulting solution reduces control costs by 2.5 and 2.7 times for the synthetic timeseries and the Uber demand forecast, respectively.
|
|
10:45-11:00, Paper FrA11.4 | Add to My Program |
Harmonic Balance Analysis of Lur'e Oscillator Network with Non-Diffusive Weak Coupling |
|
Lee, Bryan | UCLA |
Iwasaki, Tetsuya | UCLA |
Keywords: Cooperative control, Network analysis and control, Neural networks
Abstract: The central pattern generator (CPG) is a group of interconnected neurons, existing in biological systems as a control center for oscillatory behaviors. We propose a new approach based on the multivariable harmonic balance to characterize the relationship between the oscillation profile (frequency, amplitude, phase) and interconnections within the CPG, modeled as weakly coupled oscillators. In particular, taking advantage of the weak coupling, we formulate a low-dimensional matrix whose eigenvalue/eigenvector capture the perturbation in the oscillation profile due to the coupling. Then we develop an algorithm to estimate the perturbed oscillation profile of a given CPG, and suggest an optimization to synthesize the interconnections to produce a given oscillation profile.
|
|
11:00-11:15, Paper FrA11.5 | Add to My Program |
Fixed-Time Consensus for Cooperative and Antagonistic Multi-Agent Systems with External Disturbances and Directed Topologies (I) |
|
Du, Mingjun | Qilu University of Technology (Shandong Academy of Science) |
Yao, Hui | Qilu University of Technology(Shandong Academy of Sciences) |
Chen, Baicheng | Qiluu University of Technology |
Yan, Zhiguo | Qilu University of Thechnology |
Keywords: Networked control systems
Abstract: The aim of this paper is to investigate the fixed-time consensus problems of cooperative and antagonistic multi-agent systems (CAMSs) with both antagonistic interactions and external disturbances under directed topologies. Toward this end, a nonlinear control protocol is constructed according to the nearest neighbor information. With the aid of the properties of improved Laplacian potentials, the associated convergence analyses can be developed from the viewpoint of Lyapunov stability theory. It is shown that all the agents can accomplish the bipartite consensus (respectively, state stability) objective within a fixed time under structurally balanced (respectively, unbalanced) signed digraphs in spite of the existing external disturbances. Additionally, simulations are included to validate the developed results.
|
|
FrA12 Regular Session, Aqua Salon C |
Add to My Program |
Adaptive Control III |
|
|
Chair: Bhasin, Shubhendu | Indian Institute of Technology Delhi |
Co-Chair: Rantzer, Anders | Lund University |
|
10:00-10:15, Paper FrA12.1 | Add to My Program |
Long Short-Term Memory for Improved Transients in Neural Network Adaptive Control |
|
Inanc, Emirhan | Bilkent University |
Gurses, Yigit | Bilkent University |
Habboush, Abdullah | Bilkent University |
Yildiz, Yildiray | Bilkent University |
Keywords: Adaptive control, Neural networks, Uncertain systems
Abstract: In this study, we propose a novel adaptive control architecture, which provides dramatically better performance compared to conventional methods. What makes this architecture unique is the synergistic employment of a traditional, Adaptive Neural Network (ANN) controller and a Long Short-Term Memory (LSTM) network. LSTM structures, unlike the standard feed-forward neural networks, take advantage of the dependencies in an input sequence, which helps predict the evolution of an uncertainty. Through a training method we introduced, the LSTM network learns to compensate for the deficiencies of the ANN controller. This substantially improves the transient response by allowing the controller to quickly react to unexpected events. Through careful simulation studies, we demonstrate that this architecture can improve the estimation accuracy on a diverse set of unseen uncertainties. We also provide an analysis of the contributions of the ANN controller and LSTM network, identifying their individual roles in compensating low and high frequency error dynamics. This analysis provides insight into why and how the LSTM augmentation improves the system's transient response.
|
|
10:15-10:30, Paper FrA12.2 | Add to My Program |
Indirect Adaptive Optimal Control in the Presence of Input Saturation |
|
Tang, Sunbochen | Massachusetts Institute of Technology |
Annaswamy, Anuradha M. | Massachusetts Inst. of Tech |
Keywords: Adaptive control, Predictive control for linear systems, Estimation
Abstract: In this paper, we propose a combined Magnitude Saturated Adaptive Control (MSAC)-Model Predictive Control (MPC) approach to linear quadratic tracking optimal control problems with parametric uncertainties and input saturation. The proposed MSAC-MPC approach first focuses on a stable solution and parameter estimation, and switches to MPC when parameter learning is accomplished. We show that the MSAC, based on a high-order tuner, leads to parameter convergence to true values while providing stability guarantees. We also show that after switching to MPC, the optimality gap is well-defined and proportional to the parameter estimation error. We demonstrate the effectiveness of the proposed MSAC-MPC algorithm through a numerical example based on a linear second-order, two input, unstable system.
|
|
10:30-10:45, Paper FrA12.3 | Add to My Program |
Stochastic Minimax Optimal Adaptive Control |
|
Rantzer, Anders | Lund University |
|
10:45-11:00, Paper FrA12.4 | Add to My Program |
Self-Tuning Tube-Based Model Predictive Control |
|
Tranos, Damianos | KTH Royal Institute of Technology |
Russo, Alessio | KTH Royal Institute of Technology |
Proutiere, Alexandre | KTH |
Keywords: Adaptive control, Robust control, Predictive control for linear systems
Abstract: We present Self-Tuning Tube-based Model Predictive Control (STT-MPC), an adaptive robust control algorithm for uncertain linear systems with additive disturbances based on the least-squares estimator and polytopic tubes. Our algorithm leverages concentration results to bound the system uncertainty set with prescribed confidence, and guarantees robust constraint satisfaction for this set, along with recursive feasibility and input-to-state stability. Persistence of excitation is ensured without compromising the algorithm's asymptotic performance or increasing its computational complexity. We demonstrate the performance of our algorithm using numerical experiments.
|
|
11:00-11:15, Paper FrA12.5 | Add to My Program |
Adaptive Control with Memory for Switched Linear Systems |
|
Patel, Pritesh | IIT Delhi |
Basu Roy, Sayan | Indraprastha Institute of Information Technology Delhi |
Bhasin, Shubhendu | Indian Institute of Technology Delhi |
Keywords: Adaptive control, Switched systems, Identification for control
Abstract: This work proposes a switched model reference adaptive control (S-MRAC) architecture for a multi-input multi-output (MIMO) switched linear system with memory for enhanced learning. A salient feature of the proposed method that separates it from most previous results is the use of memory that store the estimator states at switching and facilitate parameter learning during both active and inactive phases of a subsystem, thereby improving the tracking performance of the overall switched system. Specifically, the learning experience from the previous active duration of a subsystem is retained in the memory and reused when the subsystem is inactive and when the subsystem becomes active again. Parameter convergence is shown based on an intermittent initial excitation (IIE), which is significantly relaxed than the classical persistence of excitation (PE) condition. A common Lyapunov function is considered to ensure closed-loop stability with S-MRAC. Further under IIE, the exponential stability of tracking and parameter estimation error dynamics are guaranteed.
|
|
11:15-11:30, Paper FrA12.6 | Add to My Program |
Integral Torque Tracking with Anti-Windup Compensation and Adaptive Cadence Tracking for Powered FES-Cycling |
|
Casas, Jonathan | Syracuse University |
Duenas, Victor H | Syracuse University |
Keywords: Adaptive control, Switched systems, Lyapunov methods
Abstract: Motorized functional electrical stimulation (FES) induced cycling is a rehabilitation intervention and exercise strategy that can benefit people with movement disorders. Power tracking is an objective in which leg muscles are artificially activated to track an active torque trajectory while an electric motor achieves a desired speed (cadence). Technical challenges remain to enhance muscle torque tracking performance since muscles experience saturation, which can induce error build-up. Further, the electric motor controller needs to account for the cross muscle torque input in the kinematic tracking loop and thus reduce potential cycling fluctuations. In this paper, a FES muscle torque tracking controller is designed with an anti-windup term in an integral torque error signal to mitigate the effect of muscle saturation. Then, an adaptive-based concurrent learning controller is developed for the electric motor to track cadence and estimate uncertain constant parameters of the cycle-rider system. The adaptive motor controller embeds the muscle torque (since the muscle controller is implementable) in the regressor and exploits it as a feedforward term in the cadence loop, rather than canceling the muscle torque input as it is usually performed in robust control designs. Globally uniformly ultimately bounded (GUUB) tracking is obtained for the torque tracking objective and exponential cadence tracking and parameter convergence is obtained by the learning controller after a finite excitation condition is satisfied.
|
|
FrA13 Tutorial Session, Aqua Salon D |
Add to My Program |
Safe and Constrained Rendezvous, Proximity Operations and Docking |
|
|
Chair: Petersen, Chris | University of Florida |
Co-Chair: Caverly, Ryan James | University of Minnesota |
Organizer: Petersen, Chris | University of Florida |
Organizer: Caverly, Ryan James | University of Minnesota |
Organizer: Weiss, Avishai | Mitsubishi Electric Research Labs |
Organizer: Phillips, Sean | Air Force Research Laboratory |
|
10:00-10:45, Paper FrA13.1 | Add to My Program |
Safe and Constrained Rendezvous, Proximity Operations and Docking (I) |
|
Petersen, Chris | University of Florida |
Caverly, Ryan James | University of Minnesota |
Phillips, Sean | Air Force Research Laboratory |
Weiss, Avishai | Mitsubishi Electric Research Labs |
Keywords: Spacecraft control, Constrained control, Autonomous systems
Abstract: This tutorial paper discusses the rising need for safe and constrained spacecraft Rendezvous, Proximity Operations, and Docking (RPOD). This class of problems brings with it i) a unique set of equations of motion, ii) a variety of constraints and objectives that are specialized to RPOD, and iii) a number of traditional and current Guidance, Navigation, and Control (GNC) considerations. There are strong connections between the work done in RPOD and a variety of other research domains that have synergistically aided in pushing forward the state-of-the-art. This tutorial paper discusses the above, provides an entry point into the field of spacecraft RPOD, and highlights a selection of open problems that still exist in the field.
|
|
10:45-11:00, Paper FrA13.2 | Add to My Program |
Ensuring Future Safety in Spacecraft Rendezvous and Proximity Operations (I) |
|
Zappulla, Richard | United States Space Force/Air Force Research Laboratory |
|
11:00-11:15, Paper FrA13.3 | Add to My Program |
The Future of Satellite Logistics and the Mission Extension Vehicle (MEV) (I) |
|
Kwas, Andrew | Northrop Grumman |
|
11:15-11:30, Paper FrA13.4 | Add to My Program |
Optimization Based Control, an Aerospace Perspective (I) |
|
Acikmese, Behcet | University of Washington |
|
FrA14 Regular Session, Aqua 311A |
Add to My Program |
Control Barrier Functions |
|
|
Chair: Breeden, Joseph | University of Michigan, Ann Arbor |
Co-Chair: Lopez, Brett | University of California - Los Angeles |
|
10:00-10:15, Paper FrA14.1 | Add to My Program |
Unmatched Control Barrier Functions: Certainty Equivalence Adaptive Safety |
|
Lopez, Brett | University of California - Los Angeles |
Slotine, Jean-Jacques | Massachusetts Institute of Technology |
Keywords: Constrained control, Adaptive control, Uncertain systems
Abstract: This work applies universal adaptive control to control barrier functions to achieve safe control of dynamical systems with parametric model uncertainties. The proposed approach utilizes the certainty equivalence principle to methodically select a model-parameterized control barrier function and corresponding safety controller from an allowable set with instantaneous parameter estimates. While such a combination does not necessarily yield forward invariance without additional requirements on the barrier function, we show that safety can indeed be established by simply adjusting the adaptation gain online. Simulation results demonstrate the approach.
|
|
10:15-10:30, Paper FrA14.2 | Add to My Program |
Barrier Pairs for Safety Control of Uncertain Output Feedback Systems |
|
He, Binghan | University of California, Berkeley |
Tanaka, Takashi | University of Texas at Austin |
Keywords: Constrained control, Fault detection, Uncertain systems
Abstract: The barrier function method for safety control typically assumes the availability of full state information. Unfortunately, in many scenarios involving uncertain dynamical systems, full state information is often unavailable. In this paper, we aim to solve the safety control problem for an uncertain single-input single-output system with partial state information. First, we develop a synthesis method that simultaneously creates a barrier function and a dynamic output feedback safety controller. This safety controller guarantees that the unit sub-level set of the barrier function is an invariant set under the uncertain dynamics and disturbances of the system. Then, we build an identifier-based estimator that provides a state estimate affine to the uncertain model parameters of the system. To detect the potential risks of the system, a fault detector uses the state estimate to find an upper bound for the barrier function. The fault detector triggers the safety controller when the system's original action leads to a potential safety issue and resumes the original action when the potential safety issue is resolved by the safety controller.
|
|
10:30-10:45, Paper FrA14.3 | Add to My Program |
Data-Efficient Control Barrier Function Refinement |
|
Dai, Bolun | New York University |
Huang, Heming | New York University |
Krishnamurthy, Prashanth | NYU Tandon School of Engineering |
Khorrami, Farshad | NYU Tandon School of Engineering |
Keywords: Constrained control, Learning, Neural networks
Abstract: Control barrier functions (CBFs) have been widely used for synthesizing controllers in safety-critical applications. When used as a safety filter, a CBF provides a simple and computationally efficient way to obtain safe controls from a possibly unsafe performance controller. Despite its conceptual simplicity, constructing a valid CBF is well known to be challenging, especially for high-relative degree systems under nonconvex constraints. Recently, work has been done to learn a valid CBF from data based on a handcrafted CBF (HCBF). Even though the HCBF gives a good initialization point, it still requires a large amount of data to train the CBF network. In this work, we propose a new method to learn more efficiently from the collected data through a novel prioritized data sampling strategy. A priority score is computed from the loss value of each data point. Then, a probability distribution based on the priority score of the data points is used to sample data and update the learned CBF. Using our proposed approach, we can learn a valid CBF that recovers a larger portion of the true safe set using a smaller amount of data. The effectiveness of our method is demonstrated in simulation on a two-link arm.
|
|
10:45-11:00, Paper FrA14.4 | Add to My Program |
Disturbance Observer-Based Robust Control Barrier Functions |
|
Wang, Yujie | University of Wisconsin-Madison |
Xu, Xiangru | University of Wisconsin-Madison |
Keywords: Constrained control, Observers for nonlinear systems, Uncertain systems
Abstract: This work presents a safe control design approach that integrates the disturbance observer (DOB) and the control barrier function (CBF) for systems with external disturbances. Different from existing robust CBF results that consider the “worst case” of disturbances, this work utilizes a DOB to estimate and compensate for the disturbances. DOB-CBF-based controllers are constructed with provably safe guarantees by solving convex quadratic programs online, to achieve a better tradeoff between safety and performance. Two types of systems are considered individually depending on the magnitude of the input and disturbance relative degrees. The effectiveness of the proposed methods is illustrated via numerical simulations.
|
|
11:00-11:15, Paper FrA14.5 | Add to My Program |
Compositions of Multiple Control Barrier Functions under Input Constraints |
|
Breeden, Joseph | University of Michigan, Ann Arbor |
Panagou, Dimitra | University of Michigan, Ann Arbor |
Keywords: Constrained control
Abstract: This paper presents a methodology for ensuring that the composition of multiple Control Barrier Functions (CBFs) always leads to feasible conditions on the control input, even in the presence of input constraints. In the case of a system subject to a single constraint function, there exist many methods to generate a CBF that ensures constraint satisfaction. However, when there are multiple constraint functions, the problem of finding and tuning one or more CBFs becomes more challenging, especially in the presence of input constraints. This paper addresses this challenge by providing tools to 1) decouple the design of multiple CBFs, so that a CBF can be designed for each constraint function independently of other constraints, and 2) ensure that the set composed from all the CBFs together is a viability domain. Thus, a quadratic program subject to all the CBFs simultaneously is always feasible. The utility of this methodology is then demonstrated in simulation for a nonlinear orientation control system.
|
|
FrA15 Invited Session, Aqua 311B |
Add to My Program |
Dynamics and Control of Marine Energy Systems |
|
|
Chair: Tang, Yufei | Florida Atlantic University |
Co-Chair: Li, Perry Y. | Univ. of Minnesota |
Organizer: Tang, Yufei | Florida Atlantic University |
Organizer: Abdelkhalik, Ossama | Iowa State University |
Organizer: Amini, Mohammad Reza | University of Michigan |
Organizer: Hasankhani, Arezoo | Cornell University |
|
10:00-10:15, Paper FrA15.1 | Add to My Program |
A Kalman Filter Approach to the Estimation and Reconstruction of Ocean Wave Fields (I) |
|
Chen, Zihao | University of Minnesota |
Wu, Jie | University of Minnesota |
Shen, Lian | University of Minnesota |
Li, Perry Y. | Univ. of Minnesota |
Keywords: Observers for Linear systems, Sensor networks, Linear systems
Abstract: This paper considers the problem of real-time reconstruction of ocean wave field with a network of discrete wave height sensors. Being able to predict incoming wave characteristics helps individual or collections of wave energy converters to increase the amount of energy that they can capture. In this paper, the wave field is modeled to consist of a frequency spectrum of monotone Airy waves with unknown strengths and phases. Kalman filter based observers are then designed to estimate the wave fields. The observers' performance in reconstructing the wave field accurately is validated in simulation for 1-D and 2-D linear and nonlinear waves. Wave tank experiments have also been performed to validate its ability to reconstruct a wave field in real-time using noisy data obtained from a vision-based wave height sensor.
|
|
10:15-10:30, Paper FrA15.2 | Add to My Program |
FEM-Aided Modeling and Control of a Tethered Hydrokinetic Energy Kite (I) |
|
Torres, Gabriel | Worcester Polytechnic Institute |
Olinger, David | Worcester Polytechnic Institute |
Demetriou, Michael A. | Worcester Polytechnic Institute |
Keywords: Modeling, Energy systems, Computer-aided control design
Abstract: In this paper, a six-degree-of-freedom tethered rigid kite with a kite-mounted turbine is modeled using Newtonian and Lagrangian formulations supplemented with corresponding kinematic analysis and an Euler-angle representation. In addition, to capture the coupled effects of kite and tether dynamics, the Euler-Bernoulli bending equations are taken into their weak form to be spatially discretized into N-segments utilizing a Galerkin Finite Element Method (FEM) strategy. Consequently, the infinite-dimensional beam governing equations become a finite set of 5(N +1) ordinary time differential equations. The kite and tether dynamics are placed into their state-space form and their interactions are characterized by the force balance at the tip of the tether at which the kite is attached. The formulations obtained in this work provide a baseline for the study of the effect of the tether loads on the energy generation of the kite.
|
|
10:30-10:45, Paper FrA15.3 | Add to My Program |
Passivity-Based Control of a Hydrokinetic Energy Kite with a Multi-Element Tether (I) |
|
Torres, Gabriel | Worcester Polytechnic Institute |
Olinger, David | Worcester Polytechnic Institute |
Demetriou, Michael A. | Worcester Polytechnic Institute |
Keywords: Modeling, Lyapunov methods, Computer-aided control design
Abstract: This paper studies passivity-based control of a tethered underwater kite used for energy generation. The mathematical formulation of the motion of a 6-degee-of-freedom (DOF) rigid kite is coupled with the continuous governing equations of a flexible tether. The tether is spatially discretized as N-frame elements so that the intrinsic infinitedimensional set of partial differential equations (PDEs) is reduced to a finite second-order set of ordinary differential equations (ODEs). Using this formulation, a Lyapunov stability analysis is conducted to establish operational conditions on the system parameters and states to achieve a certain level of internal and input-output stability and to provide proof of system trajectory boundedness. Previous passivity-based control schemes on tethered kite systems are used to establish a baseline scheme for the control logic that can accommodate the previously defined tether dynamics. A Lyapunov-based feedback linearization control is imposed on the rotational dynamics of the rigid kite according to overall stability and boundness conditions. Baseline simulation results that compare energy generation levels for decoupled-rigid kite dynamics, tether drag influenced-kite dynamics, and the tether-kite full dynamics are presented.
|
|
10:45-11:00, Paper FrA15.4 | Add to My Program |
Reinforcement Learning for Underwater Spatiotemporal Path Planning, with Application to an Autonomous Marine Current Turbine (I) |
|
Hasankhani, Arezoo | Cornell University |
Tang, Yufei | Florida Atlantic University |
VanZwieten, James | Florida Atlantic University |
Keywords: Energy systems, Mechanical systems/robotics, Machine learning
Abstract: This paper presents a reinforcement learning (RL) framework applied for an autonomous underwater vehicle (AUV) path planning, focusing on a specific type of energy-harvesting AUV, entitled marine current turbine (MCT). The proposed RL-based approach improves a classical path planning to adopt with an underwater environment prone to spatiotemporal uncertainties. The path planning problem is formulated to achieve the goal of maximizing the harnessed energy from the MCT subject to the agent dynamics and the spatiotemporal environment constraints. Three RL algorithms, including Q-learning, deep Q-network (DQN), and proximal policy optimization (PPO), are nominated to deal with the path planning over both discrete gridded and continuous underwater environments modeling. The experimental results demonstrate the efficiency of the RL-based approaches in seeking the optimal path in the underwater environment, where further discussion is presented to generalize the proposed approach to other energy-harvesting autonomous vehicles operating in the spatiotemporally varying environment, such as airborne wind turbines.
|
|
11:00-11:15, Paper FrA15.5 | Add to My Program |
Control Codesign Optimization of an Oscillating-Surge Wave Energy Converter (I) |
|
Grasberger, Jeff | Virginia Tech |
Yang, Lisheng | University of Michigan |
Bacelli, Giorgio | Sandia National Laboratories |
Zuo, Lei | Virginia Tech |
Keywords: Energy systems, Optimization, Power systems
Abstract: Ocean wave energy has the potential to play a crucial role in the shift to renewable energy. In order to improve wave energy conversion techniques, it is necessary to recognize the sub-optimal nature of traditional sequential design processes due to the interconnectedness of subsystems. A codesign optimization in this paper seeks to include effects of all subsystems within one optimization loop in order to reach a fully optimal design. A width and height sweep serves as a brute force geometry optimization while optimizing the power take-off components and controls using a pseudo-spectral method for each geometry. An investigation of electrical power and mechanical power maximization also outlines the contrasting nature of the two objectives to illustrate electrical power maximization's importance for identifying optimality. The codesign optimization leads to an optimal design with a width of 12 m and a height of 10 m. Ultimately, the codesign optimization leads to a 62% increase in the objective function over the optimal design from a sequential design process while also requiring only about half the power take-off torque.
|
|
11:15-11:30, Paper FrA15.6 | Add to My Program |
Control Co-Design of a Hydrokinetic Turbine: A Comparative Study of Open-Loop Optimal Control and Feedback Control (I) |
|
Amini, Mohammad Reza | University of Michigan |
Jiang, Boxi | University of Michigan |
Liao, Yingqian | University of Michigan |
Naik, Kartik Praful | University of Michigan |
Martins, Joaquim R.R.A. | University of Michigan |
Sun, Jing | University of Michigan |
Keywords: Energy systems, Optimal control, Optimization
Abstract: Control co-design (CCD) explores physical and control design spaces simultaneously to optimize a system’s performance. A commonly used CCD framework aims to achieve open-loop optimal control (OLOC) trajectory while optimizing the physical design variables subject to constraints on control and design parameters. In this study, in contrast with the conventional CCD methods based on OLOC schemes, we present a CCD formulation that explicitly considers a feedback controller. In the formulation, we consider two control laws based on proportional linear and quadratic state feedback, where the control gain is optimized. The simulation results show that the OLOC trajectory could be approximated by a feedback controller. While the total energy generated from the CCD with a feedback controller is slightly lower than that of the CCD with OLOC, it results in a much simpler control structure and more robust performance in the presence of uncertainties and disturbances, making it suitable for real-time control. The study in this paper investigates the performance of optimal hydrokinetic turbine design with a feedback controller in the presence of uncertainties and disturbances to demonstrate the benefits and highlight challenges associated with incorporating the feedback controller explicitly in the CCD stage.
|
|
FrA16 Tutorial Session, Aqua 313 |
Add to My Program |
Physics-Informed Machine Learning for Modeling and Control of Dynamical
Systems: Opportunities and Challenges |
|
|
Chair: Drgona, Jan | Pacific Northwest National Laboratory |
Co-Chair: Nghiem, Truong X. | Northern Arizona University |
Organizer: Nghiem, Truong X. | Northern Arizona University |
Organizer: Jones, Colin N. | EPFL |
Organizer: Drgona, Jan | Pacific Northwest National Laboratory |
Organizer: Nagy, Zoltan | The University of Texas at Austin |
Organizer: Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
|
10:00-10:45, Paper FrA16.1 | Add to My Program |
Physics-Informed Machine Learning for Modeling and Control of Dynamical Systems: Opportunities and Challenges (I) |
|
Nghiem, Truong X. | Northern Arizona University |
Drgona, Jan | Pacific Northwest National Laboratory |
Jones, Colin N. | EPFL |
Nagy, Zoltan | The University of Texas at Austin |
Schwan, Roland | EPFL |
Dey, Biswadip | Siemens Corporation |
Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Paulson, Joel | The Ohio State University |
Carron, Andrea | ETH |
Zeilinger, Melanie N. | ETH Zurich |
Shaw Cortez, Wenceslao | Pacific Northwest National Laboratory |
Vrabie, Draguna | Pacific Northwest National Laboratory |
Keywords: Machine learning, Grey-box modeling, Neural networks
Abstract: Physics-informed machine learning (PIML) is a set of methods and tools that systematically integrate machine learning (ML) algorithms with physical constraints and abstract mathematical models developed in scientific and engineering domains. As opposed to purely data-driven methods, PIML models can be trained from additional information obtained by enforcing physical laws such as energy and mass conservation. More broadly, PIML models can include abstract properties and conditions such as stability, convexity, or invariance. The basic premise of PIML is that the integration of ML and physics can yield more effective, physically consistent, and data-efficient models. This paper aims to provide a tutorial-like overview of the recent advances in PIML for dynamical system modeling and control. Specifically, the paper covers an overview of the theory, fundamental concepts and methods, tools, and applications on topics of: 1) physics-informed learning for system identification; 2) physics-informed learning for control; 3) analysis and verification of PIML models; and 4) physics-informed digital twins. The paper is concluded with a perspective on open challenges and future research opportunities.
|
|
10:45-11:00, Paper FrA16.2 | Add to My Program |
Physics-Inspired Neural Networks for Modeling and Control (I) |
|
Di Natale, Loris | Empa / EPFL |
Jones, Colin N. | EPFL |
|
11:00-11:15, Paper FrA16.3 | Add to My Program |
Differentiable Programming for Modeling and Control of Energy Systems (I) |
|
Drgona, Jan | Pacific Northwest National Laboratory |
|
11:15-11:30, Paper FrA16.4 | Add to My Program |
Physics-Informed Machine Learning for Inverse Problems (I) |
|
Dey, Biswadip | Siemens Corporation |
|
FrA17 Tutorial Session, Aqua 314 |
Add to My Program |
A Tutorial on Real-Time Computing Issues for Control |
|
|
Chair: Abramovitch, Daniel Y. | Agilent Technologies |
Co-Chair: Andersson, Sean B. | Boston University |
Organizer: Abramovitch, Daniel Y. | Agilent Technologies |
Organizer: Andersson, Sean B. | Boston University |
Organizer: Leang, Kam K. | University of Utah |
Organizer: Nagel, William S. | Widener University |
Organizer: Ruben, Shalom | University of Colorado at Boulder |
|
10:00-10:50, Paper FrA17.1 | Add to My Program |
A Tutorial on Real-Time Computing Issues for Control Systems (I) |
|
Abramovitch, Daniel Y. | Agilent Technologies |
Andersson, Sean B. | Boston University |
Leang, Kam K. | University of Utah |
Nagel, William S. | Widener University |
Ruben, Shalom | University of Colorado at Boulder |
Keywords: Computational methods, Control software, Control applications
Abstract: This paper presents a tutorial on the elements of computation in a real-time control system. Unlike conventional computation or even computation in digital signal processing systems, computation in a feedback loop must be sensitive to issues of latency and noise around the loop. This presents some fundamental requirements, limitations, and design constraints not seen in other computational applications. The logic of presenting such a tutorial is that while the computer technology changes at a rapid pace, the principles of how we match that technology to the constraints of a feedback loop remain consistent over the years. We will discuss the different computational chains in a feedback system, ways to conceptualize the effects of time delay and jitter on the system, and present a three-layer-model for programming real-time computations. The tutorial also presents some filter and state-space structures that are useful for real-time computation. It concludes with an overview of the different sample rate ranges currently used in some typical control problems and a short discussion of how business models affect our choices in real-time computation.
|
|
10:50-11:00, Paper FrA17.2 | Add to My Program |
Discrete Input-Output State-Space Models for Real-Time Control (I) |
|
Nagel, William S. | Widener University |
Leang, Kam K. | University of Utah |
|
11:00-11:10, Paper FrA17.3 | Add to My Program |
Real-Time Control of Mobile Robotic Systems through the Robot Operating System (ROS) (I) |
|
Lapins, Chantel K. | University of Utah |
Leang, Kam K. | University of Utah |
|
11:20-11:30, Paper FrA17.4 | Add to My Program |
Lessons from the Advanced Tool World (I) |
|
Andersson, Sean B. | Boston University |
|
11:20-11:30, Paper FrA17.5 | Add to My Program |
Controller Implementation Via Analog Computers (I) |
|
Ruben, Shalom | University of Colorado at Boulder |
|
FrB01 RI Session, Sapphire MN |
Add to My Program |
Process Control (RI) |
|
|
Chair: Findeisen, Rolf | TU Darmstadt |
Co-Chair: Schurig, Roland | TU Darmstadt, Control and Cyber-Physical Systems Laboratory |
|
13:30-13:34, Paper FrB01.1 | Add to My Program |
Learning MPC for Process Dynamic Working Condition Change Tasks under Model Mismatch |
|
Yang, Guanghui | Zhejiang University |
Keywords: Process Control, Chemical process control
Abstract: In this study, a learning model predictive control (MPC) algorithm for process dynamic working condition change (DWCC) tasks is proposed. The algorithm continuously compensates for model–plant mismatch (MPM) and improves dynamic performance by predicting multi-step-ahead disturbance from similar DWCC tasks. First, a state-space model augmented by disturbance variables ensures offset-free control for MPM. Second, a dynamic autoencoder is constructed to extract private features from process sequences based on long short-term memory and fully connected networks. DWCC scenarios similar to the current scenario are located from the historical database by calculating the distance between extracted features. Finally, the multi-step-ahead disturbance and its uncertainty representation are predicted through multi-output Gaussian process regression based on the located scenarios. The obtained multi-step-ahead disturbance is incorporated into the state-space MPC framework. A nonlinear case is conducted to demonstrate the effectiveness of the proposed method.
|
|
13:34-13:38, Paper FrB01.2 | Add to My Program |
A Reachable Set-Based Cyberattack Detection Scheme for Dynamic Processes |
|
Narasimhan, Shilpa | University of California, Davis |
El-Farra, Nael H. | University of California, Davis |
Ellis, Matthew | University of California, Davis |
Keywords: Process Control, Chemical process control
Abstract: Recent cyberattacks targeting process control systems have motivated the need for operational technology-based approaches, such as detection schemes that monitor processes for attacks. Chemical processes are normally operated at/near the steady-state for extended periods. To account for this, attack detection schemes may be designed to monitor the process operated near the steady-state. Attack-free transient operation (e.g., during process start-up and set point changes) may render detection schemes designed for steady-state operation ineffective by generating false alarms. In this work, a reachable set-based detection scheme is proposed to monitor the process during transient operation. Additive and multiplicative false data injection attacks (FDIAs) that alter data communicated over the sensor-controller and controller-actuator communication links are considered. Based on the ability of the proposed detection scheme to detect an FDIA, an approach to classify attacks is presented. The reachable set-based detection scheme and attack classification are applied to two illustrative processes.
|
|
13:38-13:42, Paper FrB01.3 | Add to My Program |
Necessary Optimality Conditions for Fast Lithium-Ion Battery Charging Via Hybrid Simulations |
|
Matschek, Janine | TU Darmstadt |
Berliner, Marc D. | Massachusetts Institute of Technology |
Himmel, Andreas | TU Darmstadt |
Braatz, Richard D. | Massachusetts Institute of Technology |
Findeisen, Rolf | TU Darmstadt |
Keywords: Process Control, Control applications, Chemical process control
Abstract: Fast yet health-conscious and safe optimal charging for lithium-ion batteries is essential for resource efficiency, increased battery lifetime, and overall usability. While quick and resource-efficient charging can be formulated as an optimal control problem, it often cannot be solved in real-time on computationally limited, embedded systems. We build upon a mathematical reformulation of the constrained optimal control problem into hybrid simulations, which allows for computationally efficient solutions and provides operation modes beyond existing charging profiles. We analyze under which conditions this mathematical reformulation can lead to the optimality of the resulting charging protocols. Physics-based battery models are analyzed from a systems theory perspective using controllability and flatness properties, necessary optimality conditions for the charging protocols are established.
|
|
13:42-13:46, Paper FrB01.4 | Add to My Program |
Fish Growth Tracking and Mortality Monitoring: Control Design and Comparisons |
|
Aljehani, Fahad | King Abdullah University of Science and Technology (KAUST) |
N'Doye, Ibrahima | King Abdullah University of Science and Technology (KAUST) |
Laleg-Kirati, Taous-Meriem | King Abdullah University of Science and Technology (KAUST) |
Keywords: Process Control, Control applications, Predictive control for nonlinear systems
Abstract: Monitoring the water quality and controlling the feeding are essential functions in balancing fish productivity and shaping fish’s life history in the fish growth process. Currently, most fish feeding processes are conducted manually in different phases and not optimized. The feeding technique influences fish growth through the feed conversion rate. In addition, the high concentration level of ammonia affects the water quality, resulting in fish survival and mass death. Therefore, there is a crucial need to develop control strategies to determine optimal, efficient, and reliable feeding processes and to monitor water quality at the same time. In this paper,We revisit the representative fish growth model describing the total biomass change by incorporating the fish population density and mortality. We specifically focus on relative feeding as a manipulated variable to design traditional and optimal control to track the desired weight reference within the sub-optimal temperature and Disolved Oxygen (DO) profiles under different levels of unionized ammonia (UIA) exposures. Then, we propose an optimal algorithm that optimizes the feeding and water quality of the dynamic fish population growth process. We also show that the model predictive control decreases fish mortality and also reduces food consumption in all different cases by an average of 26.9% compared to the bang-bang controller, 22.6% compared to the PID controller.
|
|
13:46-13:50, Paper FrB01.5 | Add to My Program |
Model Predictive Control for Distributed Energy Systems Management in Electrifying the Building Sector: Carbon Emission Reduction in Response to Dynamic Electricity Price and Carbon Intensity |
|
Yang, Shiyu | Cornell University |
Gao, H. Oliver | Cornell University |
You, Fengqi | Cornell University |
Keywords: Process Control, Energy systems, Control applications
Abstract: Electrification and deploying distributed energy systems are two integral strategies to decarbonize buildings. However, integrating buildings to intermittent on-site distributed energy systems and power grids with dynamic carbon intensity requires a much more intelligent building energy management (BEM) system than the current reactive-control-based BEM practice. This study proposed an electricity-mix-responsive model predictive control (MPC) framework for integrated control of building and distributed energy systems considering the dynamics of electricity carbon intensity and prices. A novel linear integrated model, including sub-models of adaptive thermal comfort, building thermodynamics, humidity, space heating, space cooling, water heating, renewable energy system, electric energy storage, and electric vehicle, is developed. A linear MPC controller is developed based on the linear integrated model. The proposed MPC framework is applied to a simulation case study for integrated control of building energy systems and multiple distributed energy resources (solar photovoltaic, electric energy storage, and electric vehicle charging) in a residential test building. The proposed MPC approach vastly reduces the electricity cost by up to 38.3% and carbon emission by up to 25.1%, for the test building, compared to conventional reactive-based control. Meanwhile, the proposed MPC approach largely enhances the test building's thermal comfort and demand flexibility. The case study results also show that maximizing carbon emission reduction does not necessarily degrade the electricity cost-saving in buildings. Instead, they can be optimized simultaneously with the proposed MPC approach.
|
|
13:50-13:54, Paper FrB01.6 | Add to My Program |
Dynamic Optimization and Control of a Renewable Microgrid Incorporating Ammonia |
|
Kong, Baiwen | University of Minnesota |
Zhang, Qi | University of Minnesota |
Daoutidis, Prodromos | Univ. of Minnesota |
Keywords: Process Control, Hierarchical control, Energy systems
Abstract: A renewable microgrid using green ammonia and hydrogen for energy storage is proposed in the work. Wind and solar energy are captured as power inputs for water electrolysis to produce hydrogen which can be further transformed to ammonia through the Haber-Bosch process. Gensets are dispatched to generate power from hydrogen or ammonia for meeting residential demands. Local control structures are designed for each module in the framework, which takes hourly commands from an upper level dynamic real-time optimization (D-RTO) layer. Case studies in Duluth, MN are conducted for summer and winter in a 24-hour time horizon, demonstrating the stability of system under disturbances in renewable sources. Results confirm that ammonia is more preferred for long-term energy storage.
|
|
13:54-13:58, Paper FrB01.7 | Add to My Program |
Estimating Parameter Regions for Structured Parameter Tuning Via Reduced Order Subsystem Models |
|
Schurig, Roland | TU Darmstadt, Control and Cyber-Physical Systems Laboratory |
Himmel, Andreas | TU Darmstadt |
Mesanovic, Amer | Siemens AG, Munich; Otto-Von-Guericke University Magdeburg, |
Braatz, Richard D. | Massachusetts Institute of Technology |
Findeisen, Rolf | TU Darmstadt |
Keywords: Process Control, Model/Controller reduction, Control system architecture
Abstract: Many large-scale systems are composed of subsystems operated by decentralized controllers, which are fixed in their structure, yet have parameters to tune. Initial tuning or subsequent adjustments dof those parameters ue to varying operating conditions or changes in the network of interconnected systems, while ensuring stability, performance, and security, pose a challenging task due to the overall complexity and size. Subsystems may not be willing or allowed to expose detailed information for safety and privacy reasons. In some cases, a comprehensive system model might not be available for global tuning, or the resulting problem might be computationally infeasible. To enable meaningful global parameter tuning while allowing for data privacy and security, we propose that the subsystems themselves should provide reduced-order models. These models capture the parametric dependency of the subsystem dynamics on the controller parameters. Specifically, we present a method to construct a region in the subsystems’ parameter space in which the deviation of the subsystem and the reduced-order model stays below a specified error bound and in which both systems are stable. A necessary and sufficient condition for such regions is derived using robust control theory. Notably, sufficiency can be expressed in terms of a linear matrix inequality. We demonstrate the approach by considering the temperature control of a large-scale building complex.
|
|
13:58-14:02, Paper FrB01.8 | Add to My Program |
Cyberattack Awareness and Resiliency of Integrated Moving Horizon Estimation and Model Predictive Control of Complex Process Networks |
|
Sundberg, Brayden | Kansas State University |
Babaei Pourkargar, Davood | Kansas State University |
Keywords: Process Control, Predictive control for nonlinear systems, Estimation
Abstract: This paper explores data-assisted cyber-attack awareness and resiliency of optimization-based estimation and control of integrated process systems to malicious attacks on measurement sensors. The proposed optimization-based estimation and control architecture consists of an integrated nonlinear moving horizon estimation (MHE) and model predictive control (MPC), where the MHE estimates the unmeasured state variables of the system required by MPC design. In addition, a measured output data-driven cyberattack detection framework is developed by frequently employing a feedforward neural network during the closed-loop process, identifying the cyberattacks from the interactive network-level dynamics. Finally, the integrated process of benzene alkylation with ethylene to produce ethylbenzene is considered a benchmark to demonstrate the application of cyberattack awareness and resiliency of the proposed control architecture in the presence of different types of adversarial cyberattacks interfering with the temperature measurement sensors.
|
|
14:02-14:06, Paper FrB01.9 | Add to My Program |
A Systematic Method for the Selection of Feedback Variables in MIMO RF Impedance Matching Systems |
|
Guc, Furkan | University of California Merced |
Chen, YangQuan | University of California, Merced |
Keywords: Process Control, Nonlinear output feedback, Optimization
Abstract: An impedance matching between the Radio-Frequency (RF) generator and the equipment is required in order to achieve maximum power transfer or minimum reflection. Different architectures of impedance matching control circuits are utilized in this problem depending on the selection of the tunable elements and topological structure. The matching network may not show expected topology behavior due to unknown elements and parameter drifting. Although there exist suggestions for the selection of feedback variables for various impedance matching control schemes, a comprehensive justification for the feedback variable selection on RF impedance matching is still missing in the literature to our best knowledge. To introduce a systematic approach on the feedback variable selection methodology, a coupling analysis for the MIMO impedance matching problem is introduced using Relative Gain Array (RGA) and interaction index analysis. Two most common matching networks are used for demonstration of the procedure namely L-Type up converting and T-Type considering additional inductor due to additional unknown element in the structure. At the end, a novel interaction coefficient is presented to as a metric for the coupling quantification of impedance matching MIMO problem for 6 candidate feedback variable scenarios. Clearly, one should select feedback variables in the impedance matching control so that the coupling effect is as small as possible. Topology changes due to performance degradation or unknown elements can be monitored with predictive maintenance and health monitoring applications. Hence, the selection of feedback variables can be updated to achieve possible error recovery. Results show that the selection of feedback variables with the aid of proposed systematic methodology enables to achieve higher convergence rate within feasible load impedance region.
|
|
14:06-14:10, Paper FrB01.10 | Add to My Program |
Towards Efficient Modularity in Industrial Drying: A Combinatorial Optimization Viewpoint |
|
Bayati, Alisina | University of Illinois at Urbana Champaign |
Srivastava, Amber | ETH Zurich |
Malvandi, Amir | University of Illinois at Urbana Champaign |
Feng, Hao | North Carolina Agricultural and Technical State University |
Salapaka, Srinivasa M. | University of Illinois |
Keywords: Process Control, Optimization algorithms, Manufacturing systems
Abstract: The industrial drying process consumes approximately 12% of the total energy used in manufacturing, with the potential for a 40% reduction in energy usage through improved process controls and the development of new drying technologies. To achieve cost-efficient and high-performing drying, multiple drying technologies can be combined in a modular fashion with optimal sequencing and control parameters for each. This paper presents a mathematical formulation of this optimization problem and proposes a framework based on the Maximum Entropy Principle (MEP) to simultaneously solve for both optimal values of control parameters and optimal sequence. The proposed algorithm addresses the combinatorial optimization problem with a non-convex cost function riddled with multiple poor local minima. Simulation results on drying distillers dried grain (DDG) products show up to 12% improvement in energy consumption compared to the most efficient single-stage drying process. The proposed algorithm converges to local minima and is designed heuristically to reach the global minimum.
|
|
FrB02 RI Session, Sapphire IJ |
Add to My Program |
Robust Control (RI) |
|
|
Chair: Komaee, Arash | Southern Illinois University |
Co-Chair: Samuelson, Samantha | University of Southern California |
|
13:30-13:34, Paper FrB02.1 | Add to My Program |
On Design of Robust Linear Quadratic Regulators |
|
Komaee, Arash | Southern Illinois University |
Keywords: Robust control, Optimal control, Linear systems
Abstract: Closed-loop stability of uncertain linear systems is studied under the state feedback realized by a linear quadratic regulator (LQR). Sufficient conditions are presented that ensure the closed-loop stability in the presence of uncertainty, initially for the case of a non-robust LQR designed for a nominal model not reflecting the system uncertainty. Since these conditions are usually violated for a large uncertainty, a procedure is offered to redesign such a non-robust LQR into a robust one that ensures closed-loop stability under a predefined level of uncertainty. The analysis of this paper largely relies on the concept of inverse optimal control to construct suitable performance measures for uncertain linear systems, which are non-quadratic in structure but yield optimal controls in the form of LQR. The relationship between robust LQR and zero-sum linear quadratic dynamic games is established.
|
|
13:34-13:38, Paper FrB02.2 | Add to My Program |
Performance of Noisy Higher Order Accelerated Gradient Flow Dynamics for Strongly Convex Quadratic Optimization Problems |
|
Samuelson, Samantha | University of Southern California |
Mohammadi, Hesameddin | University of Southern California |
Jovanovic, Mihailo R. | University of Southern California |
Keywords: Robust control, Optimization, Optimal control
Abstract: We study performance of momentum-based accelerated first-order optimization algorithms in the presence of additive white stochastic disturbances. For strongly convex quadratic problems with a condition number , we determine the best possible convergence rate of continuous-time gradient flow dynamics of order n. We also demonstrate that additional momentum terms do not affect the tradeoffs between convergence rate and variance amplification that exist for gradient flow dynamics with n = 2.
|
|
13:38-13:42, Paper FrB02.3 | Add to My Program |
Tube-Based Zonotopic Data-Driven Predictive Control |
|
Russo, Alessio | KTH Royal Institute of Technology |
Proutiere, Alexandre | KTH |
Keywords: Robust control, Predictive control for linear systems
Abstract: We present a novel tube-based data-driven predictive control method for linear systems affected by a bounded addictive disturbance. Our method leverages recent results in the reachability analysis of unknown linear systems to formulate and solve a robust tube-based predictive control problem. More precisely, our approach consists in deriving, from the collected data, a zonotope that includes the true state error set. We show how to guarantee the stability of the resulting error zonotope, which can be exploited to increase the computational efficiency of existing zonotopic data-driven MPC formulations. Results on a double-integrator affected by strong adversarial noise demonstrate the effectiveness of the proposed control approach.
|
|
13:42-13:46, Paper FrB02.4 | Add to My Program |
Maintaining Robust Stability and Performance through Sampling and Quantization |
|
Susca, Mircea | Technical University of Cluj-Napoca |
Mihaly, Vlad Mihai | Technical University of Cluj-Napoca |
Dobra, Petru | Technical University of Cluj |
Keywords: Robust control, Quantized systems, Sampled-data control
Abstract: The inherent problem with continuous-time robust control synthesis is that it returns a controller which cannot directly be implemented on a numeric device. The discrete-time robust control synthesis does not fully solve this problem, as the sampling rate is considered as an input hyperparameter, without explicitly performing a selection, and the quantization of the controller coefficients is not encompassed in the synthesis procedure. The aim of this paper is to provide rigorous means to efficiently compute the sampling rate and quantization step for a given continuous regulator in order to maintain the robust stability and robust performance specifications guaranteed in the analog domain, assuming a constant rate and fixed-point arithmetic, using the structured singular value framework and global optimization techniques. A numerical example is further presented and discussed, emphasizing practical implications.
|
|
13:46-13:50, Paper FrB02.5 | Add to My Program |
Multiple Model Switched Repetitive Control with Application to Tremor Suppression |
|
Fang, Tingze | University of Southampton |
Freeman, Christopher T. | University of Southampton |
Keywords: Robust control, Uncertain systems, Modeling
Abstract: Tremor is a debilitating oscillation of the limbs that affects millions of people worldwide. Functional electrical stimulation (FES) can reduce tremor by artificially activating opposing muscles, and when mediated by repetitive control (RC), has potential to provide complete suppression. However, all previous RC applications have limited performance due to fatigue, spasticity and modelling error. This paper first applies gap metric analysis to derive robust stability margins for RC subject to model uncertainty. It then formulates a multiple model switched repetitive control (MMSRC) scheme with guaranteed robust performance bounds. Simulation results demonstrate that MMSRC effectively suppresses tremor with realistic levels of identification error, fatigue and spasticity, whereas conventional RC FES schemes are unstable.
|
|
13:50-13:54, Paper FrB02.6 | Add to My Program |
On the Achievable Degree of Stability in State Feedback Negative Imaginary Control |
|
Dannatt, James | ANU |
Petersen, Ian R. | Australian National University |
Keywords: Robust control, Uncertain systems, Smart structures
Abstract: In this paper, we provide results that describe the largest degree of stability that can be achieved using negative imaginary state feedback control. The achievable degree of stability is related to the zero locations of the transfer function from the control input to the disturbance output of the nominal plant being controlled.
|
|
13:54-13:58, Paper FrB02.7 | Add to My Program |
Robust D-Stability Analysis of Fractional-Order Controllers |
|
Ghorbani, Majid | Tallinn University of Technology |
Tepljakov, Aleksei | Tallinn University of Technology |
Petlenkov, Eduard | Tallinn University of Technology |
Keywords: Robust control, Uncertain systems, Stability of linear systems
Abstract: This paper focuses on analyzing the robust D-stability of fractional-order systems having uncertain coefficients using fractional-order controllers. Robust D-stability means that each polynomial in a family of an uncertain fractional-order system has all its roots in a prescribed region of the complex plane. By employing the concept of the value set, two distinct methodologies are introduced for scrutinizing the robust D-stability of the system. Although the outcomes of both approaches are equivalent, their computational appeal may differ. The first approach entails a graphical technique for the analysis of robust D-stability, while the second approach furnishes a robust D-stability testing function based on the shape properties of the value set, thereby establishing necessary and sufficient conditions for verifying the robust D-stability of fractional-order systems using fractional-order controllers. Finally, a numerical example is provided to validate the results presented in this paper
|
|
13:58-14:02, Paper FrB02.8 | Add to My Program |
UDE-PLC: Uncertainty and Disturbance Estimator with Phase-Lead Compensation |
|
Zhang, Te | University of Electronic Science and Technology of China |
Zhang, Lei | Sun Yat-Sen University |
Zhu, Bo | Sun Yat-Sen University |
Zhang, Qingrui | Sun Yat-Sen University |
Keywords: Robust control, Uncertain systems
Abstract: It has been well understood that the estimation error of uncertainty and disturbance estimator (UDE) can be arbitrarily small provided the bandwidth of UDE is chosen to be sufficiently high. Unfortunately, due to many physical constraints, the allowed bandwidth of UDE is always practically limited, the UDE is not so ideal and its actual estimation performance may not be satisfactory. Motivated by this observation, we formulate a simple inequality constraint on the UDE bandwidth and propose an uncertainty and disturbance estimator with phase-lead compensation (UDE-PLC) to improve the estimation performance under such a constraint. The main idea behind the design is to use the cascade of a first-order phase lead compensator and a first-order Butterworth filter, instead of a single Butterworth filter, to build the estimation relationship. By choosing properly the involved three parameters, the obvious phase lag of the non-ideal Butterworth filter is well compensated and both the disturbance estimation error and trajectory tracking error are reduced by the proposed design. The design specifications and the guideline for parameter tuning are provided to make the philosophy behind the UDE-PLC easy to follow. The effectiveness of UDE-PLC is verified by simulation on a 2-DOF AERO attitude control platform.
|
|
14:02-14:06, Paper FrB02.9 | Add to My Program |
A Robust Dual-Loop Control for Finite-Dimensional Koopman Model of Nonlinear Dynamical Systems |
|
Pal, Anuj | Michigan State University |
He, Tianyi | Utah State University |
Keywords: Robust control, Identification for control
Abstract: The Koopman operator is a promising approach for learning nonlinear dynamics using linear operators in high-dimensional function space. However, due to finite-dimensional approximation and imperfect data, model mismatch can arise, resulting in a discrepancy from the actual nonlinear model. As a result, robustness against model mismatch is a critical objective in Koopman-model-based control design. This paper presents a robust dual-loop control scheme for the finite-dimensional Koopman model to address this issue. Firstly, the biased dynamics of the finite-dimensional Koopman model are illustrated by a nonlinear bilinear motor. Multiple trajectory data sets are assumed with measurement noises and used to identify a Koopman model using the extended Dynamic Mode Decomposition (EDMD). The resulting Koopman model is examined to yield biased dynamics from actual nonlinear dynamics. Then, a robust dual-loop control is designed, consisting of an observer-based state-feedback control for the nominal Koopman model and an additional robust loop to improve robustness. The numerical results show that the dual-loop control can improve the robustness of the Koopman operator against model mismatch compared to simply applying nominal control. At low noise levels, both LQG and dual-loop control can regulate the system. However, at higher noise levels, the LQG control strategy fails to regulate the system, but the dual-loop control drives the system to achieve robust performance against the model mismatch.
|
|
14:06-14:10, Paper FrB02.10 | Add to My Program |
Time-Optimal Constrained Adaptive Robust Control of a Class of SISO Unmatched Nonlinear Systems |
|
Ji, Cheng | Purdue University |
Yao, Bin | Purdue University |
Keywords: Robust control, Adaptive control, Optimization
Abstract: Adaptive robust control (ARC) has demonstrated its superiority in handling disturbances and parametric uncertainties in the past decades. However, the conventional ARC designs cannot effectively handle the hard state constraints. To deal with the state constraints while maintaining a good tracking performance and robustness, a two-layer constrained adaptive robust control (CARC) strategy is proposed in this paper. In the outer layer, a planner continuously monitors level of tracking errors. When the tracking errors become large, the planner redesigns the reference trajectory by solving a constrained optimization problem. In the inner layer, a Saturated-ARC controller is synthesized to achieve a high tracking performance in the presence of external disturbances and parametric modeling uncertainties. The interaction between the two layers was analyzed to achieve guaranteed performance. The optimization cost function can be arbitrarily selected based on different needs, with time-optimal trajectory tracking re-planning solved in this paper due to its wider potential applications. The focus of this paper is not on solving the optimization problems, but rather incorporating the existing algorithms into our two-layer structure. Unlike model predictive control (MPC) based strategies, the proposed design does not rely on the fast iterative computation of solving the constrained optimization problem to achieve stability and robustness. Comparative simulations were carried out on an unmatched system. The results demonstrate the improvement of the proposed design over the past ones in dealing with hard state constraints.
|
|
FrB03 Invited Session, Sapphire EF |
Add to My Program |
Recent Advancement of Human Autonomy Interaction and Integration |
|
|
Chair: Zhang, Fumin | Georgia Institute of Technology |
Co-Chair: Jain, Neera | Purdue University |
Organizer: Zhang, Fumin | Georgia Institute of Technology |
Organizer: Wang, Yue | Clemson University |
Organizer: Zhang, Wenlong | Arizona State University |
Organizer: Mou, Shaoshuai | Purdue University |
Organizer: Jain, Neera | Purdue University |
Organizer: Liu, Changliu | Carnegie Mellon University |
Organizer: Yao, Ningshi | George Mason University |
|
13:30-13:45, Paper FrB03.1 | Add to My Program |
Human-As-Advisor in the Loop for Autonomous Lane-Keeping (I) |
|
Mai, Rene | Rensselaer Polytechnic Institute |
Mishra, Sandipan | Rensselaer Polytechnic Institute |
Julius, Agung | Rensselaer Polytechnic Institute |
Keywords: Human-in-the-loop control, Automotive systems, Control applications
Abstract: This paper presents a human-as-advisor architecture for shared human-machine autonomy in dynamic systems. In the human-as-advisor architecture, the human provides suggested control actions to the autonomous system; the system uses a model of the human controller to ascertain the system's state as perceived by the human. The system combines this information with additional sensor measurements, yielding an improved state estimate. We apply this architecture to the problem of lane-centering an autonomous vehicle in the presence of conflicting lane markings that render the true lane center uncertain. We model conflicting lane markings with a multi-component Gaussian mixture model. The human-suggested course of action is interpreted as an additional sensor measurement, which a Kalman filter is designed to combine with a speedometer and camera for improving the state estimate. With human input from our human-as-advisor architecture, the vehicle centers itself in the lane; without human input, the vehicle does not center itself. We also demonstrate the human-as-advisor architecture is robust to additive output matrix uncertainty and non-linear perturbations in the human model used to interpret the human-suggested control actions.
|
|
13:45-14:00, Paper FrB03.2 | Add to My Program |
On Trust-Aware Assistance-Seeking in Human-Supervised Autonomy (I) |
|
Mangalindan, Dong Hae | Michigan State Unversity |
Rovira, Ericka | U.S. Military Academy |
Srivastava, Vaibhav | Michigan State University |
Keywords: Markov processes, Autonomous robots, Supervisory control
Abstract: Using the context of human-supervised object collection tasks, we explore policies for a robot to seek assistance from a human supervisor and avoid loss of human trust in the robot. We consider a human-robot interaction scenario in which a mobile manipulator chooses to collect objects either autonomously or through human assistance; while the human supervisor monitors the robot's operation, assists when asked, or intervenes if the human perceives that the robot may not accomplish its goal. We design an optimal assistance-seeking policy for the robot using a Partially Observable Markov Decision Process (POMDP) setting in which human trust is a hidden state and the objective is to maximize collaborative performance. We conduct two sets of human-robot interaction experiments. The data from the first set of experiments is used to estimate POMDP parameters, which are used to compute an optimal assistance-seeking policy that is used in the second experiment. For most participants, the estimated POMDP reveals that humans are more likely to intervene when their trust is low and the robot is performing a high-complexity task; and that robot asking for assistance in high-complexity tasks can increase human trust in the robot. Our experimental results show that the proposed trust-aware policy yields superior performance compared with an optimal trust-agnostic policy
|
|
14:00-14:15, Paper FrB03.3 | Add to My Program |
Modeling Dynamical Systems with Neural Hybrid System Framework Via Maximum Entropy Approach (I) |
|
Yang, Yejiang | Augusta University |
Xiang, Weiming | Augusta University |
Keywords: Hybrid systems, Neural networks, Modeling
Abstract: In this paper, a data-driven neural hybrid system modeling framework via the Maximum Entropy partitioning approach is proposed for complex dynamical system modeling such as human motion dynamics. The sampled data collected from the system is partitioned into segmented data sets using the Maximum Entropy approach, and the mode transition logic is then defined. Then, as the local dynamical description for their corresponding partitions, a collection of small-scale neural networks is trained. Following a neural hybrid system model of the system, a set-valued reachability analysis with low computation cost is provided based on interval analysis and a split and combined process to demonstrate the benefits of our approach in computationally expensive tasks. Finally, a numerical examples of the limit cycle and a human behavior modeling example are provided to demonstrate the effectiveness and efficiency of the developed methods.
|
|
14:15-14:30, Paper FrB03.4 | Add to My Program |
A Two-Layer Human-In-The-Loop Optimization Framework for Customizing Lower-Limb Exoskeleton Assistance (I) |
|
Zheng, Siqi | Clemson University |
Lv, Ge | Clemson University |
Keywords: Robotics, Human-in-the-loop control, Optimization
Abstract: Task-invariant control paradigms can enable lower-limb exoskeletons to provide assistance for their users across various locomotor tasks without prescribing to specific joint kinematics. As an energetic control method, energy shaping can alter a human's body energetics in the closed-loop to provide gait benefits. To obtain the energy shaping law for underactuated systems, a set of nonlinear partial differential equations, called the matching condition, needs to be solved to determine the achievable closed-loop dynamics. However, solving matching conditions for high-dimensional nonlinear systems is generally difficult. In addition, how to define parameters for the closed-loop dynamics that render the optimal exoskeleton assistance remains unclear. In this paper, we proposed a two-layer, human-in-the-loop optimization framework for lower-limb exoskeletons to customize their assistance to human users. The inner-layer optimization finds solutions to the matching condition, meanwhile following the energy trajectories of a virtual reference model defined based on the self-selected gaits of humans and a scaled version of their anatomical parameters. The outer-layer incorporates human-in-the-loop Bayesian Optimization to update reference energy's parameters for reducing metabolic costs. Simulation results on two biped models demonstrate that the proposed framework can solve matching conditions numerically at the selected timestamps and the associated energy shaping strategies can reduce human metabolic cost. Moreover, exoskeletons torques calculated using an able-bodied subject's kinematic data well match human biological torques.
|
|
14:30-14:45, Paper FrB03.5 | Add to My Program |
Input-Constrained Human Assist Control Via Control Barrier Function for Viability Kernel |
|
Tezuka, Issei | Tokyo University of Science |
Nakamura, Hisakazu | Tokyo University of Science |
Hatano, Takashi | Mazda Motor Corporation |
Kamijo, Kenji | Mazda Motor Corporation |
Sato, Shota | Mazda Motor Corporation |
Keywords: Human-in-the-loop control, Constrained control, Time-varying systems
Abstract: This paper introduces control barrier functions for viability kernels, where a control input that enforces the safety of a system exists, to address a human assist control problem under input constraints. This paper also introduces a CBF-based human assist controller that satisfies both state and input constraints if an initial state of a system is contained in viability kernels. We lastly demonstrate how viability kernels are represented by system states and confirm the effectiveness of the proposed controller by computer simulation.
|
|
14:45-15:00, Paper FrB03.6 | Add to My Program |
Multi-Scenario Tube-Based Model Predictive Control for Irrigation Canals with Human Interventions |
|
Lopez Rodriguez, Francisco | University of Seville |
Muros, Francisco Javier | University of Seville |
Shahverdi, Kazem | Bu-Ali Sina University, Hamedan, Iran |
Maestre, Jose Maria (Pepe) | University of Seville |
Keywords: Human-in-the-loop control, Control applications, Predictive control for linear systems
Abstract: This article considers irrigation canal control problems where human agents are free to move along the canal temporarily overriding the position of actuators, which are considered to be electromechanical gates. To deal with this issue, the centralized controller is robustified against human interventions by following a tube-based model predictive control approach. To decrease conservatism, the controller considers explicitly the different scenarios for human interventions. Also, the ancillary control law implemented by the tube-based MPC controller is computed using a modular feedback gain that is designed to be resilient against the loss of control inputs. To illustrate the effectiveness of the proposed method, the American Society of Civil Engineers (ASCE) Test Canal 2 is used as a case study.
|
|
FrB04 Regular Session, Sapphire AB |
Add to My Program |
Statistical Learning |
|
|
Chair: Imani, Mahdi | Northeastern University |
Co-Chair: Moothedath, Shana | Iowa State University |
|
13:30-13:45, Paper FrB04.1 | Add to My Program |
Optimal Recursive Expert-Enabled Inference in Regulatory Networks |
|
Ravari, Amirhossein | Northeastern University |
Ghoreishi, Seyede Fatemeh | Northeastern University |
Imani, Mahdi | Northeastern University |
Keywords: Statistical learning, Genetic regulatory systems, Stochastic systems
Abstract: Accurate inference of biological systems, such as gene regulatory networks and microbial communities, is a key to a deep understanding of their underlying mechanisms. Despite several advances in the inference of regulatory networks in recent years, the existing techniques cannot incorporate expert knowledge into the inference process. Expert knowledge contains valuable biological information and is often reflected in available biological data, such as interventions made by biologists for treating diseases. Given the complexity of regulatory networks and the limitation of biological data, ignoring expert knowledge can lead to inaccuracy in the inference process. This paper models the regulatory networks using Boolean network with perturbation. We develop an expert-enabled inference method for inferring the unknown parameters of the network model using expert-acquired data. Given the availability of information about data-acquiring objectives and expert confidence, the proposed method optimally quantifies the expert knowledge along with the temporal changes in the data for the inference process. The numerical experiments investigate the performance of the proposed method using the well-known p53-MDM2 gene regulatory network.
|
|
13:45-14:00, Paper FrB04.2 | Add to My Program |
Feature Selection in Distributed Stochastic Linear Bandits |
|
Lin, Jiabin | Iowa State University |
Moothedath, Shana | Iowa State University |
Keywords: Statistical learning, Optimization, Agents-based systems
Abstract: In this paper, we study the problem of feature selection in distributed stochastic multi-arm bandits, in which M agents work collaboratively to choose optimal actions under the coordination of a central server in order to minimize the total regret. We consider a learning situation where there is a set of feature maps, each map is best suited for a a certain state of the system and the best feature map is unknown to the agent at the time of learning. In our model, an adversary chooses a distribution on the set of possible feature maps and the agents observe only the distribution and the true feature map are unknown to the agents. Our goal is to develop a distributed algorithm that selects a sequence of optimal actions to maximize the cumulative reward. By performing a feature vector transformation we propose an elimination algorithm and prove regret and communications bounds for linearly parametrized reward functions. We implement our algorithm and validate the performance of our approach through numerical simulations.
|
|
14:00-14:15, Paper FrB04.3 | Add to My Program |
Dynamic Probabilistic Latent Variable Model with Exogenous Variables for Dynamic Anomaly Detection |
|
Xu, Bo | University of Waterloo |
Zhu, Qinqin | University of Waterloo |
|
14:15-14:30, Paper FrB04.4 | Add to My Program |
A Computationally-Friendly Data-Driven Safety Filter for Control-Affine Discrete-Time Systems Subject to Unknown Process Noise |
|
Farokhi, Farhad | The University of Melbourne |
Leong, Alex S. | DST Group |
Shames, Iman | Australian National University |
Zamani, Mohammad | DSTG |
Keywords: Statistical learning, Uncertain systems, Constrained control
Abstract: A supervisory safety filter is developed to minimally modify nominal control inputs to a nonlinear control-affine discrete-time system to ensure satisfaction of potentially time-varying state and input constraints, i.e., safety constraints, with high probability. The system model is known while the environment model, i.e., distribution of additive Gaussian process noise, is unknown. State measurements are used to learn the statistics of the process noise. The safety filter employs a robust optimization problem involving tightening of the safety constraints based on the learned statistics and the corresponding confidence.
|
|
14:30-14:45, Paper FrB04.5 | Add to My Program |
Reinforcement Learning Data-Acquiring for Causal Inference of Regulatory Networks |
|
Alali, Mohammad | Northeastern University |
Imani, Mahdi | Northeastern University |
Keywords: Genetic regulatory systems, Stochastic systems, Statistical learning
Abstract: Gene regulatory networks (GRNs) consist of multiple interacting genes whose activities govern various cellular processes. The limitations in genomics data and the complexity of the interactions between components often pose huge uncertainties in the models of these biological systems. Meanwhile, inferring/estimating the interactions between components of the GRNs using data acquired from the normal condition of these biological systems is a challenging or, in some cases, an impossible task. Perturbation is a well-known genomics approach that aims to excite targeted components to gather useful data from these systems. This paper models GRNs using the Boolean network with perturbation, where the network uncertainty appears in terms of unknown interactions between genes. Unlike the existing heuristics and greedy data-acquiring methods, this paper provides an optimal Bayesian formulation of the data-acquiring process in the reinforcement learning context, where the actions are perturbations, and the reward measures step-wise improvement in the inference accuracy. We develop a semi-gradient reinforcement learning method with function approximation for learning near-optimal data-acquiring policy. The obtained policy yields near-exact Bayesian optimality with respect to the entire uncertainty in the regulatory network model, and allows learning the policy offline through planning. We demonstrate the performance of the proposed framework using the well-known p53-Mdm2 negative feedback loop gene regulatory network.
|
|
FrB05 Regular Session, Sapphire 411A |
Add to My Program |
Optimal Control IV |
|
|
Chair: Kamalapurkar, Rushikesh | Oklahoma State University |
Co-Chair: Labbadi, Moussa | Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-Lab, 38000 Grenoble, France |
|
13:30-13:45, Paper FrB05.1 | Add to My Program |
Design and Application of Safety Filters to Secure Controllers in Autonomous Driving |
|
Jaufmann, Pascal | University of Stuttgart |
Trachte, Adrian | Robert Bosch GmbH |
Berkel, Felix | Robert Bosch GmbH |
Specker, Thomas | Robert Bosch GmbH |
Sawodny, Oliver | University of Stuttgart |
Keywords: Optimal control, Automotive systems, Fault tolerant systems
Abstract: The ability to guarantee safety for a given controller is becoming more and more important in the field of autonomous driving. In this paper, we design, implement and compare two safety methods, capable of providing safety for an arbitrary input signal. Possible unsafe controllers ranging from learning algorithms to unknown controllers from an OEM can thus be safely applied to the system. The presented robust model predictive safety filter, based upon an MPC framework, searches for a safe and minimally invasive input. Hence, an algorithm certifying whether the desired control signal is safe or must be altered in order to maintain safety is used. By applying the design to a single track model and the scenario of a double lane-change, the filter shows its capability to provide safety for a badly tuned PID controller. The MPC approach is compared to an invariant set filter that employs a safe control set to keep the vehicle within constraints, identifying the main differences. Additionally, the robust model predictive safety filter scheme successfully ensures safe driving under additive disturbances.
|
|
13:45-14:00, Paper FrB05.2 | Add to My Program |
Improving High Efficiency and Reliability of Pump Systems Using Optimal Fractional-Order Integral Sliding-Mode Control Strategy |
|
Nassiri, Samir | Engineering for Smart and Sustainable Systems Research Center, M |
Labbadi, Moussa | Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-Lab, 38000 Greno |
Cherkaoui, Mohamed | Engineering for Smart and Sustainable Systems Research Center, M |
Keywords: Optimal control, Control applications, Electrical machine control
Abstract: In this paper,a robust optimale efficience Controller for a Complete water pumping system is designed based on the Fractional order Integral Sliding Surface (FISTSM) with Linear Quadratic Regulator (LQR) related to the Minimum Electric Loss (MEL) condition and tuned using an adaptive Genetic Algorithm optimization tool (GA). The whole control system is simulated in MATLAB SIMULINK workspace and the results show that the optimal controller allows, at the same time, the maximization of the overall efficiency and stabilization of the discharge flow rate for every operation point of the pumping system, offering a suitable operating mode by balancing efficiency and reliability of the Moto Pump Pipline system. A comparative analysis based on control energy, chattering phenomena, and control robustness has been conducted between the conventional PI, LQR, Integral SuperTwisting Sliding Mode Surface (ISTSMC) and the proposed control strategy FISTSM-LQR for moto pump pipline systems based on the simulated results. Finally, we evaluated the performance of the designed controls, including the Integral Absolute Error (IAE). The results of a simulation demonstrate that the proposed controller proves energy efficiency,robustness achievement, and chattering reduction.
|
|
14:00-14:15, Paper FrB05.3 | Add to My Program |
Scalable Multi-Agent Reinforcement Learning with General Utilities |
|
Ying, Donghao | UC Berkeley |
Ding, Yuhao | University of California, Berkeley |
Koppel, Alec | JP Morgan Chase |
Lavaei, Javad | UC Berkeley |
Keywords: Optimal control, Decentralized control, Machine learning
Abstract: We study the scalable multi-agent reinforcement learning (MARL) with general utilities, defined as nonlinear functions of the team's long-term state-action occupancy measure. The objective is to find a localized policy that maximizes the average of the team's local utility functions without the full observability of each agent in the team. By exploiting the spatial correlation decay property of the network structure, we propose a scalable distributed policy gradient algorithm with shadow reward and localized policy that consists of three steps: (1) shadow reward estimation, (2) truncated shadow Q-function estimation, and (3) truncated policy gradient estimation and policy update. Our algorithm converges, with high probability, to epsilon-stationarity with widetilde{mc{O}}(epsilon^{-2}) samples up to some approximation error that decreases exponentially in the communication radius. This is the first result in the literature on multi-agent RL with general utilities that does not require the full observability.
|
|
14:15-14:30, Paper FrB05.4 | Add to My Program |
Optimility of Zeno Executions in Hybrid Systems |
|
Clark, William | Cornell University |
Oprea, Maria | Cornell University |
Keywords: Optimal control, Hybrid systems
Abstract: A unique feature of hybrid dynamical systems (systems whose evolution is subject to both continuous- and discrete-time laws) is Zeno trajectories. Usually these trajectories are avoided as they can cause incorrect numerical results as the problem becomes ill-conditioned. However, these are difficult to justifiably avoid as determining when and where they occur is a non-trivial task. It turns out that in optimal control problems, not only can they not be avoided, but are sometimes required in synthesizing the solutions. This work explores the pedagogical example of the bouncing ball to demonstrate the importance of "Zeno control executions."
|
|
14:30-14:45, Paper FrB05.5 | Add to My Program |
Nonuniqueness and Convergence to Equivalent Solutions in Observer-Based Inverse Reinforcement Learning |
|
Town, Jared | Oklahoma State University |
Morrison, Zachary | Oklahoma State University |
Kamalapurkar, Rushikesh | Oklahoma State University |
Keywords: Optimal control, Learning, Observers for Linear systems
Abstract: A key challenge in solving the deterministic inverse reinforcement learning problem online and in real-time is the existence of non-unique solutions. Nonuniqueness necessitates the study of the notion of equivalent solutions and convergence to such solutions. While offline algorithms that result in convergence to equivalent solutions have been developed in the literature, online, real-time techniques that address nonuniqueness are not available. In this paper, a regularized history stack observer is developed to generate solutions that are approximately equivalent. Novel data-richness conditions are developed to facilitate the analysis and simulation results are provided to demonstrate the effectiveness of the developed technique.
|
|
14:45-15:00, Paper FrB05.6 | Add to My Program |
Exploiting GPU/SIMD Architectures for Solving Linear-Quadratic MPC Problems |
|
Cole, David | University of Wisconsin-Madison |
Shin, Sungho | Argonne National Laboratory |
Pacaud, Francois | Argonne National Laboratory |
Zavala, Victor M. | University of Wisconsin-Madison |
Anitescu, Mihai | Argonne National Laboratory |
Keywords: Optimal control, Optimization algorithms, Computational methods
Abstract: We report numerical results on solving linear-quadratic model predictive control (MPC) problems by exploiting graphics processing units (GPUs). The presented method reduces the MPC problem by eliminating the state variables and applies a condensed-space interior-point method to remove the inequality constraints in the KKT system. The final condensed matrix is positive definite and can be efficiently factorized in parallel on GPU/SIMD architectures. In addition, the size of the condensed matrix depends only on the number of controls in the problem, rendering the method particularly effective when the problem has many states but few inputs and moderate horizon length. Our numerical results for PDE-constrained problems show that the approach is an order of magnitude faster than a standard CPU implementation. We also provide an open-source Julia framework that facilitates modeling (DynamicNLPModels.jl) and solution (MadNLP.jl) of MPC problems on GPUs.
|
|
FrB06 Regular Session, Sapphire 411B |
Add to My Program |
Stochastic Systems |
|
|
Chair: Lee, Junsoo | University of South Carolina |
Co-Chair: Hoshino, Kenta | Kyoto University |
|
13:30-13:45, Paper FrB06.1 | Add to My Program |
Fixed Time Stability of Discrete-Time Stochastic Dynamical Systems |
|
Lee, Junsoo | University of South Carolina |
Haddad, Wassim M. | Georgia Inst. of Tech |
Keywords: Stochastic systems, Stability of nonlinear systems, Lyapunov methods
Abstract: In this paper, we address fixed time stability in probability of discrete-time stochastic dynamical systems. Unlike finite time stability in probability, wherein the finite time almost sure convergence behavior of the dynamical system depends on the system initial conditions, fixed time stability in probability involves finite time stability in probability for which the stochastic settling-time is guaranteed to be independent of the system initial conditions. More specifically, we develop Lyapunov theorems for fixed time stability in probability for Ito-type stationary nonlinear stochastic difference equations including a Lyapunov theorem that involves an exponential inequality of the Lyapunov function that gives rise to a minimum bound on the average stochastic settling-time characterized by the primary and secondary branches of the Lambert W function.
|
|
13:45-14:00, Paper FrB06.2 | Add to My Program |
Temporal Logic Control of Nonlinear Stochastic Systems Using a Piecewise-Affine Abstraction |
|
van Huijgevoort, Birgit | Eindhoven University of Technology |
Weiland, Siep | Eindhoven Univ. of Tech |
Haesaert, Sofie | Eindhoven University of Technology |
Keywords: Stochastic systems, Hybrid systems, Markov processes
Abstract: Automatically synthesizing controllers for continuous-state nonlinear stochastic systems, while giving guarantees on the probability of satisfying (infinite-horizon) temporal logic specifications crucially depends on abstractions with a quantified accuracy. For this similarity quantification, approximate stochastic simulation relations are often used. To handle the nonlinearity of the system effectively, we use finite-state abstractions based on piecewise-affine approximations together with tailored simulation relations that leverage the local affine structure. In the end, we synthesize a robust controller for a nonlinear stochastic Van der Pol oscillator.
|
|
14:00-14:15, Paper FrB06.3 | Add to My Program |
Dissipative Stochastic Dynamical Systems |
|
Lanchares, Manuel | Georgia Institute of Technology |
Haddad, Wassim M. | Georgia Inst. of Tech |
Keywords: Stochastic systems, Markov processes
Abstract: Dissipative dynamical systems provide fundamental connections between physics, dynamical systems theory, and control science and engineering. In the deterministic setting, dissipativity theory has been extensively developed in the literature to provide a general framework for the analysis and design of control systems using an input-state-output system description based on generalized system energy considerations that uses a state-space formalism to link engineering systems with memory to well known physical phenomena. Recently, several results have appeared in the literature extending dissipativity notions to the stochastic setting in order to develop an analogous theory for stochastic dynamical systems. However, unlike the deterministic theory, which can involve either an energy balance or a power balance state dissipation inequality for characterizing system dissipativity, in the stochastic case this equivalence is far more nuanced. In this paper, we develop a general theory for stochastic dissipativity and present general conditions on the system drift and diffusion functions as well as the system energy storage and supply rates to provide an equivalence between the sample path dependent energetic (i.e., supermartingale) and the power balance (i.e., algebraic) forms for characterizing stochastic dissipativity.
|
|
14:15-14:30, Paper FrB06.4 | Add to My Program |
Exact Solution and Projection Filters for Open Quantum Systems Subject to Imperfect Measurements |
|
Ramadan, Ibrahim | CentraleSupelec/Université Paris-Saclay |
Amini, Nina H. | CNRS, L2S, CentraleSupelec |
Mason, Paolo | CNRS, Laboratoire Des Signaux Et Systèmes, Supélec |
Keywords: Quantum information and control, Filtering, Stochastic systems
Abstract: In this paper, we consider an open quantum system undergoing imperfect and indirect measurement. For quantum non-demolition (QND) measurement, we show that the system evolves on an appropriately chosen manifold and we express the exact solution of the quantum filter equation in terms of the solution of a lower dimensional stochastic differential equation. In order to further reduce the dimension of the system under study, we consider the projection on the lower dimensional manifold originally introduced in [1] for the case of perfect measurements. An error analysis is performed to evaluate the precision of this approximate quantum filter, focusing on the case of QND measurement. Simulations suggest the efficiency of the proposed quantum projection filter, even in presence of a stabilizing feedback control which depends on the projection filter.
|
|
14:30-14:45, Paper FrB06.5 | Add to My Program |
Scalable Long-Term Safety Certificate for Large-Scale Systems |
|
Hoshino, Kenta | Kyoto University |
Wang, Zhuoyuan | Carnegie Mellon University |
Nakahira, Yorie | Carnegie Mellon University |
Keywords: Stochastic systems, Uncertain systems
Abstract: This paper focuses on safe control problems for high-dimensional systems with large uncertainties. A major challenge is the computation load to account for long outlook horizons in large-scale systems. This challenge is tackled using an integration of probabilistic forward invariance, the comparison theorem, and PDE techniques. Specifically, we propose a probabilistic certificate for long-term safety that only requires myopically ensuring linear control constraints and evaluating two-dimensional PDEs regardless of the system dimension. The certificate is constructed by obtaining a long-term safe probability bound as a solution of the PDE using the comparison theorem and applying a new notion of probabilistic forward invariance on the probability bound. The use of forward invariance directly on probabilistic reachability allows our method to carry the former’s computation efficiency and the latter’s control over long-term behaviors. Its capability to efficiently ensure long-term safety for high-dimensional systems can be useful in many large-scale distributed autonomous systems operating with limited onboard resources in latency- critical environments.
|
|
14:45-15:00, Paper FrB06.6 | Add to My Program |
On Robustness of Double Linear Trading with Transaction Costs |
|
Hsieh, Chung-Han | National Tsing Hua University |
Keywords: Finance, Stochastic systems, Uncertain systems
Abstract: A trading system is said to be robust if it generates a robust return regardless of market direction. To this end, a consistently positive expected trading gain is often used as a robustness metric for a trading system. In this paper, we propose a new class of trading policies called the double linear policy in an asset trading scenario when the transaction costs are involved. Unlike many existing papers, we first show that the desired robust positive expected gain may disappear when transaction costs are involved. Then we quantify under what conditions the desired positivity can still be preserved. In addition, we conduct heavy Monte-Carlo simulations for an underlying asset whose prices are governed by a geometric Brownian motion with jumps to validate our theory. A more realistic backtesting example involving historical data for cryptocurrency Bitcoin-USD is also studied.
|
|
FrB07 Regular Session, Aqua 303 |
Add to My Program |
Control Applications I |
|
|
Chair: Woelfel, Christian Tobias | Ruhr-Universität Bochum |
Co-Chair: Ayalew, Beshah | Clemson University |
|
13:30-13:45, Paper FrB07.1 | Add to My Program |
Model Predictive Control of Sputter Processes |
|
Woelfel, Christian Tobias | Ruhr-Universität Bochum |
Keywords: Control applications, Process Control, Materials processing
Abstract: A new model is developed to approximate the multivariable nonlinear sputter process with respect to the argon gas flow and the generator power as the inputs and the argon pressure and the self-bias voltage as the outputs. The identification of the process parameters is discussed based on experimental data. A novel control strategy for sputter processes is presented that applies an offset-free predictive controller based on the approximated model. Experiments are shown to validate the control system.
|
|
13:45-14:00, Paper FrB07.2 | Add to My Program |
Integrating Greenhouse Gas Emissions into Model Predictive Control of Heat Pump Water Heaters |
|
dela Rosa, Loren | University of California Davis |
Mande, Caton | Western Cooling Efficiency Center |
Richardson, Henry | WattTime |
Ellis, Matthew | University of California, Davis |
Keywords: Control applications, Process Control
Abstract: Heat pump water heaters (HPWHs) are more energy-efficient than electric resistance water heaters and have inherent load-shifting potential due to their built-in storage tank. Most HPWHs currently employ rule-based control (RBC) strategies that track a temperature setpoint, regardless of the cost of electricity or marginal grid greenhouse gas (GHG) emissions. Economic model predictive control (MPC) can provide automated load flexibility for HPWHs as it can determine in real-time the optimal operation of the HPWH heat sources based on time-varying factors. For example, time-of-use (TOU) rates can be used by the MPC to minimize the cost of operating the HPWH. However, TOU rates do not directly reflect the actual grid GHG emissions associated with electricity generation. In this work, a method for incorporating the marginal grid GHG emissions rate signal into the MPC cost function is proposed to reduce GHG emissions associated with HPWH use. The resulting multi-objective MPC operating cost and expected marginal grid GHG emissions, while maintaining user comfort. Simulation results demonstrate that the MPC approach can reduce operating costs and GHG emissions with no comfort violations compared to a conventional RBC strategy for HPWHs.
|
|
14:00-14:15, Paper FrB07.3 | Add to My Program |
Multi-Robot-Assisted Human Crowd Control for Emergency Evacuation: A Stabilization Approach |
|
Yuan, Zhenyuan | Pennsylvania State University |
Zheng, Tongjia | University of Notre Dame |
Nayyar, Mollik | The Pennsylvania State University |
Wagner, Alan | The Pennsylvania State University |
Lin, Hai | University of Notre Dame |
Zhu, Minghui | Pennsylvania State University |
Keywords: Control applications, Stability of nonlinear systems, Multivehicle systems
Abstract: This paper studies the problem of using a group of mobile robots to drive a group of humans to an exit for emergency evacuation. The interactions between the robots and the humans are modeled by a social force model. A novel optimization problem is formulated to synthesize a controller with closed-form expression. Sufficient conditions for global asymptotic stability are established for the humans and the robots. Simulation is conducted to evaluate the proposed controller.
|
|
14:15-14:30, Paper FrB07.4 | Add to My Program |
Sliding Mode Control of DC Microgrids with Constant Power Loads |
|
A.Biroon, Roghieh | Clemson University |
Pisu, Pierluigi | Clemson University |
Ayalew, Beshah | Clemson University |
Biron, Zoleikha | University of Florida |
Keywords: Control applications, Stability of nonlinear systems, Variable-structure/sliding-mode control
Abstract: The growing interest in green energy and the necessity of reliable electricity in remote areas take the researchers' interest toward DC microgrids. DC microgrids are exposed to small disturbances in their DC sources due to weather uncertainties and ripples resulting from AC/DC converters in their AC sources. These uncertainties may cause instability in microgrids especially in the presence of constant power loads (CPLs). DC microgrids' stability highly depends on DC bus voltage deviation. This paper proposes a new sliding mode control for a DC microgrid to guarantee the stability of the DC bus voltage.
|
|
14:30-14:45, Paper FrB07.5 | Add to My Program |
Field-Programmable Gate Array Control of DC-DC Switching Regulators: Design and Implementation of Controllers |
|
Smith, Trevor | Rochester Institute of Technology |
Lyshevski, Sergey | Rochester Institute of Technology |
Keywords: Power electronics, Control applications, Stability of nonlinear systems
Abstract: We investigate the design, implementation, and verification of closed-loop DC-DC switching regulators controlled by using field-programmable gate arrays (FPGAs). These converters are designed to stabilize output voltage and guarantee desired reference voltage profiles in expanded operating envelopes. For systems where supplied energy, voltage, and loads vary, practical control laws must be designed and implemented to meet requirements. These regulators are used in many aerial, automotive, communication, electronic and electromechanical systems. We investigate an FPGA based management system to control power modules and interconnected components. This implies solving problems such as sensing and filtering, components aggregation, interfacing, etc. The system requirements imply design and implementation of minimal complexity control laws for high-performance switching converters. FPGAs enable adaptive control, filtering and estimation to guarantee optimal performance, robustness, and interoperability for a broad range of applications. Our findings are experimentally validated.
|
|
14:45-15:00, Paper FrB07.6 | Add to My Program |
Learning Residual Dynamics Via Physics-Augmented Neural Networks: Application to Vapor Compression Cycles |
|
Chinchilla, Raphael | University of California, Santa Barbara |
Deshpande, Vedang M. | Mitsubishi Electric Research Laboratories |
Chakrabarty, Ankush | Mitsubishi Electric Research Laboratories (MERL) |
Laughman, Christopher R. | Mitsubishi Electric Research Labs |
Keywords: Grey-box modeling, Machine learning, Control applications
Abstract: In order to improve the control performance of vapor compression cycles (VCCs), it is often necessary to construct accurate dynamical models of the underlying thermo-fluid dynamics. These dynamics are represented by complex mathematical models that are composed of large systems of nonlinear and numerically stiff differential algebraic equations (DAEs). The effects of nonlinearity and stiffness may be ameliorated by using physics-based models to describe characteristic system behaviors, and approximating the residual (unmodeled) dynamics using neural networks. In these so-called `physics-augmented' or `physics-informed' machine learning approaches, the learning problem is often solved by jointly estimating parameters of the physics component model and weights of the network. Furthermore, such approaches also often assume the availability of full-state information, which typically are not available in practice for energy systems such as VCCs after deployment. Rather than concurrently performing state/parameter estimation and network training, which often leads to numerical instabilities, we propose a framework for decoupling the network training from the joint state/parameter estimation problem by employing state-constrained Kalman smoothers customized for VCC applications. We show the effectiveness of our proposed framework on a Julia-based, high-fidelity simulation environment calibrated to a model of a commercially-available VCC and achieve an accuracy of 98% calculated over 24 states and multiple initial conditions under realistic operating conditions.
|
|
FrB08 Invited Session, Aqua 305 |
Add to My Program |
Risk-Aware Design and Control |
|
|
Chair: Motee, Nader | Lehigh University |
Co-Chair: Liu, Guangyi | Lehigh University |
Organizer: Liu, Guangyi | Lehigh University |
Organizer: Somarakis, Christoforos | Palo Alto Research Center |
Organizer: Motee, Nader | Lehigh University |
|
13:30-13:45, Paper FrB08.1 | Add to My Program |
Symbolic Perception Risk in Autonomous Driving (I) |
|
Liu, Guangyi | Lehigh University |
Kamale, Disha | Lehigh University |
Vasile, Cristian Ioan | Lehigh University |
Motee, Nader | Lehigh University |
Keywords: Automotive systems, Uncertain systems, Autonomous robots
Abstract: We develop a novel framework to assess the risk of misperception in a traffic sign classification task in the presence of exogenous noise. We consider the problem in an autonomous driving setting, where visual input quality gradually improves due to improved resolution, and less noise since the distance to traffic signs decreases. Using the estimated perception statistics obtained using the standard classification algorithms, we aim to quantify the risk of misperception to mitigate the effects of imperfect visual observation. By exploring perception outputs, their expected high-level actions, and potential costs, we show the closed-form representation of the conditional value-at-risk (CVaR) of misperception. Several case studies support the effectiveness of our proposed methodology.
|
|
13:45-14:00, Paper FrB08.2 | Add to My Program |
Adversarial Tradeoffs in Robust State Estimation (I) |
|
Zhang, Thomas | University of Pennsylvania |
Lee, Bruce | University of Pennsylvania |
Hassani, Hamed | University of Pennsylvania |
Matni, Nikolai | University of Pennsylvania |
Keywords: Kalman filtering, Estimation, Observers for Linear systems
Abstract: Adversarially robust training has been shown to reduce the susceptibility of learned models to targeted input data perturbations. However, it has also been observed that such adversarially robust models suffer a degradation in accuracy when applied to unperturbed data sets, leading to a robustness-accuracy tradeoff. Inspired by recent progress in the adversarial machine learning literature which characterize such tradeoffs in simple settings, we develop tools to quantitatively study the performance-robustness tradeoff between nominal and robust state estimation. In particular, we define and analyze a novel adversarially robust Kalman Filtering problem. We show that in contrast to most other problem instances in adversarial machine learning, we can precisely derive the adversarial perturbation in the Kalman Filtering setting. We provide an algorithm to find this optimal adversarial perturbation given data realizations, and develop upper and lower bounds on the adversarial state estimation error in terms of the standard (non-adversarial) estimation error and the spectral properties of the resulting observer. Through these results, we show a natural connection between a filter's robustness to adversarial perturbation and underlying control theoretic properties of the system being observed, namely the spectral properties of its observability gramian.
|
|
14:00-14:15, Paper FrB08.3 | Add to My Program |
Certified Robust Control under Adversarial Perturbations (I) |
|
Yang, Jinghan | Washington University in St. Louis |
Kim, Hunmin | Mercer University |
Wan, Wenbin | University of Illinois at Urbana–Champaign |
Hovakimyan, Naira | University of Illinois at Urbana-Champaign |
Vorobeychik, Yevgeniy | Washington University in Saint Louis |
Keywords: Robust adaptive control, Vision-based control, Autonomous systems
Abstract: Autonomous systems increasingly rely on machine learning techniques to transform high-dimensional raw inputs into predictions that are then used for decision-making and control. However, it is often easy to maliciously manipulate such inputs and, as a result, predictions. While effective techniques have been proposed to certify the robustness of predictions to adversarial input perturbations, such techniques have been disembodied from control systems that make downstream use of the predictions. We propose the first approach for composing robustness certification of predictions with respect to raw input perturbations with robust control to obtain certified robustness of control to adversarial input perturbations. We use a case study of adaptive vehicle control to illustrate our approach and show the value of the resulting end-to-end certificates through extensive experiments.
|
|
14:15-14:30, Paper FrB08.4 | Add to My Program |
Risk-Awareness in Learning Neural Controllers for Temporal Logic Objectives (I) |
|
Hashemi, Navid | University of Southern California |
Qin, Xin | University of Southern California |
Deshmukh, Jyotirmoy | University of Southern California |
Fainekos, Georgios | Toyota NA-R&D |
Hoxha, Bardh | Toyota Motor North America |
Prokhorov, Danil | Toyota Technical Center |
Yamaguchi, Tomoya | Toyota Motor North America |
Keywords: Formal verification/synthesis, Learning, Neural networks
Abstract: In this paper, we consider the problem of synthesizing a controller in the presence of uncertainty such that the resulting closed-loop system satisfies certain hard constraints while optimizing certain (soft) performance objectives. We assume that the hard constraints encoding safety or mission-critical specifications are expressed using Signal Temporal Logic (STL), while performance is quantified using standard cost functions on system trajectories. To ensure satisfaction of the STL constraints, we algorithmically obtain control barrier functions (CBFs) from the STL specifications. We model controllers as neural networks (NNs) and provide an algorithm to train the NN parameters to simultaneously optimize the performance objectives while satisfying the CBF conditions (with a user-specified robustness margin). We evaluate the risk incurred by the trade-off between the robustness margin of the system and its performance using the formalism of risk measures. We demonstrate our approach on challenging nonlinear control examples such as quadcopter motion planning and a unicycle.
|
|
14:30-14:45, Paper FrB08.5 | Add to My Program |
Exponential TD Learning: A Risk-Sensitive Actor-Critic Reinforcement Learning Algorithm (I) |
|
Noorani, Erfaun | University of Maryland College Park |
Mavridis, Christos | University of Maryland, College Park |
Baras, John S. | University of Maryland |
Keywords: Learning, Iterative learning control, Optimal control
Abstract: Incorporating risk in the decision-making process has been shown to lead to significant performance improvement in optimal control and reinforcement learning algorithms. We construct a temporal-difference risk-sensitive reinforcement learning algorithm using the exponential criteria commonly used in risk-sensitive control. The proposed method resembles an actor-critic architecture with the ‘actor’ implementing a policy gradient algorithm based on the exponential of the reward-to-go, which is estimated by the ‘critic’. The novelty of the update rule of the ‘critic’ lies in the use of a modified objective function that corresponds to the underlying multiplicative Bellman's equation. Our results suggest that the use of the exponential criteria accelerates the learning process and reduces its variance, i.e., risk-sensitiveness can be utilized by actor-critic methods and can lead to improved performance.
|
|
14:45-15:00, Paper FrB08.6 | Add to My Program |
Cascading Waves of Fluctuation in Time-Delay Multi-Agent Rendezvous (I) |
|
Liu, Guangyi | Lehigh University |
Pandey, Vivek | Lehigh University |
Somarakis, Christoforos | Palo Alto Research Center |
Motee, Nader | Lehigh University |
Keywords: Networked control systems, Network analysis and control, Control of networks
Abstract: We develop a framework to assess the risk of cascading failures when a team of agents aims to rendezvous in time in the presence of exogenous noise and communication time-delay. The notion of value-at-risk (VaR) measure is used to evaluate the risk of cascading failures (i.e., waves of large fluctuations) when some agents have failed to rendezvous. Furthermore, an efficient explicit formula is obtained to calculate the risk of higher-order cascading failures recursively. Finally, from a risk-aware design perspective, we report an evaluation of the most vulnerable sequence of agents in various communication graphs.
|
|
FrB09 Regular Session, Aqua 307 |
Add to My Program |
Lyapunov Methods |
|
|
Chair: Peet, Matthew M. | Arizona State University |
Co-Chair: Ahmed, Qadeer | The Ohio State University |
|
13:30-13:45, Paper FrB09.1 | Add to My Program |
Convex Synthesis and Verification of Control-Lyapunov and Barrier Functions with Input Constraints |
|
Dai, Hongkai | Toyota Research Institute |
Permenter, Frank | Toyota Research Institute |
Keywords: Lyapunov methods, Formal verification/synthesis, Optimization
Abstract: Control Lyapunov functions (CLFs) and control barrier functions (CBFs) are widely used tools for synthesizing controllers subject to stability and safety constraints. Paired with online optimization, they provide stabilizing control actions that satisfy input constraints and avoid unsafe regions of state-space. Designing CLFs and CBFs with rigorous perfor- mance guarantees is computationally challenging. To certify existence of control actions, current techniques not only design a CLF/CBF, but also a nominal controller. This can make the synthesis task more expensive, and performance estimation more conservative. In this work, we characterize polynomial CLFs/CBFs using sum-of-squares conditions, which can be directly certified using convex optimization. This yields a CLF and CBF synthesis technique that does not rely on a nominal controller. We then present algorithms for iteratively enlarging estimates of the stabilizable and safe regions. We demonstrate our algorithms on a 2D toy system, a pendulum and a quadrotor.
|
|
13:45-14:00, Paper FrB09.2 | Add to My Program |
Barrier Functions for Robust Safety in Differential Inclusions, Part III: Inner and Outer Perturbations |
|
Maghenem, Mohamed Adlene | Gipsa Lab, CNRS, France |
Karaki, Diana | CEA Paris Saclay |
Keywords: Lyapunov methods, Robust control, Stability of nonlinear systems
Abstract: This paper introduces a new robust-safety notion for differential inclusions. That is, we say that the system is strongly robustly safe if it remains safe in the presence of a continuous and positive perturbation, named robustness margin, added to both the argument and the image of its right-hand side. While in existing literature, including the preceding Parts I and II, the perturbation term is added only to the image of the right-hand side, the notion proposed in this paper is shown to be relatively stronger, especially when the right-hand side is a general set-valued map. Furthermore, we show that some of the existing sufficient conditions for robust safety, in term of barrier functions, are strong enough to guarantee strong robust safety, provided that mild assumptions on the right-hand side hold. Following that, we establish the equivalence between strong robust safety and the existence of a smooth barrier certificate.
|
|
14:00-14:15, Paper FrB09.3 | Add to My Program |
Existence of Partially Quadratic Lyapunov Functions That Can Certify the Local Asymptotic Stability of Nonlinear Systems |
|
Jones, Morgan | Sheffield University |
Peet, Matthew M. | Arizona State University |
Keywords: Lyapunov methods, Stability of nonlinear systems
Abstract: This paper proposes a method for certifying the local asymptotic stability of a given nonlinear Ordinary Differential Equation (ODE) by using Sum-of Squares (SOS) programming to search for a partially quadratic Lyapunov Function (LF). The proposed method is particularly well suited to the stability analysis of ODEs with high dimensional state spaces. This is due to the fact that partially quadratic LFs are parametrized by fewer decision variables when compared with general SOS LFs. The main contribution of this paper is using the Center Manifold Theorem to show that partially quadratic LFs that certify the local asymptotic stability of a given ODE exist under certain conditions.
|
|
14:15-14:30, Paper FrB09.4 | Add to My Program |
Cruise Controllers for Vehicles on Lane-Free Ring-Roads |
|
Theodosis, Dionysios | Technical University of Crete |
Karafyllis, Iasson | National Technical University of Athens |
Papageorgiou, Markos | Technical Univ. of Crete |
Keywords: Lyapunov methods, Stability of nonlinear systems
Abstract: The paper introduces novel families of cruise controllers for autonomous vehicles on lane-free ring-roads. The design of the cruise controllers is based on the appropriate selection of a Control Lyapunov Function expressed on measures of the energy of the system with the kinetic energy expressed in ways similar to Newtonian or relativistic mechanics. The derived feedback laws (cruise controllers) are decentralized (per vehicle), as each vehicle determines its control input based on: (i) its own state; (ii) either only the distance from adjacent vehicles (inviscid cruise controllers) or the state of adjacent vehicles (viscous cruise controllers); and (iii) its distance from the boundaries of the ring-road.
|
|
14:30-14:45, Paper FrB09.5 | Add to My Program |
Uncertainty Propagation for Nonlinear Dynamics: A Polynomial Optimization Approach |
|
Covella, Francesca | Politecnico Di Milano |
Fantuzzi, Giovanni | FAU Erlangen-Nuernberg |
Keywords: Lyapunov methods, Uncertain systems, Optimization
Abstract: We use Lyapunov-like functions and convex optimization to propagate uncertainty in the initial condition of nonlinear systems governed by ordinary differential equations. We consider the full nonlinear dynamics without approximation, producing rigorous bounds on the expected future value of a quantity of interest even when only limited statistics of the initial condition (e.g., mean and variance) are known. For dynamical systems evolving in compact sets, the best upper (lower) bound coincides with the largest (smallest) expectation among all initial state distributions consistent with the known statistics. For systems governed by polynomial equations and polynomial quantities of interest, one-sided estimates on the optimal bounds can be computed using tools from polynomial optimization and semidefinite programming. Moreover, these numerical bounds provably converge to the optimal ones in the compact case. We illustrate the approach on a van der Pol oscillator and on the Lorenz system in the chaotic regime.
|
|
14:45-15:00, Paper FrB09.6 | Add to My Program |
Safe Control Using High-Order Measurement Robust Control Barrier Functions |
|
Oruganti, Pradeep Sharma | The Ohio State University |
Naghizadeh, Parinaz | Ohio State University |
Ahmed, Qadeer | The Ohio State University |
Keywords: Autonomous robots, Lyapunov methods
Abstract: We study the problem of providing safety guarantees for dynamic systems of high relative degree in the presence of state measurement errors. To this end, we propose High-Order Measurement Robust Control Barrier Functions (HO-MR-CBFs), an extension of the recently proposed Measurement Robust Control Barrier Functions. We begin by formally defining HO-MR-CBF, and identify conditions under which the proposed HO-MR-CBF can render the system’s safe set forward invariant. In addition, we provide bounds on the state measurement errors for which the optimization problem for identifying the corresponding safe controllers is feasible for all states within the safe set and given restricted control inputs. We demonstrate the proposed approach through numerical experiments on a collision avoidance scenario in presence of measurement noise using a nonlinear kinematic model of a wheeled robot. We show that using our proposed control method, the robot, who has access to only biased state estimates, will be successful in avoiding the obstacle.
|
|
FrB10 Regular Session, Aqua 309 |
Add to My Program |
Linear Systems |
|
|
Chair: Nozari, Erfan | University of California, Riverside |
Co-Chair: Lavaei, Javad | UC Berkeley |
|
13:30-13:45, Paper FrB10.1 | Add to My Program |
A Quantitative and Constructive Proof of Willems' Fundamental Lemma and Its Implications |
|
Berberich, Julian | University of Stuttgart |
Iannelli, Andrea | University of Stuttgart |
Padoan, Alberto | ETH Zürich |
Coulson, Jeremy | University of Wisconsin-Madison |
Dörfler, Florian | Swiss Federal Institute of Technology (ETH) Zurich |
Allgöwer, Frank | University of Stuttgart |
Keywords: Linear systems, Adaptive control, Identification
Abstract: Willems' Fundamental Lemma provides a powerful data-driven parametrization of all trajectories of a controllable linear time-invariant system based on one trajectory with persistently exciting (PE) input. In this paper, we present a novel proof of this result which is inspired by the classical adaptive control literature and differs from existing proofs in multiple aspects. The proof involves a quantitative and directional PE notion, allowing to characterize robust PE properties via singular value bounds, as opposed to binary rank-based PE conditions. Further, the proof is constructive, i.e., we derive an explicit PE lower bound for the generated data. As a contribution of independent interest, we generalize existing PE results from the adaptive control literature and reveal a crucial role of the system's zeros.
|
|
13:45-14:00, Paper FrB10.2 | Add to My Program |
Ubiquitous Controllability of Single Input Linear Time-Invariant Systems |
|
Hays, Christopher | Embry-Riddle Aeronautical University |
Soderlund, Alexander | The Ohio State University |
Phillips, Sean | Air Force Research Laboratory |
Henderson, Troy | Embry-Riddle Aeronautical University |
Keywords: Linear systems, Control of networks, Network analysis and control
Abstract: In this paper, we consider the case of a particular class of linear time-invariant (LTI) dynamic systems that only require the actuation of a single state to yield controllability of the entire system, dually, only a single state need be observed to render the system observable. This work ties together elements of the state-space, graph, and transfer function representations of dynamic systems to evaluate the controllability and observability properties of a system. More specifically, necessary and sufficient conditions for Ubiquitous Single-Input Controllability (USIC) are introduced using traditional state-feedback perspectives, transfer functions, and a graph theoretical perspective is used to define an additional set of both necessary conditions and sufficient conditions. Ties are also made to structural controllability, and it is shown that any LTI system that meets the USIC condition also meets the structural controllability condition. Finally, brief practical examples are presented.
|
|
14:00-14:15, Paper FrB10.3 | Add to My Program |
A Quantitative Notion of Persistency of Excitation and the Robust Fundamental Lemma |
|
Coulson, Jeremy | ETH Zürich |
van Waarde, Henk J. | University of Groningen |
Lygeros, John | ETH Zurich |
Dörfler, Florian | Swiss Federal Institute of Technology (ETH) Zurich |
Keywords: Linear systems, Identification, Identification for control
Abstract: The fundamental lemma by Willems and coauthors enables a parameterization of all trajectories of a linear time-invariant system in terms of a single, measured one. This result plays a key role in data-driven simulation and control. The fundamental lemma relies on a persistently exciting input to the system to ensure that the Hankel matrix of resulting input/output data has the "right" rank, meaning that its columns span the entire subspace of trajectories. However, such binary rank conditions are known to be fragile in the sense that a small additive noise could already cause the Hankel matrix to have full rank. In this letter we present a robust version of the fundamental lemma. The idea behind the approach is to guarantee certain lower bounds on the singular values of the data Hankel matrix, rather than qualitative rank conditions. This is achieved by designing the inputs of the experiment such that the minimum singular value of an input Hankel matrix is sufficiently large, inspiring a quantitative notion of persistency of excitation. We highlight the relevance of the result in a data-driven control case study by comparing the predictive control performance for varying degrees of persistently exciting data.
|
|
14:15-14:30, Paper FrB10.4 | Add to My Program |
Learning Based Optimal Sensor Selection for Linear Quadratic Control with Unknown Sensor Noise Covariance |
|
Li, Jinna | Liaoning Petrochemical University |
Wang, Xinru | LiaoNing Petrochemical University |
Meng, Xiangyu | Louisiana State University |
Keywords: Linear systems, Optimal control, Learning
Abstract: In this article, an optimal sensor selection problem is considered under the framework of linear quadratic control. The objective is to find the best strategy of selecting one sensor among a set of sensors at each time step so that the expected system performance is minimized over multiple time steps. This problem is formulated as a multi-armed bandit problem. Uncertainties are captured through noisy sensor measurements, which account for the performance deterioration caused by unknown sensor noise covariance. In this context, several action-value based reinforcement learning methods are proposed to evaluate the performance of different sensor selection strategies. Moreover, a statistical method is developed to estimate the unknown sensor noise covariance as a byproduct. The almost sure convergence to the true sensor noise covariance is guaranteed as the number of times a sensor being selected goes to infinity. A linear quadratic control example is presented to illustrate the proposed approaches and to demonstrate their effectiveness.
|
|
14:30-14:45, Paper FrB10.5 | Add to My Program |
Learning of Dynamical Systems under Adversarial Attacks - Null Space Property Perspective |
|
Feng, Han | University of California, Berkeley |
Yalcin, Baturalp | UC Berkeley |
Lavaei, Javad | UC Berkeley |
Keywords: Linear systems, Optimization, Identification for control
Abstract: We study the identification of a linear time-invariant dynamical system affected by large-and-sparse disturbances modeling adversarial attacks or faults. Under the assumption that the states are measurable, we develop necessary and sufficient conditions for the recovery of the system matrices by solving a constrained lasso-type optimization problem. In addition, we provide an upper bound on the estimation error whenever the disturbance sequence is a combination of small noise values and large adversarial values. Our results depend on the null space property that has been widely used in the lasso literature, and we investigate under what conditions this property holds for linear time-invariant dynamical systems. Lastly, we further study the conditions for a specific probabilistic model and support the results with numerical experiments.
|
|
14:45-15:00, Paper FrB10.6 | Add to My Program |
On the Linearizing Effect of Temporal Averaging in Nonlinear Dynamical Systems |
|
Ahmed, Sabbir | University of California, Riverside |
Nozari, Erfan | University of California, Riverside |
Keywords: Linear systems, Stochastic systems
Abstract: Application of low pass filters (LPFs) to remove noise components is a widely used methodology for processing signals acquired from diverse systems. LPFs are also intrinsic components of many natural and man-made systems, both intended and epiphenomenal, from electromechanical systems to traffic networks and the brain. Across all cases, the effects of LPFs are often studied in a pure filtering sense, such as temporal smoothing and removing high-pass noise components, causing delays and phase distortions, or limiting bandwidths. In this work, we instead show that low-pass filtering and the temporal averaging that underlies it can also have a major and fundamental impact on the linearity of the dynamics. We show using rigorous analysis that across a wide range of stochastic nonlinear systems, temporal averaging dampens nonlinearities and leads to more and more linear dynamics with stronger temporal averaging (lower LPF cutoff frequency), leading asymptotically to a completely linear system as the width of the window over which temporal averaging occurs tends to infinity (LPF cutoff frequency tends to zero). Our results have major implications in a wide range of application areas, including the study of the nervous system whereby LPFs are biologically and algorithmically abundant and a growing body of empirical evidence has found linear models as capable as nonlinear ones in describing neuronal time series.
|
|
FrB11 Regular Session, Aqua Salon AB |
Add to My Program |
Networked Control Systems II |
|
|
Chair: Werner, Herbert | Hamburg University of Technology |
Co-Chair: Garcia, Eloy | Air Force Research Laboratory |
|
13:30-13:45, Paper FrB11.1 | Add to My Program |
Robust H_{infty} Consensus for Homogeneous Multi-Agent Systems with Parametric Uncertainties |
|
Capone, Alexandre | Technical University of Munich |
Jiao, Junjie | Technical University of Munich |
Zarei, Mostafa | Polytechnic University of Milan |
Zhang, Shiqi | Peking Univeristy |
Hirche, Sandra | Technische Universität München |
Keywords: Networked control systems, Agents-based systems, H-infinity control
Abstract: This paper addresses the problem of robust consensus of an undirected network of homogeneous multi-agent systems with uncertain agent dynamics and system noise. We consider uncertain time-varying input matrices that are arbitrary up to a known bound for the singular values. We also assume that each agent's controller is able to access the neighbors' relative states. We focus on the design of a linear controller gain that is to be identical across all agents. We provide sufficient conditions for the control gains to achieve both consensus in the noiseless setting and a transfer function with a given bounded H_{infty} norm in the setting with noise. More specifically, we show that this is achieved if a set of linear matrix inequalities using the non-zero eigenvalues of the Laplacian are satisfied. In a numerical simulation, we illustrate these theoretical results and show that our method outperforms a consensus region-based approach.
|
|
13:45-14:00, Paper FrB11.2 | Add to My Program |
Distributed H2 Controller Synthesis for Multi-Agent Systems with Stochastic Packet Loss |
|
Hespe, Christian | Hamburg University of Technology |
Datar, Adwait | Hamburg University of Technology |
Schneider, Daniel | University of Koblenz - Landau |
Saadabadi, Hamideh | TUHH |
Werner, Herbert | Hamburg University of Technology |
Frey, Hannes | University of Koblenz-Landau |
Keywords: Networked control systems, Distributed control, Stochastic systems
Abstract: In practical networking scenarios, communication links can rarely be considered to be deterministic, yet the influence of stochastic interconnections on multi-agent systems is neglected most of the time. To bridge this gap, this paper develops synthesis conditions for distributed state- and output-feedback controllers that guarantee an upper bound on the closed-loop H 2-norm under the effect of Bernoulli distributed packet loss. Utilizing the frameworks of Markov jump linear system and decomposable systems, the synthesis problem is formulated as a linear matrix inequality problem with complexity that scales linearly with the number of agents. Finally, the closed-loop performance is assessed in simulation studies with a signal-to-interference-plus-noise ratio based packet loss model for communication between autonomous underwater vehicles.
|
|
14:00-14:15, Paper FrB11.3 | Add to My Program |
Consensus Controller for Heterogeneous Multi-Agent Systems Using Output Prediction |
|
Niu, Kaicheng | Georgia Institute of Technology |
Wardi, Yorai | Georgia Institute of Technology |
Abdallah, Chaouki T. | Georgia Institute of Technology |
Hayajneh, Mohammad | United Arab Emirates University |
Keywords: Networked control systems, Distributed control
Abstract: This paper proposes a distributed consensus controller for a class of heterogeneous nonlinear multi-agent systems. The control law enacted at each agent is based on predicted outputs of itself and its neighboring agents. It implements a fluid-flow version of the Newton-Raphson method for solving equations, and this, together with the way the predictions are used, guarantees asymptotic consensus for a general class of systems defined by ordinary differential equations. The scope of the analysis includes heterogeneous systems whose agent subsystems have different state-space models with different dimensions, but it requires that all the inputs and outputs of the agents' subsystems have the same dimension. Following a presentation of the consensus-control technique, we analyse its convergence and present simulation results for a heterogeneous nonlinear system.
|
|
14:15-14:30, Paper FrB11.4 | Add to My Program |
A Norm-Free Adaptive Event-Triggering Law for Distributed Control of Nonholonomic Mobile Robots |
|
Kurtoglu, Deniz | University of South Florida |
Yucelen, Tansel | University of South Florida |
Tran, Dzung | AFRL |
Casbeer, David W. | Air Force Research Laboratory |
Garcia, Eloy | Air Force Research Laboratory |
Keywords: Networked control systems, Lyapunov methods
Abstract: In this paper, the problem of scheduling data transmissions in multiagent systems, which are composed of a team of nonholonomic mobile robots, is studied. To represent the equations of motion of each robot as double integrator dynamics, we first feedback linearize the robot dynamics that allows us to avoid nonholonomic control architecture synthesis. We then propose a decentralized, norm-free, and adaptive event-triggering rule for control of this multiagent system in a distributed manner with reduced robot-to-robot position and velocity data transmissions. Stability of the resulting event-triggered multiagent system is presented and an illustrative numerical example is also included to demonstrate its efficacy.
|
|
14:30-14:45, Paper FrB11.5 | Add to My Program |
RSSI-Based Localization with Adaptive Noise Covariance Estimation for Resilient Multi-Agent Formations |
|
Bonczek, Paul | University of Virginia |
Bezzo, Nicola | University of Virginia |
Keywords: Fault tolerant systems, Networked control systems, Multivehicle systems
Abstract: Typical cooperative multi-agent systems (MASs) exchange information to coordinate their motion in proximity-based control consensus schemes to complete a common objective. However, in the event of faults or cyber attacks to on-board positioning sensors of agents, global control performance may be compromised resulting in a hijacking of the entire MAS. For systems that operate in unknown or landmark-free environments (e.g., open terrain, sea, or air) and also beyond range/proximity sensing of nearby agents, compromised agents lose localization capabilities. To maintain resilience in these scenarios, we propose a method to recover compromised agents by utilizing Received Signal Strength Indication (RSSI) from nearby agents (i.e., mobile landmarks) to provide reliable position measurements for localization. To minimize estimation error: i) a multilateration scheme is proposed to leverage RSSI and position information received from neighboring agents as mobile landmarks and ii) a Kalman filtering method adaptively updates the unknown RSSI-based position measurement covariance matrix at runtime that is robust to unreliable state estimates. The proposed framework is demonstrated with simulations on MAS formations in the presence of faults and cyber attacks to on-board position sensors.
|
|
FrB12 Regular Session, Aqua Salon C |
Add to My Program |
Adaptive Control IV |
|
|
Chair: Valasek, John | Texas A&M University |
Co-Chair: Kumar, Manish | University of Cincinnati |
|
13:30-13:45, Paper FrB12.1 | Add to My Program |
Adaptive Control for Non-Minimum Phase Systems Via Time Scale Separation |
|
Eves, Kameron | Texas A&M University |
Valasek, John | Texas A&M University |
Keywords: Adaptive control, Uncertain systems
Abstract: Adaptive control for non-minimum phase systems is a challenging problem. This paper proposes a method of adaptive control for systems that may be both nonlinear and non-minimum phase. This is accomplished by exploiting time scale separation between the internal and external dynamics. The original non-minimum phase control problem is reduced to two minimum phase control problems through a time scale analysis. The resulting adaptive control signals are fused via multiple time scale control techniques. Singular perturbation theory is used to prove the stability and convergence of the fullorder system as an extension of the stability and convergence of the two reduced-order systems. The effectiveness of this method is validated on a nonlinear example system.
|
|
13:45-14:00, Paper FrB12.2 | Add to My Program |
Adaptive Tracking Control of Uncertain Euler-Lagrange Systems with State and Input Constraints |
|
Ghosh, Poulomee | Indian Institute of Technology Delhi |
Bhasin, Shubhendu | Indian Institute of Technology Delhi |
Keywords: Adaptive control, Uncertain systems, Constrained control
Abstract: This paper proposes a novel control architecture for state and input constrained Euler-Lagrange (E-L) systems with parametric uncertainties. A simple saturated controller is strategically coupled with a Barrier Lyapunov Function (BLF) based controller to ensure state and input constraint satisfaction. To the best of the authors' knowledge, this is the first result for E-L systems that guarantees asymptotic tracking with user-specified state and input constraints. The proposed controller also ensures that all the closed-loop signals remain bounded. The efficacy of the proposed controller in terms of constraint satisfaction and tracking performance is verified using simulation on a robot manipulator system.
|
|
14:00-14:15, Paper FrB12.3 | Add to My Program |
A Flying Inverted Pendulum with Unknown Length |
|
Barawkar, Shraddha | University of Cincinnati |
Kumar, Manish | University of Cincinnati |
Keywords: Adaptive control, Uncertain systems
Abstract: Balancing an inverted pendulum on an unmanned aerial vehicle has been a topic of interest in recent literature. For example, a recent study uses an LQR controller to balance the inverted pendulum on a quadrotor drone. However, these studies consider the length of the pendulum to be known a priori. Indeed, in certain applications this assumption might not hold true. For example, consider a quadrotor hoverboard being used by people of different heights. In such cases, an approach is required to estimate the length of the pendulum. This paper analyzes the linearized dynamics of the combined system of quadrotor and inverted pendulum. It is found that unknown length of pendulum causes the system to fall in the category of unmatched uncertain systems where the control input cannot be used to cancel the uncertainty. This paper formulates the problem in such a manner that the system is still controllable in presence of this unmatched uncertainty. A concurrent learning adaptive controller, which avoids the use of persistently exciting signals, is then utilized to estimate the unmatched uncertainty and hence the length of the pendulum. Simulation results validate the effectiveness of the adaptive controller for the proposed problem.
|
|
14:15-14:30, Paper FrB12.4 | Add to My Program |
Attention-Enabled Memory for Concurrent Learning Adaptive Control |
|
Habboush, Abdullah | Bilkent University |
Yildiz, Yildiray | Bilkent University |
Keywords: Adaptive control, Uncertain systems
Abstract: Transient tracking error dynamics are inevitable in any practical closed-loop control system. While numerous works are devoted to improving these dynamics, in this paper, we focus on taking advantage of it first, in the context of adaptive control. We propose a memory architecture that can make use of stored significant data about the transients of previously experienced anomalies to aid in obtaining a resilient system against uncertainties. The proposed architecture consists of 1) a memory containing data about a variety of uncertainties, 2) a short-term memory that aids in handling new uncertainties, and 3) an attention-based reading mechanism that enables the controller to retrieve only relevant data from the memory. The effectiveness of the architecture is validated through numerical simulations, and a rigorous Lyapunov stability analysis is provided.
|
|
14:30-14:45, Paper FrB12.5 | Add to My Program |
Retrospective-Cost-Based Model Reference Adaptive Control of Nonminimum-Phase Systems |
|
Mohseni, Nima | University of Michigan, Ann Arbor |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Direct adaptive control, Adaptive control, Linear systems
Abstract: This paper presents a novel approach to model reference adaptive control inspired by the adaptive pole-placement technique of Elliot and based on retrospective cost optimization (RC-MRAC). RC-MRAC is applicable to nonminimum-phase (NMP) systems assuming that the NMP zeros are known. Under this assumption, the advantage of RC-MRAC is a reduced need for persistency.
|
|
14:45-15:00, Paper FrB12.6 | Add to My Program |
Robust Control of a Nonsmooth or Switched Control Affine Uncertain Nonlinear System Using a Novel RISE-Inspired Approach |
|
Ting, Jonathan | Auburn University |
Basyal, Sujata | Auburn University |
Allen, Brendon C. | Auburn University |
Keywords: Robust adaptive control, Switched systems, Lyapunov methods
Abstract: For decades, nonlinear control methodologies have been developed to compensate for uncertain terms in the dynamical model that are upper bounded by constants. Classes of discontinuous and continuous controllers have been developed to compensate for these problematic terms; however, these controllers are prone to chatter or have been restricted to particular classes of uncertain and smooth nonlinear systems. Despite decades of research, an open question that remains is whether a chatter-mitigating control law can be developed to compensate for terms bounded by constants for a wider class of uncertain nonlinear systems, including switched or nonsmooth systems. To address this open question, this work considered a class of nonsmooth, uncertain, and control-affine nonlinear dynamic systems with an uncertain control effectiveness matrix. Furthermore, a novel filtered error, adaptive update law, and chatter-mitigating control law are developed to compensate for the uncertain control effectiveness matrix and the terms in the closed-loop error system that are bounded by constants. A nonsmooth Lyapunov-like stability analysis is performed to ensure semi-global exponential trajectory tracking to an ultimate bound.
|
|
FrB13 Invited Session, Aqua Salon D |
Add to My Program |
Safe Spacecraft Control |
|
|
Chair: Phillips, Sean | Air Force Research Laboratory |
Co-Chair: Petersen, Chris | University of Florida |
Organizer: Petersen, Chris | University of Florida |
Organizer: Phillips, Sean | Air Force Research Laboratory |
Organizer: Soderlund, Alexander | The Ohio State University |
|
13:30-13:45, Paper FrB13.1 | Add to My Program |
Rendezvous and Proximity Operations Using Model Predictive Control Based on Set Membership Filter (I) |
|
Patel, Jinaykumar | The University of Texas at Arlington |
Subbarao, Kamesh | The University of Texas, Arlington |
Keywords: Spacecraft control, Predictive control for linear systems, Uncertain systems
Abstract: This paper proposes a model predictive control based on set-membership filtering for a time-varying discrete system with an unknown but bounded process and measurement noise. The estimated states are computed from set-membership filtering by solving a semi-definite program utilizing ellipsoidal bounds. The estimated sets are used for optimization in the model predictive control. Control input sequence is computed from model predictive control by minimizing the cost function. At each time step, a two-step prediction and measurement update process is used for ellipsoidal state estimation. Set-membership filtering guarantees that the true states lie within the ellipsoid. Finally, a rendezvous and proximity operation simulation is executed to guide the chaser to a target to illustrate the efficacy of the proposed approach.
|
|
13:45-14:00, Paper FrB13.2 | Add to My Program |
A Universal Framework for Generalized Run Time Assurance with JAX Automatic Differentiation (I) |
|
Ravaioli, Umberto | Toyon Research Corporation |
Dunlap, Kyle | Parallax Advanced Research |
Hobbs, Kerianne | Air Force Research Laboratory |
Keywords: Autonomous systems, Control applications, Aerospace
Abstract: With the rise of increasingly complex autonomous systems powered by black box AI models, there is a growing need for Run Time Assurance (RTA) systems that provide online safety filtering to untrusted primary controller output. Currently, research in RTA tends to be ad hoc and inflexible, diminishing collaboration and the pace of innovation. The Safe Autonomy Run Time Assurance Framework presented in this paper provides a standardized interface for modular RTA building blocks and a set of universal implementations of constraint-based RTA modules. By leveraging JAX Automatic Differentiation, a technique popularized by deep learning, this framework provides unmatched flexibility in the RTA space by automatically populating advanced optimization based RTA methods from user defined constraints and dynamics. This eliminates tedious manual differentiation and minimizes user effort and error. To validate the feasibility of this framework, a simulation of a multi-agent spacecraft inspection problem is shown with differentiable safety constraints on position and velocity.
|
|
14:00-14:15, Paper FrB13.3 | Add to My Program |
Rapid Construction of Safe Search-Trees for Spacecraft Attitude Planning (I) |
|
Danielson, Claus | University of New Mexico |
Kloeppel, Joseph | University of New Mexico |
Keywords: Aerospace, Constrained control, Predictive control for nonlinear systems
Abstract: This paper adapts the rapidly-exploring variant of invariant-set motion planner (ISMP) for spacecraft attitude motion planning and control. The ISMP is a motion-planning algorithm that uses positive-invariant sets of the closed-loop dynamics to find a constraint admissible path to a desired target through an obstacle filled environment. We present four mathematical results that enable the sub-routines used to rapidly construct a search-tree for the ISMP. These mathematical results describe how to uniformly sample safe quaternions, how to find the nearest orientation in the search-tree, how to move the sampled orientation to form an edge, and how to scale the invariant set to guarantee constraint admissibility. We present simulation results that demonstrate the ISMP for spacecraft attitude motion planning.
|
|
14:15-14:30, Paper FrB13.4 | Add to My Program |
Randomized Greedy Algorithms for Sensor Selection in Large-Scale Satellite Constellations (I) |
|
Hibbard, Michael | University of Texas, Austin |
Hashemi, Abolfazl | Purdue University |
Tanaka, Takashi | University of Texas at Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Optimization algorithms, Sensor networks, Spacecraft control
Abstract: As both the number and size of satellite constellations continue to increase, there likewise exists a growing need for incorporating methods for autonomous sensor selection into these networks. Particularly, constraints due to computation and communication can often prevent all available satellite sensors from actively making observations at a given time. We pose this constrained sensor selection problem in terms of a submodular optimization problem and explore the use of randomized greedy algorithms to obtain an approximately optimal sensor selection. To this end, we propose a novel pair of randomized greedy algorithms, namely, modified randomized greedy and dual randomized greedy to approximately solve budget and performance-constrained problems, respectively. For each of these algorithms, we derive theoretical high-probability guarantees bounding their suboptimality. We then demonstrate the efficacy of these algorithms in several pertinent applications for Earth-observing constellations, specifically, state estimation for atmospheric weather conditions and ground coverage.
|
|
14:30-14:45, Paper FrB13.5 | Add to My Program |
Sensor Safety and Multi-Objective Satellite Control under Nonlinear Dynamics (I) |
|
Miller, Kristina | University of Illinois Urbana-Champaign |
Brewer, John Matthew | Georgia Institute of Technology |
Soderlund, Alexander | The Ohio State University |
Phillips, Sean | Air Force Research Laboratory |
Keywords: Spacecraft control, Autonomous systems, Formal verification/synthesis
Abstract: The safe operation of satellites is critical as the space domain becomes more cluttered with resident objects. Controller synthesis is a technique used to automatically generate correct-by-construction controllers that guarantee a system will satisfy some requirements, such as safety. In this work, we cast the safe satellite operation problem as a controller synthesis problem, and propose an algorithm that synthesizes full-state control of a satellite. This is done by decoupling the translational control from the attitude control. We deploy this algorithm in a close-proximity scenario and show that the synthesized controller satisfies our requirements and guarantees the safety of a chaser satellite.
|
|
14:45-15:00, Paper FrB13.6 | Add to My Program |
Persistently Feasible Robust Safe Control by Safety Index Synthesis and Convex Semi-Infinite Programming |
|
Wei, Tianhao | Carnegie Mellon University |
Kang, Shucheng | Tsinghua University |
Zhao, Weiye | Carnegie Mellon University |
Liu, Changliu | Carnegie Mellon University |
Keywords: Robust control, Lyapunov methods, Uncertain systems
Abstract: Model mismatches prevail in real-world applications. Ensuring safety for systems with uncertain dynamic models is critical. However, existing robust safe controllers may not be realizable when control limits exist. And existing methods use loose over-approximation of uncertainties, leading to conservative safe controls. To address these challenges, we propose a control-limits aware robust safe control framework for bounded state-dependent uncertainties. We propose safety index synthesis to find a robust safe controller guaranteed to be realizable under control limits. And we solve for robust safe control via Convex Semi-Infinite Programming, which is the tightest formulation for convex bounded uncertainties and leads to the least conservative control. In addition, we analyze when and how safety can be preserved under unmodeled uncertainties. Experiment results show that our robust safe controller is always realizable under control limits and is much less conservative than strong baselines.
|
|
FrB14 Invited Session, Aqua 311A |
Add to My Program |
Spreading Processes in Complex Networks: Analysis, Control and
Observability |
|
|
Chair: Pare, Philip E. | Purdue University |
Co-Chair: Gracy, Sebin | Rice University |
Organizer: Gracy, Sebin | Rice University |
Organizer: Ye, Mengbin | Curtin University |
Organizer: Uribe, Cesar A. | Rice University |
Organizer: Pare, Philip E. | Purdue University |
|
13:30-13:45, Paper FrB14.1 | Add to My Program |
Sustained Oscillations in Multi-Topic Belief Dynamics Over Signed Networks (I) |
|
Bizyaeva, Anastasia | University of Washington Seattle |
Franci, Alessio | Universidad Nacional Autónoma De Mexico (UNAM) |
Leonard, Naomi Ehrich | Princeton University |
Keywords: Network analysis and control, Agents-based systems
Abstract: We study the dynamics of belief formation on multiple interconnected topics in networks of agents with a shared belief system. We establish sufficient conditions and necessary conditions under which sustained oscillations of beliefs arise on the network in a Hopf bifurcation and characterize the role of the communication graph and the belief system graph in shaping the relative phase and amplitude patterns of the oscillations. Additionally, we distinguish broad classes of graphs that exhibit such oscillations from those that do not.
|
|
13:45-14:00, Paper FrB14.2 | Add to My Program |
Distributed Reproduction Numbers of Networked Epidemics (I) |
|
She, Baike | University of Florida |
Pare, Philip E. | Purdue University |
Hale, Matthew | University of Florida |
Keywords: Network analysis and control, Emerging control applications, Control applications
Abstract: Reproduction numbers are widely used for the estimation and prediction of epidemic spreading processes over networks. However, reproduction numbers do not enable estimation and prediction in individual communities within networks, and they can be difficult to compute due to the aggregation of infection data that is required to do so. Therefore, in this work we propose a novel concept of distributed reproduction numbers to capture the spreading behaviors of each entity in the network, and we show how to compute them using certain parameters in networked SIS and SIR epidemic models. We use distributed reproduction numbers to derive new conditions under which an outbreak can occur. These conditions are then used to derive new conditions for the existence, uniqueness, and stability of equilibrium states. Finally, in simulation we use synthetic infection data to illustrate how distributed reproduction numbers provide more fine-grained analyses of networked spreading processes than ordinary reproduction numbers.
|
|
14:00-14:15, Paper FrB14.3 | Add to My Program |
SIS Epidemics Coupled with Evolutionary Social Distancing Dynamics (I) |
|
Paarporn, Keith | University of Colorado, Colorado Springs |
Eksin, Ceyhun | Texas A&M University |
Keywords: Game theory, Systems biology, Stability of nonlinear systems
Abstract: A major factor contributing to the difficulties in epidemic forecasting is the unpredictable nature of the population behavior that can either mitigate or exacerbate the spread of a disease. In this paper, we consider a game-theoretic framework for modeling the disease prevalence dependent response of the population behavior in a susceptible-infected-susceptible (SIS) epidemiological model. Our behavioral response model is based on replicator dynamics, where the individuals’ underlying payoffs dynamically change in response to the prevalence of the disease. The coupled dynamics highlight the interplay between the epidemic state and distancing behaviors. We establish a critical threshold on the incentive parameters for which below the threshold, the state in which the disease is endemic and the population does not cooperate with the recommended public health measures is globally asymptotically stable (GAS). Above the threshold, we find through extensive numerical simulations that a variety of dynamical outcomes emerge. For some parameters, an interior equilibrium in which the endemic state is mitigated and a fraction of the population socially distancing is stable. For other parameters, a stable limit cycle about this interior state emerges. The arising rich set of dynamics demonstrate the potential of the modeling framework for epidemic forecasting.
|
|
14:15-14:30, Paper FrB14.4 | Add to My Program |
The Impact of Deniers on Epidemics: A Temporal Network Model (I) |
|
Zino, Lorenzo | Politecnico Di Torino |
Rizzo, Alessandro | Politecnico Di Torino |
Porfiri, Maurizio | Polytechnic Institute of New York University |
Keywords: Network analysis and control, Control of networks
Abstract: We propose a novel network epidemic model to elucidate the impact of deniers on the spread of epidemic diseases. Specifically, we study the spread of a recurrent epidemic disease, whose progression is captured by a susceptible-infected-susceptible model, in a population partitioned into two groups: cautious and deniers. Cautious individuals may adopt self-protective behaviors, possibly incentivized by information campaigns implemented by public authorities; on the contrary, deniers reject their adoption. Through a mean-field approach, we analytically derive the epidemic threshold for large-scale homogeneous networks, shedding light onto the role of deniers in shaping the course of an epidemic outbreak. Specifically, our analytical insight suggests that even a small minority of deniers may jeopardize the effort of public health authorities when the population is highly polarized. Numerical results extend our analytical findings to heterogeneous networks.
|
|
14:30-14:45, Paper FrB14.5 | Add to My Program |
Model Predictive Control of Spreading Processes Via Sparse Resource Allocation (I) |
|
Wang, Ruigang | The University of Sydney |
Zafar, Armaghan | The University of Sydney |
Manchester, Ian R. | University of Sydney |
Keywords: Control of networks, Predictive control for nonlinear systems, Network analysis and control
Abstract: In this paper, we propose a model predictive control (MPC) method for real-time intervention of spreading processes, such as epidemics and wildfire, over large-scale networks. The goal is to allocate budgeted resources each time step to minimize the risk of an undetected outbreak, i.e. the product of the probability of an outbreak and the impact of that outbreak. By using dynamic programming relaxation, the MPC controller is reformulated as a convex optimization problem, in particular an exponential cone programming. We also provide sufficient conditions for the closed-loop risks to asymptotically decrease and a method to estimate the upper bound of when the risk will monotonically decrease. Numerical results are provided for a wildfire example.
|
|
14:45-15:00, Paper FrB14.6 | Add to My Program |
Continuification Control of Large-Scale Multiagent Systems in a Ring (I) |
|
Maffettone, Gian Carlo | Scuola Superiore Meridionale |
Boldini, Alain | New York University |
di Bernardo, Mario | University of Naples Federico II |
Porfiri, Maurizio | New York University Tandon School of Engineering |
Keywords: Large-scale systems, Distributed parameter systems, Agents-based systems
Abstract: In this paper, we propose a method to control large-scale multiagent systems swarming in a ring. Specifically, we use a continuification-based approach that transforms the microscopic, agent-level description of the system dynamics into a macroscopic, continuum-level representation, which we employ to synthesize a control action towards a desired distribution of the agents. The continuum-level control action is then discretized at the agent-level in order to practically implement it. To confirm the effectiveness and the robustness of the proposed approach, we complement theoretical derivations with numerical simulations.
|
|
FrB15 Regular Session, Aqua 311B |
Add to My Program |
Discrete Event Systems |
|
|
Chair: Kovalenko, Ilya | Pennsylvania State University |
Co-Chair: Zamani, Majid | University of Colorado Boulder |
|
13:30-13:45, Paper FrB15.1 | Add to My Program |
Risk-Averse Model Predictive Control for Priced Timed Automata |
|
Tavakkoli Anbarani, Mostafa | Pennsylvania State University |
Balta, Efe C. | ETH Zurich |
Meira-Goes, Romulo | Pennsylvania State University |
Kovalenko, Ilya | Pennsylvania State University |
Keywords: Discrete event systems, Automata, Supervisory control
Abstract: In this paper, we propose a Risk-Averse Priced Timed Automata (PTA) Model Predictive Control (MPC) framework to increase flexibility of cyber-physical systems. To improve flexibility in these systems, our risk-averse framework solves a multi-objective optimization problem to minimize the cost and risk, simultaneously. While minimizing cost ensures the least effort to achieve a task, minimizing risk provides guarantees on the feasibility of the task even during uncertainty. Our framework explores the trade-off between these two qualities to obtain risk-averse control actions. The solution of risk-averse PTA MPC dynamic decision-making algorithm reacts relatively better to PTA changes compared to PTA MPC without risk-averse feature. An example from manufacturing systems is presented to show the application of the proposed control strategy.
|
|
13:45-14:00, Paper FrB15.2 | Add to My Program |
Pareto Modeling of Discrete Manufacturing Systems by Signal Interpreted Petri Nets |
|
Köhler, Andreas | University of Kaiserslautern |
Zhang, Ping | Technische Universitaet Kaiserslautern |
Keywords: Discrete event systems, Petri nets, Modeling
Abstract: This paper proposes a new approach for obtaining a model of discrete manufacturing systems according to the Pareto principle (i.e., the 80/20 principle). The basic idea is to get the plant model by transforming an already existing controller model. The controller is described by a signal interpreted Petri net (SIPN) that represents the logic control algorithm by which the plant operates. By converting the incidence matrix, firing conditions, and output vectors of the controller SIPN, a plant model can be obtained that represents the fault-free plant behavior under different actuator inputs. The proposed approach reduces significantly the engineering efforts and can be applied to manufacturing systems controlled by a programmable logic controller. An example is given to illustrate the proposed approach.
|
|
14:00-14:15, Paper FrB15.3 | Add to My Program |
Fault-Tolerant Synthesis for Multi-Process Systems Via Resource Sharing: A Discrete-Event Approach |
|
Chen, Gang | South China University of Technology |
Lu, Yu | Nanjing University of Science and Technolog |
Su, Rong | Nanyang Technological University |
Xie, Longhan | South China University of Technology |
|
14:15-14:30, Paper FrB15.4 | Add to My Program |
Abstraction-Based Verification of Approximate Pre-Opacity for Control Systems |
|
Hou, Junyao | ShanghaiJiaoTong University |
Liu, Siyuan | Technical University of Munich |
Yin, Xiang | Shanghai Jiao Tong University |
Zamani, Majid | University of Colorado Boulder |
Keywords: Discrete event systems
Abstract: In this paper, we consider the problem of verifying pre-opacity for discrete-time control systems. Pre-opacity is an important information-flow security property that secures the intention of a system to execute some secret behaviors in the future. Existing works on pre-opacity only consider non-metric discrete systems, where it is assumed that intruders can distinguish different output behaviors precisely. However, for continuous-space control systems whose output sets are equipped with metrics (which is the case for most real-world applications), it is too restrictive to assume precise measurements from outside observers. In this paper, we first introduce a concept of approximate pre-opacity by capturing the security level of control systems with respect to the measurement precision of the intruder. Based on this new notion of pre-opacity, we propose a verification approach for continuous-space control systems by leveraging abstraction-based techniques. In particular, a new concept of approximate pre-opacity preserving simulation relation is introduced to characterize the distance between two systems in terms of preserving pre-opacity. This new system relation allows us to verify pre-opacity of complex continuous-space control systems using their finite abstractions. We also present a method to construct pre-opacity preserving finite abstractions for a class of discrete-time control systems under certain stability assumptions.
|
|
14:30-14:45, Paper FrB15.5 | Add to My Program |
Data-Driven Heuristic Symbolic Models and Application to Limit-Cycle Detection |
|
Calbert, Julien | UCLouvain |
Jungers, Raphaël M. | University of Louvain |
Keywords: Automata, Discrete event systems, Information theory and control
Abstract: Symbolic control allows to provide formal guarantees for generic optimal control problems on nonlinear systems. It relies on the construction of a finite abstraction of the system which requires the discretization of the state space. Therefore, these methods suffer from the curse of dimensionality and a critical step is the choice of the state space partition. In this paper, we propose a data-driven heuristic abstraction approach relying on a probabilistic interpretation of the discretization error. Our approach can be used to automatically compare different partitions of the state space and to infer complex properties about the original system. As a proof of concept, we use our approach for the detection of limit cycles.
|
|
14:45-15:00, Paper FrB15.6 | Add to My Program |
Interpretability of Path-Complete Techniques and Memory-Based Lyapunov Functions |
|
Della Rossa, Matteo | UCLouvain |
Jungers, Raphaël M. | University of Louvain |
Keywords: Switched systems, Lyapunov methods, Automata
Abstract: We study path-complete Lyapunov functions, which are stability criteria for switched systems, described by a combinatorial component (namely, an automaton), and a functional component (a set of candidate Lyapunov functions, called the template). We introduce a class of criteria based on what we call memory-based Lyapunov functions, which generalize several techniques in the literature. Our main result is an equivalence result: any path-complete Lyapunov function is equivalent to a memory-based Lyapunov function, however defined on another template. We show the usefulness of our result in terms of numerical efficiency via an academic example.
|
|
FrB17 Tutorial Session, Aqua 314 |
Add to My Program |
Tutorial On: Game Theory for Autonomy: From Min-Max Optimization to
Equilibrium and Bounded Rationality Learning |
|
|
Chair: Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Co-Chair: Liu, Mushuang | University of Missouri |
Organizer: Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Organizer: Liu, Mushuang | University of Missouri |
|
13:30-13:35, Paper FrB17.1 | Add to My Program |
Game Theory for Autonomy: From Min-Max Optimization to Equilibrium and Bounded Rationality Learning (I) |
|
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Fotiadis, Filippos | Georgia Institute of Technology |
Hespanha, Joao P. | Univ. of California, Santa Barbara |
Chinchilla, Raphael | University of California, Santa Barbara |
Yang, Guosong | Rutgers University–New Brunswick |
Liu, Mushuang | University of Missouri |
Shamma, Jeff S. | University of Illinois at Urbana-Champaign |
Pavel, Lacra | University of Toronto |
Keywords: Game theory, Optimization algorithms, Learning
Abstract: Finding Nash equilibria in non-cooperative games can be, in general, an exceptionally challenging task. This is owed to various factors, including but not limited to the cost functions of the game being nonconvex/nonconcave, the players of the game having limited information about one another, or even due to issues of computational complexity. The present tutorial draws motivation from this harsh reality and provides methods to approximate Nash or min-max equilibria in unideal settings using both optimization- and learning-based techniques. The tutorial acknowledges, however, that such techniques may not always converge, but instead lead to oscillations or even chaos. In that respect, tools from passivity and dissipativity theory are provided, which can offer explanations about these divergent behaviors. Finally, the tutorial highlights that, more frequently than often thought, the search for equilibrium policies is simply vain; instead, bounded rationality and non-equilibrium policies can be more realistic to employ owing to some players' learning imperfectly or being relatively naive -- ``bounded rational.'' The efficacy of such plays is demonstrated in the context of autonomous driving systems, where it is explicitly shown that they can guarantee vehicle safety.
|
|
13:35-13:50, Paper FrB17.2 | Add to My Program |
Convergent Second-Order Methods for Min-Max Optimizations (I) |
|
Hespanha, Joao P. | Univ. of California, Santa Barbara |
Keywords: Game theory
Abstract: Min-max optimization is widely used in robust model predictive control, computer security problems, robust training of neural networks, generative adversarial networks, reformulating stochastic programming as min-max optimization, and robust stochastic programs. In this talk, we address the design of algorithms to solve nonconvex-nonconcave min-max optimizations using second order methods. These algorithms modify the Hessian matrix to obtain a search direction that can be seen as the solution to a quadratic program that locally approximates the min-max problem. We show that by selecting this type of modification appropriately, the only stable points of the resulting iterations are local min-max points. For min-max model predictive control problems, these algorithms leads to computation times that scale linearly with the horizon length.
|
|
13:50-14:10, Paper FrB17.3 | Add to My Program |
An Introduction to Learning in Finite Games (I) |
|
Shamma, Jeff S. | University of Illinois at Urbana-Champaign |
Keywords: Game theory
Abstract: In the setting of learning in games, player strategies evolve in an effort to maximize utility in response to the evolving strategies of other players. In contrast to the single agent case, learning in the presence of other learners induces a non-stationary environment from the perspective of any individual player. Depending on the specifics of the game and the learning dynamics, the evolving strategies may exhibit a variety of behaviors ranging from convergence to Nash equilibrium to oscillations to even chaos. This talk presents a basic introduction to learning in games through the presentation of selected results for finite normal form games, i.e., games with a finite number of players having a finite number of actions. The talk starts with a representative sample of learning dynamics that converge to Nash equilibrium for special classes of games. Specific learning dynamics include better reply dynamics, joint strategy fictitious play, and log-linear learning, with results for potential games and weakly acyclic games. These results apply to specifically pure Nash equilibrium. The talk also presents dynamics that address mixed/randomized strategy Nash equilibria, specifically smooth fictitious play and gradient play. The talk concludes with limitations in learning that stem from the notion of uncoupled dynamics, where a player's learning dynamics cannot depend explicitly on the utility functions of other players.
|
|
14:10-14:30, Paper FrB17.4 | Add to My Program |
Passivity, Reinforcement Learning and Learning in Multi-Agent Games (I) |
|
Pavel, Lacra | University of Toronto |
Keywords: Game theory
Abstract: Learning algorithm behavior highly depends on the game setting. In this tutorial talk, we discuss how these dependencies can be explained, if one regards them through a passivity lens. We focus on two representative instances in reinforcement learning: payoff-based play, and Q-learning. We show how one can exploit geometric features of different classes of games, together with dissipativity/passivity properties of interconnected systems to guarantee global convergence to a Nash equilibrium. Besides simplifying the proof of convergence, one can generate algorithms that work for classes of games with less stringent assumptions, by using passivity and basic properties of interconnected systems.
|
|
14:30-14:45, Paper FrB17.5 | Add to My Program |
Non-Equilibrium Learning in Stochastic Games (I) |
|
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Keywords: Game theory
Abstract: Reinforcement learning (RL) is effective in optimizing cumulative rewards, and it provides policies that account for how the system will interact over the future with the agent. However, when more than one learning agents are present, developing efficient collaborations/interactions is a challenging issue; not every agent may have access to the same amount of information and computational resources; not every agent may make the same assumptions about the decision-making mechanisms of one another; and many agents may not even be aware of the existence of other agents. These cognitive and physical limitations can be seen as a form of bounded rationality. Several recent experimental and empirical studies have found that the initial responses of decision-makers in multi-player games are often far from the equilibrium, which is very often out-predicted by structural non-equilibrium (e.g., cognitive hierarchy) models. This is because non-equilibrium play models allow for players who are boundedly rational and have limited information, so that their policy is not necessarily a best response to the actual adjustment laws of other agents. This tutorial talk will present computationally and communicationally efficient approaches for decision-making in boundedly rational stochastic games. Motivated by the inherent complexity of computing Nash equilibria, as well as the innate tendency of agents to choose non-equilibrium strategies, two models of bounded rationality based on recursive reasoning will be described. In the first model, named level-k thinking, each agent assumes that everyone else has a cognitive level immediately lower than theirs, and—given such an assumption—chooses their policy to be a best response to them. In the second model, named cognitive hierarchy, each agent conjectures that the rest of the agents have a cognitive level that is lower than theirs, but follows a distribution instead of being deterministic. To explicitly compute the boundedly rational policies, this tutorial talk will present both a level-recursive as well as a level-paralleled algorithm, where the latter can have an overall reduced computational complexity. For more information please see the main tutorial paper
|
|
14:45-15:00, Paper FrB17.6 | Add to My Program |
Potential Game-Based Decision Making in Autonomous Driving (I) |
|
Liu, Mushuang | University of Missouri |
Keywords: Game theory
Abstract: Game-theoretic approaches characterize agents’ interactions from a self-interest optimization perspective, consistent with humans’ reasoning, and therefore, are believed to have the potential to solve the decision making for autonomous vehicles (AVs) when they interact with human-driven vehicles and/or pedestrians. However, despite high hopes, conventional game-theoretic approaches often suffer from scalability issues due to the complexity of multi-player games and from incomplete information challenges such as the lack of knowledge of other traffic agents’ cost functions that reflect the variability in human driving behaviors. In this talk, we will show how to address these challenges by developing a novel potential game (PG) based framework. Specifically, we will propose a new PG framework that not only solves the multi-player game in real time but also guarantees the ego vehicle safety under appropriate conditions despite unexpected behaviors from the surrounding agents.
|
|
FrC01 RI Session, Sapphire MN |
Add to My Program |
Traffic Control (RI) |
|
|
Chair: Safadi, Yazan | Technion - Israel Institute of Technology |
Co-Chair: Savla, Ketan | University of Southern California |
|
15:30-15:34, Paper FrC01.1 | Add to My Program |
Safe Merging Control in Mixed Vehicular Traffic |
|
Hamdipoor, Vahid | Qatar University |
Meskin, Nader | Qatar University |
Cassandras, Christos G. | Boston University |
Keywords: Traffic control, Autonomous systems
Abstract: Despite the potential benefits of a traffic system with only Coordinated and Automated Vehicles (CAVs), it is expected that Human Driven Vehicles (HDVs) and CAVs co-exist for the foreseeable future. Due to uncertainty and the unpredictability of human drivers, developing a control framework with safety guarantees, especially in the traffic bottlenecks such as merging points is a challenging problem. Motivated by this fact, in this paper we study a merging problem in mixed vehicular traffic and we develop a safety-critical real-time decentralized control of CAVs in the presence of HDVs. We use Control Lyapunov Functions (CLFs) to attain the desired control objectives, and Control Barrier Functions (CBFs) to guarantee the safety of the merging operation. It is assumed that a high level coordinator determines the sequence of vehicles pass the merging area and forms a triplet of vehicles in the main lane and the merging lane. Then, three different combinations of CAVs and HDVs are considered and for each one, required CLFs and CBFs to safely accomplish the merging operation are developed. Simulation results are provided to demonstrate the efficacy of the proposed schemes.
|
|
15:34-15:38, Paper FrC01.2 | Add to My Program |
Aircraft Departures Management for Low Altitude Air City Transport Based on Macroscopic Fundamental Diagram |
|
Safadi, Yazan | Technion - Israel Institute of Technology |
Geroliminis, Nikolas | Urban Transport Systems Laboratory, EPFL |
Haddad, Jack | Technion-Israel Institute of Technology |
Keywords: Traffic control, Control applications, Air traffic management
Abstract: Low-altitude aircraft is being developed as a new mode of urban transport. This will give rise to new urban air transport systems, called low-altitude air city transport (LAAT) systems. Recent works show that the Macroscopic Fundamental Diagram (MFD) is a powerful tool for understanding LAAT systems from a theoretical perspective, and allows to detect congestion conditions in the airspace. In this paper, aircraft departures management for LAAT systems with the help of MFD modeling is developed and evaluated. A unique framework, which couples both microscopic and macroscopic levels of LAAT operation, is established. The plant model considers the microscopic level, where an aircraft collision-avoidance model with a cooperative control algorithm from the literature is implemented to describe the low-altitude aircraft interactions, implying the microscopic traffic behavior. At the macroscopic level, an accumulation-based model for distributed regions is introduced, which is used as the control model. Then, based on the developed framework, an optimal control strategy is formulated to optimize the aircraft inflow rate by manipulating their departure times to mitigate congestion. Different control strategies are tested: Greedy Controller and Model Predictive Controller. The strategies are deployed for the whole network or for each region at the macroscopic level and then transformed to the microscopic level. This study demonstrates that the MFD-based traffic control strategies can reduce congestion in LAAT systems.
|
|
15:38-15:42, Paper FrC01.3 | Add to My Program |
Infrastructure-Based Hierarchical Control Design for Congestion Management in Heterogeneous Traffic Networks |
|
Karimi Shahri, Pouria | UNC Charlotte |
HomChaudhuri, Baisravan | Illinois Institute of Technology |
Ghaffari, Azad | Wayne State University |
Ghasemi, Amirhossein | University of North Carolina Charlotte |
Keywords: Traffic control, Feedback linearization, Hierarchical control
Abstract: This paper develops a hierarchical mainstream traffic flow control for a heterogeneous traffic network with an unknown downstream bottleneck. A distributed extremum-seeking control approach is employed at the higher level to determine the optimal density of Autonomous Vehicles (AVs) and Human-Driven Vehicles (HDVs) in the controlled cells, considering unknown disturbances in the heterogeneous traffic network. At the lower level, a distributed filtered feedback linearization controller is designed to update the suggested velocity communicated to the AVs and HDVs so that the desired density determined at the higher level can be achieved in each cell. Furthermore, to model the heterogeneous traffic network, a multi-class METANET model is adopted to represent the aggregated behavior of the network. It is shown that the designed distributed extremum-seeking filtered feedback linearization controller can achieve the desired closed-loop performance despite the presence of unknown disturbances in the system.
|
|
15:42-15:46, Paper FrC01.4 | Add to My Program |
Bottleneck Management Using Pricing under Constraints |
|
Rostomyan, Gary | University of Southern California |
Savla, Ketan | University of Southern California |
Ioannou, Petros A. | Univ. of Southern California |
Keywords: Traffic control, Optimization, Optimization algorithms
Abstract: Studies of the traffic congestion have been limited to designing optimal time-varying tolls to eliminate queuing. Moreover, limited studies have considered time-varying rewards that eliminate queuing. This paper is the first to systematically analyze the social optimum under a user equilibrium as well as budget and maximum toll constraints for a single bottleneck. We cast the congestion pricing problem as a bilevel optimization problem and provide several analytical and numerical results. Specifically, we show that the bilevel optimization problem can be converted into a convex optimization problem under some weak assumptions of the schedule delay cost under an inelastic demand setting. The methodological contributions are supplemented with illustrative simulation results.
|
|
15:46-15:50, Paper FrC01.5 | Add to My Program |
Simulation Based Methodology for Assessing Forced Merging Strategies for Autonomous Vehicles |
|
Kong, Chun-Wei | University of Michigan |
Liu, Kaiwen | University of Michigan |
Tseng, H. Eric | Ford Motor Company |
Kolmanovsky, Ilya V. | The University of Michigan |
Girard, Anouck | University of Michigan, Ann Arbor |
Keywords: Traffic control, Simulation, Intelligent systems
Abstract: A simulation environment for assessing the forced merging strategies for autonomous vehicles (AV) is proposed. Such forced merging strategies need to explicitly account for vehicle interactions and require extensive simulation tests before actual deployment. The proposed environment aims to facilitate such simulation tests to better assess, validate, and improve the forced merging strategies. The simulation environment consists of several control strategies for the merging vehicle, different highway vehicle models that can represent interactions with the merging vehicle, and a set of metrics to evaluate the performance of the merging strategies. As an example of the evaluation, a Leader Follower Game Controller (LFGC) [1] is implemented and tested in this environment. Based on the analysis of the simulation tests, we propose an Enhanced LFGC (e-LFGC). It is shown that our methodology facilitates the development of merging controllers so that corner cases are revealed and control requirements can be improved.
|
|
15:50-15:54, Paper FrC01.6 | Add to My Program |
Re-Routing Strategy of Connected and Automated Vehicles Considering Coordination at Intersections |
|
Bang, Heeseung | University of Delaware |
Malikopoulos, Andreas A. | University of Delaware |
Keywords: Traffic control, Transportation networks, Automotive control
Abstract: In this paper, we propose a re-routing strategy for connected and automated vehicles (CAVs), considering coordination and control of all the CAVs in the network. The objective for each CAV is to find the route that minimizes the total travel time of all CAVs. We coordinate CAVs at signal-free intersections to accurately predict the travel time for the routing problem. While it is possible to find a system-optimal solution by comparing all the possible combinations of the routes, this may impose a computational burden. Thus, we instead find a person-by-person optimal solution to reduce computational time while still deriving a better solution than selfish routing. We validate our framework through simulations in a grid network.
|
|
15:54-15:58, Paper FrC01.7 | Add to My Program |
Throughput of Freeway Networks under Ramp Metering Subject to Vehicle Safety Constraints |
|
Pooladsanj, Milad | Univ. of Southern California |
Savla, Ketan | University of Southern California |
Ioannou, Petros A. | Univ. of Southern California |
Keywords: Transportation networks, Traffic control, Markov processes
Abstract: Ramp metering is one of the most effective tools to combat traffic congestion. In this paper, we present a ramp metering policy for a network of freeways with arbitrary number of on- and off-ramps, merge, and diverge junctions. The proposed policy is designed at the microscopic level and takes into account vehicle following safety constraints. In addition, each on-ramp operates in cycles during which it releases vehicles as long as the number of releases does not exceed its queue size at the start of the cycle. Moreover, each on-ramp dynamically adjusts its release rate based on the traffic condition. To evaluate the performance of the policy, we analyze its throughput, which is characterized by the set of arrival rates for which the queue sizes at all on-ramps remain bounded in expectation. We show that the proposed policy is able to maximize the throughput if the merging speed at all the on-ramps is equal to the free flow speed and the network has no merge junction. We provide simulations to illustrate the performance of our policy and compare it with a well-known policy from the literature.
|
|
15:58-16:02, Paper FrC01.8 | Add to My Program |
Monte Carlo Tree Search Based Trajectory Generation for Automated Vehicles in Interactive Traffic Environments |
|
Vellamattathil Baby, Tinu | Illinois Institute of Technology |
HomChaudhuri, Baisravan | Illinois Institute of Technology |
Keywords: Automotive control, Automotive systems, Control applications
Abstract: This paper focuses on the development of a trajectory planning method for connected and automated vehicles (CAVs) that takes into account the interactive nature of the vehicles. The proposed approach is based on Monte Carlo Tree Search (MCTS) that traverse through possible actions from each state of the system to identify the trajectory with highest reward. Here, the trajectory is planned and the actions of surrounding vehicles are predicted jointly. Planning the trajectory and predicting the surrounding vehicles jointly in an interactive environment can result in a large action-space, which is not computationally tractable. Hence, we propose an adaptive action-space, which includes pruning the action-space so that the actions resulting in unsafe trajectories are eliminated. The simulation studies show that the proposed approach is capable of identifying less conservative yet safe trajectories for CAVs in a multi-vehicle environment.
|
|
16:02-16:06, Paper FrC01.9 | Add to My Program |
Lyapunov Stability Regulation of Deep Reinforcement Learning Control with Application to Automated Driving |
|
Hejase, Bilal | The Ohio State University |
Ozguner, Umit | The Ohio State University |
Keywords: Automotive control, Control applications, Lyapunov methods
Abstract: Reinforcement learning (RL) control for nonlinear dynamical systems has seen increasing interests in recent years. However, these methods have limited practical use due to the lack of safety and stability guarantees of the control policy. In this paper, we employ a control-theoretic approach to the stability of RL-based control. We propose a two-step framework to train a Deep Deterministic Policy Gradient (DDPG) agent regulated on the violations of the Lyapunov conditions. In the first step, our framework leverages neural networks to jointly learn stable system dynamics and an associated control-Lyapunov function (cLf) based on the current control policy. In the second step, a DDPG controller is trained to learn an appropriate control policy that maximizes the reward function and minimizes the violation of the Lyapunov condition based on the current iteration of the cLf. We employ a model of dynamics noise when learning the cLf to improve the exploration of alternative state trajectories. The proposed framework is tested on nonlinear vehicle dynamics in a lane-following highway environment. The experimental results demonstrate the ability of the proposed framework to regulate the control policy on learning stable system trajectories with desired driving characteristics.
|
|
16:06-16:10, Paper FrC01.10 | Add to My Program |
Stabilization of a POD/Galerkin Reduced Order Payne-Whitham Traffic Model |
|
Block, Brian | The Ohio State University |
Chen, Xiaoling | The Ohio State University |
Stockar, Stephanie | The Ohio State University |
Keywords: Model/Controller reduction, Stability of linear systems, Traffic control
Abstract: This paper presents a method for generating stable reduced order macroscopic traffic models. Starting from the Payne-Whitham traffic model, a set of hyperbolic PDEs, Galerkin projection in conjunction with proper orthogonal decomposition is used. To enforce stability of the reduced order scheme, an extension of two methods developed for parabolic PDEs is presented in this paper. The performances of the a-posteriori stabilization schemes are compared showing that, with an appropriate calibration process, the stabilized models have comparable prediction errors to the full order models.
|
|
FrC02 RI Session, Sapphire IJ |
Add to My Program |
Power Systems (RI) |
|
|
Chair: Molzahn, Daniel | Georgia Institute of Technology |
Co-Chair: Taha, Ahmad | Vanderbilt University |
|
15:30-15:34, Paper FrC02.1 | Add to My Program |
A Fixed-Point Algorithm for the AC Power Flow Problem |
|
Chen, Liangjie (Jeffrey) | University of Toronto |
Simpson-Porco, John W. | University of Toronto |
Keywords: Power systems, Computational methods, Control of networks
Abstract: This paper presents an algorithm that solves the AC power flow problem for balanced, three-phase transmission systems at steady state. The algorithm extends the ``fixed-point power flow'' algorithm in the literature to include transmission losses, phase-shifting transformers, and a distributed slack bus model. The algorithm is derived by vectorizing the component-wise AC power flow equations and manipulating them into a novel equivalent fixed-point form. Preliminary theoretical results guaranteeing convergence are reported for the case of a two-bus power system. We validate the algorithm through extensive simulations on test systems of various sizes under different loading levels, and compare its convergence behavior against those of classic power flow algorithms.
|
|
15:34-15:38, Paper FrC02.2 | Add to My Program |
Energy Management Control of Hydrogen Fuel Cell Powered Ships |
|
Cavanini, Luca | Università Politecnica Delle Marche |
Majecki, Pawel | University of Strathclyde |
Grimble, Michael John | University of Strathclyde |
van der Molen, Gerrit | Industrial Systems and Control Ltd |
Keywords: Power systems, Maritime control, Optimization algorithms
Abstract: An Energy Management System for electric vessels is described, based on a Model Predictive Control (MPC) with Anticipative Action. The electric ship has a power system composed of a hydrogen fuel cell generator, a battery storage system, a propulsion system, an auxiliary load module, and a command system. The controller defines the power allocated among the vessel’s power system components. The MPC design uses a Linear Parameter-Varying (LPV) model to approximate the nonlinear dynamics of the vessel’s power system and components. To improve the performance of the LPV-MPC, an additional predictor is included, based on data-driven Machine Learning. This is included in the LPV-MPC so the future predicted trajectory of the reference signals can be estimated to improve the allocation of power. The reference trajectory is generated using a Neural Network trained to estimate the future power demand determined by representative ship manoeuvres. A simple baseline Rule-based (RB) strategy was compared with the basic LPV-MPC and with the data-driven LPV-MPC that includes the prediction generated by the Neural Network.
|
|
15:38-15:42, Paper FrC02.3 | Add to My Program |
Restoring AC Power Flow Feasibility from Relaxed and Approximated Optimal Power Flow Models |
|
Taheri, Babak | Georgia Institute of Technology |
Molzahn, Daniel | Georgia Institute of Technology |
Keywords: Power systems, Optimization, Machine learning
Abstract: To address computational challenges associated with power flow nonconvexities, significant research efforts over the last decade have developed convex relaxations and approximations of optimal power flow (OPF) problems. However, benefits associated with the convexity of these relaxations and approximations can have tradeoffs in terms of solution accuracy since they may yield voltage phasors that are inconsistent with the power injections and line flows, limiting their usefulness for some applications. Inspired by state estimation (SE) techniques, this paper proposes a new method for obtaining an AC power flow feasible point from the solution to a relaxed or approximated optimal power flow (OPF) problem. By treating the inconsistent voltage phasors, power injections, and line flows analogously to noisy measurements in a state estimation algorithm, the proposed method yields power injections and voltage phasors that are feasible with respect to the AC power flow equations while incorporating information from many quantities in the solution to a relaxed or approximated OPF problem. We improve this method by adjusting weighting terms with an approach inspired by algorithms used to train machine learning models. We demonstrate the proposed method using several relaxations and approximations. The results show up to several orders of magnitude improvement in accuracy over traditional methods.
|
|
15:42-15:46, Paper FrC02.4 | Add to My Program |
Frequency Shaping Control for Weakly-Coupled Grid-Forming IBRs |
|
Poolla, Bala | National Renewable Energy Laboratory |
Lin, Yashen | National Renewable Energy Laboratory |
Bernstein, Andrey | National Renewable Energy Lab (NREL) |
Mallada, Enrique | Johns Hopkins University |
Gross, Dominic | University of Wisconsin-Madison |
Keywords: Power systems, Optimization, Power electronics
Abstract: We consider the problem of controlling the frequency of low-inertia power systems via inverter-based resources (IBRs) that are weakly connected to the grid. We propose a novel grid-forming control strategy, the so-called frequency shaping control, that aims to shape the frequency response of synchronous generators (SGs) to load perturbations so as to efficiently arrest sudden frequency drops. Our solution relaxes several existing assumptions in the literature and is able to navigate tradeoffs between peak power requirements and maximum frequency deviations. Finally, we analyze the robustness to imperfect knowledge of network parameters, while particularly highlighting the importance of accurate estimation of these parameters.
|
|
15:46-15:50, Paper FrC02.5 | Add to My Program |
Robust Defense against Load Redistribution Attacks in Power Grids Based on Reactance Control |
|
Zhou, Min | Shanghai Jiao Tong University |
Wu, Jing | Shanghai Jiao Tong University |
Long, Chengnian | Shanghai Jiao Tong University |
Keywords: Power systems, Optimization
Abstract: Load redistribution (LR) attacks are covert, damaging, and able to achieve various attack objectives. Effective defensive measures are required to reduce the impact of LR attacks on power grids. Existing moving target defense (MTD) methods have been studied for attack detection based on transmission line reactance perturbation, but require sufficient deployment of distributed flexible AC transmission system (D-FACTS) devices to ensure the detection performance. However, large-scale D-FACTS device deployments are costly, which limit the efficiency of MTD methods in practical operations. As such, this paper coordinates the reactance control of a single transmission line with the generation dispatch to defend the power grid against LR attacks. Specifically, a reactance-control-based robust dispatch model is presented, which guarantees the system security as well as the economic performance without changing the reactance of a large number of transmission lines. A two-stage methodology utilizing the pattern search algorithm and column constraint generation (C&CG) algorithm is proposed to solve the dispatch model in an iterative process. Case studies based on the IEEE 14- and 118-bus systems verify the effectiveness of the proposed method in breaking through the security limits of the existing power grid and improving the economics of the robust defense.
|
|
15:50-15:54, Paper FrC02.6 | Add to My Program |
Reinforcement Learning-Based Output Structured Feedback for Distributed Multi-Area Power System Frequency Control |
|
Kwon, Kyung-bin | The University of Texas at Austin |
Mukherjee, Sayak | Pacific Northwest National Laboratory |
Zhu, Hao | The University of Texas at Austin |
Vu, Thanh Long | Pacific Northwest National Laboratory |
Keywords: Power systems, Optimization algorithms, Machine learning
Abstract: Load frequency control (LFC) is a key factor to maintain stable frequency in multi-area power systems. As modern power systems evolve from a centralized to distributed paradigm, LFC needs to consider the peer-to-peer (P2P) based scheme that considers limited information from the information-exchange graph for the generator control of each interconnected area. This paper aims to solve a data-driven constrained LQR problem with mean-variance risk constraints and output structured feedback, and applies this framework to solve the LFC problem in multi-area power systems. By reformulating the constrained optimization problem into a minimax problem, the stochastic gradient descent max-oracle (SGDmax) algorithm with zero-order policy gradient (ZOPG) is adopted to find the optimal feedback gain from the learning, while guaranteeing convergence. In addition, to improve the adaptation of the proposed learning method to new or varying models, we construct an emulator grid that approximates the dynamics of a physical grid and performs training based on this model. Once the feedback gain is obtained from the emulator grid, it is applied to the physical grid with a robustness test to check whether the controller from the approximated emulator applies to the actual system. Numerical tests show that the obtained feedback controller can successfully control the frequency of each area, while mitigating the uncertainty from the loads, with reliable robustness that ensures the adaptability of the obtained feedback gain to the actual physical grid.
|
|
15:54-15:58, Paper FrC02.7 | Add to My Program |
Optimal Placement of PMUs in Power Networks: Modularity Meets a Priori Optimization |
|
Kazma, Mohamad | Vanderbilt University |
Taha, Ahmad | Vanderbilt University |
Keywords: Power systems, Smart grid, Optimization
Abstract: This paper revisits the optimal phasor measurement unit (PMU) placement problem (P3) in transmission networks. We examine P3 from a control-theoretic and dynamic systems perspectives. Relevant prior literature studied this problem through formulations that are based on empirical observability maximization for nonlinear dynamic power system models. While such studies addressed a plethora of challenges, they mostly adopt a simple representation of system dynamics, ignore basic algebraic equations modeling power flows, forgo including renewables and their uncertainty. This paper offers a fresh perspective on this problem by leveraging the observability matrix's modularity property under a moving horizon estimation theoretic. A nonlinear differential algebraic representation of the system is implicitly discretized while explicitly accounting for uncertainty. To that end, the posed challenges are addressed for the optimal P3 via a computationally tractable integer program formulation. The validity of the approach is illustrated on an IEEE 39-bus power system.
|
|
15:58-16:02, Paper FrC02.8 | Add to My Program |
On Wide-Area Control of Solar-Integrated DAE Models of Power Grids |
|
Nadeem, Muhammad | Vanderbilt University |
Bahavarnia, MirSaleh | Vanderbilt University |
Taha, Ahmad | Vanderbilt University |
Keywords: Power systems, Smart grid, Robust control
Abstract: Today’s power systems are controlled based on decades of experience with the fundamentals of physics-based properties of synchronous generators. Future power grids however must cope with the increasing penetration of renewable energy resources (RERs) and require a much more sophisticated control architecture. This is because RERs are formed by uncertain solar- and wind-based resources and are connected to the grid via advanced (power electronics)-based technologies. These are, in short, far more complex to control than traditional generators. RERs also do not provide inertia to damp frequency oscillations, and thus the grid’s operating point changes frequently causing deterioration in the overall transient stability of the power system. This short paper proposes a robust wide-area controller for an advanced power system model having a higher order generator model, advanced (power electronics)-based solar plants model, and composite load dynamics. The simulation studies show that the proposed controller can significantly improve the transient stability of the system against uncertainty from load demand and renewables.
|
|
16:02-16:06, Paper FrC02.9 | Add to My Program |
Explicit Reinforcement Learning Safety Layer for Computationally Efficient Inverter-Based Voltage Regulation |
|
Zhao, Xingyu | KTH Royal Institute of Technology |
Xu, Qianwen | KTH Royal Institute of Technology |
Keywords: Power systems
Abstract: To mitigate fast voltage fluctuations caused by high penetration of renewable energy, efficient control and coordination methods to utilize the reactive power support of inverters are required. Capturing the nonlinear power flow dynamics while enforcing feasibility of safety constraints, reinforcement learning (RL) with safety layer is highly preferred by safety-critical voltage regulation task. This paper proposes an explicit DRL safety layer to achieve computationally efficient voltage regulation of distribution grids with guaranteed hard constraints of voltage security. To achieve this, we firstly construct the explicit form of safety layer via offline search based on multiparametric programming. Then, instead of doing exhaustive search with exponential complexity, we propose a sample-based approach to identify active constraint sets relevant to safe operations, which makes the offline construction tractable even for large-scale systems. Based on the explicit safety layer, an end-to-end trainable and computationally efficient safe reinforcement learning approach for voltage regulation is proposed. The performance and computational efficiency of proposed method is verified by case study.
|
|
16:06-16:10, Paper FrC02.10 | Add to My Program |
Gramian-Based Characterization of Network Vulnerability to Nodal Impulse Inputs |
|
Chanekar, Prasad Vilas | Indraprastha Institute of Information Technology |
Poolla, Bala | National Renewable Energy Laboratory |
Cortes, Jorge | University of California, San Diego |
Keywords: Network analysis and control, Networked control systems, Control of networks
Abstract: Impulsive inputs applied at influential nodes of a network system may result in undesirable behavior and degrade performance. This paper proposes the notion of vulnerability matrix (VM) to characterize the effect of impulse inputs on a network following either discrete-time or continuous-time dynamics. The VM describes the first-order effects of impulse inputs on edge flows and is based on the controllability Gramian. We provide explicit expressions for the elements of the vulnerability matrix for the class of directed line networks in terms of the edge weights. Simulations validate our results and highlight the utility of the proposed metric in capturing the transient effects of nodal impulse inputs on edge flows.
|
|
FrC03 Regular Session, Sapphire EF |
Add to My Program |
Autonomous Vehicles |
|
|
Chair: Chen, Zheng | University of Houston |
Co-Chair: Lucia, Walter | Concordia University |
|
15:30-15:45, Paper FrC03.1 | Add to My Program |
CBF-Inspired Weighted Buffered Voronoi Cells for Distributed Multi-Agent Collision Avoidance |
|
Lyu, Yiwei | Carnegie Mellon University |
Dolan, John | Carnegie Mellon University |
Luo, Wenhao | University of North Carolina at Charlotte |
Keywords: Autonomous robots, Multivehicle systems, Robotics
Abstract: In this paper, we introduce the Risk-aware Weighted Buffered Voronoi tessellation, a variant of the Generalized Voronoi tessellation. Inherited from traditional Voronoi tessellation, safety guarantees in terms of collision avoidance are provided by partitioning the joint state space of the multi-agent system into individual cells to constrain each individual agent's motion in a distributed manner. Different from existing Weighted Buffered Voronoi tessellations, our CBF-inspired Weighted Buffered Voronoi Cell (CBF-inspired WBVC) partition not only takes agent positional information into account, but also their motion information when determining the cell boundaries. Cell partitioning is conducted based on risk evaluation of the possibility to collide, in which Control Barrier Function is leveraged to capture the behavior of how the agents approach their safety boundaries in a model-based way. In other words, for any point in the joint state space, the cell assignment criteria is not solely based on how close it is to each agent, but on how much risk it experiences generated by each agent. With our Control Barrier Function-inspired risk measurement, the weight of CBF-inspired WBVC is dynamically updated and biases the boundary towards the agents exposed in higher accumulated risk caused by inter-agent interactions. In this way, by taking the neighbors of the neighbors into account with aggregated risk evaluation, agents facing higher risk from multi-agent interaction can have larger relative cells compared to agents exposed to lower risk. With our proposed CBF-inspired WBVC, multi-agent systems are able to perform tasks in a risk-aware manner with the enhanced knowledge of risk provided by the CBF-inspired risk evaluation framework, but without the usage requirement of CBF-based controllers. It is therefore generally applicable to various agent controllers while providing safety guarantees.
|
|
15:45-16:00, Paper FrC03.2 | Add to My Program |
On the Design of Control Invariant Regions for Feedback Linearized Car-Like Vehicles |
|
Tiriolo, Cristian | Concordia University |
Lucia, Walter | Concordia University |
Keywords: Autonomous vehicles, Constrained control, Feedback linearization
Abstract: This paper proposes a novel procedure to design a control invariant region for feedback-linearized car-like vehicles subject to linear and steering velocity constraints. To this end, first, it is formally proved that the state-dependent input constraints acting on the feedback-linearized car model admit a worst-case circular inner approximation. Then, it is shown that such a characterization can be used to analytically design a tracking controller with an associated invariant region capable of ensuring constraints fulfillment. Finally, simulation results show the effectiveness of the proposed solution and its potential to enable the design, via control invariance, of a new class of constrained and model predictive solutions for input-constrained feedback-linearized car-like vehicles.
|
|
16:00-16:15, Paper FrC03.3 | Add to My Program |
Adaptive Backstepping Control for Vehicular Platoons with Mismatched Disturbances Using Vector String Lyapunov Functions |
|
Song, Zihao | University of Notre Dame |
Welikala, Shirantha | University of Notre Dame |
Antsaklis, Panos J. | University of Notre Dame |
Lin, Hai | University of Notre Dame |
Keywords: Autonomous vehicles, Distributed control, Adaptive control
Abstract: In this paper, we consider the problem of platooning control with mismatched disturbances using adaptive backstepping method. We aim at simultaneously retaining the compositionality and the robustness of the controller with respect to general types of disturbances. To this end, motivated by the vector Lyapunov function-based analysis, we propose a novel notion called emph{Vector String Lyapunov Function}, whose existence implies l_2 weak string stability. Based on this notion, we propose an adaptive backstepping controller for the platoon, where the compositionality and robustness are guaranteed with centralized adaptive laws. Besides, the internal and the l_2 weak string stability are proved under the designed controller. By comparing with an existing method and two different types of disturbances and topologies, we numerically illustrate the effectiveness of the proposed control algorithm.
|
|
16:15-16:30, Paper FrC03.4 | Add to My Program |
Towards Physically Adversarial Intelligent Networks (PAINs) for Safer Self-Driving |
|
Gupta, Piyush | Michigan State University |
Coleman, Demetris | Michigan State University |
Siegel, Joshua | Michigan State University |
Keywords: Autonomous vehicles, Machine learning, Neural networks
Abstract: Neural networks in autonomous vehicles suffer from overfitting, poor generalizability, and untrained edge cases due to limited data availability. Researchers often synthesize randomized edge-case scenarios to assist in the training process, though simulation introduces the potential for overfitting to latent rules and features. Automating worst-case scenario generation could yield informative data for improving self-driving. To this end, we present a ``Physically Adversarial Intelligent Network", wherein self-driving vehicles interact aggressively in the CARLA simulation. We train two agents, a protagonist, and an adversary, using dueling double deep Q networks with prioritized experience replay. The coupled networks alternately seek to collide and avoid collisions such that the ``defensive'' avoidance algorithm increases the mean time to failure and distance traveled under non-hostile operating conditions. The trained protagonist becomes more resilient to environmental uncertainty and less prone to corner case failures resulting in collisions than the agent trained without an adversary.
|
|
16:30-16:45, Paper FrC03.5 | Add to My Program |
A Physics-Informed Neural Network Approach towards Cyber Attack Detection in Vehicle Platoons |
|
Vyas, Shashank Dhananjay | The Pennsylvania State University |
Padisala, Shanthan Kumar | Penn State |
Dey, Satadru | The Pennsylvania State University |
Keywords: Autonomous vehicles, Neural networks
Abstract: Connected and Autonomous Vehicles (CAVs) are seen as a promising solution to reduce traffic congestion, improve passenger comfort and fuel economy. Although CAVs address such needs in an effective way, they are vulnerable to cyber attacks due to their extensive utilization of communication networks. In light of this problem, we present a cyber attack detection framework for a vehicle platoon based on physics-informed neural network (PINN) framework. The proposed algorithm exploits the physics based model of the platoon as well as limited available data to detect and distinguish cyber-attacks from various sources, namely, attacks affecting communication network and attacks affecting local vehicular sensors. Essentially, the PINN framework learns an uncertain parameter from the physics model and utilizes the learned parameter knowledge to infer attack scenarios. Finally, as shown through the simulation studies, the proposed algorithm is able to detect and distinguish various cyber attacks showing its potential.
|
|
16:45-17:00, Paper FrC03.6 | Add to My Program |
Dynamics and Control of AUVs Using Buoyancy-Based Soft Actuation |
|
Hoppe, Christopher | Rice University |
Ghorbel, Fathi H. | Rice Univ |
Chen, Zheng | University of Houston |
Keywords: Autonomous vehicles, Robotics, Adaptive control
Abstract: Nonlinear control of Autonomous Underwater Vehicles (AUVs) via the use of thrusters has been well established. These AUVs can be used for various applications, including subsea inspection and maintenance, exploration, research, and observation. These thrusters are best suited for large thrust forces required by large movements, but require a lot of energy to operate for long periods of time. Research into Buoyancy Control Devices (BCDs) using reversible fuel cells (RFCs) has proven their viability. This paper demonstrates nonlinear control of BCD-based AUVs while picking up tools with unknown weights. An adaptive control law is derived that ensures stability and good performance throughout the completion of the desired mission. Simulation results demonstrate desired performance with low energy requirements.
|
|
FrC04 Regular Session, Sapphire AB |
Add to My Program |
Learning |
|
|
Chair: Halder, Abhishek | University of California, Santa Cruz |
Co-Chair: Shen, Jiajun | Purdue University |
|
15:30-15:45, Paper FrC04.1 | Add to My Program |
Learning the Kalman Filter with Fine-Grained Sample Complexity |
|
Zhang, Xiangyuan | University of Illinois at Urbana-Champaign |
Hu, Bin | University of Illinois at Urbana-Champaign |
Basar, Tamer | Univ of Illinois, Urbana-Champaign |
Keywords: Learning, Filtering, Optimization algorithms
Abstract: We develop the first end-to-end sample complexity of model-free policy gradient (PG) methods in discrete-time infinite-horizon Kalman filtering. Specifically, we introduce the receding-horizon policy gradient (RHPG-KF) framework and demonstrate tilde{mathcal{O}}(epsilon^{-2}) sample complexity for RHPG-KF in learning a stabilizing filter that is epsilon-close to the optimal Kalman filter. Notably, the proposed RHPG-KF framework does not require the system to be open-loop stable nor assume any prior knowledge of a stabilizing filter. Our results shed light on applying model-free PG methods to control a linear dynamical system where the state measurements could be corrupted by statistical noises and other (possibly adversarial) disturbances.
|
|
15:45-16:00, Paper FrC04.2 | Add to My Program |
On the Benefits of Leveraging Structural Information in Planning Over the Learned Model |
|
Shen, Jiajun | Purdue University |
Kuwaranancharoen, Kananart | Purdue University |
Ayoub, Raid | Intel Corporation |
Mercati, Pietro | Intel |
Sundaram, Shreyas | Purdue University |
Keywords: Learning, Grey-box modeling, Queueing systems
Abstract: Model-based Reinforcement Learning (RL) integrates learning and planning and has received increasing attention in recent years. However, learning the model can incur a significant cost (in terms of sample complexity), due to the need to obtain a sufficient number of samples for each state-action pair. In this paper, we investigate the benefits of leveraging structural information about the system in terms of reducing sample complexity. Specifically, we consider the setting where the transition probability matrix is a known function of a number of structural parameters, whose values are initially unknown. We then consider the problem of estimating those parameters based on the interactions with the environment. We characterize the difference between the Q estimates and the optimal Q value as a function of the number of samples. Our analysis shows that there can be a significant saving in sample complexity by leveraging structural information about the model. We illustrate the findings by considering how to control a queuing system with heterogeneous servers.
|
|
16:00-16:15, Paper FrC04.3 | Add to My Program |
Thompson Sampling for Partially Observable Linear-Quadratic Control |
|
Kargin, Taylan | California Institute of Technology |
Lale, Sahin | Caltech |
Azizzadenesheli, Kamyar | Purdue University |
Anandkumar, Animashree | California Institute of Technology |
Hassibi, Babak | Caltech |
Keywords: Learning, Linear systems, Adaptive control
Abstract: Thompson Sampling (TS) is a popular method for decision-making under uncertainty, where an action is sampled from a carefully constructed distribution based on the data collected. In this work, we study the problem of adaptive control in partially observable linear quadratic Gaussian, i.e., LQG, control systems using TS, when the model dynamics are unknown. Prior works have established an Õ(√T) regret upper bound for the adaptive control of such systems, after T time steps. However, the algorithms that achieve this result employ computationally intractable policies. We propose an efficient TS-based adaptive control algorithm, Thompson Sampling under Partial Observability, TSPO, to effectively balance the exploration vs. exploitation trade-off and minimize the overall control cost in epochs. TSPO utilizes closed-loop system identification to estimate the underlying model parameters up to their confidence intervals. It then deploys the optimal policy of a sampled system, which is selected at random from the distribution constructed with the model estimates and their confidence intervals. We show that using only logarithmic policy updates, TSPO attains Õ(√T) regret against the optimal control policy that knows the system dynamics. To the best of our knowledge, TSPO is the first computationally efficient algorithm that achieves Õ(√T) regret in adaptive control of unknown partially observable LQG control systems with convex cost. Further, we empirically study the performance of TSPO in an adaptive measurement-feedback control problem.
|
|
16:15-16:30, Paper FrC04.4 | Add to My Program |
An Online Deep Learning - Production Scheduling - Optimal Control Framework for Batch Chemical Processes |
|
Santander, Omar | The University of Texas at Austin |
Giannikopoulos, Ioannis | The University of Texas at Austin |
Stadtherr, Mark | University of Texas at Austin |
Baldea, Michael | The University of Texas at Austin |
Keywords: Chemical process control, Modeling, Machine learning
Abstract: Integrating production scheduling and optimal control is a key step towards increasing the efficiency of the decision-making process in chemical process operations. In this paper, we introduce a novel framework that couples short term production scheduling and optimal control using deep learning (recurrent neural networks) techniques for process modeling, capturing nonlinear process behavior and accounting for varying processing times. The models remain computationally tractable, leading to fast solutions with potential for online implementation. The capabilities of the framework are showcased with a prototype case study.
|
|
16:30-16:45, Paper FrC04.5 | Add to My Program |
Learning Adaptive Optimal Controllers for Linear Time-Delay Systems |
|
Cui, Leilei | New York University |
Pang, Bo | New York University |
Jiang, Zhong-Ping | New York University |
Keywords: Learning, Optimal control, Delay systems
Abstract: This paper studies the learning-based optimal control for a class of infinite-dimensional linear time-delay systems. The aim is to fill the gap of adaptive dynamic programming (ADP) where adaptive optimal control of infinite-dimensional systems is not addressed. A key strategy is to combine the classical model-based linear quadratic (LQ) optimal control of time-delay systems with the state-of-art reinforcement learning (RL) technique. Both the model-based and data-driven policy iteration (PI) approaches are proposed to solve the corresponding algebraic Riccati equation (ARE) with guaranteed convergence. The proposed PI algorithm can be considered as a generalization of ADP to infinite-dimensional time-delay systems. The efficiency of the proposed algorithm is demonstrated by the practical application arising from autonomous driving in mixed traffic environments, where human drivers' reaction delay is considered.
|
|
16:45-17:00, Paper FrC04.6 | Add to My Program |
Convex and Nonconvex Sublinear Regression with Application to Data-Driven Learning of Reach Sets |
|
Haddad, Shadi | University of California, Santa Cruz |
Halder, Abhishek | University of California, Santa Cruz |
Keywords: Learning, Uncertain systems, Computational methods
Abstract: We consider estimating a compact set from finite data by approximating the support function of that set via sublinear regression. Support functions uniquely characterize a compact set up to closure of convexification, and are sublinear (convex as well as positive homogeneous of degree one). Conversely, any sublinear function is the support function of a compact set. We leverage this property to transcribe the task of learning a compact set to that of learning its support function. We propose two algorithms to perform the sublinear regression, one via convex and another via nonconvex programming. The convex programming approach involves solving a quadratic program (QP). The nonconvex programming approach involves training a input sublinear neural network. We illustrate the proposed methods via numerical examples on learning the reach sets of controlled dynamics subject to set-valued input uncertainties from trajectory data.
|
|
FrC05 Regular Session, Sapphire 411A |
Add to My Program |
Optimal Control V |
|
|
Chair: Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Co-Chair: Labbadi, Moussa | Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-Lab, 38000 Grenoble, France |
|
15:30-15:45, Paper FrC05.1 | Add to My Program |
Discrete Mechanics and Optimal Control for Passive Walking with Foot Slippage |
|
Anahory Simões, Alexandre | IE University |
Lopez Gordon, Asier | Instituto De Ciencias Matematicas |
Bloch, Anthony M. | Univ. of Michigan |
Colombo, Leonardo Jesus | Spanish National Research Council |
Keywords: Algebraic/geometric methods, Mechanical systems/robotics, Optimal control
Abstract: Forced variational integrators are given by the discretization of the Lagrange-d'Alembert principle for systems subject to external forces, and have proved useful for numerical simulation studies of complex dynamical systems. In this paper we model a passive walker with foot slip by using techniques of geometric mechanics, and we construct forced variational integrators for the system. Moreover, we present a methodology for generating (locally) optimal control policies for simple hybrid holonomically constrained forced Lagrangian systems, based on discrete mechanics, applied to a controlled walker with foot slip in a trajectory tracking problem.
|
|
15:45-16:00, Paper FrC05.2 | Add to My Program |
Application of Quantum Optimal Control to Shaken Lattice Interferometry |
|
Shao, Jieqiu | University of Colorado Boulder |
Chih, Liang-Ying | University of Colorado Boulder |
Naris, Mantas | University of Colorado Boulder |
Holland, Murray | University of Colorado Boulder |
Nicotra, Marco M | University of Colorado Boulder |
Keywords: Quantum information and control, Optimal control, Control applications
Abstract: This paper demonstrates how quantum optimal control can be used to perform shaken lattice interferometry. The first objective is to translate the five fundamental stages of interferometry (splitting, propagation, reflection, counter propagation and recombination) into quantum optimal control problems parametrized by the time horizon of each stage. The timing of each stage is then studied in relationship to its overall influence on the interferometer performance. This is done by comparing the population distributions obtained for a range of different accelerations and using Fisher information to estimate the sensitivity of the resulting accelerometer. These encouraging results highlight the effectiveness of quantum optimal control for the the design of next-generation atom-based interferometers.
|
|
16:00-16:15, Paper FrC05.3 | Add to My Program |
An Inverse Optimal Control Approach for Learning and Reproducing under Uncertainties |
|
Byeon, Sooyung | Purdue University |
Sun, Dawei | Purdue University Sch of Aero and Astro |
Hwang, Inseok | Purdue University |
Keywords: Optimal control, Uncertain systems, Identification for control
Abstract: This study presents a novel inverse optimal control (IOC) approach that can account for uncertainties in measurements and system models. The proposed IOC approach aims to recover an objective function including a time-varying term, called variability, from a given demonstration. All uncertainties of the demonstration and the system model can be lumped into the variability such that the optimality condition violation is further reduced. The inferred objective function including the variability has two advantages over the objective function inferred by existing IOC approaches: first, the variability can enhance the capability of describing the given demonstration since it represents how the uncertainties of the system affect the objective function; and second, the proposed IOC approach can reproduce the trajectories such that we can predict the behavior of the system even with system modeling errors. We show that the variability exists and is unique under attainable assumptions. Illustrative numerical examples are presented to demonstrate the proposed method.
|
|
16:15-16:30, Paper FrC05.4 | Add to My Program |
Multi-Stage Path Planning for Unmanned Surface Vessels Recovery |
|
Xu, Siyuan | Shanghai Jiaotong University |
Wu, Jing | Shanghai Jiao Tong University |
Long, Chengnian | Shanghai Jiao Tong University |
Wang, Lin | Shanghai Jiao Tong University |
Li, Shaoyuan | Shanghai Jiao Tong University |
Keywords: Maritime control, Optimal control
Abstract: In this paper, a multi-stage path planning algorithm based on geometric method for automated unmanned surface vessels (USVs) recovery is presented, where there are no constraints for the initial positions and velocity of mother/child boats. Different efficient paths can be obtained by dividing the overall goal of recovery into different sub-goals according to the random course of the mother boat, which satisfies the maneuverability constraints of different boat types. Finally, the result of simulation is given to verify the effectiveness of our proposed method, which shows that the mother boat can collect child boats successfully at any initial location and initial velocity in both straight and curve courses.
|
|
16:30-16:45, Paper FrC05.5 | Add to My Program |
GrAVITree: Graph-Based Approximate Value Function in a Tree |
|
Washington, Patrick | Stanford University |
Fridovich-Keil, David | The University of Texas at Austin |
Schwager, Mac | Stanford University |
Keywords: Optimal control, Randomized algorithms, Numerical algorithms
Abstract: In this paper, we introduce GrAVITree, a tree- and sampling-based algorithm to compute a near-optimal value function and corresponding feedback policy for indefinite time-horizon, terminal state-constrained nonlinear optimal control problems. Our algorithm is suitable for arbitrary nonlinear control systems with both state and input constraints. The algorithm works by sampling feasible control inputs and branching backwards in time from the terminal state to build the tree, thereby associating each vertex in the tree with a feasible control sequence to reach the terminal state. Additionally, we embed this stochastic tree within a larger graph structure, rewiring of which enables rapid adaptation to changes in problem structure due to, e.g., newly detected obstacles. Because our method reasons about global problem structure without relying on (potentially imprecise) derivative information, it is particularly well suited to controlling a system based on an imperfect deep neural network model of its dynamics. We demonstrate this capability in the context of an inverted pendulum, where we use a learned model of the pendulum with actuator limits and achieve robust stabilization in settings where competing tree-based and derivative-based techniques fail.
|
|
16:45-17:00, Paper FrC05.6 | Add to My Program |
Quadrotor Motion Planning in Stochastic Wind Fields |
|
Greiff, Marcus Carl | Mitsubishi Electric Research Laboratries |
P. Vinod, Abraham | Mitsubishi Electric Research Laboratories |
Nabi, Saleh | Mitsubishi Electric Research Laboratories (MERL) |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Flight control, Aerospace, Optimization algorithms
Abstract: In this paper, we propose a motion planner for quadrotors in windy environments. We extend a well-known convex polynomial optimization (CPO) method to incorporate known stochastic input uncertainties. In particular, we focus on a quadrotor unmanned aerial vehicle (UAV), and propose a new objective for direct minimization of the squared L2-norm of the UAV thrust. We show that the first two moments of this norm are convex in the optimization variables of the CPO problem, and can be minimized directly. Furthermore, we demonstrate that a constrained CPO approach can be used in this setting, contrary to the more popular unconstrained approaches. We provide examples demonstrating: (i) that inclusion of wind can yield significant improvements in the considered cost; (ii) that re-planning of complex paths at can be done at rates exceeding 100 Hz; and (iii) that the proposed method facilitates online re-planning leveraging wind in free-space defined as the union of convex sets.
|
|
FrC06 Regular Session, Sapphire 411B |
Add to My Program |
Uncertain Systems |
|
|
Chair: Kontoudis, George | University of Maryland |
Co-Chair: Farhood, Mazen | Virginia Tech |
|
15:30-15:45, Paper FrC06.1 | Add to My Program |
Closed-Form Active Learning Using Expected Variance Reduction of Gaussian Process Surrogates for Adaptive Sampling |
|
Kontoudis, George | University of Maryland |
Otte, Michael | University of Maryland College Park |
Keywords: Uncertain systems, Optimization, Machine learning
Abstract: Adaptive sampling of latent fields remains a challenging task, especially in high-dimensional input spaces. In this paper, we propose an active learning method of expected variance reduction with Gaussian process (GP) surrogates using a closed-form gradient. The use of closed-form gradient leads the optimization to find better solutions with reduced computations. We derive the closed-form gradient for active learning Cohn (ALC) using GP surrogates that are formed with the separable squared exponential covariance function. Moreover, we provide algorithmic details for the execution of the closed-form ALC (cALC). Numerical experiments with multiple input space dimensions illustrate the efficacy of our method.
|
|
15:45-16:00, Paper FrC06.2 | Add to My Program |
Identifying Critical Attack Points in Cyber-Physical Systems Using Integral Quadratic Constraints |
|
Sinha, Sourav | Virginia Tech |
Farhood, Mazen | Virginia Tech |
Keywords: Uncertain systems, Robotics, Robust control
Abstract: This paper gives a systematic approach for identifying critical attack points in cyber-physical systems leveraging recently developed robustness analysis tools for finite horizon systems based on integral quadratic constraints (IQCs). The controlled system is expressed as a linear fractional transformation on uncertainties and is affected by exogenous inputs, where both the modeling uncertainties and disturbance inputs are characterized using IQCs. The attacks are assumed to target the sensor measurements and actuator inputs over a finite time interval, and are in the form of additive perturbations that are bounded pointwise in time. The pointwise-bounded adversarial perturbations and the finite-horizon disturbance signals are properly characterized to reduce conservatism. The robust performance level obtained from IQC analysis is used as a qualitative measure to identify critical sensor and actuator attack points. The proposed approach is applied to identify the critical sensor and actuator attack points in an unmanned aircraft system, and its advantages over nonlinear optimization techniques are demonstrated.
|
|
16:00-16:15, Paper FrC06.3 | Add to My Program |
On Robust Control of Partially Observed Uncertain Systems with Additive Costs |
|
Dave, Aditya | University of Delaware |
Senthil Kumar, Nishanth Venkatesh | University of Delaware |
Malikopoulos, Andreas A. | University of Delaware |
Keywords: Uncertain systems, Robust control, Markov processes
Abstract: In this paper, we consider the problem of optimizing the worst-case behavior of a partially observed system. All uncontrolled disturbances are modeled as finite-valued uncertain variables. Using the theory of cost distributions, we present a dynamic programming (DP) approach to compute a control strategy that minimizes the maximum possible total cost over a given time horizon. To improve the computational efficiency of the optimal DP, we introduce a general definition for information states and show that many information states constructed in previous research efforts are special cases of ours. Additionally, we define approximate information states and an approximate DP that can further improve computational tractability by conceding a bounded performance loss. We illustrate the utility of these results using a numerical example.
|
|
16:15-16:30, Paper FrC06.4 | Add to My Program |
Funnel Control for Uncertain Nonlinear Systems Via Zeroing Control Barrier Functions |
|
Verginis, Christos | Uppsala University |
Keywords: Robust adaptive control, Uncertain systems, Constrained control
Abstract: We consider the funnel-control problem for control-affine nonlinear systems with unknown drift term and parametrically uncertain control-input matrix. We develop an adaptive control algorithm that uses zeroing control barrier functions to accomplish trajectory tracking in a pre-defined funnel, achieving hence pre-defined transient and steady-state performance. In contrast to standard funnel-control works, the proposed algorithm can retain the system’s input in pre-defined bounds without resorting to reciprocal terms that can lead to arbitrarily large control effort. Moreover and unlike the previous works on zeroing control barrier functions, the algorithm uses appropriately designed adaptation variables that compensate for the uncertainties of the system; namely, the unknown drift term and parametric uncertainty of the control- input matrix. Comparative computer simulations verify the effectiveness of the proposed algorithm.
|
|
16:30-16:45, Paper FrC06.5 | Add to My Program |
Safe and Stable Control Synthesis for Uncertain System Models Via Distributionally Robust Optimization |
|
Long, Kehan | University of California San Diego |
Yi, Yinzhuang | University of California, San Diego |
Cortes, Jorge | University of California, San Diego |
Atanasov, Nikolay | University of California, San Diego |
Keywords: Constrained control, Uncertain systems, Stability of nonlinear systems
Abstract: This paper considers enforcing safety and stability of dynamical systems in the presence of model uncertainty. Safety and stability constraints may be specified using a control barrier function (CBF) and a control Lyapunov function (CLF), respectively. To take model uncertainty into account, robust and chance formulations of the constraints are commonly considered. However, this requires known error bounds or a known distribution for the model uncertainty, and the resulting formulations may suffer from over-conservatism or over-confidence. In this paper, we assume that only a finite set of model parametric uncertainty samples is available and formulate a distributionally robust chance-constrained program (DRCCP) for control synthesis with CBF safety and CLF stability guarantees. To facilitate efficient computation of control inputs during online execution, we present a reformulation of the DRCCP as a second-order cone program (SOCP). Our formulation is evaluated in an adaptive cruise control example in comparison to 1) a baseline CLF-CBF quadratic programming approach, 2) a robust approach that assumes known error bounds of the system uncertainty, and 3) a chance-constrained approach that assumes a known Gaussian Process distribution of the uncertainty.
|
|
FrC07 Regular Session, Aqua 303 |
Add to My Program |
Control Applications II |
|
|
Chair: Mukherjee, Ranjan | Michigan State University |
Co-Chair: Caverly, Ryan James | University of Minnesota |
|
15:30-15:45, Paper FrC07.1 | Add to My Program |
LSTM-Based Control of Degree of Polymerization in a Batch Pulp Digester |
|
Shah, Parth | Texas A&M University |
Choi, Hyun-Kyu | Texas A&M University |
Kwon, Joseph | Texas A&M University |
Keywords: Pulp and Paper Control, Predictive control for nonlinear systems, Machine learning
Abstract: Due to ever increasing demand for different types of paper, it is crucial to optimize the Kraft pulping process to achieve the required paper properties. This work proposes a framework to regulate these paper properties by building a novel closed-loop long short-term memory (LSTM)-based model predictive control system. First, a multiscale model was developed by combining the mass and thermal energy balance equations adopted from Purdue model with a layered kinetic Monte Carlo (kMC) algorithm that describes the time-evolution of microscopic events such as fiber morphology, kappa number, and cellulose Degree of Polymerization (DP). Then, this model was run over different operating conditions by varying the temperature, concentration, and cooking time to generate data. An LSTM-ANN network was trained using these datasets with a prediction accuracy of over 98% capturing the behavior of kappa number and cellulose DP and considering the effects of time-varying and time-invariant operating conditions together. Finally, a closed-loop LSTM-based multi-objective optimal controller was designed, which was demonstrated to achieve the target set-point values and obtain optimal constant value inputs along with time-series inputs while considering process constraints. The results showed excellent accuracy and the controller was computationally less expensive due to the use of a well-trained LSTM network in the proposed framework.
|
|
15:45-16:00, Paper FrC07.2 | Add to My Program |
Design and Implementation of Finite-Time Control for Speed Tracking of Permanent Magnet Synchronous Motor |
|
Chatri, Chakib | Engineering for Smart and Sustainable Systems Research Center, M |
Labbadi, Moussa | Univ. Grenoble Alpes, CNRS, Grenoble INP, GIPSA-Lab, 38000 Greno |
Ouassaid, Mohammed | Mohammadia School of Engineers(EMI), Mohammed V University in Ra |
Elyaalaoui, Kamal | LAPLACE, University of Toulouse, INPTENSEEIHT, France |
El Houm, Yassine | Engineering for Smart and Sustainable Systems Research Center, M |
Keywords: Electrical machine control
Abstract: This letter investigates a real-time of a finite-time control for permanent magnet synchronous motor in the presence of external load disturbance. Firstly, an integral terminal sliding manifold is designed to achieve fast speed, high precision performance, and enhance the quality of currents by reducing the total harmonic distortion. Indeed, the proposed surface manifold ensures a finite-time convergence of the states. Secondly, a switching control scheme is added in the system control to force the state systems converge to their desired values in the presence of load disturbance. The finite-time stability is proved based on Lyapunov theory. Finally, the effectiveness of the designed controller is validated and evaluated by carrying out real-time experimental studies using eZdspTM F28335 board. Experimental results demonstrate that the proposed controller is simple to implement, has better tracking accuracy, reduces the chattering phenomenon, and ensures robustness against external load disturbance.
|
|
16:00-16:15, Paper FrC07.3 | Add to My Program |
Noncolocated Mu-Tip Trajectory Tracking of Redundantly-Actuated Flexible Robotic Manipulators |
|
Lyman, Richard James | University of Minnesota |
Cheah, Sze Kwan | University of Minnesota |
Caverly, Ryan James | University of Minnesota |
Keywords: Flexible structures, Robust adaptive control, Robotics
Abstract: This paper presents a robust passivity-based payload trajectory tracking control method for redundantly-actuated flexible robotic manipulators. The proposed approach is based on mu-tip control, which involves the use of a modified system output to ensure a passive input-output mapping. This work distinguishes itself from prior implementations of mu-tip control with flexible manipulators by demonstrating the generality with which redundant actuation can be accounted for. In particular, it is shown that prior load-sharing-parameter-based approaches are a special case of a more general kinematic constraint that is to be enforced to ensure passivity. Numerical results with an overactuated cable-driven parallel robot demonstrate the performance of the proposed mu-tip control method.
|
|
16:15-16:30, Paper FrC07.4 | Add to My Program |
Direct Adaptive Fuzzy-Based Neural Network Controller for a Human-Driven Knee Joint Orthosis |
|
Bey, Oussama | University of Paris-Est Créteil |
Chemachema, Mohamed | University of Constantine 1, Algeria |
Amirat, Yacine | University of Paris Est Créteil (UPEC) |
Fried, Georges | Université Paris-Est Créteil Val De Marne |
Mohammed, Samer | University of Paris Est Créteil (UPEC) |
Keywords: Direct adaptive control, Robotics
Abstract: This paper presents a control error based direct adaptive Neural Network (NN) controller applied to a lower limb knee joint orthosis during flexion/extension movements. The proposed approach requires neither pre-knowledge of the exact human-orthosis system nonlinearities nor it’s exact parameters. Unlike the available NN control approaches that rely on the tracking errors to derive the adaptive weights, our approach represent an alternative way on which we introduce the control error for online updating of the NN weights. A Fuzzy Inference System (FIS) is exploited to estimate the unknown control error. Then, the NN weights are tuned directly using back-propagation algorithm based on a quadratic criterion of the control error independently from the tracking error. In terms of stability, the tracking error has been proved to converge exponentially to an arbitrary small set despite the presence of external disturbances. Simulations are conducted to evaluate the effectiveness of the proposed control approach.
|
|
16:30-16:45, Paper FrC07.5 | Add to My Program |
A Minimax-Based Decision-Making Approach for Safe Maneuver Planning in Automated Driving |
|
Saraoglu, Mustafa | Technische Universität Dresden |
Jiang, Heng | Dresden University of Technology |
Schirmer, Manuel | Technische Universität Dresden |
Mutlu, Ilhan | RWTH Aachen University |
Janschek, Klaus | Technische Universität Dresden |
Keywords: Multivehicle systems, Game theory, Control system architecture
Abstract: This paper proposes a novel game-theoretic decision-making algorithm for safe maneuver planning in highway driving. The problem is formulated as a two-player extensive-form game for safety between the ego vehicle and the environment (all the other vehicles around). In order to make a decision (i.e., plan maneuver), the ego vehicle builds a game tree in the current state. The tree is expanded for each possible maneuver of the ego vehicle and the observations from the environment. For evaluation, we quantify the safety value of a maneuver by computing and over-approximating its trajectory and checking for the worst-case spatiotemporal overlap with possible trajectories of other vehicles. The ego vehicle tries to maximize the safety value, assuming that others will act to minimize it. Among equally safe maneuvers, it chooses the one that travels the longest distance. The minimax solution of the game tree yields a sequence of maneuvers up to a predefined depth. The ego vehicle applies the first maneuver in a receding horizon fashion and repeats the process in constant planning cycles. For validation, we simulated highway driving scenarios and compared our minimax-based planning approach to a rule-based planner and an online look-ahead planner in terms of safety, traveled distance, and computation time. We have shown that our approach incorporates a higher safety level than the baseline planners at the cost of traveled distance and computation time.
|
|
16:45-17:00, Paper FrC07.6 | Add to My Program |
Orbital Stabilization of Underactuated Systems Using Time Period Regulation |
|
Kant, Nilay | Mainspring Energy |
Mukherjee, Ranjan | Michigan State University |
Keywords: Mechanical systems/robotics, Robotics, Linear systems
Abstract: A new approach to orbital stabilization of underactuated systems with one passive degree-of-freedom (DOF) is presented. Virtual holonomic constraints are enforced using partial feedback linearization; this results in a dense set of periodic orbits on a constraint manifold. Every orbit on the constraint manifold is associated with a unique time-period. A desired orbit is selected and the impulse controlled Poincare map (ICPM) approach is utilized to stabilize the orbit by regulating the time-period. By treating the time period as the output, it is possible to design a dead-beat controller that achieves orbital stabilization in a single time-step. The effectiveness of the dead-beat design is demonstrated for the cart-pendulum system.
|
|
FrC08 Regular Session, Aqua 305 |
Add to My Program |
Fault Diagnosis |
|
|
Chair: Lu, Qiugang | Texas Tech University |
Co-Chair: Yoon, Yongsoon | Oakland University |
|
15:30-15:45, Paper FrC08.1 | Add to My Program |
Early Crack Localization in Flexible Structures Subjected to Unknown Disturbances Using Sensor-Measurements Only |
|
Khalil, Abdelrahman | Memorial University of Newfoundland |
Aljanaideh, Khaled | Jordan University of Science and Technology |
Al Janaideh, Mohammad | University of Guelph |
Keywords: Fault detection, Fault diagnosis, Flexible structures
Abstract: This paper uses output-only measurements to localize faults within flexible structures. These measurements are used to construct transmissibility operators, which are mathematical models that are independent of the excitation acting on the structure. Faults considered in this paper are formulated as unknown disturbances acting on the underlying structure. The proposed approach is illustrated on a class of flexible cantilever beams, which can be modeled as a connection of finite lumped segments. The output (e.g. deflection of the beam) at one location on the beam can be predicted using a transmissibility operator and the output at a different location on the beam. The discrepancy between the measured and predicted outputs at a specific location on the beam can be used as a fault indicator. If this discrepancy is small, the beam is considered healthy. Any deviation from the healthy conditions of the beam will cause an increase in the transmissibility discrepancy, which indicates a fault. This allows early fault and crack detection even if the fault is not clearly visible to the human eye. The proposed approach can be used online during system operation and is illustrated using a numerical example.
|
|
15:45-16:00, Paper FrC08.2 | Add to My Program |
Estimation and Frequency Domain Analysis of an Inverse Model for Electro-Hydraulic System Diagnostic in Closed-Loop |
|
Yoon, Yongsoon | Oakland University |
Keywords: Fault diagnosis, Fluid power control, Mechatronics
Abstract: This paper presents an onboard diagnostic of an electro-hydraulic actuator in closed-loop based on inverse model estimation and its frequency domain analysis. The developed diagnostic has two sequential steps. In the first step, an inverse model of the electro-hydraulic actuator in closed-loop is adaptively updated to retain changing dynamics due to the occurrence of faults. To address an estimation bias and covariance windup under non-persistent excitation of closed-loop system identification, an indirect two-stage directional forgetting recursive least squares method is applied to estimate the inverse model parameters. In the second step, the estimated inverse model is analyzed in frequency domain to extract fault features for diagnostic. The developed diagnostic is illustrated numerically with the most common and critical faults including incorrect pump pressure, fluid leakage and changes of friction and bulk modulus.
|
|
16:00-16:15, Paper FrC08.3 | Add to My Program |
Approximate Confidence Region of State Prediction in Stochastic Dynamical Discrete-Time Systems |
|
Shen, Xun | Osaka University |
Ouyang, Tinghui | National Institute of Advanced Industrial Science and Technology |
Wu, Yuhu | Dalian University of Technology |
Keywords: Fault detection, Fault diagnosis, Machine learning
Abstract: The confidence region of state prediction is necessary for anomaly detection and robust control design in stochastic dynamical systems. This paper addresses the problem of computing the tightest ellipsoidal region of state prediction with a required probability confidence level for stochastic dynamical discrete-time systems. This problem is not directly tractable. In this paper, a sample-based method is proposed to construct a solvable approximate problem of the original problem. By solving the approximate problem, the approximate confidence region can be obtained. We prove that the approximate confidence region converges to the optimal confidence region with probability 1 when the number of sample data increases to infinite. Numerical simulations have been implemented to validate the effectiveness of the proposed method.
|
|
16:15-16:30, Paper FrC08.4 | Add to My Program |
Symbolic Regression for Fault Prognosis and Remaining Useful Life Estimation |
|
Safikou, Efi | University of Connecticut |
Bollas, George | University of Connecticut |
Keywords: Fault diagnosis, Fault detection, Machine learning
Abstract: We present a hybrid scheme for prognostics and system health management, which combines system modeling methods and regression-based approaches. Along these lines, we perform parameter trending using symbolic regression, by implementing a genetic programming algorithm that integrates the system model based on the available sensor data. The obtained fault function is an analytical expression for the progression of the system fault in time, which provides valuable insights on its causality. For comparison purposes, we also employ a dynamic degradation regression model that encompasses as health indicators inferential sensors that have been optimized by combining symbolic regression and information theory. To highlight the effectiveness of the proposed framework, both of the aforementioned approaches are applied to a dynamic model of a cross-flow plate-fin heat exchanger toward predicting fault occurrences and estimating the remaining useful life of the system, for various levels of measurement noise.
|
|
16:30-16:45, Paper FrC08.5 | Add to My Program |
A Smoothing Approach for Active Fault Diagnosis with a Unified Set Representation |
|
Qiu, Haohao | Tsinghua University |
Fan, Yidian | Tsinghua University |
Xu, Feng | Tsinghua University |
Wang, Xueqian | Tsinghua University |
Keywords: Fault diagnosis, Linear systems, Uncertain systems
Abstract: This paper proposes a universal guaranteed active fault diagnosis framework for systems with zonotopic, polytopic or ellipsoidal uncertainties. Based on the notion of the second-order cone, a novel set representation that unifies the above set forms for set-membership estimation in fault diagnosis is derived. The principle of fault diagnosis within a specified time horizon is to design an input sequence to separate the output sets of all fault scenarios. In our framework, the input design problem is formulated as a mathematical program with complementarity constraints. To reduce computational complexity, a smoothing approach is applied such that gradient based methods can be utilized to search solutions efficiently. The effectiveness of the proposed method is demonstrated by a numerical example.
|
|
16:45-17:00, Paper FrC08.6 | Add to My Program |
Improving Convolutional Neural Networks for Fault Diagnosis by Assimilating Global Features |
|
Al-Wahaibi, Saif | Texas Tech University |
Lu, Qiugang | Texas Tech University |
Keywords: Fault diagnosis, Machine learning, Neural networks
Abstract: Deep learning techniques have become prominent in modern fault diagnosis for complex processes. In particular, convolutional neural networks (CNNs) have shown an appealing capacity to deal with multivariate time-series data when converted into images. However, existing CNN techniques mainly focus on capturing local or multi-scale features from input images. A deep CNN is often required to indirectly extract global features, which are critical to describing the images converted from multivariate dynamical data. This paper proposes a novel local-global scale CNN (LGS-CNN) architecture that directly accounts for both local and global features for fault diagnosis. Specifically, the local features are acquired by traditional local kernels, whereas global features are extracted using one-dimensional tall and fat kernels that span the entire height and width of the image. Both local and global features are then merged for classification using fully-connected layers. The proposed LGS-CNN is validated on the benchmark Tennessee Eastman process dataset. Comparison with traditional CNN shows that the proposed LGS-CNN can greatly improve the fault diagnosis performance without significantly increasing the model complexity. This is attributed to the much wider local receptive field created by the LGS-CNN than that by CNN. The proposed LGS-CNN can also outperform artificial neural networks and fisher discriminant analysis in FD on the same dataset.
|
|
FrC10 Regular Session, Aqua 309 |
Add to My Program |
LMIs |
|
|
Chair: Rajamani, Rajesh | Univ. of Minnesota |
Co-Chair: Sznaier, Mario | Northeastern University |
|
15:30-15:45, Paper FrC10.1 | Add to My Program |
Nonlinear Observer Design Methods Based on High-Gain Methodology and LMIs with Application to Vehicle Tracking |
|
Bessafa, Hichem | Université De Lorraine |
Delattre, Cedric | Université De Lorraine (IUT De Longwy) |
Belkhatir, Zehor | Memorial Sloan Kettering Cancer Center (MSKCC) |
Zemouche, Ali | CRAN UMR CNRS 7039 & Inria: EPI-DISCO |
Rajamani, Rajesh | Univ. of Minnesota |
Keywords: Observers for nonlinear systems, LMIs, Lyapunov methods
Abstract: The main objective of this work is to propose a solution to observer design for triangular systems where additional output measurements are available, which may improve the estimation quality. In fact, such additional measurements prevent the standard high-gain observer methodology to provide solutions for the estimation problem. In this paper, motivated by this issue, we propose two novel observer design methods to handle the additional output measurements. The first one can be viewed as an extension of the standard high-gain observer by introducing a weighting matrix as a tuning parameter, while the second method, which can be viewed as an alternative method, exploits jointly the high-gain methodology and the LPV/LMI technique to overcome some limitations related to the first design method. The proposed methods are applied to a vehicle trajectory estimation problem using the well-known kinematic model. The efficiency of the estimation using both proposed methods and a comparative study between them are provided.
|
|
15:45-16:00, Paper FrC10.2 | Add to My Program |
Data-Driven Gain Scheduling Control of Linear Parameter-Varying Systems Using Quadratic Matrix Inequalities |
|
Miller, Jared | Northeastern University |
Sznaier, Mario | Northeastern University |
Keywords: Linear parameter-varying systems, Uncertain systems, LMIs
Abstract: This paper synthesizes a gain-scheduled controller to stabilize all possible Linear Parameter-Varying (LPV) plants that are consistent with measured input/state data records. Inspired by prior work in data informativity and LTI stabilization, a set of Quadratic Matrix Inequalities is developed to represent the noise set, the class of consistent LPV plants, and the class of stabilizable plants. The bilinearity between unknown plants and `for all' parameters is avoided by vertex enumeration of the parameter set. Effectiveness and computational tractability of this method is demonstrated on example systems.
|
|
16:00-16:15, Paper FrC10.3 | Add to My Program |
Stabilization of a Class of Singularly Perturbed Switched Systems |
|
de Souza, Ryan P. C. | Toulouse INP/LAPLACE/UNIVERSITE DE TOULOUSE |
Kader, Zohra | Laplace, INPT-ENSEEIHT |
Caux, Stéphane | LAPLACE-INPT/ENSEEIHT |
Keywords: Switched systems, Stability of hybrid systems, LMIs
Abstract: In this paper, we address the control of a class of switched systems cast in the framework of singularly perturbed systems. The class of switched systems that we deal with here is a particular case of switched affine systems where the state matrices are the same for all modes. These systems have been studied in the literature, wherein control design is carried out by solving Linear Matrix Inequalities (LMIs). However, the presence of the small parameter epsilon , characteristic of singularly perturbed systems, in the dynamical equation introduces numerical stiffness. To the best of the authors' knowledge, these issues have not been addressed in the literature for the class of switched systems studied here. We propose an epsilon -dependent controller stabilizing the system and also an epsilon -independent controller, in the case where the parameter epsilon is not well-known. The design of these control laws is based on LMIs that do not present the ill-conditioning linked to epsilon . The proposed approach is illustrated by simulation results.
|
|
16:15-16:30, Paper FrC10.4 | Add to My Program |
Robustness and Convergence Analysis of First-Order Distributed Optimization Algorithms Over Subspace Constraints |
|
Marquis, Dennis | Virginia Tech |
Abou Jaoude, Dany | American University of Beirut |
Farhood, Mazen | Virginia Tech |
Woolsey, Craig | Virginia Tech |
Keywords: Optimization algorithms, LMIs, Robust control
Abstract: This paper extends algorithms that solve the distributed consensus problem to solve the more general problem of distributed optimization over subspace constraints. Leveraging the integral quadratic constraint framework, we analyze the performance of these generalized algorithms in terms of worst-case robustness and convergence rate. The utility of our framework is demonstrated by showing how one of the extended algorithms, originally designed for consensus, is now able to solve a multitask inference problem.
|
|
FrC11 Regular Session, Aqua Salon AB |
Add to My Program |
Networked Control Systems III |
|
|
Chair: Garcia, Eloy | Air Force Research Laboratory |
Co-Chair: Rabi, Maben | Østfold University College |
|
15:30-15:45, Paper FrC11.1 | Add to My Program |
Estimating a Scalar Log-Concave Random Variable, Using a Silence Set Based Probabilistic Sampling |
|
Rabi, Maben | Østfold University College |
Wu, Junfeng | The Chinese Unviersity of Hong Kong, Shenzhen |
Singh, Vyoma | IIT Mandi |
Johansson, Karl H. | KTH Royal Institute of Technology |
Keywords: Networked control systems, Estimation, Control over communications
Abstract: We study the probabilistic sampling of a random variable, in which the variable is sampled only if it falls outside a given set, which is called the silence set. This helps us to understand optimal event-based sampling for the special case of IID random processes, and also to understand the design of a sub-optimal scheme for other cases. We consider the design of this probabilistic sampling for a scalar, log-concave random variable, to minimize either the mean square estimation error, or the mean absolute estimation error. We show that the optimal silence interval: (i) is essentially unique, and (ii) is the limit of an iterative procedure of centering. Further we show through numerical experiments that super-level intervals seem to be remarkably near-optimal for mean square estimation. Finally we use the Gauss inequality for scalar unimodal densities, to show that probabilistic sampling gives a mean square distortion that is less than a third of the distortion incurred by periodic sampling, if the average sampling rate is between 0.3 and 0.9 samples per tick.
|
|
15:45-16:00, Paper FrC11.2 | Add to My Program |
Asynchronous Dynamic Quantization for Nonlinear Systems with One-Bit Data Transmission |
|
Almakhles, Dhafer J | Prince Sultan University |
Abdelrahim, Mahmoud | Prince Sultan Univeristy |
Keywords: Networked control systems, Quantized systems, Variable-structure/sliding-mode control
Abstract: This paper investigates the problem of asynchronous dynamic quantization for nonlinear systems with unknown initial conditions and subject to external disturbances and delays. We propose a novel two-level dynamic quantizer that only depends on the sign of the quantization error to quantize the actual input signal. Building on the sliding mode approach, the proposed quantizer is enable to capture the state/input in a finite time and maintains the quantization error bounded after capturing. Sufficient conditions are provided to ensure the closed-loop stability in terms of Lyapunov functions. Furthermore, the robustness of the quantization policy with respect to external disturbances and time delays is also investigated. The effectiveness of the approach is demonstrated through a numerical example.
|
|
16:00-16:15, Paper FrC11.3 | Add to My Program |
Large Population Games with Timely Scheduling Over Constrained Networks |
|
Aggarwal, Shubham | University of Illinois, Urbana Champaign |
Zaman, Muhammad Aneeq uz | UIUC |
Bastopcu, Melih | University of Illinois Urbana Champaign |
Basar, Tamer | Univ of Illinois, Urbana-Champaign |
Keywords: Networked control systems, Mean field games, Decentralized control
Abstract: In this paper, we consider a discrete-time multi-agent system involving N cost-coupled networked rational agents solving a consensus problem, and a central Base Station (BS), scheduling agent communications over a network. Due to an average bandwidth constraint on the number of transmissions, the BS can let at most Rd < N agents to access their state information through the network on average. For the scheduling problem, we propose a novel weighted age of information (WAoI) metric. Then, under standard information structures, we are able to separate the estimation and control problems for each agent. We first solve an unconstrained MDP problem and then compute an optimal policy for the original problem using the solution to the former problem. Next, we solve the consensus problem using the mean-field game framework wherein we first design decentralized control policies for a limiting case of the N-agent system as N tends to infinity, and prove the existence of a unique mean-field equilibrium. Consequently, we show that the obtained equilibrium policies constitute an approximate Nash equilibrium for the finite-agent system. Finally, we validate the performance of both the scheduling and the control policies through numerical simulations.
|
|
16:15-16:30, Paper FrC11.4 | Add to My Program |
Asynchronous Dynamic Quantization for Nonlinear Systems with One-Bit Data Transmission |
|
Almakhles, Dhafer J | Prince Sultan University |
Abdelrahim, Mahmoud | Prince Sultan Univeristy |
|
16:30-16:45, Paper FrC11.5 | Add to My Program |
Output Regulation of Nonlinear Systems by an Emulation-Based Approach |
|
Wu, Jieshuai | Beijing Institute of Technology |
Lu, Maobin | Beijing Institute of Technology |
Deng, Fang | Beijing Institute of Technology |
Chen, Jie | Beijing Institute of Technology |
Keywords: Output regulation, Networked control systems, Uncertain systems
Abstract: In this paper, we investigate the semi-global robust output regulation problem of a class of nonlinear networked control systems by an emulation approach. We propose a class of sampled-data control laws to solve this problem. In particular, by the emulation approach, we first develop a class of sampled-data dynamic output feedback control laws. Then, based on the internal model principle, we convert the semiglobal robust output regulation problem into a semi-global robust stabilization problem of an augmented hybrid system composed of the internal model and the original system. Next, we show that semi-global robust stabilization of the augmented hybrid system can be achieved by a sampled-data control law and thus leading to the solution of the semi-global robust output regulation problem. Finally, an example is given to illustrate our control approach.
|
|
FrC12 Regular Session, Aqua Salon C |
Add to My Program |
Adaptive Systems |
|
|
Chair: Tanner, Herbert G. | University of Delaware |
Co-Chair: Li, Perry Y. | Univ. of Minnesota |
|
15:30-15:45, Paper FrC12.1 | Add to My Program |
Receding Horizon Cost-Aware Adaptive Sampling for Environmental Monitoring |
|
Westermann, Johannes | Otto Von Guericke Universität Magdeburg |
Mayer, Jana | Karlsruhe Institute of Technology |
Petereit, Janko | Fraunhofer IOSB |
Noack, Benjamin | Otto Von Guericke University Magdeburg (OVGU) |
Keywords: Statistical learning, Robotics, Adaptive systems
Abstract: In this paper, environmental monitoring by mobile robots is considered, where expensive or time-consuming sampling has to be carried out in order to obtain a metamodel of the phenomenon investigated. Due to limited resources, often not only a limited number of samples can be taken, but also the cost and time of the traveled distance between the sample points must be considered. We present an adaptive sampling method that greatly reduces the robot's travel costs for all common sampling criteria with minimal impact on model accuracy. This is achieved by predicting future sample points based on virtual sampling over a horizon in each iteration of the algorithm and suggesting a next sample point after a cost optimization. The algorithm is simulatively evaluated for application to global exploration and reconstruction of unknown phenomena on a variety of randomly generated henomena. It is shown that our method vastly outperforms standard adaptive sampling.
|
|
15:45-16:00, Paper FrC12.2 | Add to My Program |
Random-Walk Elimination in Numerical Integration of Sensor Data Using Adaptive Input Estimation |
|
Sanjeevini, Sneha | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive systems, Estimation, Kalman filtering
Abstract: Numerical integration of measured signals is challenging due to sensor noise, where sensor bias leads to a spurious ramp, and white noise leads to random-walk divergence. This paper presents a novel approach to numerical integration of sensor data based on adaptive input estimation. In particular, retrospective cost input estimation (RCIE) is applied to a one-step-delayed differentiator model to estimate the unknown input, which is the desired integral of the output. Numerical examples show that, for harmonic signals corrupted by white noise, RCIE integration eliminates the random walk that arises from standard numerical integration.
|
|
16:00-16:15, Paper FrC12.3 | Add to My Program |
Error Bounds for Native Space Embedding Observers with Operator-Valued Kernels |
|
Burns, John A | Virginia Tech |
Guo, Jia | Georgia Institute of Technology |
Kurdila, Andrew J. | Virginia Tech |
Paruchuri, Sai Tej | Lehigh University |
Wang, Haoran | Virginia Tech |
Keywords: Adaptive systems, Learning, Identification
Abstract: This paper derives new rates of convergence for observers for a class of uncertain systems governed by nonlinear ODEs. We assume that the generally nonlinear function appearing in the ODEs that represents the unknown dynamics is an element of a vector-valued reproducing kernel Hilbert space mathbb{H} (RKHS) that is induced by an operator-valued kernel. The vector-valued RKHS embedding method described in the paper yields a nonparametric adaptive estimator that takes the form of distributed parameter system (DPS). The original ODEs in mathbb{R}^d are thus embedded in a product space mathbb{R}^dtimesmathbb{H} in which state and functional uncertainty estimates evolve. We first discuss the well-posedness of the DPS formulation, and subsequently describe an approximation scheme in finite-dimensional subspaces based on certain types of history dependent bases. We derive sufficient conditions that ensure the consistency of the finite-dimensional approximation scheme, and further derive rates of convergence in some particular cases when the samples that define the scattered bases are dense in some sufficiently regular and invariant subset of the observation space. A numerical example is given to illustrate the qualitative behavior of implementations of the theoretical results derived in the paper.
|
|
16:15-16:30, Paper FrC12.4 | Add to My Program |
Online Learning and Control of an Internal Combustion Engine for UAS Using Simplex Tessellation and Recursive Least Squares |
|
Tranquillo, Holden | University of Minnesota |
Sonstegard, Jack | University of Minnesota |
Kim, Kenneth | DEVCOM Army Research Laboratory |
Kweon, Chol-Bum | DEVCOM Army Research Laboratory |
Li, Perry Y. | Univ. of Minnesota |
Keywords: Learning, Adaptive systems, Aerospace
Abstract: As Unmanned Aircraft Systems demand more fuel flexibility, engine control for these systems will need to adapt to unknown fuels. To do so, a computationally efficient method for the online learning and adaptive control of an engine based on real-time input and output engine measurements is developed. The method, based on recursive least-squares estimation and multi-dimensional piecewise-linear splines, has been developed for systems with one input (injection timing), two inputs (injection timing, glow-plug power/fuel mass), as well as for general systems with arbitrary dimensions. The online learning model in turn generates an adaptive feedforward signal which is combined with integral feedback with decoupling control to achieve a desired combustion phasing (CA50) and other outputs such as mean effective pressure (MEP) or power.
|
|
16:30-16:45, Paper FrC12.5 | Add to My Program |
Extremum Seeking Regulator for a Class of Nonlinear Systems with Unknown Control Direction |
|
Wang, Shimin | Queen's University |
Guay, Martin | Queens University |
Keywords: Output regulation, Adaptive systems, Nonlinear output feedback
Abstract: Nussbaum function techniques are commonly used to investigate output regulation problems for various systems subject to unknown control direction. However, their implementation often leads to large overshoots when the initial estimates of the control direction are wrong, which yields systems with poor transient performance. This study proposes an extremum-seeking control approach to overcome the need for Nussbaum-type functions. The approach yields control laws that can handle the robust practical output regulation problem for a class of nonlinear systems subject to an unknown time-varying control direction. The stability of the design is proven using a Lie bracket averaging technique. It is shown that uniform ultimate boundedness of the closed-loop signals is guaranteed. Finally, a simulation study is performed involving a chaotic control problem for the generalized Lorenz system with an unknown time-varying coefficient to illustrate the validity of the theoretical results.
|
|
FrC13 Invited Session, Aqua Salon D |
Add to My Program |
Autonomous Satellite Control Systems |
|
|
Chair: Phillips, Sean | Air Force Research Laboratory |
Co-Chair: Petersen, Chris | University of Florida |
Organizer: Petersen, Chris | University of Florida |
Organizer: Phillips, Sean | Air Force Research Laboratory |
Organizer: Soderlund, Alexander | The Ohio State University |
|
15:30-15:45, Paper FrC13.1 | Add to My Program |
Design of Super-Twisting Sliding Mode Observer for LISA Mission Micro-Meteoroid Impact (I) |
|
Ruggiero, Dario | Politecnico Di Torino |
Capello, Elisa | Politecnico Di Torino, CNR-IEIIT |
Novara, Carlo | Politecnico Di Torino |
Grzymisch, Jonathan | European Space Agency |
Keywords: Observers for nonlinear systems, Estimation, Autonomous systems
Abstract: LISA (Laser Interferometer Space Antenna) is a space mission, under study by the European Space Agency (ESA) and other institutions, with the objective of detecting, observing, and measuring gravitational waves. It consists of a triangle constellation of three spacecraft connected through bi-directional laser links to measure gravitational waves by means of interferometry. During the Science mode, also called Drag-free mode, micrometeoroids may collide with the spacecraft surface, generating impulsive forces and torques, which can cause the loss of links. Impulsive disturbances may lead to a significant performance degradation and even to instability, especially in the presence of actuator saturations. In this paper, a Navigation algorithm based on a sliding mode observer is proposed to improve the closed-loop system stability properties, allowing the spacecraft to quickly restore the laser links, safely returning to the Science mode. Simulation results show the effectiveness of the proposed solution. Moreover, a comparison with classical methods is carried out, based on the combination of an Extended Kalman Filter and an Anti-windup strategy.
|
|
15:45-16:00, Paper FrC13.2 | Add to My Program |
Attitude Control System Design for Multibody Flexible Spacecraft (I) |
|
Tagliani, Gianluca | Politecnico Di Torino |
Mancini, Mauro | Politecnico Di Torino |
Capello, Elisa | Politecnico Di Torino, CNR-IEIIT |
Keywords: Spacecraft control, Flexible structures, Variable-structure/sliding-mode control
Abstract: This paper considers control design and model validation for attitude dynamics of a multi-body flexible spacecraft. The spacecraft is designed in MSC Adams with a main rigid body and four deployable flexible solar panels. MSC Adams allows to simulate the attitude dynamics of the satellite, taking into account: (i) the disturbances due to both flexible dynamics and torques exchanged during the solar panels deployment and (ii) the vibrations of the flexible panels due to attitude maneuvers. In addition, MSC Adams gives the parameters of the multibody spacecraft for each configuration it can assume, thus simplifying the design of the controller. In fact, those parameters are used to design a robust Sliding Mode Control (SMC) able to manipulate the perturbed, uncertain, and time-varying attitude dynamics of the spacecraft. Numerical simulations are performed to show the effectiveness of the proposed approach.
|
|
16:00-16:15, Paper FrC13.3 | Add to My Program |
Autonomous Information Gathering Guidance for Distributed Space Systems with Optical Sensors (I) |
|
Greaves, Jesse | University of Colorado Boulder |
Scheeres, Daniel J. | The University of Colorado |
Keywords: Spacecraft control, Autonomous systems, Vision-based control
Abstract: Spacecraft to spacecraft tracking using optical sensors is a promising approach to autonomous navigation of distributed space systems. Previous works have shown that optical spacecraft to spacecraft tracking can provide an absolute navigation estimate for all vehicles in the distributed system, but the relative range between the spacecraft is often weakly observable. The observability issues motivate the development of guidance capabilities to gather information on a desired sub-space of the state, such as relative range, to ensure accurate state estimation. This paper starts by developing a simplified model and heuristic policy for information gathering with optical measurements. Then a general analytic guidance policy for information gathering is derived. The guidance methods are tested via a covariance analysis in the cislunar environment with an optical sensor. In all test scenarios the analytic method is fast to calculate and nearly optimal, making it suitable as an autonomous guidance algorithm for information gathering.
|
|
16:15-16:30, Paper FrC13.4 | Add to My Program |
Constellation Phasing of Spacecraft in Near-Circular, In-Plane Orbits Using Low-Thrust Trajectory Optimization (I) |
|
Sin, Emmanuel | University of California, Berkeley |
Arcak, Murat | University of California, Berkeley |
Keywords: Spacecraft control, Aerospace, Optimal control
Abstract: We present a trajectory optimization problem to be used in the planning of orbital maneuvers for spacecraft operating in a constellation. The 3-DOF orbital motion of each spacecraft, governed by central body gravity and low-thrust propulsion, is expressed in a planet-centered inertial frame with Cartesian state vectors. Path constraints on each spacecraft include bounds on altitude, thrust magnitude, and propellant consumption. Terminal constraints enforce all spacecraft to achieve near-circular motion in the same orbital plane with desired altitude and in-plane angular spacing between spacecraft. The numerical example in this paper considers a cluster of spacecraft deployed into the same parking orbit by a launch vehicle. We apply our problem formulation to perform simultaneous orbit phasing and station-keeping of the spacecraft in minimum-time. The problem is approached using recent advances in sequential convex programming (SCP) and the solution is applied in simulation to verify satisfaction of constraints.
|
|
16:30-16:45, Paper FrC13.5 | Add to My Program |
Strong Observability of LTV Systems with Feedthrough and On-Orbit Reconnaissance and Evasion Applications (I) |
|
Woodford, Nathaniel | Utah State University |
Harris, Matthew W. | Utah State University |
Keywords: Aerospace, Time-varying systems, Control applications
Abstract: This paper considers linear time-varying control systems with feedthrough. A necessary and sufficient condition for strong observability (also known as observability with unknown inputs) is stated in terms of the observability matrix and newly redefined invertibility matrix. This is followed by an observer for pointwise reconstruction of the state from the output and its time derivatives. A variable-time weakly unobservable subspace is then introduced such that the rank test can be recast in terms of this subspace and the kernel of a certain matrix. The subspace characterization leads to results on the existence and construction of unobservable state and control functions. The theoretical results are illustrated in an on-orbit reconnaissance application. Within the context of a time-varying relative orbital motion model, it is shown that strong observability is satisfiable with any constant or bounded feedthrough matrix. In the absence of strong observability, control functions to evade observation are constructed.
|
|
16:45-17:00, Paper FrC13.6 | Add to My Program |
Consensus Over Clustered Networks Using Output Feedback and Asynchronous Inter-Cluster Communication (I) |
|
Nino, Cristian F. | University of Florida |
Zegers, Federico | Johns Hopkins University Applied Physics Laboratory |
Phillips, Sean | Air Force Research Laboratory |
Dixon, Warren E. | University of Florida |
Keywords: Networked control systems, Hybrid systems, Lyapunov methods
Abstract: This paper develops a method to yield state consensus and state reconstruction for a clustered multi-agent system (C-MAS). The agents within the network are organized into disjoint clusters, where each cluster induces a connected sub-graph. Agents contained within the same cluster are capable of communicating continuously with their neighbors. Between some cluster pairs, there exists an inter-cluster, where agents contained within the same inter-cluster can intermittently communicate with their neighbors. In addition, the communication between distinct inter-clusters may be asynchronous. Since we assume no agent can completely measure its own state, a model-based observer utilizing intermittent output feedback is developed to facilitate state reconstruction. The combination of continuous-time dynamics with intermittent communication and sensing is modeled as a hybrid system. The state consensus and state reconstruction problems are formulated as set stabilization problems for hybrid dynamical systems, where Lyapunov-based stability analyses show that the state consensus and state reconstruction sets are globally exponentially stable.
|
|
FrC14 Regular Session, Aqua 311A |
Add to My Program |
Sensor Fusion |
|
|
Chair: N'Doye, Ibrahima | King Abdullah University of Science and Technology (KAUST) |
|
15:30-15:45, Paper FrC14.1 | Add to My Program |
An Online Learning Based Extended Kalman Filtering Approach for Intelligent Vehicles Localization During Short-Term GNSS Outages |
|
Li, Zipeng | Tongji University |
Guo, Yafeng | Tongji University |
Wang, Jun | Tongji University |
Keywords: Sensor fusion, Estimation, Autonomous systems
Abstract: Real-time and accurate localization is a prerequisite for intelligent vehicles control. GNSS is an important information source for localization. However, GNSS signal may be short-term blocked by large buildings and tunnels inevitably. Therefore, it is a practical issue to retain localization accuracy during short-term GNSS outages. By improving the modeling accuracy of the vehicle motion and sensor measurements, localization is expected to maintain a satisfactory performance during GNSS short-term outages. In this paper, dual neural extended kalman filtering approach (DN-EKF) is introduced to compensate for the unmodeled errors of vehicle motion and statistical modeling error of sensor measurement noise, and consequently improves estimator accuracy. Experiments on our test platform have demonstrated the effectiveness of proposed method during GNSS short-term outages. It is worth noting that the proposed method in this paper is open-ended. Therefore, it can be easily integrated with other solutions to further improve the performance of localization.
|
|
15:45-16:00, Paper FrC14.2 | Add to My Program |
INS-GNSS Navigation for Large Attitude Uncertainties with the Matrix Fisher-Gaussian Distribution |
|
Wang, Weixin | George Washington University |
Lee, Taeyoung | George Washington University |
Keywords: Sensor fusion, Estimation, Robotics
Abstract: In this paper, we present a new recursive Bayesian filter for loosely coupled INS-GNSS navigation to handle large attitude uncertainty. The filter replaces the Gaussian distribution assumed in Kalman filters by the matrix Fisher-Gaussian (MFG) distribution, which is defined intrinsically on the product manifold of the three dimensional special orthogonal group and the Euclidean space of an arbitrary dimension. The MFG models large attitude uncertainty accurately, which can be frequently encountered in robot and pedestrian localization, for example when the robot or person enters a building where the heading direction is unobservable. It is validated by simulation studies illustrating that the proposed filter has a substantially faster convergence rate, when compared with the extended Kalman filter.
|
|
16:00-16:15, Paper FrC14.3 | Add to My Program |
Graduated Moving Window Optimization As a Flexible Framework for Multi-Object Tracking |
|
Funk, Christopher | Otto Von Guericke University Magdeburg, Institute for Intelligen |
Noack, Benjamin | Otto Von Guericke University Magdeburg (OVGU) |
Keywords: Sensor fusion, Optimization
Abstract: Continuous optimization methods for multiple object tracking allow to jointly estimate continuous object trajectories and perform implicit data association. However, the local minima that arise from including data association in a continuous optimization problem pose challenges. In addition, optimization is usually performed either over a fixed or an indefinitely growing time frame. This either discards valuable past information or is computationally unsustainable. Hence, in this work, a flexible continuous optimization based framework for multiple object tracking that accounts for these issues is proposed. The framework provides a unified approach to not only include data association but also multiple motion models and temporary interactions between objects in a continuous optimization problem. It leverages the concept of graduated optimization, a heuristic, which allows to avoid local minima. The proposed framework's performance is benchmarked on a synthetic dataset, showing its capabilities and indicating areas of possible improvement.
|
|
16:15-16:30, Paper FrC14.4 | Add to My Program |
OGDM: An Observability Guaranteed Distributed Edge Sensing Method for Industrial Cyber-Physical Systems |
|
Wang, Shigeng | Shanghai Jiao Tong University |
Ji, Zhiduo | Shanghai Jiao Tong University |
Chen, Cailian | Shanghai Jiao Tong University |
Keywords: Sensor fusion, Sensor networks
Abstract: The new generation of industrial cyber-physical systems (ICPS) supported by the edge computing technology enables efficient distributed sensing under massive data volumes and frequent transmissions. Observability is essential to obtain good sensing performance, and most of existing sensing works directly assume that the system is observable. However, it is difficult to satisfy the assumption with the increasingly expanded network scale and dynamic scheduling of devices. To solve this problem, we propose an observability guaranteed distributed method (OGDM) for edge sensing with the cooperation of sensors and edge computing units (ECUs). We analyze the relationship between sensor scheduling and observability based on the network topology and graph signal processing (GSP) technology. In addition, we transform the observability condition into a convex form and take into account sensing error and energy consumption for optimization. Finally, our algorithm is applied to estimate the slab temperature in the hot rolling process. The effectiveness is verified by simulation results.
|
|
16:30-16:45, Paper FrC14.5 | Add to My Program |
Distributed Interval Type-2 Fuzzy Filtering for Wireless Sensor Networks with Intermittent Measurements |
|
Hu, Zhijian | Nanyang Technological University |
Su, Rong | Nanyang Technological University |
Wang, Yujia | Harbin Institute of Technology |
Xu, Zeyuan | Harbin Institute of Technology |
Wang, Bohui | Nanyang Technological University |
Lu, Yun | Nanyang Technological University |
Keywords: Sensor networks, Filtering, Fuzzy systems
Abstract: Though wireless sensor networks (WSNs) help to enhance data fusion accuracy, measurement exchanges between sensors are not always reliable due to inherent open communication channels. In this paper, a distributed interval type-2 (IT2) fuzzy filter is presented in the context of WSNs with intermittent measurements. Firstly, IT2 fuzzy models are employed to formulate one type of nonlinear systems with parameter uncertainties. Then, dual random data packet dropouts phenomena are considered, including the measurements transmitting from sensors to data fusion centers, and the measurements transmitting from data fusion centers to distributed filters. Bernoulli variables are adopted to depict the random data packet dropouts. Furthermore, to guarantee the robust mean-square asymptotic stability of the filtering error system, less conservative sufficient conditions are derived to seek for distributed filter gains. Finally, simulation results on Henon mapping systems with parameter uncertainties verify the robustness of the presented distributed fuzzy filter for WSNs with intermittent measurements.
|
|
16:45-17:00, Paper FrC14.6 | Add to My Program |
Personalized and Energy-Efficient Health Monitoring: A Reinforcement Learning Approach |
|
Eden, Batchen | Tel Aviv University |
Bistritz, Ilai | Stanford University |
Bambos, Nicholas | Stanford University |
Ben-Gal, Irad | Tel-Aviv University |
Khmelnitsky, Eugene | Tel Aviv University |
Keywords: Sensor networks, Healthcare and medical systems, Machine learning
Abstract: We consider a network of controlled sensors that monitor the unknown health state of a patient. We assume that the health state process is a Markov chain with a transition matrix that is unknown to the controller. At each timestep, the controller chooses a subset of sensors to activate, which incurs an energy (i.e., battery) cost. Activating more sensors improves the estimation of the unknown state, which introduces an energy-accuracy tradeoff. Our goal is to minimize the combined energy and state misclassification costs over time. Activating sensors now also provides measurements that can be used to learn the model, improving future decisions. Therefore, the learning aspect is intertwined with the energy-accuracy tradeoff. While reinforcement learning (RL) is often used when the model is unknown, it cannot be directly applied in health monitoring since the controller does not know the (health) state. Therefore, the monitoring problem is a partially observable Markov decision process (POMDP) where the cost feedback is also only partially available since the misclassification cost is unknown. To overcome this difficulty, we propose a monitoring algorithm that combines RL for POMDPs and online estimation of the expected misclassification cost based on a hidden Markov model (HMM). We show empirically that our algorithm achieves comparable performance with a monitoring system that assumes a known transition matrix and quantizes the belief state. It also outperforms the model-based approach where the estimated transition matrix is used for value iteration. Thus, our algorithm can be useful in designing energy-efficient and personalized health monitoring systems.
|
|
FrC15 Regular Session, Aqua 311B |
Add to My Program |
Delay Systems |
|
|
Co-Chair: Yao, Bin | Purdue University |
|
15:30-15:45, Paper FrC15.1 | Add to My Program |
Strong Left-Invertibility and Strong Input-Observability of Nonlinear Time-Delay Systems |
|
Chen, Yahao | Centrale Nantes, LS2N UMR CNRS 6004, France |
Ghanes, Malek | Centrale Nantes |
Barbot, Jean Pierre | ENSEA |
Keywords: Delay systems, Algebraic/geometric methods, Observers for nonlinear systems
Abstract: In this paper, we study the problem of unknown inputs reconstruction for nonlinear time-delay systems. First we define two notions called strong left-invertibility and strong input-observability and the word ``strong'' is to address the causality properties of those two notions. Then necessary and sufficient conditions for the strong left-invertibility and the strong input-observability are given under the algebraic framework. We find that a sequence of inputs submodules plays an important role for the strong left-invertibility of time-delay systems. A structure algorithm is provided to construct that sequence and to formulate an input reconstructor. At last, several examples are given to illustrate how to check the strong left-invertibility and the strong input-observability by applying the proposed structure algorithm, and to show how to recover the inputs via causal outputs and the initial value functions of states (strong left-invertibility) or only via causal outputs (strong input-observability).
|
|
15:45-16:00, Paper FrC15.2 | Add to My Program |
Delay Estimation for Nonlinear System with Unknown Output Delay |
|
Dam, Quang Truc | Normandy University, UNIROUEN, ESIGELEC, IRSEEM |
Thabet, Rihab El Houda | IRSEEM ESIGELEC |
Ahmed Ali, Sofiane | IBISC, Evry-Val-d’Essonne University, Universite Paris-Saclay, E |
Guerin, Francois | University Le Havre |
Khemmar, Redouane | ESIGELEC, IRSEEM |
Keywords: Delay systems, Identification, Observers for nonlinear systems
Abstract: In this paper, the problems of delay identifiability and delay estimation for a nonlinear systems subject to constant unknown output delay are studied. Usually, the estimation of such delay is based on a monotonic condition which is hard to satisfy in the case of nonlinear systems. To deal with this open and interesting problem and overcome this issue, a change of coordinates is introduced in this paper to transform the nonlinear system to the triangular form. Then, the Newton method and a finite-time observer are used to identify the unknown but bounded delay of the nonlinear systems. The convergence of the proposed observer is proved and the effectiveness of the proposed method is illustrated through simulation results of an Electro-Hydraulic Actuator (EHA) system.
|
|
16:00-16:15, Paper FrC15.3 | Add to My Program |
Event-Triggered Control under Unknown Input and Unknown Measurement Delays Using Interval Observers |
|
Malisoff, Michael | Louisiana State University |
Mazenc, Frederic | Inria Saclay |
Barbalata, Corina | Louisiana State University |
Keywords: Delay systems, Linear systems, Stability of linear systems
Abstract: We provide a new input-to-state stabilizing event-triggered feedback design for linear systems with unknown input delays, unknown measurement delays, and unknown additive disturbances. Our trigger times are computed using only the matrices defining the system and time-lagged sampled state values. We use the theory of positive systems, interval observers, and a vector version of Halanay’s inequality. We illustrate our method using a marine robotic model.
|
|
16:15-16:30, Paper FrC15.4 | Add to My Program |
Adaptive Robust Tracking Control for First-Order Linear Systems with Input Delay and Lipschitz Nonlinear Disturbance |
|
Lai, Han | Zhejiang University |
Zhu, Yang | Zhejiang University |
Chen, Zheng | Zhejiang University |
Yao, Bin | Purdue University |
Keywords: Adaptive control, Delay systems, Robust control
Abstract: In this paper, an adaptive robust tracking controller is proposed for first-order linear systems with input delay, unknown plant parameters and Lipschitz nonlinear disturbance. The controller employs the predictor feedback to compensate for the effect of input delay, the robust feedback to deal with uncertainties, the model compensation for trajectory tracking, and projection-type adaptation laws are designed. By the stability analysis with a Lyapunov function in integral form, the closed-loop system is locally stable in the sense that the tracking error is bounded above by a known function which exponentially converges to a specified accuracy provided that the initial states and control parameters meet certain conditions. Furthermore, when the disturbance is reduced to a constant, the controller guarantees the semi-global stability that the tracking error asymptotically converges to zero. Simulation results demonstrate the effectiveness of the proposed controller.
|
|
16:30-16:45, Paper FrC15.5 | Add to My Program |
Task-Space Teleoperation with Time-Delays and without Velocity Measurements Via a Bounded Controller |
|
Aldana, Carlos Ivan | University of Guadalajara (UDG) |
Garcia-Lopez, Karina A. | Universidad De Guadalajara |
Nuño, Emmanuel | University of Guadalajara |
Cruz-Zavala, Emmanuel | University of Guadalajara (UdG) |
Perez-Cisneros, Marco A. | University of Guadalajara |
Keywords: Robotics, Control of networks
Abstract: This paper reports a novel controller for robot teleoperation systems in the task-space. The local and the remote robots are kinematically and dynamically different and they are modeled as Euler-Lagrange agents. We consider the realistic scenario where the robot actuators are not ideal and thus they are prone to saturation. Moreover, velocity measurements are not available and variable time-delays arise in the communications. The human operator and the remote environment are assumed to be passive. The controller is dynamical and it consists of a gravity cancellation plus a plant-controller interconnection term. The controller dynamics is of second-order and damping is injected to ensure convergence. Unit-quaternions are used to obtain a singularity-free representation of the orientation. When the human and the environment forces are zero, then we prove that the pose of both robots converges to a common pose. Experimental results of the proposed scheme are provided to illustrate the controller performance.
|
|
FrC16 Regular Session |
Add to My Program |
Aerospace |
|
|
Chair: Mukherjee, Dwaipayan | Indian Institute of Technology Bombay |
Co-Chair: Sinha, Abhinav | University of Texas at San Antonio |
|
15:30-15:45, Paper FrC16.1 | Add to My Program |
3-D Nonlinear Guidance Law for Target Circumnavigation |
|
Sinha, Abhinav | University of Texas at San Antonio |
Cao, Yongcan | University of Texas, San Antonio |
Keywords: Aerospace, Autonomous systems, Control applications
Abstract: In this letter, we address the problem of circumnavigating a stationary target using a single vehicle. Unlike most existing results wherein the target is encircled in a two-dimensional plane, we focus on devising a guidance strategy that enables a vehicle to encircle a target in a three-dimensional space using the relative information between the vehicle and the target. In particular, we assume that the vehicle has lateral acceleration capabilities only and that the radial acceleration is unavailable, thereby making the proposed design favorable for a class of aerial vehicles (e.g., aircraft and fixed-wing UAVs, which cannot hover and have to maneuver constantly). Therefore, the vehicle's steering controls are its lateral acceleration components in the pitch and yaw channels. In addition, we also consider nonlinear, coupled three-dimensional engagement kinematics between the vehicle and the target to preserve the inherent coupling between various channels and to achieve satisfactory control precision even if the channels are strongly coupled. Furthermore, we minimize a relevant weighted cost function to obtain the lateral acceleration components in the pitch and the yaw channels. We finally demonstrate the efficacy of our design via simulations.
|
|
15:45-16:00, Paper FrC16.2 | Add to My Program |
Biologically Plausible Robust Control with Neural Network Weight Reset for Unmanned Aircraft Systems under Impulsive Disturbances |
|
Rubio Scola, Ignacio | INTI - Conicet - National University of Rosario |
Garcia Carrillo, Luis Rodolfo | New Mexico State University |
Sornborger, Andrew T. | Los Alamos National Laboratory |
Hespanha, Joao P. | Univ. of California, Santa Barbara |
Keywords: Aerospace, Biologically-inspired methods, Spacecraft control
Abstract: Self-learning control techniques mimicking the functionality of the limbic system in the mammalian brain have shown advantages in terms of superior learning ability and low computational cost. However, accompanying stability analyses and mathematical proofs rely on unrealistic assumptions which limit not only the performance, but also the implementation of such controllers in real-world scenarios. In this work the limbic system inspired control (LISIC) framework is revisited, introducing three contributions that facilitate the implementation of this type of controller in real-time. First, an extension enabling the implementation of LISIC to the domain of SISO affine systems is proposed. Second, a strategy for resetting the controller's Neural Network (NN) weights is developed, in such a way that now it is possible to deal with piece-wise smooth references and impulsive perturbations. And third, for the case when a nominal model of the system is available, a technique is proposed to compute a set of optimal NN reset weight values by solving a convex constrained optimization problem. Numerical simulations addressing the stabilization of an unmanned aircraft system via the robust LISIC demonstrate the advantages obtained when adopting the extension to SISO systems and the two NN weight reset strategies.
|
|
16:00-16:15, Paper FrC16.3 | Add to My Program |
A Feedback-Feedforward Controller for Hybrid Flight Regimes in Transitioning Aerial Vehicles |
|
McIntosh, Kristoff | Rensselaer Polytechnic Institute |
Reddinger, Jean-Paul | DEVCOM Army Research Laboratory |
Mishra, Sandipan | Rensselaer Polytechnic Institute |
Keywords: Aerospace, Control applications, Autonomous systems
Abstract: This paper presents a guidance and control methodology for transitioning unmanned aerial vehicles (UAS) designed around hybrid flight, i.e., flight states purely in the transition regime. The control architecture, designed for a tailsitter vehicle, consists of a trajectory planner, an outer loop position controller, an inner loop attitude controller, and a control allocator. The trajectory planner uses a simplified vehicle model with aerodynamic and wake effects for generating optimal trajectories and associated aerodynamic feedforward information for minimum time transition between flight modes. The outer loop position controller then uses these approximate aerodynamic forces computed by the trajectory planner in feedforward along with feedback linearization of the outer loop dynamics. The inner loop attitude controller is a standard nonlinear dynamic inversion control law that generates the desired pitch, roll and yaw moments, which are then used to compute rotor angular velocity commands. We derive analytical conditions that guarantee robust stability of the outer loop position controller, in the presence of uncertainty in the feedforward aerodynamic force compensation. Finally, the performance of the control architecture is evaluated on a high fidelity flight dynamics simulation of a quadrotor biplane tailsitter for various transitioning flight missions that demand high maneuverability.
|
|
16:15-16:30, Paper FrC16.4 | Add to My Program |
Free Will Arbitrary Time Consensus-Based Cooperative Salvo Guidance Over Leader-Follower Network |
|
Pal, Rajib Shekhar | Indian Institute of Technology Bombay |
Kumar, Shashi Ranjan | Indian Institute of Technology Bombay |
Mukherjee, Dwaipayan | Indian Institute of Technology Bombay |
Keywords: Aerospace, Cooperative control
Abstract: In this paper, a cooperative salvo guidance strategy using free-will arbitrary time consensus over a leader-follower communication network is proposed. Guidance commands are derived considering nonlinear engagement kinematics and a system lag to account for the effect of interceptor autopilot, so as to capture realistic scenarios. The guidance schemes utilize the time-to-go estimates of all interceptors to achieve simultaneous target interception. The agreement among time-to-go of all interceptors is achieved within a fixed time, to which the interceptors' time-to-go converge within a settling time that is bounded above. This time-to-go, as well as the aforesaid bound on settling time, can be pre-specified arbitrarily independent of the initial conditions or the design parameters, which allows the interceptors to converge on a stationary target simultaneously at a predetermined impact time. Numerical simulations are presented to demonstrate the efficacy of the proposed guidance strategy.
|
|
16:30-16:45, Paper FrC16.5 | Add to My Program |
A UDE-Based Controller with Targeted Filtering for the Stabilization of a Fixed-Wing UAV in the Harrier Maneuver |
|
Wedage, Pravin | University of Toronto |
Liu, Hugh Hong-Tao | Univ. of Toronto |
Keywords: Aerospace, Robust control, Uncertain systems
Abstract: Autonomous aerobatic flight for fixed-wing aerial vehicles is studied. This paper proposes an uncertainty and disturbance estimator (UDE) based controller that attenuates the special effect of model uncertainty and external disturbances during the aerobatic harrier maneuver using a novel targeted filtering structure. Knowledge of the disturbance frequency content and the undisturbed system dynamics are used in filter design to improve disturbance rejection compared with standard UDE-based controllers with low-pass filtering structures. The controller performance is validated on a simulated model of a vehicle performing the low-speed, high angle-of-attack harrier aerobatic maneuver.
|
|
16:45-17:00, Paper FrC16.6 | Add to My Program |
PowerLine Unmanned Surfer (PLUS): Concept and Morphing Flight Dynamics |
|
Patel, Ujjval | Oklahoma State University |
Faruque, Imraan | University of Maryland |
Henry, Todd | US Army Research Laboratory |
Hrynuk, John | DEVCOM Army Research Lab |
Phillips, Francis | DEVCOM Army Research Laboratory |
Keywords: Flight control, Aerospace, Modeling
Abstract: Significant energetic challenges remain for long range, small unmanned aerial systems (UAS), and the potential to recover powerline energy would significantly increase range. This study investigates a long range fixed wing UAS that uses morphing aerodynamics to enable near proximity powerline flight. A bilinear flight dynamics model is developed incorporating generalized aerodynamic morphing, and a frequency-correspondence established to a characteristic powerline. The resulting feedforward control architecture is tested in simulation using a camber-actuated RQ-11 airframe, showing that the control approach results in several seconds of powerline contact and a required morphing range (11-13 % camber) within aerostructural feasibility expectations.
|
| |