| |
Last updated on July 17, 2019. This conference program is tentative and subject to change
Technical Program for Wednesday July 10, 2019
|
WeA01 Regular Session, Franklin 1 |
Add to My Program |
Robotics I |
|
|
Chair: Tanner, Herbert G. | University of Delaware |
Co-Chair: Liu, Yen-Chen | National Cheng Kung University |
|
10:00-10:20, Paper WeA01.1 | Add to My Program |
Adaptive Backstepping Tracking Control for Quadrotor Aerial Robots Subject to Uncertain Dynamics |
Ou, Tsung-Wei | National Cheng Kung University |
Liu, Yen-Chen | National Cheng Kung University |
Keywords: Robotics, Autonomous robots, Adaptive control
Abstract: In this paper, a backstepping controller is presented for quadrotor system to follow a predefined trajectory without the knowledge of dynamic parameters in the control algorithms. By dividing the quadrotor systems into several subsystems, the idea of nominal control input is presented to modify the quadrotor input force and torque. Subsequently, the backstepping control technique is developed for the nominal controls with the adaptive laws to estimate unknown dynamic parameters. Both the mass and moment of inertia are coped with by using adaptive laws. The stability and tracking performance of the proposed closed-loop system are proved by using Lyapunov theorem that the tracking errors converge to the origin asymptotically. Numerical examples are presented to show the quadrotor system tracking a desired trajectory efficiently.
|
|
10:20-10:40, Paper WeA01.2 | Add to My Program |
Movement Error Based Control for a Firm Touch of a Soft Somatosensitive Actuator |
Boivin, Megan | University of California Santa Cruz |
Milutinovic, Dejan | University of California, Santa Cruz |
Wehner, Michael | University of California Santa Cruz |
Keywords: Robotics, Control applications
Abstract: We propose a control architecture with the aim of providing a firm touch of a soft somatosensitive actuator (SSA) finger with an object. The two main components of the architecture are a reference tracking curvature controller and a force controller. The first one sets the finger in motion which is blocked if the finger comes into contact with an object. The result of such an event is that the finger bending is constrained, and the tracking error of the curvature controller increases. Once the error exceeds a predetermined threshold value, there is a switch from the reference tracking to the force controller, which maintains the finger in contact with the object. Therefore, the proposed architecture accounts not only for sensory data, but also for the error of the movement towards the touch. The proposed control architecture is illustrated with numerical simulations.
|
|
10:40-11:00, Paper WeA01.3 | Add to My Program |
Infrastructure-Free Multi-Robot Localization with Ultrawideband Sensors |
Guler, Samet | King Abdullah University of Science and Technology |
Abdelkader, Mohamed | King Abdullah University of Science & Technology |
Shamma, Jeff S. | KAUST |
Keywords: Robotics, Estimation, Multivehicle systems
Abstract: Swarm applications use motion capture system or GPS sensors as localization systems. However, motion capture systems provide local solutions, and GPS sensors are not reliable in occluded environments. For reliable and versatile operation in a swarm, robots must sense each other and interact locally. Motivated by this requirement, we propose an onboard localization framework for multi-robot systems. Our framework consists of an anchor robot with three ultrawideband (UWB) sensors and a tag robot with a single UWB sensor. The anchor robot utilizes the three UWB sensors as a localization infrastructure and estimates the tag robot's location by using its on-board sensing and computational capabilities solely, without explicit inter-robot communication. We utilize a dual Monte-Carlo localization approach to capture the agile maneuvers of the tag robot with acceptable precision. We validate the effectiveness of our algorithm with simulations as well as indoor and outdoor experiments on a two-drone setup. The proposed framework with the dual MCL algorithm yields accurate estimates for various speed profiles of the tag robot, outperforms the standard particle filter and extended Kalman filter, and suffice for a relative position maintenance application.
|
|
11:00-11:20, Paper WeA01.4 | Add to My Program |
Proprioceptive Robot Collision Detection through Gaussian Process Regression |
Dalla Libera, Alberto | University of Padova |
Tosello, Elisa | University of Padova |
Ghidoni, Stefano | University of Padova, Department of Information Engineering |
Pillonetto, Gianluigi | University of Padova |
Carli, Ruggero | University of Padova |
Keywords: Robotics, Machine learning, Grey-box modeling
Abstract: This paper proposes a proprioceptive collision detection algorithm based on Gaussian Regression. Compared to sensor-based collision detection and other proprioceptive algorithms, the proposed approach has minimal sensing requirements, since only the currents and the joint configurations are needed. The algorithm extends the standard Gaussian Process models adopted in learning the robot inverse dynamics, using a more rich set of input locations and an ad-hoc kernel structure to model the complex and non-linear behaviors due to frictions in quasi-static configurations. Tests performed on a Universal Robots UR10 show the effectiveness of the proposed algorithm to detect when a collision has occurred.
|
|
11:20-11:40, Paper WeA01.5 | Add to My Program |
On the Hybrid Kinematics of Tethered Mobile Robots |
Sebok, Michael | University of Delaware |
Tanner, Herbert G. | University of Delaware |
Keywords: Robotics, Hybrid systems, Autonomous systems
Abstract: Tethered mobile robots have for a long time been utilized in search and rescue and operations in inaccessible or hazardous environments. From inspection and cleanup inside nuclear waste tanks to underwater inspection, tethers and umbilical cords have been a reliable means of uninterrupted power supply, high-bandwidth communication, and means of deployment and/or recovery in cases of system failure. While often tethered robots are teleoperated, this may not always be the case, and this paper is concerned with aspects of tether monitoring and management which are central to autonomous operations. Specifically, the paper reports on a method to approximate tether shape and configuration in cluttered workspaces for mobile robots equipped with spooling mechanisms capable of releasing or collecting a cable having its free end fixed at a point in the workspace.
|
|
11:40-12:00, Paper WeA01.6 | Add to My Program |
Relative Constrained SLAM for Robot Navigation |
Qian, Duowen | McGill University |
Rahman, Shatil | McGill University |
Forbes, James Richard | McGill University |
Keywords: Robotics, Estimation, Optimization
Abstract: This paper presents a relative-constrained SLAM formulation where partial a priori landmark information is built into the SLAM problem. Incorporating a priori relative constraints is motivated by the desire to avoid drawbacks of global constraints and to reduce uncertainty in the overall map and pose estimates. First, a Relative Deterministic-Constrained SLAM (RDC-SLAM) method is presented, where a Lagrange multiplier term is added to the cost function of the standard graph-based SLAM method, realizing a new deterministic-constrained least squares solution. Next, this method is extended to incorporate probabilistic constraints and is solved using chance-constrained optimization for a more robust least square solution, leading to Relative Probabilistic-Constrained SLAM (RPC-SLAM). Both RDC-SLAM and RPC-SLAM are tested within a Monte-Carlo framework using a 2D dataset. It is shown that the RPC-SLAM framework outperforms the other methods considered when landmark initialization is poor.
|
|
WeA02 Regular Session, Franklin 2 |
Add to My Program |
Autonomous Systems |
|
|
Chair: Karpenko, Mark | Naval Postgraduate School |
Co-Chair: Oishi, Meeko | University of New Mexico |
|
10:00-10:20, Paper WeA02.1 | Add to My Program |
Voronoi Partition-Based Scenario Reduction for Fast Sampling-Based Stochastic Reachability Computation of LTI Systems |
Sartipizadeh, Hossein | University of Texas at Austin |
Vinod, Abraham | The University of Texas at Austin |
Acikmese, Behcet | University of Washington |
Oishi, Meeko | University of New Mexico |
Keywords: Stochastic optimal control, Sampled-data control, Autonomous systems
Abstract: We address the stochastic reach-avoid problem for linear systems with additive stochastic uncertainty. We seek to compute the maximum probability that the states remain in a safe set over a finite time horizon and reach a target set at the final time. We employ sampling-based methods and provide a lower bound on the number of scenarios required to guarantee that our estimate provides an underapproximation. Due to the probabilistic nature of the sampling-based methods, our underapproximation guarantee is probabilistic, and the proposed lower bound can be used to satisfy a prescribed probabilistic confidence level. To decrease the computational complexity, we propose a Voronoi partition-based to check the reach-avoid constraints at representative scenarios, instead of the original scenarios. The state constraints arising from the safe and target sets are tightened appropriately. We propose a systematic approach for selecting these representative scenarios and provide the flexibility to trade-off the number of cells needed for accuracy with the computational cost.
|
|
10:20-10:40, Paper WeA02.2 | Add to My Program |
Ordered Formation Control and Affine Transformation of Multi-Agent Systems without Global Reference Frame |
Chen, Yu-Wen | National Taiwan University |
Chiang, Ming-Li | National Taiwan University |
Fu, Li-Chen | National Taiwan University |
Keywords: Autonomous systems, Cooperative control, Control applications
Abstract: The purpose of this paper is to design a control law such that the multi-agent system can form into arbitrary shape, rotate around the centroid which tracks a given trajectory, and further adjust the formation into various shapes based on the affine transformation command. Moreover, the specified order between agents is crucial in some tasks, and hence ordered formation is addressed in our approach. The information for controller is measured locally from the neighbors and is in the local reference frames. To facilitate the goals, we propose an extended model and introduce the penalty flow exchanging mechanism which deals with the ordered formation. The control law is derived based on stability analysis, and a simulation example is provided to validate our results.
|
|
10:40-11:00, Paper WeA02.3 | Add to My Program |
Distributed Formation Control Via Mixed Barycentric Coordinate and Distance-Based Approach |
Fathian, Kaveh | MIT |
Rachinskii, Dmitrii | University of Texas at Dallas |
Spong, Mark W. | University of Texas at Dallas |
Summers, Tyler H. | University of Texas at Dallas |
Gans, Nicholas | University of Texas at Arlington |
Keywords: Cooperative control, Autonomous systems, Autonomous robots
Abstract: We present a distributed control strategy for a team of agents to autonomously achieve a desired planar formation. Our control strategy is based on combining the barycentric coordinate-based (BCB) and the distance-based (DB) approach. In the BCB approach, the almost global convergence of the agents to the desired formation shape is guaranteed, however, the formation scale cannot be controlled. In the DB method, the scale of the achieved formation is controlled, however, the convergence is local and in general stable undesired equilibria exist. By combining these methods via imposing a timescale separation between their respective dynamics, our proposed control strategy retains the advantages of each approach and avoids their shortcomings. We analyze the stability properties of the proposed control and prove that the desired formation is an almost globally stable equilibrium. We provide simulations to typify the theoretical results and compare our method with a leader-follower BCB (LF-BCB) approach that can be used to control the formation scale in the BCB strategy. In particular, we demonstrate that unlike the LF-BCB approach, our method is far more robust to measurement inaccuracies.
|
|
11:00-11:20, Paper WeA02.4 | Add to My Program |
Multi-Agent Formation Control Using Angle Measurements |
Chen, Liangming | University of Groningen |
Cao, Ming | University of Groningen |
Li, Chuanjiang | Harbin Institute of Technology |
Cheng, Xiaodong | University of Groningen |
Kapitanyuk, Yuriy | University of Groningen |
Keywords: Autonomous systems, Multivehicle systems, Vision-based control
Abstract: This paper investigates the triangular and polygonal formation control problem for mobile multi-agent systems under the constraint that each agent can only take angle measurements. For triangular formations, due to the fact that the sum of three interior angles always equals pi, the desired triangular shape can be obtained when any two agents achieve desired angles for which they are the corresponding vertices of the triangle. So to achieve the desired shape of a triangular formation, we propose to let one agent remain fixed and the other two agents move along their bisectors respectively with respect to their two neighbors. For convex polygonal formations, since the sum of all interior angles is constant, we are able to use a similar control strategy to achieve the desired polygonal shape. The stability of the closed-loop multi-agent systems is proved using Lyapunov theory. Finally, simulation examples illustrate the validity of the theoretic results.
|
|
11:20-11:40, Paper WeA02.5 | Add to My Program |
Autonomous UAV Sensor Planning, Scheduling and Maneuvering: An Obstacle Engagement Technique |
Ross, I. Michael | Naval Postgraduate School |
Proulx, Ronald | Naval Postgraduate School |
Karpenko, Mark | Naval Postgraduate School |
Keywords: Autonomous systems, Aerospace, Hybrid systems
Abstract: An uninhabited aerial vehicle (UAV) equipped with an electro-optical payload is tasked to collect over a set of discrete regions of interest. By considering the discrete regions to be obstacles that must be engaged, rather than avoided, a new mathematical technique emerges. To frame the anti-obstacle-avoidance problem, we use Kronecker indicator functions to localize the totality of constraints associated with the discrete regions. A rich class of payoff functionals can be defined using nonsmooth constructs. We show that the integrated sensor planning, scheduling and UAV maneuvering problem can be framed under a single unified mathematical framework. The price for this unification is nonsmooth calculus. The practical viability of the new problem formulation is demonstrated by solving a sample problem using DIDO — a guess-free, advanced MATLAB optimal control toolbox for solving dynamic optimization problems.
|
|
11:40-12:00, Paper WeA02.6 | Add to My Program |
Full Model-Free Control Architecture for Hybrid UAVs |
Olszanecki Barth, Jacson Miguel | ENAC - the French Civil Aviation University |
Condomines, Jean-Philippe | ENAC |
Moschetta, Jean-Marc | Institut Superieur De l'Aeronautique Et De L'Espace |
Cabarbaye, Aurélien | ENAC |
Join, Cedric | Univ. Henri Poincare, Nancy 1 |
Fliess, Michel | Ecole Polytechnique |
Keywords: Control system architecture, Autonomous systems, Flight control
Abstract: This paper discusses the development of a control architecture for hybrid Unmanned Aerial Vehicles (UAVs) based on model-free control (MFC) algorithms. Hybrid UAVs combine the beneficial features of fixed-wing UAVs with Vertical Take-Off and Landing (VTOL) capabilities to perform five different flight phases during typical missions, such as vertical take-off, transitioning flight, forward flight, hovering and vertical landing. Based on model-free control principles, a novel control architecture that handles the hybrid UAV dynamics at any flight phase is presented. This unified controller allows autonomous flights without discontinuities of switching for the entire flight envelope with position tracking, velocity control and attitude stabilization. Simulation results show that the proposed control architecture provides an effective control performance for the entire flight envelope and excellent disturbance rejections during the critical flight phases, such as transitioning and hovering flights in windy conditions.
|
|
WeA03 Regular Session, Franklin 3 |
Add to My Program |
Distributed Control I |
|
|
Chair: Mou, Shaoshuai | Purdue University |
Co-Chair: Yucelen, Tansel | University of South Florida |
|
10:00-10:20, Paper WeA03.1 | Add to My Program |
On the Trade-Off between Communication and Execution Overhead for Control of Multi-Agent Systems |
Li, Anqi | Georgia Institute of Technology |
Egerstedt, Magnus | Georgia Institute of Technology |
Keywords: Distributed control, Decentralized control, Cooperative control
Abstract: For multi-agent systems, it is common to encode the task as an optimization problem with two distinctly different solution methodologies -- one is to directly apply control inputs as optimization updates, the other is to solve the optimization problem through communications before applying actual control inputs. This reveals an important trade-off between communication and execution overhead for control of multi-agent systems. To formally study this trade-off, we restrict our consideration to a class of commonly studied multi-agent problems where the objective function is the sum of a set of edge potential functions. The gradient descent algorithm and Newton's method are viewed as the proxy for the pure execution and the pure communication strategy, respectively. We propose an algorithm based on truncated Newton's method that provides tunable levels of trade-off between communication and execution efforts. Theoretical results on the convergence rate of the purposed algorithm are studied for the consensus problem under different trade-off strategies. The performance of the proposed algorithm is validated through simulation.
|
|
10:20-10:40, Paper WeA03.2 | Add to My Program |
A Distributed Observer for a Continuous-Time Linear System |
Wang, Lili | Yale University |
Liu, Ji | Stony Brook University |
Morse, A. Stephen | Yale Univ |
Keywords: Distributed control, Estimation, Cooperative control
Abstract: A simply structured distributed observer is described for estimating the state of a continuous-time, jointly observable, input-free linear system. The observer's correctness is established in a straightforward manner by exploiting several well-known properties of invariant subspaces.
|
|
10:40-11:00, Paper WeA03.3 | Add to My Program |
A Scalable Distributed Algorithm for Least Squares Solutions in Double-Layered Multi-Agent Networks |
Wang, Xuan | Purdue University |
Mou, Shaoshuai | Purdue University |
Keywords: Distributed control, Agents-based systems
Abstract: In this paper, we propose a scalable distributed algorithm for double-layered multi-agent network to cooperatively find the least square solutions to an over-determined linear equation. Compared with existing consensus-based distributed linear equation solvers, the double-layered network structure allows us to implement two types of coordination, namely consensus and conservation, simultaneously. As a result, the proposed algorithm has achieved better scalability in the sense that each agent does not need to know a full row of the overall equation. The convergence of our algorithm is exponential, which has been validated by both analytical proof and numerical simulations.
|
|
11:00-11:20, Paper WeA03.4 | Add to My Program |
Resilient Distributed Averaging |
Dibaji, Seyed Mehran | Massachusetts Inst. of Tech |
Safi, Mostafa | Amirkabir University of Technology |
Ishii, Hideaki | Tokyo Institute of Technology |
Keywords: Distributed control, Fault detection, Networked control systems
Abstract: In this paper, a fully distributed averaging algorithm in the presence of adversarial Byzantine agents is proposed. The algorithm is based on a resilient retrieval procedure, where all non-Byzantine nodes send their own initial values and retrieve those of other agents. We establish that the convergence of the proposed algorithm relies on strong robustness of the graph, which is a connectivity notion. Simulation results are provided to verify the effectiveness of the proposed algorithms.
|
|
11:20-11:40, Paper WeA03.5 | Add to My Program |
Distributed Control of Multiagent Systems with Heterogeneity in Synchronization Roles |
Sarsilmaz, Selahattin Burak | University of South Florida |
Yucelen, Tansel | University of South Florida |
Oswald, Tyler | University of South Florida |
Keywords: Distributed control, Control of networks, Cooperative control
Abstract: This paper introduces a new definition of the linear cooperative output regulation problem in order to allow the common output synchronization (regulation) together with an additional output synchronization for a proper subset of all agents. The solvability of this problem with an internal model based distributed dynamic state feedback control law is first investigated based on a global condition. An agent-wise local sufficient condition is then presented under standard assumptions. A numerical example is finally provided to illustrate the considered problem and the proposed approach in this paper.
|
|
11:40-12:00, Paper WeA03.6 | Add to My Program |
Robustness of Finite-Time Distributed Control Algorithm with Time Transformation |
Arabi, Ehsan | University of Michigan |
Yucelen, Tansel | University of South Florida |
Singler, John | Missouri University of Science and Technology |
Keywords: Distributed control, Cooperative control, Control system architecture
Abstract: The focus of this paper is distributed control of multiagent systems in a-priori given, user-defined finite-time interval using a recently developed time transformation approach. In particular, we utilize a time transformation function to convert a user-defined finite-time interval to a stretched infinite-time interval such that a distributed control algorithm can be designed on this stretched interval and then it can be transformed back to the original finite-time interval in order to satisfy a given multiagent system objective. In addition, the robustness of the resulting finite-time distributed control algorithm against vanishing and non-vanishing system uncertainties is also discussed. In contrast to existing finite-time approaches, the presented algorithm can preserve a-priori given, user-defined finite-time convergence regardless of the initial conditions of the multiagent system and without the need for a knowledge of the upper bounds of the considered system uncertainty classes.
|
|
WeA04 Regular Session, Franklin 4 |
Add to My Program |
Networked Control Systems I |
|
|
Chair: Lucia, Walter | Concordia University |
Co-Chair: Fu, Anqi | Imperial College London |
|
10:00-10:20, Paper WeA04.1 | Add to My Program |
A Game-Theoretic Framework for Security-Aware Sensor Placement Problem in Networked Control Systems |
Pirani, Mohammad | KTH Royal Institute of Technology |
Nekouei, Ehsan | KTH Royal Institute of Technology |
Sandberg, Henrik | KTH Royal Institute of Technology |
Johansson, Karl H. | Royal Institute of Technology |
Keywords: Networked control systems, Control of networks, Game theory
Abstract: This paper studies the sensor placement problem in a networked control system for improving its security against cyber-physical attacks. The problem is formulated as a zero-sum game between an attacker and a detector. The attacker's decision is to select f nodes of the network to attack whereas the detector's decision is to place f sensors to detect the presence of the attack signals. In our formulation, the attacker minimizes its visibility, defined as the system L_2 gain from the attack signals to the deployed sensors' outputs, and the detector maximizes the visibility of the attack signals. The equilibrium strategy of the game determines the optimal locations of the sensors. The existence of Nash equilibrium for the attacker-detector game is studied when the underlying connectivity graph is a directed or an undirected tree. When the game does not admit a Nash equilibrium, it is shown that the Stackelberg equilibrium of the game, with the detector as the game leader, can be computed efficiently. Finally, the attacker-detector game is studied in a cooperative adaptive cruise control algorithm for vehicle platooning problem. The existence of Nash equilibrium is investigated for both directed and undirected platoons and the effect of the position of the reference vehicle on the game value is studied. Our results show that, under the optimal sensor placement strategy, an undirected topology provides a higher security level for a networked control system compared with its corresponding directed topology.
|
|
10:20-10:40, Paper WeA04.2 | Add to My Program |
Intermittent Connectivity Maintenance with Heterogeneous Robots Using a Beads-On-A-Ring Strategy |
Aragues, Rosario | Universidad De Zaragoza |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Networked control systems, Autonomous robots, Distributed control
Abstract: We consider a scenario of cooperative task servicing, with a team of heterogeneous robots with different maximum speeds and communication radii, in charge of keeping the network intermittently connected. We abstract the task locations into a 1D cycle graph that is traversed by the communicating robots, and we discuss intermittent communication strategies so that each task location is periodically visited, with a worst–case revisiting time. Robots move forward and backward along the cycle graph, exchanging data with their previous and next neighbors when they meet, and updating their region boundaries. Asymptotically, each robot is in charge of a region of the cycle graph, depending on its capabilities. The method is distributed, and robots only exchange data when they meet.
|
|
10:40-11:00, Paper WeA04.3 | Add to My Program |
Adaptive Neural Network Control for Multiaxis Trajectory Tracking: Nanomanipulation Example |
Li, Dan | University of Electronic Science and Technology of China |
Kong, Linghuan | University of Electronic Science and Technology of China |
Zou, Jianxiao | University of Electronic Science and Technology of China |
He, Wei | University of Science and Technology Beijing |
Keywords: Networked control systems, Adaptive control, Observers for nonlinear systems
Abstract: This paper investigates adaptive neural network control for multiaxis trajectory tracking of a piezoelectric actuator-driven nanomanipulation system. An approximation model-based control scheme which is involved with only nominal parts of the unknown system dynamics is designed first and the hysteretic effect is compensated by designing a disturbance observer. Then, adaptive neural networks are applied to approximate unknown parts and an adaptive neural network control scheme is designed. It can be proved that all the error signals are ultimately bounded with Lyapunov’s stability theory. A nanomanipulation experiment is conducted and the results prove the effectiveness of the proposed control.
|
|
11:00-11:20, Paper WeA04.4 | Add to My Program |
Leader Group Selection for Energy-Related Controllability of Signed Acyclic Graphs |
She, Baike | University of Iowa |
Mehta, Siddhartha | University of Florida - REEF |
Doucette, Emily | AFRL |
Curtis, J. Willard | Air Force Research Laboratory |
Kan, Zhen | The University of Iowa |
Keywords: Networked control systems, Control of networks, Network analysis and control
Abstract: A leader group selection approach that jointly considers network controllability and control energy is investigated in this work. Specifically, a dynamic multi-agent system with signed acyclic topology is considered, where signed edges capture cooperative and competitive interactions among agents. To effectively and efficiently control the multi-agent system, leader group selection in this work focuses on energy-related controllability, which jointly considers two primary objectives: 1) network controllability, i.e., identification of a subset of agents as leaders that can drive the entire network to a desired state even in the presence of antagonistic interactions, and 2) energy efficiency, which takes into account the control cost incurred by the selected leaders in steering the network to the desired state. To achieve these objectives, graph-inspired characterizations of energy-related controllability are developed based on the interaction between the network topology and the agent dynamics. The developed topological characterizations are exploited to derive heuristic leader selection algorithms on signed acyclic graphs. Illustrative examples are provided to demonstrate the effectiveness of the developed leader group selection methods.
|
|
11:20-11:40, Paper WeA04.5 | Add to My Program |
A Novel Control Architecture for the Detection of False Data Injection Attacks in Networked Control Systems |
Ghaderi, Mohsen | Concordia University |
Gheitasi, Kian | Concordia University |
Lucia, Walter | Concordia University |
Keywords: Networked control systems, Control system architecture, Supervisory control
Abstract: In this manuscript, we propose a novel control architecture capable of detecting deception attacks affecting networked control systems. In the proposed solution, we borrow and combine the existing concepts of watermarking signal and auxiliary systems in order to detect a broad class of false data injection attacks. We show that by combining the aforementioned concepts, we can detect false data injection attacks without sacrificing control performance. Moreover, we propose a novel nonlinear auxiliary system which is static and does not require any dynamical coupling with the plant dynamics. Finally, the effectiveness of the proposed method is shown by means of a simulation campaign.
|
|
11:40-12:00, Paper WeA04.6 | Add to My Program |
Asynchronous Sampling for Decentralized Periodic Event-Triggered Control |
Fu, Anqi | Imperial College London |
Tomic, Ivana | Imperial College London |
McCann, Julie A. | Imperial College London |
Keywords: Networked control systems, Decentralized control, Hybrid systems
Abstract: Decentralized periodic event-triggered control (DPETC) strategies are an attractive solution for wireless cyber-physical systems where resources such as network bandwidth and sensor power are scarce. This is because these strategies have the advantage of preventing unnecessary data transmissions and therefore reduce bandwidth and energy requirements, however the sensor sampling regime remains synchronous. Typically the action of sampling leads almost immediately to a transmission on an event being detected. If the sampling is synchronous, multiple transmission requests may be raised at the same time which further leads to bursty traffic patterns. Bursty traffic patterns are critical to the DPETC systems performance as the probability of collisions and the amount of requested bandwidth resources become high ultimately causing delays. In this paper, we propose an asynchronous sampling scheme for DPETC. The scheme ensures that at each sampling time, no more than one transmission request can be generated which prevents the occurrence of network traffic collision. At the same time, for the DPETC system with asynchronous sampling a pre-designed global exponential stability and L2-gain performance can still be guaranteed. We illustrate the effectiveness of the approach through a numerical example.
|
|
WeA05 Regular Session, Franklin 5 |
Add to My Program |
Optimization I |
|
|
Chair: Sanfelice, Ricardo G. | University of California at Santa Cruz |
Co-Chair: Yousefian, Farzad | Oklahoma State University |
|
10:00-10:20, Paper WeA05.1 | Add to My Program |
A Robust Hybrid Heavy Ball Algorithm for Optimization with High Performance |
Hustig-Schultz, Dawn | University of California, Santa Cruz |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Optimization, Hybrid systems, Switched systems
Abstract: This paper proposes hybrid control algorithms for optimization of a convex objective function with fast convergence, reduced oscillations, and robustness. Developed using hybrid system tools, the algorithms feature a uniting control strategy, in which two standard heavy ball algorithms, one used globally and another used locally, with properly designed gravity and friction parameters, are employed. The proposed hybrid control strategy switches the parameters to converge quickly to the set of minimizers of the convex objective function without oscillations. A hybrid control algorithm implementing a switching strategy that measures the objective function and its gradient, and another algorithm that only measures its gradient, are designed. Key properties of the resulting closed-loop systems, including existence of solutions, asymptotic stability, and robustness, are analyzed. Numerical results validate the findings.
|
|
10:20-10:40, Paper WeA05.2 | Add to My Program |
Optimal Scheduling of PTGs with Multiple Service Levels on Heterogeneous Distributed Systems |
Roy, Sanjit Kumar | Indian Institute of Technology Guwahati |
Devaraj, Rajesh | IIT Guwahati |
Sarkar, Arnab | IIT Guwahati |
Keywords: Optimization, Embedded systems, Automotive control
Abstract: Real-time applications in today’s distributed cyber-physical control systems are often represented as Precedence-constrained Task Graphs (PTGs) and increasingly implemented on heterogeneous platforms, to cater to their high performance demands. Optimal scheduling solutions for such systems can provide advantages in terms of performance, reliability, cost etc. This paper addresses the problem of scheduling a real-time application modelled as PTG where tasks have multiple optional service levels (where higher service level implies higher Quality-of-Service (QoS)). In particular, we propose an Integer Linear Programming based optimal solution strategy for scheduling PTGs with multiple service levels, executing on a distributed platform composed of heterogeneous processing elements. Through the real-world case study of an automotive cruise controller, we generate an optimal schedule using our proposed scheme in order to demonstrate its applicability. Conducted simulation based experiments and comparison with a state of art approach, reveal the practical efficacy of our scheme.
|
|
10:40-11:00, Paper WeA05.3 | Add to My Program |
Convergence of the Expectation-Maximization Algorithm through Discrete-Time Lyapunov Stability Theory |
Romero, Orlando | Rensselaer Polytechnic Institute |
Chatterjee, Sarthak | Rensselaer Polytechnic Institute |
Pequito, Sergio | Rensselaer Polytechnic Institute |
Keywords: Optimization, Control applications
Abstract: In this paper, we propose a dynamical systems perspective of the Expectation-Maximization (EM) algorithm. More precisely, we can analyze the EM algorithm as a nonlinear state-space dynamical system. The EM algorithm is widely adopted for data clustering and density estimation in statistics, control systems, and machine learning. This algorithm belongs to a large class of iterative algorithms known as proximal point methods. In particular, we re-interpret limit points of the EM algorithm and other local maximizers of the likelihood function it seeks to optimize as equilibria in its dynamical system representation. Furthermore, we propose to assess its convergence as asymptotic stability in the sense of Lyapunov. As a consequence, we proceed by leveraging recent results regarding discrete-time Lyapunov stability theory in order to establish asymptotic stability (and thus, convergence) in the dynamical system representation of the EM algorithm.
|
|
11:00-11:20, Paper WeA05.4 | Add to My Program |
A First-Order Method for Monotone Stochastic Variational Inequalities on Semidefinite Matrix Spaces |
Majlesinasab, Nahidsadat | Oklahoma State University |
Yousefian, Farzad | Oklahoma State University |
Feizollahi, Mohammad Javad | Georgia State University |
Keywords: Optimization, Game theory, Computational methods
Abstract: Motivated by multi-user optimization problems and non-cooperative Nash games in stochastic regimes, we consider stochastic variational inequality (SVI) problems on matrix spaces where the variables are positive semidefinite matrices and the mapping is merely monotone. Much of the interest in the theory of variational inequality (VI) has focused on addressing VIs on vector spaces. Yet, most existing methods addressing VIs on matrix spaces either rely on strong assumptions, or require a two-loop framework where at each iteration, a projection problem, i.e., a semidefinite optimization problem needs to be solved. Motivated by this gap, we develop a stochastic mirror descent method where we choose the distance generating function to be defined as the quantum entropy. This method is a single-loop first-order method in the sense that it only requires a gradient-type of update at each iteration. The novelty of this work lies in the convergence analysis that is carried out through employing an auxiliary sequence of stochastic matrices. Our contribution is three-fold: (i) under this setting and employing averaging techniques, we show that the iterate generated by the algorithm converges to a weak solution of the SVI; (ii) moreover, we derive a convergence rate in terms of the expected value of a suitably defined gap function; (iii) we implement the developed method for solving a multiple-input multiple-output multi-cell cellular wireless network composed of seven hexagonal cells and present the numerical experiments supporting the convergence of the proposed method.
|
|
11:20-11:40, Paper WeA05.5 | Add to My Program |
An H_ Index and H Infinity Norm Blending for Mode Decoupling |
Baár, Tamás | Hungarian Academy of Sciences, Institute for Computer Science An |
Luspay, Tamás | Institute for Computer Science and Control |
Keywords: Optimization, Flexible structures, Aerospace
Abstract: A novel input and output blend calculation method is presented for decoupled control of selected modes. Decoupling is carried out by maximizing the minimum sensitivity of the controlled mode while minimizing the worst case gain for other mode(s) from the blended input to the blended output. This leads to an optimization problem of joint maximization of the mathcal{H}_{-} index of the controlled mode and the minimization of the mathcal{H}_{infty} norm corresponding to other modes. The optimization problem is formalized with Linear Matrix Inequalities, and two examples from the aerospace engineering field are given for evaluation purposes.
|
|
11:40-12:00, Paper WeA05.6 | Add to My Program |
On the Optimal Condition for Battery Aging Assessment Based on an Electrochemical Model |
Huang, Meng | The Ohio State University |
Kumar, Mrinal | Ohio State University |
Yang, Chao | The Ohio State University |
Keywords: Optimization, Kalman filtering, Reduced order modeling
Abstract: Battery aging remains a critical challenge and state-of-heath (SOH) estimation is a key task for battery management system (BMS). Adaptive model-based methods have been extensively studied, and conventional applications of extended Kalman filter (EKF) are mostly limited to only one electrode, in order to address the weak observability of battery system due to the absence of a reference electrode. Moreover, the state-of-art is dominated by improving model precision and algorithm efficiency, while the significance of measurement data for SOH estimation is often neglected. This study applies EKF to both electrodes and guarantees the estimation accuracy through the optimized initialization. Effective cyclable lithium, ∆n_(Li,avg), is proposed and validated with experimental data as a reliable aging parameter to interpret the long-term evolution of battery degradation. Data of different operating conditions (charging, discharging, charge depleting), different state-of-charge (SOC) sections and different rates of measurement update, are tested for their impacts on aging estimation. It can be concluded that a sufficiently wide SOC range from 1C charging is comparatively the optimal condition for estimating ∆n_(Li,avg). Within the bond of required estimation precision, a slower measurement update proves to be a preferred solution due to its equivalent estimation accuracy and less demanding computational resource.
|
|
WeA06 Invited Session, Franklin 6 |
Add to My Program |
Analysis, Design, and Control of Systems in Neuroscience I |
|
|
Chair: Pasqualetti, Fabio | University of California, Riverside |
Co-Chair: Pequito, Sergio | Rensselaer Polytechnic Institute |
Organizer: Pequito, Sergio | Rensselaer Polytechnic Institute |
Organizer: Medvedev, Alexander V. | Uppsala University |
Organizer: Pasqualetti, Fabio | University of California, Riverside |
Organizer: Dixon, Warren E. | University of Florida |
|
10:00-10:20, Paper WeA06.1 | Add to My Program |
A Computational Study of a Spatially Continuum Mean Field Model Capturing Loss of Consciousness and the Emergence of Alpha and Gamma Rhythmic Activity in the Neocortex (I) |
Haddad, Wassim M. | Georgia Inst. of Tech |
Keywords: Neural networks
Abstract: In this paper, we analyze the spatio-temporal mean field model developed by Liley et al. [1] in order to advance our understanding of the wide effects of pharmacological agents and anesthetics. Specifically, we use the spatio-temporal mean field model in [1] for capturing the electrical activity in the neocortex to computationally study the emergence of α and γ-band rhythmic activity in the brain. We show that α oscillations in the solutions of the model appear globally across the neocortex, whereas γ oscillations can emerge locally as a result of a bifurcation in the dynamics of the model. We solve the dynamic equations of the model using a finite element solver package and show that our results verify the predictions made by bifurcation analysis.
|
|
10:20-10:40, Paper WeA06.2 | Add to My Program |
Oscillations and Coupling in Interconnections of Two-Dimensional Brain Networks (I) |
Nozari, Erfan | University of California, San Diego |
Cortes, Jorge | University of California, San Diego |
Keywords: Biological systems, Network analysis and control, Neural networks
Abstract: Oscillations in the brain are one of the most ubiquitous and robust patterns of activity and correlate with various cognitive phenomena. In this work, we study the existence and properties of oscillations in simple mean-field models of brain activity with bounded linear-threshold rate dynamics. First, we obtain exact conditions for the existence of limit cycles in two-dimensional excitatory-inhibitory networks (E-I pairs). Building on this result, we study networks of multiple E-I pairs, provide exact conditions for the lack of stable equilibria, and numerically show that this is a tight proxy for the existence of oscillatory behavior. Finally, we study cross-frequency coupling between pairs of oscillators each consisting of an E-I pair. We find that while both phase-phase coupling (synchronization) and phase-amplitude coupling (PAC) monotonically increase with inter-oscillator connection strength, there exists a tradeoff in increasing frequency mismatch between the oscillators as it de-synchronizes them while enhancing their PAC.
|
|
10:40-11:00, Paper WeA06.3 | Add to My Program |
Steady-State Analysis of a Human-Social Behavior Model: A Neural-Cognition Perspective (I) |
Wei, Jieqiang | KTH |
Nekouei, Ehsan | KTH Royal Institute of Technology |
Wu, Junfeng | Royal Institute of Technology (KTH) |
Cvetkovic, Vladimir | KTH Royal Institute of Technology |
Johansson, Karl H. | Royal Institute of Technology |
Keywords: Human-in-the-loop control, Markov processes, Network analysis and control
Abstract: We consider an extension of the Rescorla-Wagner model which bridges the gap between conditioning and learning on a neural-cognitive, individual psychological level, and the social population level. In this model, the interaction among individuals is captured by a Markov process. The resulting human-social behavior model is a recurrent iterated function system which behaves differently from the classical Rescorla-Wagner model due to randomness. A sufficient condition for the convergence of the forward process starting with arbitrary initial distribution is provided. Furthermore, the ergodicity properties of the internal states of agents in the proposed model are studied.
|
|
11:00-11:20, Paper WeA06.4 | Add to My Program |
Exact and Approximate Stability Conditions for Cluster Synchronization of Kuramoto Oscillators (I) |
Menara, Tommaso | University of California, Riverside |
Baggio, Giacomo | University of California, Riverside |
Bassett, Danielle | University of Pennsylvania |
Pasqualetti, Fabio | University of California, Riverside |
Keywords: Stability of nonlinear systems, Network analysis and control, Neural networks
Abstract: In this paper we derive exact and approximate conditions for the (local) stability of the cluster synchronization manifold for sparsely interconnected oscillators with heterogeneous and weighted Kuramoto dynamics. Cluster synchronization, which emerges when the oscillators can be partitioned in a way that their phases remain identical over time within each group, is critically important for normal and abnormal behaviors in technological and biological systems ranging from the power grid to the human brain. Yet, despite its importance, cluster synchronization has received limited attention, so that the fundamental mechanisms regulating cluster synchronization in important classes of oscillatory networks are still unknown. In this paper we provide the first conditions for the stability of the cluster synchronization manifold for general weighted networks of heterogeneous oscillators with Kuramoto dynamics. In particular, we discuss how existing results are inapplicable or insufficient to characterize the stability of cluster synchronization for oscillators with Kuramoto dynamics, provide rigorous quantitative conditions that reveal how the network weights and oscillators' natural frequencies regulate cluster synchronization, and offer examples to quantify the tightness of our conditions. Further, we develop approximate conditions that, despite their heuristic nature, are numerically shown to tightly capture the transition to stability of the cluster synchronization manifold.
|
|
11:20-11:40, Paper WeA06.5 | Add to My Program |
A Learning Framework for Controlling Spiking Neural Networks (I) |
Narayanan, Vignesh | Washington University in St. Louis |
Ritt, Jason | Boston University |
Li, Jr-Shin | Washington University in St. Louis |
Ching, ShiNung | Washington University in St. Louis |
Keywords: Neural networks, Learning, Biomedical
Abstract: Controlling a population of interconnected neurons using extrinsic stimulation is a challenging problem. The challenges are due to the inherent nonlinear neuronal dynamics, the highly complex structure of underlying neuronal networks, the underactuated nature of the control problem, and adding to these is the binary nature of the observation/feedback. To meet these challenges, adaptive, learning-based approaches using deep neural networks and reinforcement learning are potentially useful strategies. In this paper, we propose an approximation based learning framework in which a model for approximating the input-output relationship in a spiking neuron is developed. We then present a reinforcement learning scheme to approximate the solution for the Bellman equation, and to design the control sequence to achieve a desired spike pattern. The proposed strategy, by integrating the reinforcement learning and system theoretic approaches, provides a tractable framework to design a learning control network, and to select the hyper parameters in deep learning architectures. We demonstrate the feasibility of the proposed approach using numerical simulations.
|
|
11:40-12:00, Paper WeA06.6 | Add to My Program |
Learning Latent Fractional Dynamics with Unknown Unknowns (I) |
Gupta, Gaurav | University of Southern California |
Pequito, Sergio | Rensselaer Polytechnic Institute |
Bogdan, Paul | University of Southern California |
Keywords: Estimation, Biological systems, Optimization algorithms
Abstract: Despite significant effort in understanding complex systems (CS), we lack a theory for modeling, inference, analysis and efficient control of time-varying complex networks (TVCNs) in uncertain environments. From brain activity dynamics to microbiome, and even chromatin interactions within the genome architecture, many such TVCNs exhibits a pronounced spatio-temporal fractality. Moreover, for many TVCNs only limited information (e.g., few variables) is accessible for modeling, which hampers the capabilities of analytical tools to uncover the true degrees of freedom and infer the CS model, the hidden states and their parameters. Another fundamental limitation is that of understanding and unveiling of unknown drivers of the dynamics that could sporadically excite the network in ways that straightforward modeling does not work due to our inability to model non-stationary processes. Towards addressing these challenges, in this paper, we consider the problem of learning the fractional dynamical complex networks under unknown unknowns (i.e., hidden drivers) and partial observability (i.e., only partial data is available). More precisely, we consider a generalized modeling approach of TVCNs consisting of discrete-time fractional dynamical equations and propose an iterative framework to determine the network parameterization and predict the state of the system. We showcase the performance of the proposed framework in the context of task classification using real electroencephalogram data.
|
|
WeA07 Invited Session, Franklin 7 |
Add to My Program |
Control & Energy Management of Building Systems |
|
|
Chair: Shahbakhti, Mahdi | Michigan Technological University |
Co-Chair: Hota, Ashish | Indian Institute of Technology (IIT), Kharagpur |
Organizer: Kim, Donghun | Purdue University |
Organizer: Stockar, Stephanie | Penn State University |
Organizer: Shahbakhti, Mahdi | Michigan Technological University |
Organizer: Bay, Christopher | National Renewable Energy Laboratory |
Organizer: Rasmussen, Bryan | Texas A&M University |
|
10:00-10:20, Paper WeA07.1 | Add to My Program |
Self-Optimizing Control of an Air Source Heat Pump (I) |
Zhao, Zhongfan | Univ. of Texas at Dallas |
Li, Yaoyu | University of Texas at Dallas |
Salsbury, Timothy | Johnson Controls, Inc |
Alcala, Carlos F. | Johnson Controls, Inc |
House, John | Johnson Controls |
Keywords: Building and facility automation, Process Control, Optimization
Abstract: Self-optimizing Control (SOC) is a method for finding appropriate controlled variables for which implementation of feedback control yields nearly-optimal operation regardless of variation in disturbances. The Jacobian estimation process in conventional SOC rely on an offline analysis of large amounts of steady-state data, which can be difficult in practice. In this paper, we propose a new SOC procedure enabled by extremum-seeking control (ESC). First, by presenting periodic disturbance dither into the plant model, the Jacobian estimation can be carried out with the dither-demodulation process in multivariable ESC, and then the null-space method is used to find the optimal sensitivity matrix. The ESC can then be used to find the optimum setpoint value for the controlled variable from the previous step. The proposed method is compared with conventional SOC using a Modelica-based dynamic simulation of an air-source heat pump (ASHP) system.
|
|
10:20-10:40, Paper WeA07.2 | Add to My Program |
Identification of a Self-Optimizing Control Structure from Normal Operating Data (I) |
Alcala, Carlos F. | Johnson Controls, Inc |
Salsbury, Timothy | Johnson Controls, Inc |
House, John | Johnson Controls |
Keywords: Optimal control, Energy systems, Building and facility automation
Abstract: In building systems, it is necessary to maintain comfort conditions while minimizing operating costs. One way to do this is to use a real-time optimizer (RTO) to adjust the setpoints of the controlled variables. Another way is to use a self-optimizing control (SOC) structure to find one or more new variables that, when controlled to the appropriate constant setpoints, drive the operating cost of the system to, or close to, its optimal point. A requirement of SOC is that an optimal operating point be used in the calculation of the self-optimizing variable(s) and the identification of its parameters. In this work, we propose a formulation of SOC that allows for the use of non-optimal data. The proposed method makes use of normal operating data to identify the parameters used to calculate the self-optimizing variables. Simulation of an HVAC system shows that the performance of the proposed method is similar to that of SOC based on optimal data, and also to the performance of an RTO alternative based on extremum-seeking control (ESC).
|
|
10:40-11:00, Paper WeA07.3 | Add to My Program |
Optimal Exergy-Wise Predictive Control for a Combined MicroCSP and HVAC System in a Building (I) |
Reddy, Chethan | Michigan Technological University |
Razmara, Meysam | Michigan Technological University |
Shahbakhti, Mahdi | Michigan Technological University |
Robinett, Rush | Michigan Tech University |
Keywords: Energy systems, Optimal control, Mechatronics
Abstract: This paper presents a new control method to minimize the energy consumption of a micro-scale concentrated solar power (MicroCSP) system and building heating, ventilation, and air conditioning (HVAC) system. A new real-time optimal control method is proposed using the concept of “exergy” and model predictive control (MPC) techniques. To achieve this, first law of thermodynamics (FLT) and second law of thermodynamics (SLT) based mathematical models of MicroCSP are developed and integrated into a model of an office building located at Michigan Technological University. Then, an exergy-wise MPC framework is designed to optimize MicroCSP operation in accordance with the building HVAC needs. The new controller reduces exergy destruction by 28%, compared to a common rule-based controller (RBC). This leads to 23% energy saving, compared to the applied RBC.
|
|
11:00-11:20, Paper WeA07.4 | Add to My Program |
MPC-Trained ANFIS for Control of MicroCSP Integrated into a Building HVAC System (I) |
Toub, Mohamed | Ecole Mohammadia D'Ingénieurs |
Shahbakhti, Mahdi | Michigan Technological University |
Robinett, Rush | Michigan Tech University |
Aniba, Ghassane | Mohammadia School of Engineers |
Keywords: Building and facility automation, Fuzzy systems, Optimization
Abstract: This paper presents the design of an easily implementable rule-based controller that can minimize the electrical energy consumption of a building heating, ventilation, and air-conditioning (HVAC) system integrated with a micro-scale concentrated solar power (MicroCSP) system. A model predictive control (MPC) scheme is developed to optimize MicroCSP electrical and thermal energy flows for HVAC use in a building. Despite its attractiveness regarding energy savings and thermal comfort satisfaction, MPC requires high computational resources and can not be easily implemented on the common low-cost HVAC controllers available in the market. To cope with these issues, two MPC-trained adaptive neuro-fuzzy inference system (ANFIS) models are designed to control the building HVAC with MicroCSP. Simulation results exploiting real operation data from an office building at Michigan Technological University and our newly purchased MicroCSP are presented. It is shown that the resulting controller can reproduce the MPC reasoning and performance while being simpler and much more computationally efficient.
|
|
11:20-11:40, Paper WeA07.5 | Add to My Program |
Dynamic Mechanism Design for Human-In-The-Loop Control of Building Energy Consumption (I) |
Schütte, Maximilian | ETH Zurich |
Hota, Ashish | Indian Institute of Technology (IIT), Kharagpur |
Eichler, Annika | ETH Zurich |
Lygeros, John | ETH Zurich |
Keywords: Building and facility automation, Game theory, Human-in-the-loop control
Abstract: Integrating the preferences of building occupants for efficient building energy management has the potential for significant energy savings. In this paper, we present a new dynamic mechanism that achieves ex-post incentive compatibility, i.e., the occupants reveal their privately-held preferences truthfully in every time period. These preferences are then incorporated in a receding horizon control scheme to jointly minimize the cost of energy purchase and the discomfort experienced by the occupants. We evaluate the performance of our scheme with a baseline heating policy based on standardized thermal comfort bounds, and the classical dynamic pivot mechanism via extensive numerical simulations of a sample building. We illustrate that due to the integration of individual preferences, both occupant discomfort and energy consumption can be greatly reduced compared to the baseline heating policy. Furthermore, while the dynamic pivot mechanism requires occupants to pay for their comfort, our payment scheme rewards the occupants whose participation leads to energy savings, making their participation in the scheme more palatable.
|
|
11:40-12:00, Paper WeA07.6 | Add to My Program |
MPC-Based Building Climate Controller Incorporating Humidity |
Raman, Naren Srivaths | University of Florida |
Devaprasad, Karthikeya | University of Florida |
Barooah, Prabir | Univ. of Florida |
Keywords: Building and facility automation, Energy systems, Predictive control for nonlinear systems
Abstract: Although Model Predictive Control (MPC) has been widely investigated for energy efficient climate control of buildings, most prior works have neglected humidity in the problem formulation and performance evaluations. A climate control algorithm that ignores humidity cannot be used in practice, especially in hot-humid climates. Apart from the discomfort of occupants, high humidity over long periods will lead to issues such as mold growth, adversely impacting occupant health. In this paper, we provide an MPC formulation that explicitly accounts for humidity constraints in a principled manner. We show how to construct data-driven low order models of a cooling and dehumidifying coil that can be used in the MPC formulation. The resulting controller's performance is tested in simulation using a plant that differs significantly from the model used by the optimizer. In spite of the large plant model mismatch, the proposed MPC controller performs well. Humidity constraints are seen to be active for a large part of the day, especially in the summer. MPC formulations that ignore humidity would lead to a poor indoor climate in these situations.
|
|
WeA08 Regular Session, Franklin 8 |
Add to My Program |
Learning I |
|
|
Chair: Kayacan, Erdal | Aarhus University |
Co-Chair: Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
|
10:00-10:20, Paper WeA08.1 | Add to My Program |
A New Approach for Distributed Hypothesis Testing with Extensions to Byzantine-Resilience |
Mitra, Aritra | Purdue University |
Richards, John A. | Sandia National Laboratories |
Sundaram, Shreyas | Purdue University |
Keywords: Learning, Agents-based systems, Fault tolerant systems
Abstract: We study a setting where a group of agents, each receiving partially informative private observations, seek to collaboratively learn the true state (among a set of hypotheses) that explains their joint observation profiles over time. To solve this problem, we propose a distributed learning rule that differs fundamentally from existing approaches, in the sense that it does not employ any form of "belief-averaging". Specifically, every agent maintains a local belief (on each hypothesis) that is updated in a Bayesian manner without any network influence, and an actual belief that is updated (up to normalization) as the minimum of its own local belief and the actual beliefs of its neighbors. Under minimal requirements on the signal structures of the agents and the underlying communication graph, we establish consistency of the proposed belief update rule, i.e., we show that the actual beliefs of the agents asymptotically concentrate on the true state almost surely. As one of the key benefits of our approach, we show that our learning rule can be extended to scenarios that capture misbehavior on the part of certain agents in the network, modeled via the Byzantine adversary model. In particular, we prove that each non-adversarial agent can asymptotically learn the true state of the world almost surely, under appropriate conditions on the observation model and the network topology.
|
|
10:20-10:40, Paper WeA08.2 | Add to My Program |
Learning-Based Control for a Communicating Mobile Robot under Unknown Rates |
Busoniu, Lucian | Technical University of Cluj-Napoca |
Satheeskumar Varma, Vineeth | CNRS |
Morarescu, Irinel-Constantin | CRAN, CNRS, Université De Lorraine |
Lasaulce, Samson | Supelec Paris |
Keywords: Learning, Autonomous robots, Numerical algorithms
Abstract: In problems such as surveying or monitoring remote regions, a mobile robot must transmit data over a wireless network with unknown, position-dependent transmission rates. We propose an algorithm to achieve this objective that learns approximations of the rate function and of an optimal-control solution that transmits the data in minimum time. The rates are estimated with supervised learning from the samples observed; and the control is found with dynamic programming sweeps around the current state of the robot that exploit the rate function estimate, combined with online reinforcement learning. For both synthetic and realistic rate functions, our experiments show that the learning algorithm empties the data buffer in less than twice the number of steps achieved by a model-based solution that requires to perfectly know the rate function.
|
|
10:40-11:00, Paper WeA08.3 | Add to My Program |
Robust Kinodynamic Motion Planning Using Model-Free Game-Theoretic Learning |
Kontoudis, George | Virginia Tech |
Vamvoudakis, Kyriakos G. | Georgia Inst. of Tech |
Keywords: Learning, Autonomous systems, Optimization
Abstract: This paper presents an online, robust, and model-free motion planning framework for kinodynamic systems. In particular, we employ a Q-learning algorithm for a two player zero-sum dynamic game to account for worst-case disturbances and kinodynamic constraints. We use one critic, and two actor approximators to solve online the finite horizon minimax problem with a form of integral reinforcement learning. We then leverage a terminal state evaluation structure to facilitate the online implementation. A static obstacle augmentation, and a local re-planning framework is presented to guarantee safe kinodynamic motion planning. Rigorous Lyapunov-based proofs are provided to guarantee closed-loop stability, while maintaining robustness and optimality. We finally evaluate the efficacy of the proposed framework with simulations and we provide a qualitative comparison of kinodynamic motion planning techniques.
|
|
11:00-11:20, Paper WeA08.4 | Add to My Program |
Planning Swift Maneuvers of Quadcopter Using Motion Primitives Explored by Reinforcement Learning |
Camci, Efe | Nanyang Technological University |
Kayacan, Erdal | Aarhus University |
Keywords: Learning, Control applications, Autonomous robots
Abstract: In this work, we propose a novel, learning-based approach for swift maneuver planning of unmanned aerial vehicles using motion primitives. Our approach is composed of two main stages: learning a set of motion primitives during offline training first, and utilization of them for online planning of fast maneuvers thereafter. We propose a compact disposition of motion primitives which consists of roll, pitch, and yaw motions to build up a simple yet effective representation for learning. Thanks to this compact representation, our method retains an easily transferable, reproducible, and referable knowledge which caters for real-time swift maneuver planning. We compare our approach with the current state-of-the-art methods for planning and control, and show improved navigation time performance up to 25% in challenging obstacle courses. We validate our approach through software-in-the-loop Gazebo simulations and real flight tests with Diatone FPV250 Quadcopter equipped with PX4 FMU.
|
|
11:20-11:40, Paper WeA08.5 | Add to My Program |
Prescribed Performance Control Guided Policy Improvement for Satisfying Signal Temporal Logic Tasks |
Varnai, Peter | KTH Royal Institute of Technology |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Learning, Formal verification/synthesis, Autonomous robots
Abstract: Signal temporal logic (STL) provides a user-friendly interface for defining complex tasks for robotic systems. Recent efforts aim at designing control laws or using reinforcement learning methods to find policies which guarantee satisfaction of these tasks. While the former suffer from the trade-off between task specification and computational complexity, the latter encounter difficulties in exploration as the tasks become more complex and challenging to satisfy. This paper proposes to combine the benefits of the two approaches and use an efficient prescribed performance control (PPC) base law to guide exploration within the reinforcement learning algorithm. The potential of the method is demonstrated in a simulated environment through two sample navigational tasks.
|
|
11:40-12:00, Paper WeA08.6 | Add to My Program |
Learning to Emulate an Expert Projective Cone Scheduler |
Ward, Andrew | Stanford University |
Master, Neal | Stanford University |
Bambos, Nicholas | Stanford University |
Keywords: Learning, Iterative learning control
Abstract: Projective cone scheduling defines a large class of rate-stabilizing policies for queueing models relevant to several applications. While there exists considerable theory on the properties of projective cone schedulers, there is little practical guidance on choosing the parameters that define them. In this paper, we propose an algorithm for designing an automated projective cone scheduling system based on observations of an expert projective cone scheduler. We show that the estimated scheduling policy is able to emulate the expert in the sense that the average loss realized by the learned policy will converge to zero. Specifically, for a system with n queues observed over a time horizon T, the average loss for the algorithm is O(ln(T)sqrt{ln(n)/T}). This upper bound holds regardless of the statistical characteristics of the system. The algorithm uses the multiplicative weights update method and can be applied online so that additional observations of the expert scheduler can be used to improve an existing estimate of the policy. This provides a data-driven method for designing a scheduling policy based on observations of a human expert. We demonstrate the efficacy of the algorithm with a simple numerical example and discuss several extensions.
|
|
WeA09 Regular Session, Franklin 9 |
Add to My Program |
Control of Hybrid and Electric Vehicles |
|
|
Chair: Canova, Marcello | The Ohio State University |
Co-Chair: Zhao, Dezong | Loughborough University |
|
10:00-10:20, Paper WeA09.1 | Add to My Program |
Optimising the Energy Efficiency and Transient Response of Diesel Engines through an Electric Turbocharger |
Zhao, Dezong | Loughborough University |
Stobart, Richard | Loughborough University |
Mason, Byron | Loughborough University |
Keywords: Automotive systems, Mechatronics, Predictive control for nonlinear systems
Abstract: The electric turbocharger provides great potential for vehicle fuel efficiency improvement, exhaust emissions reduction and transient response acceleration. It makes the engine runs as a hybrid system so critical challenges are raised in energy management and control. This paper proposes a real-time energy management strategy for the electric turbocharger. A multi-variable explicit model predictive controller is designed to regulate the key variables in the engine air system, while the optimal setpoints of those variables are generated by a high level controller. The controllers work in a highly efficient way to achieve the optimal energy management. This strategy has been validated in simulations and experiments. Excellent tracking performance and high robustness demonstrate the effectiveness of the proposed method.
|
|
10:20-10:40, Paper WeA09.2 | Add to My Program |
Real-Time Capable Driving Strategy for EVs Using Linear MPC |
Morlock, Florian | University of Stuttgart |
Wohlhaupter, Uli | Daimler AG |
Sawodny, Oliver | University of Stuttgart |
Keywords: Automotive control, Optimal control, Automotive systems
Abstract: Recent trends in automotive industry reveal strict movement towards electromobility. However, limited electric vehicle (EV) range poses a major impediment of this movement which is tackled by development of sophisticated advanced driver assistance systems (ADAS). This paper presents a novel approach for computation of energy efficient speed trajectories for EVs. The proposed approach aims for application in an intelligent cruise controller (ICC) framework utilizing lookahead data for the road provided by advanced navigational systems and a simplified vehicle model. To evaluate the algorithm's performance, a simulative study is carried out comparing optimized speed trajectories to baseline ICC. Distinctive feature of this work presents the derivation of a simplified powertrain model which is used in linear MPC. This makes the proposed approach perfectly suitable for prototypical implementation and offers potential for transfer to standard electronic control units.
|
|
10:40-11:00, Paper WeA09.3 | Add to My Program |
Inverse Model Allocation for Optimized Coordination of a Turbocharged SI Engine with Electric Supercharger |
Rostiti, Cristian | The Ohio State University |
Canova, Marcello | The Ohio State University |
Serrani, Andrea | The Ohio State University |
Hellström, Erik | Ford Research and Advanced Engineering |
Xiao, Baitao | Ford Motor Company |
Keywords: Automotive control, Output regulation, Algebraic/geometric methods
Abstract: Electric boosting is a promising solution to improve the dynamic response of the air path system in downsized turbocharged engines. Unfortunately, typical electric supercharge controllers do not take into account the action of the wastegate actuator when generating the references for the e-compressor shaft speed, which can lead to overshoots and poor overall tracking performance. Leveraging on the presence of an existing feedback tracking controller for the wastegate and e-compressor, a plug-in module based on the inverse model allocation framework is design to coordinate the action of the two actuators. The module is tested using a model in the loop platform, based on a high-fidelity engine model in GT-Suite. Significant reduction of power losses are observed for a launch maneuver.
|
|
11:00-11:20, Paper WeA09.4 | Add to My Program |
Development of a Torque Vectoring System in Hybrid 4WD Vehicles to Improve Vehicle Safety and Agility |
Park, Giseo | KAIST |
Choi, Seibum Ben | KAIST |
Keywords: Automotive control, Mechanical systems/robotics, Mechatronics
Abstract: In this paper, a new method for vehicle torque vectoring (TV) with the difference in torques between the left and right sides is introduced. This chassis control system can help the vehicle follow the driver’s intended line without vehicle deceleration. Targeting a hybrid four wheel drive (4WD) vehicle with an active differential in rear axle and in-wheel motors (IWMs) in front axle, a TV system based on a vehicle bicycle model is developed. Especially, a new yaw rate reference smoothly varying between safety mode and sport mode aims to enhance both cornering safety and agility. To properly combine these two modes, a weighting factor based on steering command is designed. Also, to track the reference accurately, an integral sliding mode controller (SMC) is introduced in this paper, which has the advantage of reducing yaw rate error during steady state cornering. Lastly, a torque distribution method based on modeling of both active differential and IWM is developed to generate the correct yaw moment. Also, it reflects the actuator characteristics, such as response time, torque capacity, and torque direction. The performance of the proposed TV system is evaluated using a vehicle dynamic software, and a comparative study is also conducted.
|
|
11:20-11:40, Paper WeA09.5 | Add to My Program |
Optimal Control of an Integrated Energy and Thermal Management System for Electrified Powertrains |
Wei, Caiyang | Eindhoven University of Technology |
Hofman, Theo | Technische Universiteit Eindhoven |
Ilhan Caarls, Esin | Bosch Transmission Technology |
van Iperen, Rokus | Bosch Transmission Technology |
Keywords: Automotive systems
Abstract: This paper proposes an integrated energy and thermal management system (IETMS) to quantify the influence of a cold-start on the fuel-saving potential and the gain of utilizing waste heat recovery (WHR) technologies on the ultimate fuel saving of a plug-in hybrid electric vehicle with cabin heating. A cold-start indicates a low engine temperature, which increases the frictional power loss, resulting in excess fuel consumption. A dual source WHR (DSWHR) system harvests waste heat from exhaust gases and the recovered power is temporarily stored into the battery and can be retrieved when needed. Furthermore, it recuperates waste energy from a continuously variable transmission and an electric machine including power electronics to increase the heating performance of a heat pump, which reduces the load on the battery. For a known driving cycle, New European Driving Cycle, the IETMS aims to maximize the fuel efficiency. Numerical results demonstrate that a cold-start has a remarkable impact on the fuel-saving potential, 7.1%, yet a small influence on the optimization strategy. The DSWHR system shows a significant improvement on the ultimate fuel saving, up to 13.1%, from which insights into the design of WHR technologies can be drawn.
|
|
11:40-12:00, Paper WeA09.6 | Add to My Program |
Estimating Rack Force Due to Road Slopes for Electric Power Steering Systems |
Bhardwaj, Akshay | University of Michigan |
Gillespie, Brent | University of Michigan |
Freudenberg, James S. | Univ. of Michigan |
Keywords: Automotive systems, Modeling, Automotive control
Abstract: The net force generated by tire moments on the steering rack of a vehicle, called the rack force, holds a significant amount of information about the tire-road angle, the surface profile of road, and the speed of the vehicle. As a result, many electric power steering control applications rely on the estimation of rack force. Current methods of rack force estimation are inaccurate because they either do not account for road profile in the rack force estimation or are susceptible to disturbances acting in the steering system. In this paper we overcome both of these limitations and develop two real-time capable models to estimate the rack force for driving on longitudinal and lateral road slopes using vehicle and tire dynamics models. We demonstrate the accuracy of our models by analyzing the results from actual driving experiments performed on sloped roads under normal and aggressive driving situations. We also compare the performance of the two models with a model existing in the literature that does not account for road slopes.
|
|
WeA10 Regular Session, Franklin 10 |
Add to My Program |
Predictive Control for Linear Systems |
|
|
Chair: Rossiter, John Anthony | University of Sheffield |
Co-Chair: Olaru, Sorin | CentraleSupélec |
|
10:00-10:20, Paper WeA10.1 | Add to My Program |
Complexity Bounds for Obstacle Avoidance within a Zonotopic Framework |
Ioan, Daniel | L2S-Univ. Paris-Sud-CentraleSupelec-CNRS, Universite Paris Sacla |
Prodan, Ionela | Grenoble Institute of Technology (Grenoble INP) - Esisar |
Stoican, Florin | UPB (Politehnica UNiversity of Bucharest) |
Olaru, Sorin | CentraleSupélec - Inria Saclay |
Niculescu, Silviu-Iulian | CNRS-Supelec |
Keywords: Predictive control for linear systems, Constrained control, Multivehicle systems
Abstract: This paper addresses the problem of collision avoidance in a multi-obstacle environment and focuses on its representation in optimization-based control problems. The design problem is commonly stated in the literature in terms of a constrained optimization problem over a non-convex domain. Preliminary results make use of hyperplane arrangements to characterize these regions. The current paper considers additional structural constraints by the use of zonotopic over-approximation and highlights their benefits when introduced in the obstacle avoidance problem. Comparisons with classical sampled-based approaches are presented through simulations.
|
|
10:20-10:40, Paper WeA10.2 | Add to My Program |
Adaptive Predictor-Based Control for Perturbed Systems with Time-Delay: Applied in Real-Time |
Caballero-Barragán, Humberto | CINVESTAV Unidad Guadalajara |
Osuna-Ibarra, Linda Patricia | CINVESTAV Unidad Guadalajara |
Loukianov, Alexander G. | CINVESTAV IPN Unidad GDL |
Plestan, Franck | Ecole Centrale De Nantes-LS2N |
Keywords: Predictive control for linear systems, Indirect adaptive control, Delay systems
Abstract: In this paper, a robust predictive control with plant parameter adaptation for time-delay systems is designed. The controller is divided into two parts in order to tackle two problems, the uncertainty adaptation, and the output tracking control. The first control part is used to compensate an unknown parameter vector while the other predictive part deals with the output tracking control. Theoretical results are implemented for two cases of study, the first one thanks to simulations for a third order system, and the second one on real-time application to a circuit system.
|
|
10:40-11:00, Paper WeA10.3 | Add to My Program |
Model Predictive Selection: A Receding Horizon Scheme for Actuator Selection |
Lima Silva, Vinicius | University of Pennsylvania |
de Oliveira Chamon, Luiz Fernando | University of Pennsylvania |
Ribeiro, Alejandro | University of Pennsylvania |
Keywords: Predictive control for linear systems, Large-scale systems, Optimal control
Abstract: We propose a model predictive scheme for selecting actuators in dynamical systems. In control applications, selection problems arise due to the high cost associated to simultaneously using all sensors or actuators in large-scale systems. Since these problems are NP-hard in general, finding an optimal solutions is impractical and approximations based on greedy or convex relaxations are commonly used. In most approaches, however, the control policy and actuator subsets are obtained a priori. In this work, we address the online problem using a model predictive selection (MPS). This iterative procedure inspired by model predictive control methods determines a near-optimal actuator subset for a finite operation horizon starting at the current state, applies the first control action on this subset, and repeats the procedure starting from the new state. Despite using suboptimal solutions of the selection problem, we derive conditions that guarantee this procedure is stable. We illustrate these conditions for the LQR problem by leveraging the concept of approximate submodularity and conclude with numerical experiments that showcase the use of the proposed approach.
|
|
11:00-11:20, Paper WeA10.4 | Add to My Program |
Safe and Near-Optimal Policy Learning for Model Predictive Control Using Primal-Dual Neural Networks |
Zhang, Xiaojing | UC Berkeley |
Bujarbaruah, Monimoy | UC Berkeley |
Borrelli, Francesco | Unversity of California at Berkeley |
Keywords: Predictive control for linear systems, Neural networks, Machine learning
Abstract: In this paper, we propose a novel framework for approximating the explicit MPC law for linear parameter-varying systems using supervised learning. In contrast to most existing approaches, we not only learn the control policy, but also a "certificate policy", that allows us to estimate the suboptimality of the learned control policy online, during execution-time. We learn both these policies from data using supervised learning techniques, and also provide a randomized method that allows us to guarantee the quality of each learned policy, measured in terms of feasibility and optimality. This in turn allows us to bound the probability of the learned control policy of being infeasible or suboptimal, where the check is performed by the certificate policy. Since our algorithm does not require the solution of an optimization problem during run- time, it can be deployed even on resource-constrained systems. We illustrate the efficacy of the proposed framework on a vehicle dynamics control problem where we demonstrate a speedup of up to two orders of magnitude compared to online optimization with minimal performance degradation.
|
|
11:20-11:40, Paper WeA10.5 | Add to My Program |
Offset-Free Input-Output Formulations of Stochastic Model Predictive Control Based on Polynomial Chaos Theory |
von Andrian, Matthias | MIT |
Braatz, Richard D. | Massachusetts Institute of Technology |
Keywords: Predictive control for linear systems, Uncertain systems, Stochastic systems
Abstract: Stochastic model predictive control (SMPC) formulations are proposed that have both low on-line computational cost and zero steady-state offset for constrained dynamical systems of high state dimension. The effects of probabilistic parameter uncertainties on the process outputs are quantified using polynomial chaos theory, and the scalability with state dimension is obtained by using an input-output formulation. An explanation is provided for why the structure of some SMPC formulations provide zero steady-state error whereas other seemingly reasonable formulations do not. The article also describes how to incorporate chance constraints on the states and outputs into the SMPC formulations, while retaining an online optimization whose cost has a weak dependency on the number of states and outputs.
|
|
11:40-12:00, Paper WeA10.6 | Add to My Program |
A New Paradigm for Predictive Functional Control to Enable More Consistent Tuning |
Rossiter, John Anthony | University of Sheffield |
Bin Abdullah, Muhammad | The University of Sheffield |
Keywords: Predictive control for linear systems
Abstract: This paper presents two significant contributions to the understanding of Predictive Functional Control (PFC). First, it gives novel insights and explanations into a poorly understood issue, that is the weak link between PFC tuning parameters and the resulting closed-loop behaviour. This new understanding is then exploited to proposed a modification to the existing PFC algorithm which creates a much stronger tuning link while retaining the critical properties of elementary coding and understanding. The efficacy of the proposal is demonstrated on several numerical examples.
|
|
WeA11 Invited Session, Room 401-402 |
Add to My Program |
Security and Privacy of Cyber-Physical Systems |
|
|
Chair: Nekouei, Ehsan | KTH Royal Institute of Technology |
Co-Chair: Ruths, Justin | University of Texas at Dallas |
Organizer: Ruths, Justin | University of Texas at Dallas |
Organizer: Sandberg, Henrik | KTH Royal Institute of Technology |
Organizer: Umsonst, David | KTH Royal Institute of Technology |
|
10:00-10:20, Paper WeA11.1 | Add to My Program |
Towards Differential Privacy for Symbolic Systems (I) |
Jones, Austin | Massachusetts Institute of Technology Lincoln Laboratory |
Leahy, Kevin | MIT Lincoln Laboratory |
Hale, Matthew | University of Florida |
Keywords: Randomized algorithms, Automata, Formal verification/synthesis
Abstract: In this paper, we develop a privacy implementation for symbolic control systems. Such systems generate sequences of non-numerical data, and these sequences can be represented by words or strings over a finite alphabet. This work uses the framework of differential privacy, which is a statistical notion of privacy that makes it unlikely that privatized data will reveal anything meaningful about underlying sensitive data. To bring differential privacy to symbolic control systems, we develop an exponential mechanism that approximates a sensitive word using a randomly chosen word that is likely to be near it. The notion of “near” is given by the Levenshtein distance, which counts the number of operations required to change one string into another. We then develop a Levenshtein automaton implementation of our exponential mechanism that efficiently generates privatized output words. This automaton has letters as its states, and this work develops transition probabilities among these states that give overall output words obeying the distribution required by the exponential mechanism. Numerical results are provided to demonstrate this technique for both strings of English words and runs of a deterministic transition system, demonstrating in both cases that privacy can be provided in this setting while maintaining a reasonable degree of accuracy.
|
|
10:20-10:40, Paper WeA11.2 | Add to My Program |
Networked Control under DoS Attacks: Trade-Off between Resilience and Data Rate (I) |
Feng, Shuai | University of Groningen |
Cetinkaya, Ahmet | Tokyo Institute of Technology |
Ishii, Hideaki | Tokyo Institute of Technology |
Tesi, Pietro | University of Florence |
De Persis, Claudio | University of Groningen |
Keywords: Networked control systems, Quantized systems, Stability of linear systems
Abstract: We study communication-constrained networked control problems for linear time-invariant systems in the presence of Denial-of-Service (DoS) attacks, namely attacks that prevent transmissions over the communication network. Our work aims at exploring the relationship between system resilience and network bandwidth. Given a class of DoS attacks, we characterize the bit-rate bounds that are dependent on the unstable eigenvalues of the dynamic matrix of the plant and the parameters of DoS attacks, beyond which exponential stability of the closed-loop system can be guaranteed. Our characterization clearly shows the trade-off between the communication bandwidth and resilience against DoS. An example is given to illustrate the proposed solution approach.
|
|
10:40-11:00, Paper WeA11.3 | Add to My Program |
A Model Inversion Based Watermark for Replay Attack Detection with Output Tracking (I) |
Romagnoli, Raffaele | Carnegie Mellon University |
Weerakkody, Sean | Carnegie Mellon University |
Sinopoli, Bruno | Carnegie Mellon University |
Keywords: Fault detection, Linear systems, Output regulation
Abstract: This article proposes a new approach for replay attack detection using a model inversion based physical watermark. We consider a defender who tracks a constant reference at the output. This leaves a system vulnerable to replay attacks, where an adversary replaces the true outputs of a system with a recorded sequence. In steady state a defender can not distinguish between normal and replayed outputs, allowing an undetected attack. This paper argues that a controller using model inversion can achieve simultaneous tracking and security performance. Specifically, this approach computes a feedforward input using a technique called pseudo-inversion, which is then added to a constant reference signal. Beyond considering physical watermarking in a new setting of output tracking, the main advantage of this approach is the performance guarantees of the associated controller. Unlike classical physical watermarking which introduces stochastic inputs that can lead to potentially undesirable behavior, model inversion watermarking allows a defender to carefully utilize several degrees of freedom to achieve predictable control performance during normal operation and detect malicious behavior while under replay attack. In this paper, we focus on a practical scheme, which uses time resets. Moreover, we demonstrate our solution can be applied to nonminimum phase systems.
|
|
11:00-11:20, Paper WeA11.4 | Add to My Program |
A Moving Target Defense to Detect Stealthy Attacks in Cyber-Physical Systems (I) |
Giraldo, Jairo | University of Texas at Dallas |
Cardenas, Alvaro | University of Texas at Dallas |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Keywords: Networked control systems, Switched systems, Estimation
Abstract: Cyber-Physical Systems (CPS) have traditionally been considered more static, with regular communication patterns when compared to classical information technology networks. Because the structure of most CPS remains unchanged during long periods of time, they become vulnerable to adversaries who can tailor their attacks based on their precise knowledge of the system dynamics, communications, and control. Moving Target Defense (MTD) has emerged as a strategy to add uncertainty about the state and execution of a system in order to prevent adversaries from having predictable effects with their attacks. In this work we propose a novel type of MTD strategy that randomly changes the availability of the sensor data, so that it is harder for adversaries to tailor stealthy attacks and at the same time it can minimize the impact of false-data injection attacks. Using tools from switched control systems we formulate an optimization problem to find the probability of the switching signals that increase the visibility of stealthy attacks while decreasing the deviation caused by false data injection attacks.
|
|
11:20-11:40, Paper WeA11.5 | Add to My Program |
On the Confidentiality of Linear Anomaly Detector States (I) |
Umsonst, David | KTH Royal Institute of Technology |
Nekouei, Ehsan | KTH Royal Institute of Technology |
Teixeira, André M. H. | Uppsala University |
Sandberg, Henrik | KTH Royal Institute of Technology |
Keywords: Networked control systems, Emerging control applications
Abstract: A malicious attacker with access to the sensor channel in a feedback control system can severely affect the physical system under control, while simultaneously being hard to detect. A properly designed anomaly detector can restrict the impact of such attacks, however. Anomaly detectors with an internal state (stateful detectors) have gained popularity because they seem to be able to mitigate these attacks more than detectors without a state (stateless detectors). In the analysis of attacks against control systems with anomaly detectors, it has been assumed that the attacker has access to the detector's internal state, or designs its attack such that it is not detected regardless of the detector's state. In this paper, we show how an attacker can realize the first case by breaking the confidentiality of a stateful detector state evolving with linear dynamics, while remaining undetected and imitating the statistics of the detector under nominal conditions. The realization of the attack is posed in a convex optimization framework using the notion of Kullback-Leibler divergence. Further, the attack is designed such that the maximum mean estimation error of the Kalman filter is maximized at each time step by exploiting dual norms. A numerical example is given to illustrate the results.
|
|
11:40-12:00, Paper WeA11.6 | Add to My Program |
Generalized Chi-Squared Detector for LTI Systems with Non-Gaussian Noise (I) |
Hashemi, Navid | University of Texas at Dallas |
Ruths, Justin | University of Texas at Dallas |
Keywords: Fault detection, Stochastic systems, Control applications
Abstract: Previously, we derived exact relationships between the properties of a linear time-invariant control system and properties of an anomaly detector that quantified the impact an attacker can have on the system if that attacker aims to remain stealthy to the detector. A necessary first step in this process is to be able to precisely tune the detector to a desired level of performance (false alarm rate) under normal operation, typically through the selection of a threshold parameter. To-date efforts have only considered Gaussian noises. Here we generalize the approach to tune a chi-squared anomaly detector for noises with non-Gaussian distributions. Our method leverages a Gaussian Mixture Model to represent the arbitrary noise distributions, which preserves analytic tractability and provides an informative interpretation in terms of a collection of chi-squared detectors and multiple Gaussian disturbances.
|
|
WeA12 Regular Session, Room 403 |
Add to My Program |
Adaptive Control |
|
|
Chair: Chen, Ti | York University |
Co-Chair: Dong, Xinmin | Air Force Engineering University |
|
10:00-10:20, Paper WeA12.1 | Add to My Program |
Distributed Tracking of Multiple Under-Actuated Lagrangian Systems with Uncertain Parameters and Actuator Faults |
Chen, Ti | York University |
Shan, Jinjun | York University |
Keywords: Adaptive control, Cooperative control, Uncertain systems
Abstract: A distributed adaptive controller is proposed for a class of under-actuated Lagrangian systems under a directed communication graph to control the actuated variables to track a dynamic leader and keep unactuated ones bounded. A finite time observer is introduced to estimate the leader’s velocity. Based on the two sliding variables defined for the actuated and unactuated channels, the adaptive controllers are designed for the under-actuated Lagrangian systems with or without actuator faults. The convergence of the proposed controllers is proved based on the separation principle between the estimation and control. Finally, experiments are conducted to verify the effectiveness of the proposed controllers.
|
|
10:20-10:40, Paper WeA12.2 | Add to My Program |
Classical D-Step-Ahead Adaptive Control Revisited: Linear-Like Convolution Bounds and Exponential Stability |
Miller, Daniel E. | University of Waterloo |
Shahab, Mohamad T. | University of Waterloo |
Keywords: Adaptive control, Identification for control
Abstract: Classical discrete-time adaptive controllers provide asymptotic stabilization and tracking; neither exponential stabilization nor a bounded noise gain is typically proven. In recent work it has been shown, in both the pole placement stability setting and the first-order one-step-ahead tracking setting, that if the original, ideal, Projection Algorithm is used (subject to the common assumption that the plant parameters lie in a convex, compact set and that the parameter estimates are restricted to that set) as part of the adaptive controller, then a linear-like convolution bound on the closed loop behaviour can be proven; this immediately confers exponential stability and a bounded noise gain, and it can be leveraged to provide tolerance to unmodelled dynamics and plant parameter variation. In this paper we extend the approach to the d-step-ahead adaptive controller setting and prove comparable properties.
|
|
10:40-11:00, Paper WeA12.3 | Add to My Program |
On Adaptive Control of Uncertain Dynamical Systems in the Presence of Actuator Dynamics and Amplitude Saturation Limits |
Gruenwald, Benjamin | University of South Florida |
Yucelen, Tansel | University of South Florida |
Dogan, Kadriye Merve | University of South Florida |
Muse, Jonathan | Wright Patterson Air Force Base |
Keywords: Intelligent systems, Adaptive control, LMIs
Abstract: In this paper, we propose a model reference adaptive control approach for uncertain dynamical systems in the presence of both actuator dynamics and actuator amplitude saturation limits. Specifically, we use a new expanded reference model including a deficit term between the ideal control signal and its saturated version. Closed-loop system stability of the proposed approach utilizing this expanded reference model is analyzed using linear matrix inequalities (LMIs) and Lyapunov theory, where the resulting stability conditions capture the interplay between the allowable actuator dynamics, actuator amplitude saturation limits, initial conditions, and the system uncertainties. An illustrative numerical example is further provided to demonstrate the efficacy of the proposed approach.
|
|
11:00-11:20, Paper WeA12.4 | Add to My Program |
Adaptive Tracking Control for a Class of Disturbed Nonlinear Systems with Unbounded Time Derivative for Disturbance |
Duan, Xiaojun | Northwestern Polytechnical University |
Dong, Xinmin | Aeronautics Engineering College, Air Force Engineering Universit |
Liu, Zongcheng | Aeronautics Engineering College, Air Force Engineering Universit |
Lyu, Maolong | Delft Center for Systems and Control, Delft University of Techno |
Zhang, Wenqian | Air Force Engineering University |
Keywords: Adaptive control, Lyapunov methods, Stability of nonlinear systems
Abstract: Adaptive tracking control problem for disturbed nonlinear systems with the time derivative of disturbance being unbounded is investigated in this paper. Different from the existing literatures, a new disturbance observer is constructively proposed with its parameters being functions rather than constants, which results in a new manner for our disturbance observer. The convergence of the new disturbance observer is then proved based on Lyapunov stability theorem. Moreover, it is proved that the tracking error of system can be regulated to arbitrary small by appropriately choosing the design functions and parameters. Finally, simulation results are given to demonstrate the effectiveness of designed method.
|
|
11:20-11:40, Paper WeA12.5 | Add to My Program |
Adaptive Feedback Noise Control for Wide, Square, and Tall Systems |
Xie, Antai | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control, Direct adaptive control
Abstract: This paper considers MIMO feedback noise control in a three-dimensional acoustic space, where the plant may be wide, tall, or square. The goal is to investigate the implications of the plant aspect ratio within the context of retrospective cost adaptive control (RCAC), which is susceptible to canceling unmodeled nonminimum-phase transmission zeros. To obtain the necessary modeling information, each control speaker is impulsed, and the data from the resulting impulse response is used to construct the intercalated target model needed by RCAC. No additional system identification or analytical modeling is used for controller implementation. Laboratory experiments are used to evaluate the ability of RCAC to reject harmonic and broadband disturbances for wide, square, and tall sensor/actuator configurations.
|
|
11:40-12:00, Paper WeA12.6 | Add to My Program |
Adaptive Control of Systems with Unknown Nonminimum-Phase Zeros Using Cancellation-Based Pseudo-Identification |
Islam, Syed Aseem Ul | University of Michigan |
Xie, Antai | University of Michigan |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Adaptive control
Abstract: Adaptive control of linear systems with unknown nonminimum-phase (NMP) zeros remains a significant challenge. Although retrospective cost adaptive control (RCAC) is applicable to NMP systems with known NMP zeros, errors in the knowledge of those zeros can lead to unstable pole/zero cancellation under sufficiently aggressive tuning. To address this problem, this paper provides a numerical investigation of a heuristic extension of RCAC that exploits the propensity of RCAC to cancel NMP zeros, thereby inferring the NMP zeros. This modeling information can be subsequently incorporated within the target model used by RCAC. By focusing on only NMP zeros, this approach is distinct from conventional system identification, which relies on input-output data for model fitting. This cancellation-based technique relies on saturation of the control input and instability of the feedback controller. Simultaneous occurrence of control saturation and controller instability provides a heuristic indicator that the controller has cancelled one or more NMP zero during closed-loop operation. The estimated NMP zeros are subsequently used within a cancellation-based pseudo-identification extension of RCAC to prevent further cancellation of the NMP zeros.
|
|
WeA13 Regular Session, Room 404 |
Add to My Program |
Observers for Nonlinear Systems I |
|
|
Chair: Zemouche, Ali | Cran Umr Cnrs 7039 |
Co-Chair: Yong, Sze Zheng | Arizona State University |
|
10:00-10:20, Paper WeA13.1 | Add to My Program |
Bounded-Error Estimator Design with Missing Data Patterns Via State Augmentation |
Hassaan, Syed | Arizona State University |
Shen, Qiang | Arizona State University |
Yong, Sze Zheng | Arizona State University |
Keywords: Observers for Linear systems, Switched systems, Optimization
Abstract: In this paper, we present a bounded-error estimator that achieves equalized recovery for discrete-time time-varying affine systems subject to missing data. By augmenting the system state estimate with a Luenberger-like observer error, we formulate the equalized recovery estimator design problem as a semi-infinite optimization problem, and leverage tools from robust optimization to solve it. Due to the design freedom introduced by the Luenberger-like observer, we can place the eigenvalues of the augmented system to desired locations, which results in a more optimal intermediate level in the equalized recovery problem than existing approaches in the literature. Furthermore, as an extension of the proposed equalized recovery estimator, we consider missing data in the estimator design, where a fixed-length language is used to specify the allowable missing data patterns. Simulation examples involving an adaptive cruise control system are given to demonstrate the equalized recovery performance of the proposed estimator.
|
|
10:20-10:40, Paper WeA13.2 | Add to My Program |
Linear Position Estimation on Smart Actuators Using a Nonlinear Observer |
Movahedi, Hamidreza | University of Minnesota |
Zemouche, Ali | Cran Umr Cnrs 7039 |
Rajamani, Rajesh | Univ. of Minnesota |
Keywords: Observers for nonlinear systems, Control applications, Fluid power control
Abstract: This paper focuses on observer design for a dynamic system with non-monotonic nonlinear measurement equations. A Lyapunov-analysis-based observer design method for exponentially stable state estimation and a corresponding LMI for computing the observer design gains are developed. This observer design method is applied to linear position estimation using magnetic fields for smart industrial actuators. The output equations for magnetic field as a function of position are nonlinear and non-monotonic. A single constant gain that can satisfy the observer stability condition over the entire range of operating conditions does not exist, but a constant stabilizing gain does exist in each piecewise monotonic region. A methodology for discretizing the operating range into piecewise regions and using a finite state machine for switching between piecewise regions with stabilizing observer gains is developed. Experimental results are presented on the performance of the observer in accurately estimating linear position.
|
|
10:40-11:00, Paper WeA13.3 | Add to My Program |
On Observability and Stability of Moving-Horizon Estimation in a Distributional Framework |
Krishnan, Vishaal | University of California, San Diego |
Martinez, Sonia | University of California at San Diego |
Keywords: Observers for nonlinear systems, Estimation, Optimization algorithms
Abstract: In this work, we propose a unifying framework in the space of probability measures for gradient-based and sampling-based moving-horizon estimation methods. We begin with an investigation of the classical notion of strong local observability of nonlinear systems and its relationship to optimization-based state estimation. We then present a general moving-horizon estimation framework for strongly locally observable systems, as an iterative minimization scheme in the space of probability measures. This framework allows for the minimization of the estimation cost with respect to different metrics and divergences. In particular, we consider two variants, which we name W_2-MHE and KL-MHE, where the minimization scheme uses the 2-Wasserstein distance and the KL-divergence respectively. The W_2-MHE yields a gradient-based estimator whereas the KL-MHE yields a particle filter, for which we investigate asymptotic stability and robustness properties. Stability results for these moving-horizon estimators are derived in the distributional setting, against the backdrop of the classical notion of strong local observability which, to the best of our knowledge, differentiates it from other previous works. We also present results from numerical simulations to demonstrate the performance of these estimators.
|
|
11:00-11:20, Paper WeA13.4 | Add to My Program |
Self-Triggered Interval Observers for Lipschitz Nonlinear Systems |
Tahir, Adam | University of Washington |
Xu, Xiangru | University of Washington |
Acikmese, Behcet | University of Washington |
Keywords: Observers for nonlinear systems, Hybrid systems, Control over communications
Abstract: This paper constructs observers for linear and Lipschitz nonlinear systems with self-triggered measurements by utilizing the interval observer framework, which guarantees that an upper bound on the error between the estimated state and the actual state are known. The self-triggered observers are designed based on periodically sampled interval observers which guarantees a positive uniform minimum inter-sampling time. Convex programs for constructing the observer gains and the triggering functions are proposed. Simulation results are given to show the effectiveness of the proposed algorithms.
|
|
11:20-11:40, Paper WeA13.5 | Add to My Program |
Hybrid Implementation of Observers in Initial Coordinates with a Finite Number of Approximate Inversions and Global Convergence |
Bernard, Pauline | University of Bologna |
Marconi, Lorenzo | Univ. Di Bologna |
Keywords: Observers for nonlinear systems, Hybrid systems
Abstract: In this paper, we assume we are given an asymptotic observer whose dynamics are not written in the plant’s coordinates and whose implementation requires the inversion of an injective immersion at each time. To avoid these costly computations, we propose a method to write the observer dynamics directly in the plant’s coordinates by extending the injective immersion into a diffeomorphism and inverting its Jacobian. This is done by combining, in a hybrid way, those dynamics with an independent practical observer (maybe of smaller dimension), which is used to reset the estimate whenever it leaves the diffeomorphism domain where the Jacobian is invertible. This latter operation may necessitate to inverse an injective map, but we show that it happens only a finite number of times during the transient, and this inversion does not need to be exact : it can be done thanks to a minimization on a rough grid. The obtained observer is proved to be globally asymptotically convergent and robust to noise. Its performances are illustrated on a bioreactor model.
|
|
11:40-12:00, Paper WeA13.6 | Add to My Program |
Exponential Observers for Discrete-Time Nonlinear Systems with Incremental Quadratic Constraints |
Zhang, Wei | Shanghai University of Engineering Science |
Zhao, Younan | Shanghai University of Engineering Science |
Abbaszadeh, Masoud | GE Global Research |
Ji, Mingming | Shanghai University of Engineering Science |
Cai, Xiushan | Zhejiang Normal University |
Keywords: Observers for nonlinear systems, Lyapunov methods
Abstract: This paper investigates the observer design for a class of nonlinear discrete-time systems satisfying incremental quadratic constraints. A circle criterion based full-order observer is constructed by injecting output estimation error into the observer nonlinear terms. We also construct a reduced-order observer to estimate the unmeasured system state. The proposed observers guarantee exponential convergence of the estimation error to zero. The design of the proposed observers is reduced to solving a set of linear matrix inequalities. It is proved that the conditions under which a full-order observer exists also guarantee the existence of a reduced-order observer. Compared to some previous results in the literature, this work considers a larger class of nonlinearities and unifies some related observer designs for discrete-time nonlinear systems. Finally, a numerical example is given to illustrate the effectiveness of the proposed design.
|
|
WeA14 Regular Session, Room 405 |
Add to My Program |
Robust Control I |
|
|
Chair: Bopardikar, Shaunak D. | Michigan State University |
Co-Chair: Lather, Jagdeep Singh | Department of Electrical Engineering, National Institute of Technology, Kurukshetra |
|
10:00-10:20, Paper WeA14.1 | Add to My Program |
Experimental and Educational Platforms for Studying Architecture and Tradeoffs in Human Sensorimotor Control |
Liu, Quanying | Caltech |
Nakahira, Yorie | California Institute of Technology |
Mohideen, Ahkeel | California Institute of Technology |
Doyle, John C. | Caltech |
Keywords: Robust control, Biological systems, Networked control systems
Abstract: This paper describes several surprisingly rich but simple demos and a new experimental platform for human sensorimotor control research and also controls education. The platform safely simulates a canonical sensorimotor task of riding a mountain bike down a steep, twisting, bumpy trail using a standard display and inexpensive off-the-shelf gaming steering wheel with a force feedback motor. We use the platform to verify our theory, presented in a companion paper. The theory tells how component hardware speed-accuracy tradeoffs (SATs) in control loops impose corresponding SATs at the system level and how effective architectures mitigate the deleterious impact of hardware SATs through layering and 'diversity sweet spots' (DSSs). Specifically, we measure the impacts on system performance of delays, quantization, and uncertainties in sensorimotor control loops, both within the subject's nervous system and added externally via software in the platform. This provides a remarkably rich test of the theory, which is consistent with all preliminary data. Moreover, as the theory predicted, subjects effectively multiplex specific higher layer planning/tracking of the trail using vision with lower layer rejection of unseen bump disturbances using reflexes. In contrast, humans multitask badly on tasks that do not naturally distribute across layers (e.g. texting and driving). The platform is cheap to build and easy to program for both research and education purposes, yet verifies our theory, which is aimed at closing a crucial gap between neurophysiology and sensorimotor control. The platform can be downloaded at https://github.com/Doyle-Lab/WheelCon.
|
|
10:20-10:40, Paper WeA14.2 | Add to My Program |
Output-Feedback Linear Quadratic Robust Control under Actuation and Deception Attacks |
Hespanha, Joao P. | Univ. of California, Santa Barbara |
Bopardikar, Shaunak D. | Michigan State University |
Keywords: Robust control, Game theory
Abstract: We consider output-feedback robust control of a linear system subject to disturbances and noise and in presence of an attacker who: 1) can corrupt the measured output (deception attack) and, 2) can introduce perturbations to the control signal (actuation attack). We consider an open-loop control problem over a finite horizon which models the scenario where feedback control could be stopped if one is certain that an attack is ongoing. We formulate this problem as a zero-sum game between a defender that selects the control signal based on a measured output and an attacker that selects the attack signals. The game has asymmetric information in that the defender only knows the measured output, whereas the attacker knows additional information, which includes the value of initial conditions and disturbances/measurement noise. The main contributions are (i) sufficient conditions for the existence of a Nash equilibrium corresponding to a saddle-point for the defender and (ii) a computationally efficient procedure to compute a pair of policies that form a Nash equilibrium for the game. We apply the procedure to a finite horizon linear quadratic control problem.
|
|
10:40-11:00, Paper WeA14.3 | Add to My Program |
Synthesis of Strictly Negative Imaginary Controllers Using a H∞ Performance Index |
Lee, Ken | McGill University |
Forbes, James Richard | McGill University |
Keywords: Robust control, H-infinity control, Mechanical systems/robotics
Abstract: Negative imaginary (NI) systems are those characterized by a negative imaginary frequency response. A NI system connected in a positive feedback interconnection with a strictly negative imaginary (SNI) controller is internally stable if and only if a DC gain condition is satisfied. This can be interpreted as a robust stability result in situations where plant uncertainty does not destroy the NI nature of the plant nor the DC gain condition. Motivated by a desire to realize improved closed-loop performance, this paper considers the design of H ∞ -optimal SNI controllers. The proposed synthesis method makes use of convex optimization and linear matrix inequality (LMI) tools. Another contribution of this paper is pointing out how to realize tip position control, rather than joint position control, of a flexible manipulator within a NI framework. Numerical simulation results are included.
|
|
11:00-11:20, Paper WeA14.4 | Add to My Program |
Robust and LPV Economic Linear Optimal Control |
Zhang, Jin | Illinois Institute of Technology |
Chmielewski, Donald J. | Illinois Institute of Technology |
Keywords: Robust control, Linear parameter-varying systems, Uncertain systems
Abstract: This work investigates how to address box-type uncertainties in economic linear optimal control (ELOC). We consider two methods, a robust formulation for when the uncertainty is completely unknown and a Linear Parameter Varying formulation for when uncertainty can be measured in real time. In both cases, the infinite number of conditions that need to be satisfied are reduced to a finite set of constraints. The resulting problem formulations have a similar structure to the ELOC and can be solved globally by employing the generalized Benders decomposition.
|
|
11:20-11:40, Paper WeA14.5 | Add to My Program |
Theoretical Foundations for Layered Architectures and Speed-Accuracy Tradeoffs in Sensorimotor Control |
Nakahira, Yorie | California Institute of Technology |
Liu, Quanying | Caltech |
Bernat, Natalie | Caltech |
Sejnowski, Terrence | Salk Institute |
Doyle, John C. | Caltech |
Keywords: Robust control, Optimal control, Biological systems
Abstract: Nervous systems sense, communicate, compute, and actuate movement, using distributed hardware with tradeoffs in speed and accuracy. The resulting sensorimotor control is nevertheless remarkably fast and accurate due to highly effective layered architectures. However, such architectures have received little attention in neuroscience due to the lack of theory that connects the system and hardware level speed-accuracy tradeoffs. In this paper, we present a theoretical framework that connects the speed-accuracy tradeoffs of sensorimotor control and neurophysiology. We characterize how the component SATs in spiking neuron communication and their sensory and muscle endpoints constrain the system SATs in both stochastic and deterministic models. The results show that appropriate speed-accuracy diversity at the neurons/muscles levels allow nervous systems to improve the speed and accuracy in control performance despite using slow or inaccurate hardware. Then, we characterize the fundamental limits of layered control systems and show that appropriate diversity in planning and reaction layers leads to both fast and accurate system despite being composed of slow or inaccurate layers. We term these phenomena ``Diversity Sweet Spots.'' The theory presented here is illustrated in a companion paper, which introduces simple demos and a new inexpensive and easy-to-use experimental platform.
|
|
WeA15 Invited Session, Room 406 |
Add to My Program |
Control Challenges in Smart Multi-Vehicle Systems |
|
|
Chair: Ferrante, Francesco | GIPSA-Lab and Université Grenoble Alpes |
Co-Chair: Dadras, Soodeh | Utah State University |
Organizer: Ahmed, Qadeer | The Ohio State University |
Organizer: Chen, Pingen | Tennessee Technological University |
Organizer: Scacchioli, Annalisa | Stevens Institute of Technology |
Organizer: Chen, Yan | Arizona State University |
|
10:00-10:20, Paper WeA15.1 | Add to My Program |
Automated Multi-Object Tracking for Autonomous Vehicle Control in Dynamically Changing Traffic (I) |
Hunde, Andinet | Clemson University |
Ayalew, Beshah | Clemson University |
Wang, Qian | Clemson University |
Keywords: Automotive control, Optimization, Estimation
Abstract: Public road traffic is rich in examples of dynamic objects suddenly appearing/disappearing in/from the Field of View (FoV) of an autonomous ego vehicle, such as when target vehicles zoom out by accelerating from the ego vehicle or sensor detections deteriorate temporarily due to shadows and other environmental effects. Thus, the guidance and control system should capture the motion of moving obstacles by a perception and tracking module capable of track management features including but not limited to track initiation and termination. This paper presents such a module that executes multi-target tracking with the linear integrated probabilistic data association (IPDA) filter in conjunction with a model predictive control (MPC) scheme for path and reference speed tracking and obstacle avoidance. From the perception module, all the confirmed tracks are made available to an Interacting Multiple Model (IMM) subsystem which predicts the motion of target vehicles to constrain the optimization problem in the MPC. The paper includes illustrations of the proposed scheme with practical traffic scenarios, which show that the ego vehicle is able to autonomously react to random changes in the number and/or state of target vehicles as well as to occasional missed detections due to environmental effects.
|
|
10:20-10:40, Paper WeA15.2 | Add to My Program |
Cooperative Adaptive Cruise Control Safety Enhancement Via Dynamic Communication Channel Selection (I) |
Wang, Zejiang | University of Texas at Austin |
Bai, Yunhao | The Ohio State Univiersty |
Zha, Jingqiang | University of Texas at Austin |
Wang, Junmin | University of Texas at Austin |
Wang, Xiaorui | The Ohio State Univesity |
Keywords: Multivehicle systems
Abstract: Adding vehicle-to-vehicle (V2V) communication into the adaptive cruise control (ACC) system produces the cooperative adaptive cruise control (CACC) with a reinforced road safety. However, current policy obliges safety-related data to be exchanged solely over the control channel (CCH) within the Dedicated Short-Range Communication (DSRC) spectrum, which may induce intolerable communication delay and higher accident risks. Standard countermeasures concentrate principally on adaptively adjusting transmission parameters. However, due to the limited network capacity of a single channel, these methods can hardly meet the real-time packet delivery requirement when vehicle density becomes high. Therefore, to ensure timely delivery of critical safety messages, this paper proposes instead a dynamic channel selection algorithm to fully exploit all the seven useable channels in the DSRC band. Experiments on a two-scaled-car platoon demonstrate the effectiveness of the method in reducing the vehicle CACC position and speed tracking errors.
|
|
10:40-11:00, Paper WeA15.3 | Add to My Program |
Robustified Distributed Model Predictive Control for Coherence and Energy Efficiency-Aware Platooning (I) |
Zambelli, Massimo | University of Pavia |
Ferrara, Antonella | University of Pavia |
Keywords: Multivehicle systems, Robust control, Variable-structure/sliding-mode control
Abstract: Platooning has become one of the most appealing formations for intelligent vehicles safety enhancement and traffic regulation. Besides the traditional control algorithms, which are required to enforce at least local and string stability, more complex control schemes can be designed to cope with advanced requirements. In this paper, a suitable Distributed Model Predictive Control (DMPC) scheme, robustified with a second-order Integral Sliding Mode (ISM) correction term, is proposed to enforce and maintain coherence during cruising, while considering energy efficiency during acceleration/deceleration phases. While the former aspect has a complex impact on traffic regulation, especially when a large number of vehicles is considered, the latter is of primary importance in an increasingly eco-friendly transportation systems design. The proposed approach is well suited for real-world implementation, and can constitute a valid basis for more advanced control architectures. Simulation results highlight the effectiveness of the proposed architecture in maintaining the formation while guaranteeing a robust achievement of the required performance.
|
|
11:00-11:20, Paper WeA15.4 | Add to My Program |
Resilient Control Design for Vehicular Platooning in an Adversarial Environment (I) |
Dadras, Soodeh | Utah State University |
Dadras, Sara | Ford Motor Company |
Winstead, Chris | Utah State University |
Keywords: Control applications, Automotive control, Stability of linear systems
Abstract: In this paper, we propose a mitigation scheme to prevent an attacker from causing collisions in a vehicular platoon under a gain modification attack. A control algorithm, based on fractional-order calculus and using only local sensor information, is shown to significantly alleviate the impact of the attacker. The control is incorporated into the system when the attacker(s) is(are) detected. We prove that once the stream has been destabilized and its states continually deviate from the desired trajectories, the attacker can be interrupted by another member of the platoon. Simulations demonstrate that by applying our proposed control method, collisions are eliminated despite the attacker maliciously altering its gain such that system becomes unstable or shows oscillatory behavior.
|
|
11:20-11:40, Paper WeA15.5 | Add to My Program |
Network Aware Control Design for String Stabilization in Vehicle Platoons: An LMI Approach (I) |
Merco, Roberto | Clemson University |
Ferrante, Francesco | GIPSA-Lab and Université Grenoble Alpes |
Pisu, Pierluigi | Clemson University |
Keywords: Hybrid systems, Networked control systems, Automotive control
Abstract: The problem of designing a decentralized Cooperative Adaptive Cruise Control (CACC) with quantifiable robustness margins with respect to network delays and intermittent measurements is studied. A networked decentralized proportional-derivative controller is considered to achieve string stability for a platoon of vehicles. The closed-loop system is augmented with a timer triggering the arrival of new measurements. Sufficient conditions in the form of matrix inequalities are given to design the proposed controller with additional performance specifications. The effectiveness of the approach is shown in a numerical example.
|
|
11:40-12:00, Paper WeA15.6 | Add to My Program |
Optimal Vehicle Speed and Gear Position Control for Connected and Autonomous Vehicles (I) |
Shao, Yunli | University of Minnesota |
Sun, Zongxuan | University of Minnesota |
Keywords: Automotive control, Optimization
Abstract: For a connected and autonomous vehicle (CAV), co-optimization of vehicle speed and powertrain operation maximizes the fuel benefits. For an internal combustion engine based vehicle (ICV), the transmission gear position can be optimized to adapt to anticipated future vehicle speed and power demand. It is necessary to consider drivability when optimizing the gear shift to ensure a satisfactory acceleration capability and to avoid the shift busyness. This work proposes a first-of-its-kind real-time implementable optimal control strategy to optimize vehicle speed and gear position simultaneously for ICVs while considering both fuel efficiency and drivability. The control strategy is developed upon a unified CAV framework so that it is widely applicable to various CAV applications. The optimal control problem is formulated and simplified to a mixed integer programming problem with a convex quadratic objective function and linear constraints. An efficient numerical solver is applied to obtain the optimal solutions for an eco-drive application in a model predictive control (MPC) fashion. The control is real-time implementable with an average computational time of 0.33 seconds and maximum computational time of 0.79 seconds. Results from simulation and experiment show that by co-optimizing vehicle speed and gear position, the target vehicle can achieve 16% fuel benefits compared to a baseline vehicle with constant speed cruising control. In addition, experimental results show that the optimal control can also significantly reduce emissions.
|
|
WeA16 Regular Session, Room 407 |
Add to My Program |
Stochastic Systems |
|
|
Chair: Tsumura, Koji | The University of Tokyo |
Co-Chair: Naghnaeian, Mohammad | Clemson University |
|
10:00-10:20, Paper WeA16.1 | Add to My Program |
Simulation and Real-World Evaluation of Attack Detection Schemes |
Porter, Matthew | University of Michigan |
Joshi, Arnav | University of Michigan |
Hespanhol, Pedro | UC Berkeley |
Aswani, Anil | UC Berkeley |
Johnson-Roberson, Matthew | University of Michigan |
Vasudevan, Ramanarayan | University of Michigan |
Keywords: Stochastic systems, Automotive systems, Fault detection
Abstract: A variety of anomaly detection schemes have been proposed to detect malicious attacks to Cyber-Physical Systems. Among these schemes, Dynamic Watermarking methods have been proven highly effective at detecting a wide range of attacks. Unfortunately, in contrast to other anomaly detectors, no method has been presented to design a Dynamic Watermarking detector to achieve a user-specified false alarm rate, or subsequently evaluate the capabilities of an attacker under such a selection. This paper describes methods to measure the capability of an attacker, to numerically approximate this metric, and to design a Dynamic Watermarking detector that can achieve a user-specified rate of false alarms. The performance of the Dynamic Watermarking detector is compared to three classical anomaly detectors in simulation and on a real-world platform. These experiments illustrate that the attack capability under the Dynamic Watermarking detector is comparable to those of classic anomaly detectors. Importantly, these experiments also make clear that the Dynamic Watermarking detector is consistently able to detect attacks that the other class of detectors are unable to identify.
|
|
10:20-10:40, Paper WeA16.2 | Add to My Program |
Compositional Planning in Markov Decision Processes: Temporal Abstraction Meets Generalized Logic Composition |
Liu, Xuan | Worcester Polytechnic Institute |
Fu, Jie | Worcester Polytechnic Institute |
Keywords: Stochastic systems, Formal verification/synthesis, Automata
Abstract: In hierarchical planning for Markov decision processes (MDPs), temporal abstraction allows planning with macro-actions that take place at different time scale in form of sequential composition. In this paper, we propose a novel approach to compositional reasoning and hierarchical planning for MDPs under co-safe temporal logic constraints. In addition to sequential composition, we introduce a composition of policies based on generalized logic composition: Given sub-policies for sub-tasks and a new task expressed as logic compositions of subtasks, a semi-optimal policy, which is optimal in planning with only sub-policies, can be obtained by simply composing sub-polices. Thus, a synthesis algorithm is developed to compute optimal policies efficiently by planning with primitive actions, policies for sub-tasks, and the compositions of sub-policies, for maximizing the probability of satisfying constraints specified in the fragment of co-safe temporal logic. We demonstrate the correctness and efficiency of the proposed method in stochastic planning examples with a single agent and multiple task specifications.
|
|
10:40-11:00, Paper WeA16.3 | Add to My Program |
Monte Carlo Simulation of Brownian Motion Using a Piezo-Actuated Microscope Stage |
Vickers, Nicholas A. | Boston University |
Andersson, Sean B. | Boston University |
Keywords: Stochastic systems, Simulation, Biological systems
Abstract: Single particle tracking is a powerful tool for studying and understanding the motions of biological macromolecules integral to cellular processes. In the past three decades there has been continuous and rapid development of these techniques in both optical microscope design and in algorithms to estimate the statistics and positions of the molecule's trajectory. Although there has been great progress, comparison between different microscope configurations and estimation algorithms has been difficult beyond simulated data. In this paper we explore using a piezo actuated microscope stage to reproduce Brownian motion. Our goal is to use this as a tool to test performance of single particle tracking optical microscopes and estimation algorithms. In this study, Monte Carlo simulations were used to assess the ability of piezo actuated microscope stages for reproducing Brownian motion. Surprisingly, the dynamics of the stage together with configuration of the system allow for preservation of the Brownian motion statistics. Further, feed forward model inverse control allows for low error tracking of Brownian motion trajectories over a wide range of diffusion constants, varying stage response times, and trajectory discrete time steps. These results show great promise in using a piezo actuated microscope stage for testing single particle tracking experimental setups.
|
|
11:00-11:20, Paper WeA16.4 | Add to My Program |
Distributed Control of Stochastic Manufacturing Processes Based on Consensus Algorithms |
Tsumura, Koji | The University of Tokyo |
Nguyen, Binh-Minh | The University of Tokyo |
Wakayama, Hisaya | NEC Corporation |
Maeno, Yoshiharu | NEC Corporation |
Hara, Shinji | Chuo University |
Keywords: Manufacturing systems, Distributed control, Stochastic systems
Abstract: In this paper, we deal with a distributed control of stock levels of buffers in a large-scale manufacturing factory. We suppose that the manufacturing factory is composed of many production processes and transportation processes. Each production process has several input buffers to stock materials for production temporarily and an output buffer to stock the produced materials temporarily. The transportation process is assumed to be realized by a swarm of vehicles, which flexibly move between buffers and transport the materials conveniently. We model the production processes as deterministic dynamical systems and the transportation processes as stochastic events. Then, we propose a distributed control method for the production rates and the transportation probabilities by employing an idea of consensus algorithms and rigorously prove that all the normalized stock levels of the buffers are globally stable at consensus values in a probabilistic sense. We finally demonstrate the effectiveness of our proposed method by numerical simulations.
|
|
11:20-11:40, Paper WeA16.5 | Add to My Program |
Noise-Induced Tracking Error in PI Controlled Systems with Sensor Saturation |
Lee, Juseung | DGIST |
Eun, Yongsoon | DGIST |
Keywords: PID control, Constrained control, Stochastic systems
Abstract: Tracking loss due to zero mean measurement noise has been discovered in feedback control systems with saturating actuators. This phenomenon was named as “Noise-Induced Tracking Error (NITE)” and was analyzed for several types of feedback control systems in previous work. In this paper, we show that a similar phenomenon occurs in feedback control systems with saturating sensors. Specifically, in a class of PI controlled systems with saturating sensors, we show that NITE occurs, and quantify it, using stochastic averaging, in terms of system parameters and noise characteristics. The result is both qualitatively and quantitatively different from that for the systems with saturating actuators. Simulation results are provided for validation of analysis.
|
|
11:40-12:00, Paper WeA16.6 | Add to My Program |
Approximation of the Chemical Master Equation Using Conditional Moment Closure and Time-Scale Separation |
Kwon, Ukjin | MIT |
Naghnaeian, Mohammad | Clemson University |
Del Vecchio, Domitilla | Massachusetts Institute of Technology |
Keywords: Model/Controller reduction, Stochastic systems, Biomolecular systems
Abstract: To describe the stochastic behavior of biomolecular systems, the Chemical Master Equation (CME) is widely used. The CME gives a complete description of the evolution of a system's probability distribution. However, in general, the CME's dimension is very large or even infinite, so analytical solutions may be difficult to write and analyze. To handle this problem, based on the fact that biomolecular systems are time-scale separable, we approximate the CME with another CME that describes the dynamics of the slow species only. In particular, we assume that the number of each molecular species is bounded, although it may be very large. We thus write Ordinary Differential Equations (ODEs) of the slow-species counts' marginal probability distribution and of the fast-species counts' first n conditional moments. Here, n is an arbitrary (possibly small) number, which can be chosen to compromise between approximation accuracy and the computational burden associated with simulating or analyzing a high dimensional system. Then we apply conditional moment closure and time-scale separation to approximate the first n conditional moments of the fast-species counts as functions of the slow-species counts. By substituting these functions on the right-hand side of the ODEs that describes the marginal probability distribution of the slow-species counts, we can approximate the original CME with a lower dimensional CME. We illustrate the application of this method on an enzymatic and a protein binding reaction.
|
|
WeA17 Regular Session, Room 408 |
Add to My Program |
Distributed Parameter Systems I |
|
|
Chair: Schmidt, Kevin | University of Stuttgart |
Co-Chair: Peet, Matthew M. | Arizona State University |
|
10:00-10:20, Paper WeA17.1 | Add to My Program |
Delay Robust State Feedback Stabilization of an Underactuated Network of Two Interconnected PDE Systems |
Auriol, Jean | University of Calgary |
Di Meglio, Florent | MINES ParisTech |
Bribiesca Argomedo, Federico | Université De Lyon, INSA Lyon, Laboratoire Ampère CNRS UMR5005 |
Keywords: Distributed parameter systems, Control of networks, Robust control
Abstract: We detail in this article the development of a delay-robust stabilizing state feedback control law for an underactuated network of two systems of two heterodirectional linear first-order hyperbolic Partial Differential Equations interconnected through their boundaries. Only one of the two subsystems is actuated. The proposed approach combines successive backstepping transformations which allow to rewrite the original network system as a simple neutral system with distributed delays for which the control design is easy. The proposed feedback law is finally proved to be robust to small delays in the actuation.
|
|
10:20-10:40, Paper WeA17.2 | Add to My Program |
Frequency Domain Estimation of Spatially Varying Parameters in Heat and Mass Transport |
Das, Amritam | Eindhoven University of Technology |
Weiland, Siep | Eindhoven Univ. of Tech |
van Berkel, Matthijs | Dutch Institute for Fundamental Energy Research |
Keywords: Distributed parameter systems, Estimation, Grey-box modeling
Abstract: This paper presents a frequency domain approach to estimate spatially varying physical parameters of a one dimensional diffusion-transport-reaction equation. A non-linear least squares optimization of a frequency relevant criterion is proposed on the basis of measurements from a limited number of sensors. Analytic expressions of the Jacobian of the criterion function are exploited in an efficient numerical scheme. The proposed method exploits the sparsity of the underlying discretized model for a fast computation of the system parameters. The performance of the proposed procedure is illustrated by a number of simulation results. We demonstrate that the proposed method is able to estimate a spatially varying profile of unknown physical parameters in a realistic scenario.
|
|
10:40-11:00, Paper WeA17.3 | Add to My Program |
Boundary Observer Design for a Wave PDE with Parameter Uncertainty |
Yilmaz, Cemal Tugrul | Bogazici University |
Basturk, Halil I. | Bogazici University |
|
11:00-11:20, Paper WeA17.4 | Add to My Program |
Computing Input-Ouput Properties of Coupled PDE Systems |
Shivakumar, Sachin | Arizona State University |
Peet, Matthew M. | Arizona State University |
Keywords: Distributed parameter systems, LMIs, Optimization
Abstract: In this paper, we propose an LMI-based approach to analyze input-output properties of coupled linear PDE systems. This work expands on a newly developed state-space theory for coupled PDEs and extends the positive-real and bounded-real lemmas to infinite dimensional systems. We show that conditions for passivity and bounded L 2 gain can be expressed as linear operator inequalities on RxL 2. A method to convert these operator inequalities to LMIs by using parameterization of the operator variables is proposed. This method does not rely on discretization and as such, the properties obtained are prima facie provable. We use numerical examples to demonstrate that the bounds obtained are not conservative in any significant sense and that the bounds are computable on desktop computers for systems consisting of up to 20 coupled PDEs.
|
|
11:20-11:40, Paper WeA17.5 | Add to My Program |
Designing Pneumatically Actuated Deformable Mirrors: Control of Circular Plates with Varying Thickness |
Schmidt, Kevin | University of Stuttgart |
Raisch, Adrian | University of Stuttgart |
Sawodny, Oliver | University of Stuttgart |
Keywords: Distributed parameter systems, Mechatronics
Abstract: This contribution focuses on the optimal design and pneumatic deformation control of thin circular plates with spatially-varying thickness. The work is motivated by pneumatically actuated deformable mirrors, which are used to compensate for wavefront disturbances in adaptive optics. To achieve the required deformation profiles with high precision, the equilibrium deformation is optimized with respect to the plate’s thickness. For designing an asymptotic tracking control, the finite relative degree of the distributed parameter system is exploited. Since the nonlinear pressure dynamics actuate the governing partial differential equation (PDE) in a distributed way, finite-order feedback linearization can be applied. In addition, static nonlinear effects in the pneumatic valve and infinite-dimensional internal dynamics have to be taken into account. Finally, we demonstrate the controller's performance by means of simulations.
|
|
11:40-12:00, Paper WeA17.6 | Add to My Program |
Modeling and Stability Analysis of a Class of Convective Distributed Thermodynamic Systems |
Zárate-Navarro, Marco Antonio | Universidad De Guadalajara |
Garcia-Sandoval, Juan Paulo | Universidad De Guadalajara |
Dubljevic, Stevan | University of Alberta |
Keywords: Distributed parameter systems, Modeling, Chemical process control
Abstract: In this contribution we develop a distributed parameter model of a class of thermodynamic systems described by transport hyperbolic partial differential equations. The general model is proposed in a thermodynamically consistent framework, where the internal entropy production is positive semi-definite regardless if the system is far from equilibrium, i.e., the force-flux relations can be nonlinear and the internal entropy production can be associated to stability or passivity properties. A case study of an adiabatic plug flow reactor with stream recycle is analyzed from an entropy production point of view, showing the sensitivity of the steady internal entropy production density and state variables to the recycle rate and a possible link to instabilities.
|
|
WeA18 Regular Session, Room 409 |
Add to My Program |
Power Systems I |
|
|
Chair: Gomes da Silva Jr, Joao Manoel | Universidade Federal Do Rio Grande Do Sul (UFRGS) |
Co-Chair: Scherpen, Jacquelien M.A. | University of Groningen |
|
10:00-10:20, Paper WeA18.1 | Add to My Program |
Switching-Synchronized Sampled-State Space Modeling and Digital Controller for a Constant Off-Time, Current-Mode Boost Converter |
Xiaofan, Cui | University of Michigan, Ann Arbor |
Avestruz, Al-Thaddeus | University of Michigan |
Keywords: Power electronics, Control applications, Modeling
Abstract: The effective modeling and high speed digital control of variable frequency power converters has been a long-standing challenge. In this paper, we extend and analyze with proofs for stability and performance along with calculations for robustness, a switching-synchronized sampled-state space framework for a current-mode boost converter with constant off-time. We demonstrate a controller in this framework in both simulation and real-world hardware.
|
|
10:20-10:40, Paper WeA18.2 | Add to My Program |
Cascaded Nonlinear Control for Grid-Connected Single-Phase Inverters Utilizing Learning Compensation and Current Observer |
Alqatamin, Moath | University of Louisville |
McIntyre, Michael | University of Louisville |
Latham, Joseph | University of Louisville |
Keywords: Power electronics, Lyapunov methods, Control applications
Abstract: In this paper, a cascaded control scheme based on nonlinear methods has been designed to simultaneously improve the quality of the local load voltage while also controlling the injected grid current in a grid-connected single-phase inverter system. This control approach ensures the seamless transfer between grid-connected and stand-alone operation modes without adjusting the controller structure. The proposed control structure consists of an outer current loop and inner voltage loop, each of which are motivated by separate Lyapunov based stability analysis. In an effort to reduce cost and noise sensitivity an inductor current observer is utilized. This scheme incorporates a Learning scheme to compensate for periodic disturbances which are present in the dynamic system. Moreover, since the impedance of the grid has significant effect on system stability and current control performance, parameter estimation scheme is developed to compensate for this unknown parameter. Each scheme in the cascaded system is validated through a Lyapunov stability analysis. The overall scheme is validated with an instantaneous circuit simulation where PLECS was utilized.
|
|
10:40-11:00, Paper WeA18.3 | Add to My Program |
Robust Control for Boost Converters with Anti-Windup Compensation |
Boeff, Luís Felipe | Universidade Federal Do Rio Grande Do Sul (UFRGS) |
Flores, Jeferson Vieira | UFRGS |
Gomes da Silva Jr, Joao Manoel | Universidade Federal Do Rio Grande Do Sul (UFRGS) |
Keywords: Power electronics, Robust control, Constrained control
Abstract: This work presents the design of state-feedback robust control laws for boost power converters. First, an equivalent circuit of the boost converter is presented and a nonlinear(bilinear) state-space representation is obtained. The system is linearized around an equilibrium point, such that linear robust control techniques can be applied. An integral action is added to the linearized system, such that step-like disturbances can be rejected in closed-loop. A saturation restriction on the control signal is then imposed to limit the operation of the system in a region where the linear model approximation is valid. In order to improve the closed-loop performance, an Hinf control design with pole placement restrictions based on linear matrix inequalities is considered. Finally, a static antiwindup compensator is designed to reduce possible integral windup effects imposed by the saturation. The resulting control system is validated by PSIM simulation software, where high frequency switching and other unmodeled effects neglected in the modeling stage are considered.
|
|
11:00-11:20, Paper WeA18.4 | Add to My Program |
Backstepping Control for Grid-Connected Single-Phase Inverter Utilizing Variable Structure Observer |
Alqatamin, Moath | University of Louisville |
McIntyre, Michael | University of Louisville |
Latham, Joseph | University of Louisville |
Keywords: Control applications, Power electronics, Observers for nonlinear systems
Abstract: In this paper, a backstepping nonlinear control scheme has been designed for a single-phase grid-connected inverter system with local load. The main objective of the proposed controller is to simultaneously improve the quality of the local load voltage while injecting clean current to the grid with unity power factor. Furthermore, this control approach ensures the seamless transfer between grid-connected and stand-alone operation modes without adjusting the controller structure. The proposed control structure utilizes a variable structure nonlinear observer to avoid using the numerical derivative of the output voltage. Moreover, the variable structure component of the observer makes it robust to a wide range of operating conditions. The proposed combination of controller/ observer is validated by a Lyapunov stability analysis as well as via instantaneous dynamic circuit simulation in PLECS software.
|
|
11:20-11:40, Paper WeA18.5 | Add to My Program |
Distributed Passivity-Based Control of DC Microgrids |
Cucuzzella, Michele | University of Groningen |
Kosaraju, Krishna Chaitanya | Indian Institute of Technology, Madras |
Scherpen, Jacquelien M.A. | University of Groningen |
Keywords: Power systems, Distributed control, Control of networks
Abstract: In this paper, we propose a new distributed passivity-based control strategy for Direct Current (DC) microgrids. The considered DC microgrid includes Distributed Generation Units (DGUs) sharing power through resistive-inductive distribution lines. Each DGU is composed of a generic DC energy source that supplies an unknown load through a DC-DC buck converter. The proposed control scheme exploits a communication network, the topology of which can differ from the topology of the physical electrical network, in order to achieve proportional (fair) current sharing using a consensus-like algorithm. Moreover, the proposed distributed control scheme regulates the average value of the network voltages towards the corresponding desired reference, independently of the initial condition of the controlled microgrid. Convergence to a desired steady state is proven and satisfactorily assessed in simulations.
|
|
11:40-12:00, Paper WeA18.6 | Add to My Program |
Double-Layered Distributed Transient Frequency Control with Regional Coordination |
Zhang, Yifu | University of California, San Diego |
Cortes, Jorge | University of California, San Diego |
Keywords: Power systems, Distributed control, Predictive control for linear systems
Abstract: This paper proposes a control strategy for power systems with a two-layer structure that achieves global stabilization and, at the same time, delimits the transient frequencies of targeted buses to a desired safe interval. The first layer is a model predictive control that, in a receding horizon fashion, optimally allocates the power resources while softly respecting transient frequency constraints. As the first layer control requires solving an optimization problem online, it only periodically samples the system state and updates its action. The second layer control, however, is implemented in continuous time, assisting the first layer to achieve frequency invariance and attractivity requirements. Furthermore, through network partition, they can be implemented in a distributed fashion, only requiring system information from neighboring partitions. Simulations on the IEEE 39-bus network illustrate our results.
|
|
WeB01 Regular Session, Franklin 1 |
Add to My Program |
Robotics II |
|
|
Chair: Hoelzle, David | Ohio State University |
Co-Chair: Gregg, Robert D. | University of Texas at Dallas |
|
13:30-13:50, Paper WeB01.1 | Add to My Program |
Contact-Invariant Total Energy Shaping Control for Powered Exoskeletons |
Lin, Jianping | University of Texas at Dallas |
Lv, Ge | Carnegie Mellon University |
Gregg, Robert D. | University of Texas at Dallas |
Keywords: Robotics, Mechanical systems/robotics, Biomedical
Abstract: Energy shaping methods can be used to design task-invariant feedback control laws for the powered exoskeletons (i.e., orthoses). In order to achieve a desired closed-loop energy, certain matching conditions must be satisfied, which are sets of nonlinear partial differential equations. In this paper, we solve the matching conditions and come up with a new solution for under-actuated systems by using Auckly's method. We find a unified feedback control law that is task-invariant with respect to human inputs and different contact conditions. We propose assistive and resistive shaping strategies to alter the mass/inertia matrix and simulate on a powered knee-ankle exoskeleton. The simulation results show the reduction and increment of the human model's metabolic cost of generating muscular forces in human walking. The interchange between the kinetic and potential energy and the changes in acceleration of the center of mass are also investigated in the simulation.
|
|
13:50-14:10, Paper WeB01.2 | Add to My Program |
Trajectory Generation for Robotic Systems with Contact Force Constraints |
Lee, Jaemin | University of Texas at Austin |
Bakolas, Efstathios | The University of Texas at Austin |
Sentis, Luis | The University of Texas at Austin |
Keywords: Robotics, Mechanical systems/robotics, Constrained control
Abstract: This paper presents a trajectory generation method for contact-constrained robotic systems such as manipulators and legged robots. Contact-constrained systems are affected by the interaction forces between the robot and the environment. In turn, these forces determine and constrain state reachability of the robot parts or end effectors. Our study subdivides the trajectory generation problem and the supporting reachability analysis into tractable subproblems consisting of a sampling problem, a convex optimization problem, and a nonlinear programming problem. Our method leads to significant reduction of computational cost. The proposed approach is validated using a realistic simulated contact-constrained robotic system.
|
|
14:10-14:30, Paper WeB01.3 | Add to My Program |
Trajectory Tracking with Velocity Constraints Using Control Barrier Functions |
Guerrero-Bonilla, Luis | University of Pennsylvania |
Kumar, Vijay | University of Pennsylvania |
Keywords: Robotics, Mechanical systems/robotics
Abstract: This paper presents control strategies to ensure that the tangential velocity of a robot, which is commanded to move in a trajectory with a constant offset from a reference curve, is bounded within a specified range. This is achieved at the expense of adjusting the distance between the robot and the curve. The strategies are based on zeroing control barrier functions and minimum norm control inputs, which ensure the satisfaction of constraints while only deviating from the nominal trajectory when necessary. Control laws for curves on a plane and in 3D space are presented, using the Frenet-Serret and Bishop frames to specify the desired trajectory of the robots. We illustrate our results through simulations.
|
|
14:30-14:50, Paper WeB01.4 | Add to My Program |
Coupled Dynamics of Material Delivery and Robotic Manipulator Axes in Endoscopic Additive Manufacturing |
Simeunovic, Andrej | The Ohio State University |
Hoelzle, David | Ohio State University |
Keywords: Robotics, Modeling, Biotechnology
Abstract: Tissue engineering (TE) has seen success in recapitulating the natural function of a variety of simple tissues in the laboratory setting. One barrier to increased clinical translation of tissue constructs is morbidities caused by open surgeries currently needed for their delivery into the body. Advanced robotics and control allow for new tools and manufacturing capabilities that can accelerate the clinical viability of existing forms of TE today. One such tool, an intracorporeal, additive manufacturing (AM) based TE fabrication system in an endoscopic form factor, the Endo AM system, allows for the fabrication of TE constructs inside the body in a minimally-invasive manner. The Endo AM system consists of a 9-joint robotic manipulator and a direct-write (DW) AM extruder, leading to complex flow and positioning dynamics. Here we describe and explore the dynamics of the Endo AM system in simulation, with a focus on studying the coupling of dynamic positioning and material delivery axes.
|
|
14:50-15:10, Paper WeB01.5 | Add to My Program |
Tactile-Based Blind Grasping: Trajectory Tracking and Disturbance Rejection for In-Hand Manipulation of Unknown Objects |
Shaw Cortez, Wenceslao | The University of Melbourne |
Oetomo, Denny Nurjanto | The University of Melbourne |
Manzie, Chris | The University of Melbourne |
Choong, Peter | The University of Melbourne |
Keywords: Robotics, Robust control, Mechanical systems/robotics
Abstract: Tactile-based blind grasping refers to a realistic grasping scenario where the robotic hand has no knowledge of the object, and only has access to on-board sensors. This scenario is representative of real-world applications (e.g prosthetics) where high resolution cameras and other external sensors are not available to the robotic hand as they would be in a structured, laboratory setting. At present, there is no manipulation control that can track a reference object trajectory in tactile-based blind grasping. In this paper, a robust trajectory tracking controller is proposed to enhance the manipulation capabilities of robotic hands in tactile-based blind grasping. The proposed control ensures semi-global practical asymptotic tracking of the reference trajectory, while compensating for bounded wrench disturbances. Numerical simulations show the efficacy of the proposed approach.
|
|
15:10-15:30, Paper WeB01.6 | Add to My Program |
Stabilization of Homoclinic Orbits of Two Degree-Of-Freedom Underactuated Systems |
Kant, Nilay | Michigan State University |
Mukherjee, Ranjan | Michigan State University |
Khalil, Hassan K. | Michigan State Univ |
Keywords: Robotics, Stability of hybrid systems
Abstract: A hybrid controller for stabilization of homoclinic orbits of two degree-of-freedom (DOF) underactuated systems is proposed. The controller is comprised of continuous-time inputs, impulsive brakings, and virtual impulsive inputs for resetting of the passive coordinate. Impulsive brakings of the active coordinate result in instantaneous negative changes in the mechanical energy of the system. An impulsive dynamical system framework is adopted for modeling the hybrid dynamics and a Lyapunov function is defined for stabilization of the orbit. Sufficient conditions for stabilization are presented such that the Lyapunov function decreases monotonically under the action of the continuous inputs and undergoes negative jumps due to impulsive brakings. The control design is implemented on an inverted pendulum on a cart example. Simulation results indicate fast convergence of system trajectories to the homoclinic orbit corresponding to the upright equilibrium configuration.
|
|
WeB02 Regular Session, Franklin 2 |
Add to My Program |
Autonomous Driving |
|
|
Chair: Carcaterra, Antonio | Sapienza, Univeristy of Rome |
Co-Chair: Tomizuka, Masayoshi | Univ of California, Berkeley |
|
13:30-13:50, Paper WeB02.1 | Add to My Program |
Guaranteed Safe Reachability-Based Trajectory Design for a High-Fidelity Model of an Autonomous Passenger Vehicle |
Vaskov, Sean | University of Michigan |
Sharma, Utkarsh | University of Michigan |
Kousik, Shreyas | University of Michigan - Ann Arbor |
Johnson-Roberson, Matthew | University of Michigan |
Vasudevan, Ramanarayan | University of Michigan |
Keywords: Automotive control, Lyapunov methods, Autonomous systems
Abstract: Trajectory planning is challenging for autonomous cars since they operate in unpredictable environments with limited sensor horizons. To incorporate new information as it is sensed, planning is done in a loop, with the next plan being computed as the previous plan is executed. Reachability- based Trajectory Design (RTD) is a recent, provably safe, real- time algorithm for trajectory planning. RTD consists of an offline Forward Reachable Set (FRS) computation of the vehi- cle tracking parameterized trajectories; and online trajectory optimization using the FRS to map obstacles to constraints in a provably-safe way. In the literature, RTD has only been applied to small mobile robots. The contribution of this work is RTD on a passenger vehicle in CarSim, with a full powertrain model, chassis and tire dynamics. RTD operates the vehicle safely at up to 15 m/s on a two-lane road around randomly- placed obstacles only known to the vehicle when detected within its sensor horizon. RTD is compared with a Nonlinear Model- Predictive Control (NMPC) and a Rapidly-exploring Random Tree (RRT) approach. The experiment demonstrates RTD’s ability to plan safe trajectories in real time, in contrast to the existing state-of-the-art approaches.
|
|
13:50-14:10, Paper WeB02.2 | Add to My Program |
A Novel Control Strategy for Autonomous Cars |
Antonelli, Dario | Sapienza Università Di Roma |
Nesi, Leandro | University of Rome, Sapienza |
Pepe, Gianluca | Sapienza Univeristy of Rome |
Carcaterra, Antonio | Sapienza, Univeristy of Rome |
Keywords: Automotive control, Mechanical systems/robotics, Variational methods
Abstract: The autonomous vehicle is one of the greatest challenges in modern vehicle design. This paper proposes a new method of control named FLOP, Feedback Local Optimality Principle, recently proposed by the authors. The method, starting from the Pontryagin’s theory, introduces a new optimality principle that minimizes a sequence of individual functionals with the chance of a direct feedback control. The theory is applied to the steering and traction control of a two-wheeled vehicle, showing the ability of tracking a given trajectory and obstacles avoidance in a rather complex environment.
|
|
14:10-14:30, Paper WeB02.3 | Add to My Program |
Contingency Model Predictive Control for Automated Vehicles |
Alsterda, John P. | Stanford University |
Brown, Matthew | Stanford University |
Gerdes, J. Christian | Stanford Univ |
Keywords: Automotive control, Predictive control for linear systems, Autonomous systems
Abstract: We present Contingency Model Predictive Control (CMPC), a novel and implementable control framework which tracks a desired path while simultaneously maintaining a contingency plan – an alternate trajectory to avert an identified potential emergency. In this way, CMPC anticipates events that might take place, instead of reacting when emergencies occur. We accomplish this by adding an additional prediction horizon in parallel to the classical receding MPC horizon. The contingency horizon is constrained to maintain a feasible avoidance solution; as such, CMPC is selectively robust to this emergency while tracking the desired path as closely as possible. After defining the framework mathematically, we demonstrate its effectiveness experimentally by comparing its performance to a state-of-the-art deterministic MPC. The controllers drive an automated research platform through a left-hand turn which may be covered by ice. Contingency MPC prepares for the potential loss of friction by purposefully and intuitively deviating from the prescribed path to approach the turn more conservatively; this deviation significantly mitigates the consequence of encountering ice.
|
|
14:30-14:50, Paper WeB02.4 | Add to My Program |
Bayesian Persuasive Driving |
Peng, Cheng | University of California, Berkeley |
Tomizuka, Masayoshi | Univ of California, Berkeley |
Keywords: Intelligent systems, Optimization, Automotive systems
Abstract: In the autonomous driving area, interaction between vehicles is still a piece of puzzle which has not been fully resolved. The ability to intelligently and safely interact with other vehicles can not only improve self driving quality but also be beneficial to the global driving environment. In this paper, a Bayesian persuasive driving algorithm based on optimization is proposed, where the ego vehicle is the persuader (information sender) and the surrounding vehicle is the persuadee (information receiver). In the persuasion process, the ego vehicle aims at changing the surrounding vehicle's posterior belief of the world state by providing certain information via signaling in order to achieve a lower cost for both players. The information received by the surrounding vehicle and its belief of the world state are described by Gaussian distributions. Simulation results in several common traffic scenarios are provided to demonstrate the proposed algorithm's capability of handling interaction situations involving surrounding vehicles with different driving characteristics.
|
|
14:50-15:10, Paper WeB02.5 | Add to My Program |
Backstepping-Based Time-Gap Regulation for Platoons |
Chou, Fang-Chieh | University of California, Berkeley |
Tang, Shuxia | University of California, Berkeley |
Lu, Xiao-Yun | Univ. of California at Berkeley |
Bayen, Alexandre | University of California at Berkeley |
Keywords: Automotive control, Cooperative control, Lyapunov methods
Abstract: The time-gap regulation problem for a cascaded system consisting of platooned automated vehicles following a leading non-automated vehicle is investigated in this article. Under the assumption of uniform boundedness of the acceleration of the leading vehicle, a control design scheme is proposed via an extension of integral backstepping control method, where additional terms that counter the impact due to the speed change of the non-automated vehicle are used. Each automated vehicle is actuated by one backstepping controller, demonstrated by a recursive control design procedure based on induction. As a result, both the time-gap error and the speed error between each pair of consecutive vehicles are proven to be ultimately bounded by some constants that can be tuned to be arbitrarily close to zero. In particular, the regulated time-gap guarantees enough time for the following vehicle in each pair to react to the velocity change of its preceding vehicle. Simulation is carried out to validate the proposed controllers.
|
|
15:10-15:30, Paper WeB02.6 | Add to My Program |
Short-Term Speed Forecasting Using Vehicle Wireless Communications |
Hyeon, Eunjeong | University of Michigan |
Kim, Youngki | University of Michigan - Dearborn |
Prakash, Niket | University of Michigan, Ann Arbor |
Stefanopoulou, Anna G. | University of Michigan |
Keywords: Automotive systems, Automotive control, Intelligent systems
Abstract: Forecasting the speed trajectories of driving vehicles is essential for vehicle/powertrain predictive optimal control. This paper proposes a simple and effective forecasting method for generating short-term future speed trajectories using vehicle-to-vehicle (V2V) information. Specifically, a series of lead vehicles’ speeds and locations are considered to be the potential trajectories that the following car would drive in the near future. Polynomial regression based on weighted least-squares estimation is used to determine a future speed trajectory over a short prediction horizon. The efficacy of the proposed approach is evaluated in single-lane traffic simulations over various driving scenarios. In addition, the performance of the proposed method is also evaluated when V2V is not available. Simulation results show that for a highway drive cycle, the proposed predictor results in root-mean-square errors less than 1 mph with V2V data.
|
|
WeB03 Regular Session, Franklin 3 |
Add to My Program |
Distributed Control II |
|
|
Chair: Santilli, Matteo | Università Degli Studi Roma Tre |
Co-Chair: Yame, Joseph Julien | Université De Lorraine |
|
13:30-13:50, Paper WeB03.1 | Add to My Program |
Optimality Condition Decomposition Approach to Distributed Model Predictive Control |
Yame, Joseph Julien | Université De Lorraine |
Gabsi, Farah | Université De Lorraine |
Jain, Tushar | Indian Institute of Technology Mandi |
Hamelin, Frederic | University of Lorraine |
Sauer, Nathalie | Université De Lorraine |
Keywords: Distributed control, Large-scale systems, Building and facility automation
Abstract: This paper presents a new methodology for distributed model predictive control of large-scale systems. The methodology involves two distinct stages, i.e., the decomposition of large-scale systems into subsystems and the design of subsystem controllers. Two procedures are used: in the first stage, the structure of the Karush-Kuhn-Tucker matrix resulting from the necessary optimality conditions is exploited to yield a decomposition of the large-scale system into several subsystems. In the second stage, a particular technique, the so-called optimality condition decomposition makes it possible to synthesize distributed coordinated subcontrollers thus achieving an optimal distributed control of the large-scale system. The convergence of the proposed approach is stated.
|
|
13:50-14:10, Paper WeB03.2 | Add to My Program |
State-Feedback Controller Sparsification Via Quasi-Norms |
Bahavarnia, MirSaleh | University of Maryland, College Park |
Keywords: Distributed control, Large-scale systems, Optimization
Abstract: In this paper, quasi-norms are utilized to sparsify a pre-given well-performing state-feedback controller stabilizing a linear time-invariant (LTI) system. To do so, an unconstrained optimization problem is firstly formulated which incorporates two terms: (i) the Frobenius norm of difference of the pre-given feedback controller and the one to be designed; (ii) the 0 < q < 1 quasi-norm of the feedback controller to be designed. The former term heuristically features the disturbance attenuation performance and the latter term promotes the sparsity. Next, obtaining an analytic threshold for the sparsity-promoting parameter, the analytic solution of the formulated unconstrained optimization problem is expressed which is basically the designed sparse feedback controller. Throughout the numerical simulations, it is observed that when 0 < q < 1 decreases, the sparsity-performance balance is significantly improved. Furthermore, the proposed method is interestingly capable of being applied to the large-scale systems with thousands of states.
|
|
14:10-14:30, Paper WeB03.3 | Add to My Program |
Sequential Optimization for State-Dependent Opinion Dynamics |
Etesami, S. Rasoul | University of Illinois at Urbana-Champaign |
Keywords: Distributed control, Network analysis and control, Agents-based systems
Abstract: Stability and analysis of networked decision systems with state-dependent switching typologies have been a fundamental and longstanding challenge in control, social sciences, and many other related fields. These already complex systems become further complicated once one accounts for asymmetry or heterogeneity of the underlying agents/dynamics. Despite extensive progress in analysis of conventional networked decision systems where the network evolution and state dynamics are driven by independent or weakly coupled processes, most of the existing results fail to address decision systems where the network and state dynamics are highly coupled and evolve based on status of heterogeneous agents. Motivated by numerous applications of such dynamics in social sciences, in this paper we provide a new direction toward analysis of dynamic networks of heterogeneous agents under complex environments. As a result we show how Lyapunov stability of several problems from opinion dynamics can be established using a simple application of our framework. Our results provide new insights toward analysis of complex networked multi-agent systems using exciting field of sequential optimization.
|
|
14:30-14:50, Paper WeB03.4 | Add to My Program |
Localized High-Order Consensus Destabilizes Large-Scale Networks |
Tegling, Emma | KTH Royal Institute of Technology |
Bamieh, Bassam | Univ. of California at Santa Barbara |
Sandberg, Henrik | KTH Royal Institute of Technology |
Keywords: Distributed control, Network analysis and control
Abstract: We study the problem of distributed consensus in networks where the local agents have high-order (n ≥ 3) integrator dynamics, and where all feedback is localized in that each agent has a bounded number of neighbors. We prove that no consensus algorithm based on relative differences between states of neighboring agents can then achieve consensus in networks of any size. That is, while a given algorithm may allow a small network to converge to consensus, the same algorithm will lead to instability if agents are added to the network so that it grows beyond a certain finite size. This holds in classes of network graphs whose algebraic connectivity, that is, the smallest non-zero Laplacian eigenvalue, is decreasing towards zero in network size. This applies, for example, to all planar graphs. Our proof, which relies on Routh-Hurwitz criteria for complex-valued polynomials, holds true for directed graphs with normal graph Laplacians. We survey classes of graphs where this issue arises, and also discuss leader-follower consensus, where instability will arise in any growing, undirected network as long as the feedback is localized.
|
|
14:50-15:10, Paper WeB03.5 | Add to My Program |
Distributed Connectivity Maintenance in Multi-Agent Systems with Field of View Interactions |
Santilli, Matteo | Università Degli Studi Roma Tre |
Mukherjee, Pratik | Virginia Polytechnic Institute and State University |
Gasparri, Andrea | University of "Roma Tre" |
Williams, Ryan | Virginia Tech |
Keywords: Distributed control, Networked control systems, Agents-based systems
Abstract: In this paper, we consider the problem of coordinating a multi-agent team to maintain a connected topology while equipped with limited field of view sensors. Applying the potential-based control framework and assuming agent interaction is encoded by a triangular geometry, we derive a distributed control law based on two non-linear functions, the point-to-line distance and the multivariate Gaussian, in order to achieve the topology control objective. Furthermore, we demonstrate a condition on digraphs for which the proposed control strategy achieves the system objective. Finally, numerical simulations are provided to corroborate the theoretical findings.
|
|
15:10-15:30, Paper WeB03.6 | Add to My Program |
Distributed Q-Learning for Dynamically Decoupled Systems |
Alemzadeh, Siavash | University of Washington |
Mesbahi, Mehran | University of Washington |
Keywords: Distributed control, Networked control systems, Machine learning
Abstract: Control of large-scale networked systems often necessitates the availability of complex models for the interactions amongst the agents. However, in many applications building accurate models of these interactions might be prohibitive due to the curse of dimensionality or their inherent complexity. In the meantime, data-guided control methods can circumvent model complexity by directly synthesizing the controller from the observed data. In this paper, we propose a distributed Q-learning algorithm to design a feedback mechanism given an underlying graph structure parameterizing the agents' communication. We assume that the distributed nature of the system arises from a common cost and show that for the particular case of identical dynamically decoupled systems, the learned controller converges to the optimal Linear Quadratic Regulator controller for each subsystem. We provide a convergence analysis and verify the result with an example.
|
|
WeB04 Regular Session, Franklin 4 |
Add to My Program |
Networked Control Systems II |
|
|
Chair: Kalaimani, Rachel Kalpana | Indian Institute of Technology Madras |
Co-Chair: Yang, Yipeng | University of Houston - Clear Lake |
|
13:30-13:50, Paper WeB04.1 | Add to My Program |
Zeno-Free Stochastic Distributed Event-Triggered Consensus Control for Multi-Agent Systems |
Tsang, Kam Fai Elvis | Hong Kong University of Science and Technology |
Wu, Junfeng | Royal Institute of Technology (KTH) |
Shi, Ling | Hong Kong University of Science and Technology |
Keywords: Networked control systems, Distributed control, Agents-based systems
Abstract: This paper investigates the problem of multi- agent consensus control with input disturbances. We propose a stochastic distributed event-triggereing law, based on an existing deterministic law, for the said problem. It is shown that both event-triggering laws achieve practical consensus exponentially fast under the influence of disturbance. We further derive an analytical upper bound for the consensus error and show that the stochastic law excludes Zeno behavior. A numerical simulation is also provided to illustrate the proposed consensus control law compared with the deterministic law.
|
|
13:50-14:10, Paper WeB04.2 | Add to My Program |
Motion Planning with Secrecy |
Tsiamis, Anastasios | University of Pennsylvania |
Alexandru, Andreea B. | University of Pennsylvania |
Pappas, George J. | University of Pennsylvania |
Keywords: Networked control systems, Information theory and control, Estimation
Abstract: In this paper, we introduce the problem of motion planning with secrecy guarantees. A robot is tracking a desired trajectory, which is transmitted on-line by a planner, e.g. a base station or a mobile station. The communication between the robot and the planner is organized in packets and takes place over a wireless channel, which is susceptible to eavesdropping attacks. Our goal is to design secure communication codes in order to encode the trajectory information and hide it from any eavesdroppers. Meanwhile, the robot should be able to recover the trajectory and the planner should be able to estimate the robot's motion. We introduce a novel coding scheme that creates secrets between the robot and the planner based on i)~the randomness of the robot's motion and ii)~the imperfection of the communication channel. We show that every time the planner receives the corresponding packet while the eavesdropper misses it, a new secret is created, which can be used as a key to encode the information about the motion intent. If the motion-planning is random enough, one occurrence of this event makes the eavesdropper lose track of the trajectory; even if the eavesdropper has unlimited computational power. We apply our framework to the problem of way-point tracking, where the robot should visit some target positions one after the other. We illustrate the theoretical results in simulations.
|
|
14:10-14:30, Paper WeB04.3 | Add to My Program |
Event-Triggered Pulse Control with Model Learning (if Necessary) |
Baumann, Dominik | Max Planck Institute for Intelligent Systems |
Solowjow, Friedrich | Max Planck Institute for Intelligent Systems |
Johansson, Karl H. | Royal Institute of Technology |
Trimpe, Sebastian | Max Planck Institute for Intelligent Systems |
Keywords: Networked control systems, Learning
Abstract: In networked control systems, communication is a shared and therefore scarce resource. Event-triggered control (ETC) can achieve high performance control with a significantly reduced amount of samples compared to classical, periodic control schemes. However, ETC methods usually rely on the availability of an accurate dynamics model, which is oftentimes not readily available. In this paper, we propose a novel event-triggered pulse control strategy that learns dynamics models if necessary. In addition to adapting to changing dynamics, the method also represents a suitable replacement for the integral part typically used in periodic control.
|
|
14:30-14:50, Paper WeB04.4 | Add to My Program |
Scale Estimate and Stability Analysis of Networked Control Systems with Random Time Delays and State Compensation |
Yang, Yipeng | University of Houston - Clear Lake |
Keywords: Networked control systems, Linear parameter-varying systems, Stability of linear systems
Abstract: In order to overcome the constraints of Networked Control Systems (NCS) such as random packet delays or disorders, it is a natural idea to estimate the system state and compensate for the time delays on the controller side. However, it is rarely studied how this idea changes the structure and scale of the system. This paper provides an estimate on the scale of the complete dynamical system using this idea of control. The structure of the complete system is clearly illustrated. Then a concise sufficient and necessary stability condition is provided. In the numerical example, it is shown that a seemingly small system turns out to have a very large scale if random time delays and state estimates are present.
|
|
14:50-15:10, Paper WeB04.5 | Add to My Program |
D-Stability under Channel Capacity Constraints |
Rokade, Kiran | Indian Institute of Technology Madras |
Kalaimani, Rachel Kalpana | Indian Institute of Technology Madras |
Keywords: Networked control systems, Optimization, LMIs
Abstract: We address the problem of stabilizing a system, with a certain desired dynamic performance, using control signal sent over a communication channel having a limited capacity. A desired dynamic performance of the closed-loop system is obtained by placing its poles in a specific region of the open left-half of the complex plane. Denoting such a region by D, this procedure is also called D-stabilization. We first analyze a single-input linear time-invariant (LTI) system with state-feedback control over a channel subjected to additive noise. Using tools from H 2 control theory, we pose the above stabilization problem as an optimization problem involving linear matrix inequalities (LMIs). Using this, we derive a sufficient condition for D-stabilization of the system subject to the channel capacity constraint. Further, we extend our analysis to a multi-input LTI system with state-feedback over a multi-input multi-output (MIMO) channel subjected to additive noise. The channel consists of multiple single-input single-output (SISO) subchannels connected in parallel. The total capacity of the MIMO channel is fixed, while the individual subchannel capacities can be freely allocated. We provide a necessary and sufficient condition for stabilization and a sufficient condition for D-stabilization of this system subject to the channel capacity constraints. We also propose a method to design the channel and an optimal controller.
|
|
15:10-15:30, Paper WeB04.6 | Add to My Program |
Channel-Aware Scheduling for Multiple Control Systems with Packet-Based Control Over Collision Channels |
Li, Pengfei | University of Science and Technology of China |
Kang, Yu | University of Science and Technology of China |
Zhao, Yun-Bo | Zhejiang University of Technology |
Pan, Xiaokang | Zhejiang University of Technology |
Keywords: Networked control systems, Predictive control for nonlinear systems, Network analysis and control
Abstract: We consider a wireless control architecture with multiple control systems communicating over two shared collision channels. Each sensor accesses the channel randomly and a scheduler at the controller side decides which controller is permitted to access the channel. We design a packet-based model predictive controller and obtain the packet transmission success probability requirements of stability. The channel-aware transmission strategy of each sensor is designed and analyzed in the non-cooperative game theory framework. We also characterize the Nash equilibrium and design a decentralized channel access mechanism to achieve the Nash equilibrium. The effectiveness of our results is demonstrated by a numerical simulation.
|
|
WeB05 Regular Session, Franklin 5 |
Add to My Program |
Optimization II |
|
|
Chair: Fuchs, Zachariah E. | Wright State University |
Co-Chair: Zeng, Xiangrui | Ford Motor Company |
|
13:30-13:50, Paper WeB05.1 | Add to My Program |
Optimized Design of Multi-Speed Transmissions for Battery Electric Vehicles |
Han, Kyoungseok | University of Michigan |
Wang, Yan | Ford Research and Advanced Engineerintg, Ford Motor Company |
Filev, Dimitre P. | Ford Motor Company |
Dai, Edward | Ford Motor Company |
Kolmanovsky, Ilya V. | The University of Michigan |
Girard, Anouck | University of Michigan, Ann Arbor |
Keywords: Optimization, Optimal control, Optimization algorithms
Abstract: This paper considers the optimization of multispeed transmission configuration and gearshift schedule for the battery electric vehicles. Although only a single reduction gear is commonly utilized in commercial battery electric vehicles, further improvements in energy savings can be achieved by employing a multi-speed transmission as has been already shown in existing literature. In this paper, we propose an approach to co-optimization of transmission design (number of gears and gear ratios) and of gear shift schedule. The simulation results quantify the battery energy savings which are achieved by the proposed approach and the ability to obtain shift schedules which promote regenerative braking.
|
|
13:50-14:10, Paper WeB05.2 | Add to My Program |
A Universal Map Matching Framework Based on Dynamic System and Optimal Control |
Zeng, Xiangrui | Ford Motor Company |
Mohanty, Amit | Ford Motor Company |
Keywords: Optimization, Optimal control, Transportation networks
Abstract: Map matching is the process of matching a time sequence of location coordinate points into a digital road map. Currently there are different map matching algorithms designed for different types of location data with different frequencies, different accuracies, and different types of additional information that can be used to improve the results. However, there is not yet a universal map matching framework that considers all the map matching criteria and covers all these different scenarios. This paper presents a batch map matching framework that works well for high-frequency, high-accuracy location data and low-frequency low-accuracy location data, and it can consider different types of additional data for data fusion. The map matching problem is formulated as an optimal control problem for a discrete-time domain dynamic system, and the problem can be solved using dynamic programming. This framework will greatly benefit the map matching application development, as the core building blocks for the algorithm are the same for all types of data.
|
|
14:10-14:30, Paper WeB05.3 | Add to My Program |
Optimal Dubins Paths to Intercept a Moving Target on a Circle |
Manyam, Satyanarayana Gupta | Infoscitex Corporation |
Casbeer, David W. | Air Force Research Laboratory |
Von Moll, Alexander | Air Force Research Laboratory |
Fuchs, Zachariah E. | University of Cincinnati |
Keywords: Optimization, Optimization algorithms, Autonomous systems
Abstract: We present a path planning problem for a pursuer to intercept a cooperating target traveling on a circle. The pursuer considered here has limited yaw rate, and therefore its path should satisfy the kinematic constraints. We assume that the distance between initial position of the pursuer and any point on the target circle is greater than four times the minimum turn radius of the pursuer. We prove the continuity of the length of the Dubins paths of type Circle-Straight line-Circle with respect to the position on the target circle. This is used to prove that the optimal interception path is a Dubins path, and we present an iterative algorithm to find the optimal interception point on the target circle.
|
|
14:30-14:50, Paper WeB05.4 | Add to My Program |
A Prediction-Correction Primal-Dual Algorithm for Distributed Optimization |
Paternain, Santiago | University of Pennsylvania |
Fazlyab, Mahyar | University of Pennsylvania |
Preciado, Victor M. | University of Pennsylvania |
Ribeiro, Alejandro | University of Pennsylvania |
Keywords: Optimization, Optimization algorithms, Distributed control
Abstract: In this work, we propose a novel primal-dual algorithm for solving distributed optimization problems with consensus constraints over a network of agents. Our starting point is to form the Lagrangian of the constrained problem. The agents update their dual variables using dual gradient ascent (the dual step). By interpreting the dual variables as time-varying parameters, the agents track the minimizer of the resulting time-varying Lagrangian using a prediction-correction scheme (the primal step). Each iteration of the resulting algorithm requires two rounds of communication and two local Hessian inversions per agent. In particular, we establish exponential convergence of the resulting algorithm to a neighborhood of the optimal solution. Numerical experiments support the theoretical conclusions.
|
|
14:50-15:10, Paper WeB05.5 | Add to My Program |
Pareto Optimization of Energy and Tolerance in Motion Trajectory Generation for Industrial Feed Drive Systems |
Nshama, Enock William | Toyohashi University of Technology |
Msukwa, Mathew Renny | Toyohashi University of Technology |
Uchiyama, Naoki | Toyohashi University of Technology |
Keywords: Optimization, Optimization algorithms, Modeling
Abstract: This paper proposes a method of generating piece-wise linear trajectories with smoothed corners that optimizes two objectives: energy consumption and cornering tolerance for feed drive systems. An energy model of an industrial bi-axial feed drive system is used to formulate a bi-objective optimization problem. The linear and smooth corner segments are generated using jerk limited acceleration profiles and kinematic corner smoothing technique with interrupted acceleration, respectively. The optimization problem is described with normalized normal constraints, where sequential quadratic programming is used to solve it. A divide and conquer algorithm is utilized to recursively generate Pareto optimal solutions. The best trade-off solution is obtained as the one that minimizes both objectives. Optimization results for an industrial bi-axial machine are illustrated, where the best trade-off solution achieves 63.96% of the energy saving potential with a moderate cornering tolerance of 29.79μm.
|
|
15:10-15:30, Paper WeB05.6 | Add to My Program |
A Distributed Algorithm for Robust Convex Optimization Over Random Networks |
Alaviani, Seyyed Shaho | Iowa State University |
Elia, Nicola | University of Minnesota |
Vaidya, Umesh | Iowa State University |
|
WeB06 Invited Session, Franklin 6 |
Add to My Program |
Analysis, Design, and Control of Systems in Neuroscience II |
|
|
Chair: Medvedev, Alexander V. | Uppsala University |
Co-Chair: Sharma, Nitin | University of Pittsburgh |
Organizer: Medvedev, Alexander V. | Uppsala University |
Organizer: Dixon, Warren E. | University of Florida |
Organizer: Pasqualetti, Fabio | University of California, Riverside |
Organizer: Pequito, Sergio | Rensselaer Polytechnic Institute |
|
13:30-13:50, Paper WeB06.1 | Add to My Program |
A Hebbian Learning Algorithm for Training a Neural Circuit to Perform Context-Dependent Associations of Stimuli (I) |
Zhu, Henghui | Boston University |
Paschalidis, Ioannis Ch. | Boston University |
Hasselmo, Michael | Boston University |
Keywords: Biological systems, Biologically-inspired methods, Neural networks
Abstract: We propose a biologically plausible learning algorithm to train a neural circuit model to perform context-dependent associations of stimuli with correct responses. The specific cognitive task we consider requires the ability to learn a context-dependent association rule and generalize beyond what has been seen during training. We analyze the learning algorithm using a Markov chain framework and establish its convergence. Using numerical simulation, we validate the performance of the learning algorithm and the generalization ability of the neural circuit model.
|
|
13:50-14:10, Paper WeB06.2 | Add to My Program |
Cadence and Position Tracking for Decoupled Legs During Switched Split-Crank Motorized FES-Cycling (I) |
Esquivel Estay, Fidel Ignacio | University of Florida |
Rouse, Courtney | University of Florida |
Cohen, Max | University of Florida |
Cousin, Christian | University of Florida |
Dixon, Warren E. | University of Florida |
Keywords: Lyapunov methods, Switched systems, Biomedical
Abstract: Functional electrical stimulation (FES) has proven to be an effective method for improving health and regaining muscle function for people with limited or reduced motor skills. Closed-loop control of motorized FES-cycling can facilitate recovery. Many people with movement disorders (e.g., stroke) have asymmetries in their motor control, motivating the need for a closed-loop control system that can be implemented on a splitcrank cycle. In this paper, nonlinear sliding mode controllers are designed for the FES and electric motor on each side of a split-crank cycle to maintain a desired cadence and a crank angle offset of 180 degrees, simulating standard pedaling conditions. A Lyapunov-like function is used to prove stability and tracking of the desired cadence and position for the combined cycle-rider system. One experimental trial on an able-bodied individual demonstrated the feasibility and stability of the closed-loop controller, which resulted in an average cadence error of 2.62 +/ 3.54 RPM for the dominant leg and an average position and cadence error of 39.84 +/ 10.77 degrees and -0.04 +/ 8.79 RPM for the non-dominant leg.
|
|
14:10-14:30, Paper WeB06.3 | Add to My Program |
Control-Engineering Perspective on Deep Brain Stimulation: Revisited (I) |
Medvedev, Alexander V. | Uppsala University |
Cubo, Ruben | Uppsala University |
Olsson, Fredrik | Uppsala University |
Bro, Viktor | Uppsala University |
Andersson, Helena | Uppsala University |
Keywords: Biomedical, Modeling, Estimation
Abstract: Deep brain stimulation (DBS) is a an established therapy in neurological and mental disorders making use of electrical pulses chronically delivered to a certain disease-specific neural target through surgically implanted electrodes. The therapeutical effect of DBS is highly individual and depends on the target coverage by the stimuli and the amount of spill beyond it. This can be suitably formulated as an optimization problem. Since the biological mechanism underlying the DBS therapy is mainly unknown, and due to high inter-patient and intra-patient variability of the DBS effect, a pragmatic approach to the DBS programming is to consider the process as tuning of a control system for the symptoms. Such a technology assumes that the symptoms are accurately quantified. The paper summarizes the progress in the individualized DBS and presents the results of a limited clinical study making use of the proposed DBS programming approach.
|
|
14:30-14:50, Paper WeB06.4 | Add to My Program |
Defining Information-Based Functional Objectives for Neurostimulation and Control (I) |
Ghazizadeh, Elham | Washington University in St. Louis |
Yi, Peng | Washington University in St Louis |
Ching, ShiNung | Washington University in St. Louis |
Keywords: Information theory and control, Learning, Optimization algorithms
Abstract: Abstract—Neurostimulation – the practice of applying exogenous excitation, e.g., via electrical current, to the brain – has been used for decades in clinical applications such as the treatment of motor disorders and neuropsychiatric illnesses. Over the past several years, more emphasis has been placed on understanding and designing neurostimulation from a systems-theoretic perspective, so as to better optimize its use. Particular questions of interest have included designing stimulation waveforms that best induce certain patterns of brain activity while minimizing expenditure of stimulus power. The pursuit of these designs faces a fundamental conundrum, insofar as they presume that the desired pattern (e.g., desynchronization of a neural population) is known a priori. In this paper, we present an alternative paradigm wherein the goal of the stimulation is not to induce a prescribed pattern per se, but rather to simply improve the functionality of the stimulated circuit/system. Here, the notion of functionality is defined in terms of an information-theoretic objective. Specifically, we seek closed loop control designs that maximize the ability of a controlled circuit to encode an afferent ‘hidden input,’ without prescription of dynamics or output. In this way, the control attempts only to make the system ‘effective’ without knowing beforehand the dynamics that are needed to be induced. We devote most of our effort to defining this framework mathematically, providing algorithmic procedures that demonstrate its solution and interpreting the results of this procedure for simple, prototypical dynamical systems. Simulation results are provided for more complex models, including an example involving control of a canonical neural mass model.
|
|
14:50-15:10, Paper WeB06.5 | Add to My Program |
Observer Design for a Nonlinear Neuromuscular System with Multi-Rate Sampled and Delayed Output Measurements (I) |
Zhang, Qiang | University of Pittsburgh |
Sheng, Zhiyu | University of Pittsburgh |
Kim, Kang | University of Pittsburgh |
Sharma, Nitin | University of Pittsburgh |
Keywords: Observers for nonlinear systems, Control applications, Sensor fusion
Abstract: Robotic devices and functional electrical stimulation (FES) are utilized to provide rehabilitation therapy to persons with incomplete spinal cord injury. The goal of the therapy is to improve their weakened voluntary muscle strength. A variety of control strategies used in these therapies need the measurement of the subject's volitional strength. This informs the robot-based or FES-based device to modulate assistance proportional to the patient's weakness. In this paper we propose an observer design to estimate ankle joint's kinematics that are elicited volitionally. The observer is designed for a nonlinear continuous-time neuromusculoskeletal system, which has multi-rate sampled output measurements with non-uniform and unknown delays that come from two sensing modalities including ultrasound imaging and inertial measurement unit. The allowable maximum values of unsynchronized sampling intervals and non-uniform delays are hypothesized, respectively. By constructing a Lyapunov-Krasovskii function, sufficient conditions are derived to show the exponential stability of the estimation error. At last, numerical simulations are provided to verify the effectiveness of the designed observer.
|
|
15:10-15:30, Paper WeB06.6 | Add to My Program |
Dealing with State Estimation in Fractional-Order Systems under Artifacts (I) |
Chatterjee, Sarthak | Rensselaer Polytechnic Institute |
Pequito, Sergio | Rensselaer Polytechnic Institute |
Keywords: Control applications, Biomedical, Systems biology
Abstract: Fractional-order dynamical systems are used to describe processes that exhibit long-term memory with power-law dependence. Notable examples include complex neurophysiological signals such as electroencephalogram (EEG) and blood-oxygen-level dependent (BOLD) signals. When analyzing different neurophysiological signals and other signals with a different origin (for example, biological systems), we often find the presence of artifacts, that is, recorded activity due to external causes having origins outside the system of interest. In this paper, we consider the problem of estimating the states of a discrete-time fractional-order dynamical system when there are artifacts present in some of the sensor measurements. Specifically, we provide necessary and sufficient conditions that ensure we can retrieve the system states even in the presence of artifacts. We provide a state estimation algorithm that can estimate the states of the system in the presence of artifacts. Finally, we present illustrative examples of our main results using real EEG data.
|
|
WeB07 Invited Session, Franklin 7 |
Add to My Program |
Estimation and Identification of Energy Storage Systems |
|
|
Chair: Lin, Xinfan | University of California, Davis |
Co-Chair: Kim, Youngki | University of Michigan - Dearborn |
Organizer: Dey, Satadru | University of Colorado Denver |
Organizer: Moura, Scott | University of California, Berkeley |
Organizer: Lin, Xinfan | University of California, Davis |
Organizer: Anderson, R. Dyche | Ford Motor Company |
Organizer: Parvini, Yasha | University of Detroit Mercy |
Organizer: Perez, Hector E. | University of California, Berkeley |
Organizer: Kim, Youngki | University of Michigan - Dearborn |
|
13:30-13:50, Paper WeB07.1 | Add to My Program |
Minimum-Time Measurement of Open Circuit Voltage of Battery Systems (I) |
Lee, Suhak | University of Michigan, Ann Arbor |
Kim, Youngki | University of Michigan - Dearborn |
Siegel, Jason B. | University of Michigan |
Stefanopoulou, Anna G. | University of Michigan |
Keywords: Energy systems, Optimal control, Identification for control
Abstract: Open circuit voltage (OCV) is an important parameter of a battery model. In order to provide accurate state estimation and control command, the battery model parameters have to be calibrated regularly when the battery ages or the model prediction deviates from the data. In this study, an innovative method is developed to reduce the total testing time for taking incremental OCV measurements. In the traditional incremental OCV measurement, the relaxation period is the most time-consuming step waiting until the slow time constant of diffusion dynamics reaches equilibrium. Here, an optimal control problem is formulated to find the minimum-time current profile such that it brings the voltage across the double RC pairs to equilibrium and the initial SOC to target SOC while satisfying the state and input constraints. It is shown by both simulation and experiment that the proposed minimum-time current profile can reduce the total testing time by 69%.
|
|
13:50-14:10, Paper WeB07.2 | Add to My Program |
Analytical Sensitivity Analysis for Battery Electrochemical Parameters (I) |
Lai, Qingzhi | University of California, Davis |
Jangra, Sidharth | University of California Davis |
Ahn, Hyoung Jun | LG Chem |
Kim, Geumbee | LG Chem |
Joe, Won Tae | Battery R&D, LG Chem |
Lin, Xinfan | University of California, Davis |
Keywords: Estimation, Identification, Energy systems
Abstract: Recognizing the important role of data in estimation, data optimization for offline and online battery state and parameter estimation has been receiving increasing attention recently. The main idea is to design/select data that are most sensitive to the target variables under estimation. However, due to the lack of efficient ways to compute sensitivity and heavy reliance on simulation, data optimization is often intractable because of the computational complexity. This issue is especially prominent for the states and parameters of the electrochemical battery models. In this work, we study the methodology for analytically deriving the sensitivity of battery electrochemical parameters. The derivation is based on a single particle model, and the results have been verified by comparing to the numerical simulation of a full order pseudo-2D electrochemical model. The obtained analytic results provide theoretic insight on the dynamic nature of the parameter sensitivity. The derived analytic expressions could enable fast sensitivity computation to serve the data optimization for offline system identification and online data selection/mining for real-time estimation.
|
|
14:10-14:30, Paper WeB07.3 | Add to My Program |
Quantifying Process Noise in Kalman Filters for Electrochemical Lithium-Ion Battery State Estimation (I) |
Weber, Weber | Stanford University |
Hoffmann, Kenneth | Stanford University, Department of Mechanical Engineering |
Spragg, Robert | Stanford University, Department of Civil and Environmental Engineering |
Onori, Simona | Stanford Univeristy |
|
14:30-14:50, Paper WeB07.4 | Add to My Program |
Parameter Identification of the Nonlinear Double-Capacitor Model for Lithium-Ion Batteries: From the Wiener Perspective (I) |
Tian, Ning | University of Kansas |
Fang, Huazhen | University of Kansas |
Wang, Yebin | Mitsubishi Electric Research Labs |
Keywords: Identification, Energy systems, Nonlinear systems identification
Abstract: Battery parameter identification is emerging as an important topic due to the increasing use of battery energy storage. This paper studies parameter identification for the nonlinear double-capacitor (NDC) model for lithium-ion batteries, which is a new equivalent circuit model developed in the authors' previous work. It is noticed that the NDC model has a structure similar to the Wiener system. From this Wiener perspective, this work builds a parameter identification approach for this model upon the well-known maximum (MAP) estimation. The purpose of using MAP is to overcome the nonconvexity and local minima that can cause unphysical parameter estimates. A quasi-Newton-based method is developed to accomplish the involved optimization procedure numerically. The proposed approach is the first one that we aware of exploits MAP for Wiener system identification. It also demonstrates significant effectiveness for accurate identification of the NDC model as validated through experiments.
|
|
14:50-15:10, Paper WeB07.5 | Add to My Program |
On Parameterizing PEM Fuel Cell Models (I) |
Goshtasbi, Alireza | University of Michigan |
Chen, Jixin | University of Michigan |
Waldecker, James | Ford Motor Company |
Hirano, Shinichi | Ford Motor Company |
Ersal, Tulga | University of Michigan |
Keywords: Identification, Model Validation, Modeling
Abstract: A methodology for parameterizing polymer electrolyte membrane (PEM) fuel cell models is presented. The procedure starts by optimal experimental design (OED) for parameter identification. This is done by exploring output sensitivities to parameter variations in the space of operating conditions. Once the optimal operating conditions are determined, they are used to gather synthetic experimental data. The synthetic data are then used to identify 7 model parameters in a step-by-step procedure that involves grouping the parameters for identification based on the preceding sensitivity analysis. Starting from the kinetic region of the polarization curve and continuing with the ohmic and mass transport regions, the parameters are identified in a cumulative fashion using a gradient-based nonlinear least squares algorithm. The impact of the OED for parameter identification is explored by comparing the results with another set of synthetic data obtained by Latin Hypercube Sampling (LHS) of the operating space. The results indicate improved identification with OED compared to LHS and point to the utility of the systematic approach, presented herein, for parameter identification for PEM fuel cell models.
|
|
15:10-15:30, Paper WeB07.6 | Add to My Program |
Hierarchical Estimation for Complex Multi-Domain Dynamical Systems (I) |
Tannous, Pamela | University of Illinois at Urbana-Champaign |
Docimo, Donald | University of Illinois at Urbana-Champaign |
Pangborn, Herschel | University of Illinois at Urbana-Champaign |
Alleyne, Andrew G. | Univ of Illinois, Urbana-Champaign |
Keywords: Automotive systems, Observers for nonlinear systems, Hierarchical control
Abstract: Complex power systems have dynamics spanning multiple energy domains and operating at multiple time scales. Hierarchical control has been proven to guarantee successful management of the coupling between the resulting fast transients and slow dynamics. It is usually prohibitively expensive or even infeasible to measure every signal in the system. Therefore, a reliable estimation framework that provides accurate estimates is vital to the success of the control design. This paper proposes a multi-level hierarchical estimation approach that can be used to supply reliable estimates to hierarchical controllers of complex multi-domain power systems. Models of complex multi-domain power systems can be accurately represented using graphs. System decomposition can be then achieved using clustering algorithms from graph theory. In this work, local estimates at each level of the hierarchical estimator are obtained using extended Kalman filters. A hierarchical estimator-controller is designed for an automotive electric vehicle as an illustrative example.
|
|
WeB08 Regular Session, Franklin 8 |
Add to My Program |
Learning II |
|
|
Chair: Benosman, Mouhacine | Mitsubishi Electric Research Laboratories |
Co-Chair: Duffaut Espinosa, Luis Augusto | University of Vermont |
|
13:30-13:50, Paper WeB08.1 | Add to My Program |
Mutual Learning: Part I – Learning Automata |
Narendra, Kumpati S. | Yale Univ |
Mukhopadhyay, Snehasis | Indiana-Purdue Univ |
Keywords: Learning, Machine learning, Stochastic systems
Abstract: Learning theory has been studied for a long time by philosophers, and in the last century by psychologists and engineers. Yet, all learning is carried out in a general deterministic or stochastic environment, mostly by one isolated learner. This paper discusses the concept of mutual learning, where two or more entities attempt to learn from each other. The question posed is: “If two or more entities are learning in the same or similar environments trying to solve the same or similar tasks, how can they share their learning to improve themselves?” The authors believe that this is a central question that will keep researchers busy for many years. The paper merely introduces this question for discussion, and suggests some preliminary answers using the well known stochastic learning automaton framework for reinforcement learning.
|
|
13:50-14:10, Paper WeB08.2 | Add to My Program |
Learning Constitutive Equations of Physical Components with Predefined Feasibility Conditions |
Matei, Ion | Palo Alto Research Center |
de Kleer, Johan | Palo Alto Research Center |
Zhenirovskyy, Maksym | Palo Alto Research Center |
Feldman, Alexander | Palo Alto Research Center |
Keywords: Learning, Modeling, Optimization
Abstract: Complete models of physical systems enable a plethora of model-based methods in control, diagnosis or prognosis. Proprietary information and system complexity often hinder building such models. We address here the problem of learning physical representations of components in partially known physical systems. These representations need to be feasible: when included in the system model, at minimum the model has to simulate. We propose mathematical models for the component representations and give necessary and sufficient conditions for their feasibility.We demonstrate our approach on a illustrative example where we learn different representations of an unknown resistor component in an electrical circuit.
|
|
14:10-14:30, Paper WeB08.3 | Add to My Program |
Combining Learning and Model Based Control: Case Study for Single-Input Lotka-Volterra System |
Gray, W. Steven | Old Dominion University |
Guggilam, Subbarao Venkatesh | Old Dominion University |
Duffaut Espinosa, Luis Augusto | University of Vermont |
Keywords: Learning, Predictive control for nonlinear systems, Adaptive control
Abstract: A hybrid control architecture for nonlinear dynamical systems is described which combines the advantages of model based control with those of real-time learning. The basic idea is to generate input-output data from an error system involving the plant and a proposed model. A discretized Chen-Fliess functional series is then identified from this data and used in conjunction with the model for predictive control. This method builds on the authors' previous work on model-free control of a single-input, single-output Lotka-Volterra system. The problem is revisited here, but now with the introduction of a model for the dynamics. The single-input, multiple-output version of the problem is also investigated as a way to enhance closed-loop performance.
|
|
14:30-14:50, Paper WeB08.4 | Add to My Program |
Model-Free Learning to Avoid Constraint Violations: An Explicit Reference Governor Approach |
Liu, Kaiwen | University of Michigan |
Li, Nan | University of Michigan |
Rizzo, Denise | US Army Tank Automotive Research, Development, and Engineering C |
Garone, Emanuele | Université Libre De Bruxelles |
Kolmanovsky, Ilya V. | The University of Michigan |
Girard, Anouck | University of Michigan, Ann Arbor |
Keywords: Constrained control, Learning, Adaptive control
Abstract: Constraints, including thermal, power, traction and rollover limits, as well as actuator range and rate limits, are ubiquitous in advanced ground vehicles and propulsion systems, and in their components, especially as these systems are downsized. These vehicles and systems will be operating in unknown environments where the recognition and avoidance of degradation or damage will be required. This paper proposes a model-free learning algorithm that over time modifies the parameters of an explicit reference governor (ERG) scheme so that violations of pre-specified constraints are avoided after a sufficiently informative learning phase. The ERG modifies set-point commands to a nominal closed-loop system. Our learning algorithm modifies the ERG parameters based on observed constraint violations during a learning phase so as to eliminate constraint violations after learning is completed. Theoretical properties of the algorithm are analyzed and several examples that illustrate its effectiveness are presented.
|
|
14:50-15:10, Paper WeB08.5 | Add to My Program |
Learning-Based Robust Observer Design for Coupled Thermal and Fluid Systems |
Koga, Shumon | University of California, San Diego |
Benosman, Mouhacine | Mitsubishi Electric Research Laboratories |
Borggaard, Jeff | Virginia Tech |
Keywords: Fluid flow systems, Estimation, Adaptive systems
Abstract: We present a learning-based robust observer design for thermal-fluid systems, pursuing an application to efficient energy management in buildings. The model is originally described by Boussinesq equations which is given by two partial differential equations (PDEs) on velocity field and temperature profile under incompressible flow. Using proper orthogonal decomposition (POD), the PDEs are reduced to a set of nonlinear ordinary differential equations (ODEs). Given a set of temperature and velocity point measurements, a nonlinear state observer is designed to reconstruct the entire state under the error of initial states, and model parametric uncertainties. We prove that the closed loop system of observer error state satisfies an estimate of L2 norm in a sense of locally input-to-state stability (LISS) with respect to parameter uncertainties. Moreover, the system uncertain parameters estimate used in the designed observer are optimized through iterations using a data-driven extremum seeking (ES) algorithm. Numerical simulation on a 2D Boussinesq PDE illustrates the performance of the proposed adaptive estimation method.
|
|
15:10-15:30, Paper WeB08.6 | Add to My Program |
Feedforward Motion Control: From Batch-To-Batch Learning to Online Parameter Estimation |
Mooren, Noud | Eindhoven University of Technology |
Witvoet, Gert | TNO Technical Sciences |
Oomen, Tom | Eindhoven University of Technology |
Keywords: Mechatronics, Learning, Adaptive systems
Abstract: Feedforward control is essential in high-performance motion control. The aim of this paper is to develop a unified framework for automatic feedforward optimization from both batch-wise data sets as well as real-time data. A statistical analysis is employed to analyze the effect of noise, i.e., an iteration varying disturbance, on feedforward controller performance. This provides new insights, both potential advantages as well as possible hazards of real-time estimation are considered. Finally, a case study confirms and illustrates the results.
|
|
WeB09 Invited Session, Franklin 9 |
Add to My Program |
Vehicle Dynamics Estimation and Control |
|
|
Chair: Chen, Yan | Arizona State University |
Co-Chair: Del Re, Luigi | Johannes Kepler University Linz |
Organizer: Dadras, Sara | Ford Motor Company |
Organizer: Ossareh, Hamid | University of Vermont |
Organizer: Parvini, Yasha | University of Detroit Mercy |
Organizer: Kim, Youngki | University of Michigan - Dearborn |
Organizer: Chen, Yan | Arizona State University |
|
13:30-13:50, Paper WeB09.1 | Add to My Program |
On-Bicycle Vehicle Tracking at Traffic Intersections Using Inexpensive Low-Density Lidar (I) |
Xie, Zhenming | University of Minnesota |
Rajamani, Rajesh | Univ. of Minnesota |
Keywords: Automotive systems, Sensor fusion, Multivehicle systems
Abstract: This paper explores the challenges in developing an inexpensive on-bicycle sensing system to track vehicles at a traffic intersection. In particular, opposing traffic with vehicles that can travel straight or turn left are considered. The estimated vehicle trajectories can be used for collision prevention between bicycles and left-turning vehicles. A compact solid-state 2-D low-density Lidar is mounted at the front of a bicycle to obtain distance measurements from vehicles. Vehicle tracking can be achieved by clustering based approaches for assigning measurement points to individual vehicles, introducing a correction term for position measurement refinement, and by exploiting data association and interacting multiple model Kalman filtering approaches for multi-target tracking. The tracking performance of the developed system is evaluated by both simulation and experimental results. Two types of scenarios that involve straight driving and left turning vehicles are considered. Experimental results show that the developed system can successfully track cars in these scenarios accurately in spite of the low measurement density of the sensor.
|
|
13:50-14:10, Paper WeB09.2 | Add to My Program |
Pulse-And-Glide Operation for Parallel Hybrid Electric Vehicles with Step-Gear Transmission in Automated Car-Following Scenario with Ride Comfort Consideration (I) |
Shieh, Su-Yang | University of Michigan |
Ersal, Tulga | University of Michigan |
Peng, Huei | Univ. of Michigan |
Keywords: Optimal control, Automotive control
Abstract: In this paper, the pulse and glide (PnG) operation for parallel hybrid electric vehicles (HEVs) with step-gear transmission in cruising scenario is considered. The PnG operation is an eco-driving technique that alternately turns on and off the engine to achieve better fuel economy. For HEVs, the batteries can serve as yet another energy buffer in addition to the vehicle body. However, due to the power loss during battery charging and discharging, the fuel saving performance of PnG using only battery is much degraded, even though it can lead to better ride comfort. Therefore, in this work, we introduce speed oscillation to SOC-PnG that originally only oscillates the state-of-charge (SOC) of the battery. Meanwhile, desired ride comfort and SOC sustenance requirements need to be fulfilled. To achieve this goal, two optimal control problems are formulated, one for the gliding phase and the other for the pulsing phase. By linearizing the vehicle dynamics and applying the McCommick envelop approach, the problems can be transcribed into quadratic programming (QP) problems using the Legendre pseudo-spectral (PS) method. The resultant QP problems can be solved efficiently. Therefore, this framework is suitable for real-time on-line implementation. Numerical simulations are conducted to show the ability of the proposed method to improve fuel economy, while maintaining desired ride comfort and sustaining the battery SOC.
|
|
14:10-14:30, Paper WeB09.3 | Add to My Program |
Steering of Autonomous Vehicles Based on Friction-Adaptive Nonlinear Model-Predictive Control (I) |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Automotive control, Automotive systems, Autonomous systems
Abstract: The vehicle steering-control behavior is highly dependent on the road surface. However, the road surface conditions are typically unknown a priori, and control actions that are safe to perform on asphalt may therefore lead to vehicle instability on low-friction surfaces. It is therefore important that the road surface is estimated, or at least detected, online, and that the vehicle dynamics control algorithms are adapted to the changing conditions. In this paper, we propose a nonlinear model-predictive control (NMPC) scheme that adapts its tire parameters in response to the estimated road surface. We show how estimating the initial slope of the tire-force curve can be used to change the full nonlinear tire-curve used by the NMPC and validate the method in simulation.
|
|
14:30-14:50, Paper WeB09.4 | Add to My Program |
Unsprung Mass Effects on Electric Vehicle Dynamics Based on Coordinated Control Scheme (I) |
Wang, Wei | Tongji University |
Chen, Xinbo | Tongji University |
Wang, Junmin | University of Texas at Austin |
Keywords: Automotive systems, Automotive control
Abstract: In electric vehicles, the propulsion configuration with the driving motor installed inside or close to the wheel has been treated as an option. Despite the advantages of the in-wheel drive system, negative effects brought by the increased unsprung mass, e.g. wheel and body vibrations, should be examined. In this work, we investigated this problem based on a proposed coordinated vehicle dynamics control system considering the desired path following as well as the body motion. The desired vehicle motion is determined by the generalized forces/moment, generated by a high-level MIMO sliding mode controller (SMC). Based on the tire normal force allocation, the generalized lateral, longitudinal forces, and yaw moment were distributed to the slip and slip angel of each tire by a fixed-point control allocation algorithm. With respect to the uneven road, a normal force robust tracking controller was proposed as a part of the low-level control. Evaluation of the unsprung mass effect was accomplished by simulations with a full-vehicle CarSim model under a fast double lane-changing maneuver. Comparison results with different unsprung mass configurations and road conditions reveal how the increased unsprung mass affects the vehicle dynamic performance in terms of vehicle planar and spatial motion.
|
|
14:50-15:10, Paper WeB09.5 | Add to My Program |
Microscopic Driving Behavior Modelling at Highway Entrances Using Bayesian Network (I) |
Deng, Junpeng | Johannes Kepler University Linz |
Gagliardi, Davide | Johannes Kepler Universität Linz |
Del Re, Luigi | Johannes Kepler University Linz |
Keywords: Automotive systems, Modeling, Stochastic systems
Abstract: Entrances into highway represent critical sections, as entering vehicles are bound to merge with the existing traffic at a fixed junction point almost independently from the traffic conditions - in some sense a "constrained" cut-in manoeuver. Advanced driver - assistance systems (ADAS) need to perform correctly under these conditions as well, but could also be used to facilitate merging and reducing risks. In particular, vehicles on the main road could adapt their speeds - or even change lane - provided an estimate of the entering vehicle's time to merge is available, exactly as a human driver would do. This paper is concerned with providing such an estimate. To this end, we observe that the speed profile on the entering ramps is rather well predictable if the acceleration of the entering vehicles is described as a function of their actual distance from the junction point. Still, uncertainties remain and to cope with them, we use a stochastic prediction model based on Dynamic Bayesian Network. The result are probability distribution functions of the time to merge based on the observation of speed and distance of the entering vehicle once they become visible to the traffic on the main road. Experimental data are used to illustrate the model structure and the parameter determination. The model quality is then assessed by comparing statistics from simulations with the one recorded on road. The possible use of the model as a tool for traffic prediction algorithm embedded in ADAS and an extension to existing highway stochastic traffic models are shortly discussed at the end of the paper.
|
|
15:10-15:30, Paper WeB09.6 | Add to My Program |
Guaranteed Vehicle Safety Control Using Control-Dependent Barrier Functions (I) |
Huang, Yiwen | Arizona State University |
Yong, Sze Zheng | Arizona State University |
Chen, Yan | Arizona State University |
Keywords: Automotive control, Constrained control, Stability of nonlinear systems
Abstract: How to guarantee the safety of autonomous ground vehicles is still a significant challenge, although different active safety control systems have been developed, including techniques based on controlled invariant sets and control barrier functions (CBF) that have been proven to guarantee the safety of dynamic systems. To apply these techniques to vehicle safety control, we regarded an estimated lateral stability region of a vehicle as a controlled invariant set. However, the stability region was found to vary with respect to the system control input, which is normally the steering angle. Therefore, the existing definition of the controlled invariant set, which is independent of control inputs, may not be applicable. In this paper, the definition of a controlled invariant set is extended to a control-dependent invariant set, so that the controlled invariant set can vary with control inputs. Based on the extended definition, a new invariance condition using control-dependent barrier function (CDBF) is proposed and applied to the guaranteed vehicle safety control problem. Finally, the guaranteed vehicle safety control is demonstrated by simulation results.
|
|
WeB10 Regular Session, Franklin 10 |
Add to My Program |
Predictive Control for Nonlinear Systems I |
|
|
Chair: Christofides, Panagiotis D. | Univ. of California at Los Angeles |
Co-Chair: Prodan, Ionela | Grenoble Institute of Technology (Grenoble INP) - Esisar |
|
13:30-13:50, Paper WeB10.1 | Add to My Program |
On Impact of Unsafe Set Structure in Control Lyapunov-Barrier Function-Based Model Predictive Control |
Wu, Zhe | University of California, Los Angeles |
Christofides, Panagiotis D. | Univ. of California at Los Angeles |
Keywords: Predictive control for nonlinear systems, Chemical process control, Lyapunov methods
Abstract: Control Lyapunov-Barrier function (CLBF) has been used to design controllers for nonlinear systems subject to input constraints to ensure closed-loop stability and process operational safety simultaneously. In this work, we developed Control Lyapunov-Barrier functions for two types of unsafe regions (i.e., bounded and unbounded sets) to solve the problem of stabilization of nonlinear systems with guaranteed safety. Specifically, discontinuous control actions are required to handle potential stationary points (except the origin) for Control Lyapunov-Barrier function in the presence of a bounded unsafe region embedded within the closed-loop system stability region. Subsequently, the CLBF-MPC is developed by incorporating CLBF-based constraints to guarantee closed-loop stability with safety and also ensure the avoidance of convergence to other stationary points if there is a bounded unsafe region. In the case of unbounded unsafe sets, closed-loop stability with safety is readily guaranteed under the CLBF-MPC since the origin is the unique stationary point in state-space. The application of the proposed CLBF-MPC method is demonstrated through a chemical process example with a bounded and an unbounded unsafe region, respectively.
|
|
13:50-14:10, Paper WeB10.2 | Add to My Program |
Integrating Safeness Index-Based Model Predictive Control and Safety Relief Valve Activation for Operational Safety of Chemical Processes |
Zhang, Zhihao | University of California, Los Angeles |
Wu, Zhe | University of California, Los Angeles |
Rincon, Franklin D. | University of São Paulo |
Christofides, Panagiotis D. | Univ. of California at Los Angeles |
Keywords: Predictive control for nonlinear systems, Chemical process control, Simulation
Abstract: This work demonstrates an application of Safeness Index-based model predictive control to improve process operational safety in a safety critical chemical process application. Specifically, a high-pressure flash drum separator together with pressure relief valve as safety system is used to analyze the benefits of integrating Safeness Index-based considerations in model predictive control (MPC). Safeness Index function and Safeness Index threshold are developed using information collected from the process and safety system to indicate the safeness of the plant. Under an identified linear model, MPC is implemented with Safeness Index-based constraints and slack variables in a co-simulation of Matlab/Aspen. It is demonstrated that in the presence of a small disturbance, the drum pressure remains below the opening pressure of relief valve by Safeness Index-based MPC, so that the safety system is not activated. When there is a large disturbance, the controller working together with the relief valve ensures process operational safety before, during and after the pressure relief valve is turned on/off.
|
|
14:10-14:30, Paper WeB10.3 | Add to My Program |
Stabilizing Model Predictive Control for Nonlinear Systems in Input-Output Quasi-LPV Form |
Gonzalez Cisneros, Pablo Sebastian | Hamburg University of Technology |
Werner, Herbert | Hamburg University of Technology |
Keywords: Predictive control for nonlinear systems, Linear parameter-varying systems, Constrained control
Abstract: This paper present a Nonlinear Model Predictive Control (NMPC) scheme for systems in input-output quasi-Linear Parameter Varying (IO-qLPV) form. Stability is guaranteed by the use of terminal ingredients: a terminal cost associated with a control Lyapunov function, with a dual mode controller within a terminal constraint set. These terminal ingredients are computed offline by solving an LMI problem, using a recent result from IO-LPV literature. Online computational complexity is kept low by solving the nonlinear optimization problem as a sequence of Quadratic Programs. A simulation example on a 2-DOF robotic manipulator illustrates the approach and the computation of the terminal ingredients.
|
|
14:30-14:50, Paper WeB10.4 | Add to My Program |
On the Use of a Computed-Torque Control Law for the Terminal Region of an NMPC Scheme |
Nguyen, Ngoc Thinh | Grenoble INP (Institute of Engineering Univ. Grenoble Alpes) |
Prodan, Ionela | Grenoble Institute of Technology (Grenoble INP) - Esisar |
Lefevre, Laurent | Grenoble Institute of Technology (Grenoble INP) |
Keywords: Predictive control for nonlinear systems, Mechatronics, Feedback linearization
Abstract: This work addresses the advantages of using a CTC (Computed-Torque Control) law within a NMPC (Nonlinear Model Predictive Control) scheme. More precisely, the CTC law leads to stable linear closed-loop dynamics after the end of the prediction horizon. By choosing appropriate control gains, a positive invariant ellipsoidal set in which the input constraints are satisfied is determined. Using this set as terminal region in the NMPC problem, together with additional assumptions provides recursive feasibility and asymptotic stability guarantees. This proposed approach can be applied for any robotic manipulators admitting a CTC law, as a particular example. To prove its benefits some simulation results and comparisons with quasi-infinite horizon NMPC over the classical inverted pendulum dynamics are presented.
|
|
14:50-15:10, Paper WeB10.5 | Add to My Program |
Improved Nonlinear Model Predictive Control with Volterra-Laguerre Models |
Stoddard, Jeremy | University of Newcastle |
Welsh, James S. | University of Newcastle |
Keywords: Predictive control for nonlinear systems, Nonlinear systems identification
Abstract: This paper revisits the problem of nonlinear model predictive control (NMPC) using a second order Volterra-Laguerre model structure. While previous NMPC results used a simplified version of the structure with only one set of Laguerre basis functions, recent advances in regularized Volterra series identification allow direct estimation of a more complex Volterra-Laguerre structure. To accommodate this, we develop a more flexible state space representation of the second order model, and derive the corresponding NMPC optimization problem and its analytic solution. The proposed approach is compared with previous methods on a simulation example to demonstrate the performance benefits.
|
|
15:10-15:30, Paper WeB10.6 | Add to My Program |
Dissipativity and Economic Model Predictive Control for Optimal Set Operation |
Martin, Tim | University of Stuttgart |
Köhler, Philipp N. | University of Stuttgart |
Allgöwer, Frank | University of Stuttgart |
Keywords: Predictive control for nonlinear systems, Optimal control, Process Control
Abstract: The paper deals with systems which are optimally operated when the system states remain in a certain subset of the state space. We define this mode of optimal operation as optimal set operation. We characterize optimal set operation by a dissipativity condition with a parametric storage function. Both, the definition and the dissipativity condition for optimal set operation, constitute a eneralization of the definition and the dissipativity condition for the well-studied scenarios of optimal steady-state or optimal periodic operation. Furthermore, we present an economic MPC scheme with optimized terminal equality constraint that yields convergence of the MPC closed-loop system to the set where the system is optimally operated.
|
|
WeB11 Invited Session, Room 401-402 |
Add to My Program |
Safety-Critical Systems: Analysis and Control |
|
|
Chair: Ornik, Melkior | University of Illinois at Urbana-Champaign |
Co-Chair: Hiskens, Ian | University of Michigan |
Organizer: Kalsi, Karan | Pacific Northwest National Lab |
Organizer: Kundu, Soumya | Pacific Northwest National Laboratory |
|
13:30-13:50, Paper WeB11.1 | Add to My Program |
Compositional Set Invariance in Network Systems with Assume-Guarantee Contracts (I) |
Chen, Yuxiao | California Institute of Technology |
Anderson, James | California Institute of Technology |
Kalsi, Karan | Pacific Northwest National Lab |
Low, Steven | California Institute of Technology |
Ames, Aaron D. | California Institute of Technology |
Keywords: Formal verification/synthesis, Networked control systems, Smart grid
Abstract: This paper presents an assume-guarantee reasoning approach to the computation of robust invariant sets for network systems. Parameterized signal temporal logic (pSTL) is used to formally describe the behaviors of the subsystems, which we use as the template for the contract. We show that set invariance can be proved with a valid assume-guarantee contract by reasoning about individual subsystems. If a valid assume-guarantee contract with monotonic pSTL template is known, it can be further refined by value iteration. When such a contract is not known, an epigraph method is proposed to solve for a contract that is valid, ---an approach that has linear complexity for a sparse network. A microgrid example is used to demonstrate the proposed method. The simulation result shows that together with control barrier functions, the states of all the subsystems can be bounded inside the individual robust invariant sets.
|
|
13:50-14:10, Paper WeB11.2 | Add to My Program |
Herding an Adversarial Attacker to a Safe Area for Defending Safety-Critical Infrastructure (I) |
Chipade, Vishnu S. | University of Michigan, Ann Arbor |
Panagou, Dimitra | University of Michigan, Ann Arbor |
Keywords: Autonomous systems, Multivehicle systems, Aerospace
Abstract: This paper investigates a problem of defending safety-critical infrastructure from an adversarial aerial attacker in an urban environment. A circular arc formation of defenders is formed around the attacker, and vector-field based guidance laws herd the attacker to a predefined safe area in the presence of rectangular obstacles. The defenders' formation is defined based on a novel vector field that imposes super-elliptic contours around the obstacles, to closely resemble their rectangular shape. A novel finite-time stabilizing controller is proposed to guide the defenders to their desired formation, while avoiding obstacles and inter-agent collisions. The efficacy of the approach is demonstrated via simulation results.
|
|
14:10-14:30, Paper WeB11.3 | Add to My Program |
Distributed Barrier Certificates for Safe Operation of Inverter-Based Microgrids (I) |
Kundu, Soumya | Pacific Northwest National Laboratory |
Geng, Sijia | University of Michigan, Ann Arbor |
Nandanoori, Sai Pushpak | Iowa State University |
Hiskens, Ian | University of Michigan |
Kalsi, Karan | Pacific Northwest National Lab |
Keywords: Network analysis and control, Distributed control, Smart grid
Abstract: Inverter-interfaced microgrids differ from the traditional power systems due to their lack of inertia. Vanishing timescale separation between voltage and frequency dynamics makes it critical that faster-timescale stabilizing control laws also guarantee by-construction the satisfaction of voltage limits during transients. In this article, we apply a barrier functions method to compute distributed active and reactive power setpoint control laws that certify satisfaction of voltage limits during transients. Using sum-of-squares optimization tools, we propose an algorithmic construction of these control laws. Numerical simulations are provided to illustrate the proposed method.
|
|
14:30-14:50, Paper WeB11.4 | Add to My Program |
Synthesis of Minimum-Cost Shields for Multi-Agent Systems (I) |
Bharadwaj, Sudarshanan | University of Texas, Austin |
Bloem, Roderick | Graz University of Technology |
Dimitrova, Rayna | Max Planck Institute for Software Systems |
Koenighofer, Bettina | Graz University of Technology |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Formal verification/synthesis, Autonomous systems
Abstract: In this paper, we propose a general approach to derive runtime enforcement implementations for multi- agent systems, called shields, from temporal logical specifications. Each agent of the multi-agent system is monitored, and if needed corrected, by the shield, such that a global specification is always satisfied. The different ways of how a shield can interfere with each agent in the system in case of an error introduces the need for quantitative objectives. This work is the first to discuss the shield synthesis problem with quantitative objectives. We provide several cost functions that are utilized in the multi-agent setting and provide methods for the synthesis of cost-optimal shields and fair shields, under the given assumptions on the multi-agent system. We demonstrate the applicability of our approach via a detailed case study on UAV mission planning for warehouse logistics and simulating the shielded multi-agent system on ROS/Gazebo.
|
|
14:50-15:10, Paper WeB11.5 | Add to My Program |
Correct-By-Construction Control Synthesis for Buck Converters with Event-Triggered State Measurement (I) |
Yang, Liren | University of Michigan |
Xiaofan, Cui | University of Michigan, Ann Arbor |
Avestruz, Al-Thaddeus | University of Michigan |
Ozay, Necmiye | Univ. of Michigan |
Keywords: Formal verification/synthesis, Hybrid systems, Power electronics
Abstract: In this paper, we illustrate a new correct-by-construction switching controller for a power converter with event-triggered measurements. The event-triggered measurement scheme is beneficial for high frequency power converters because it requires relatively low-speed sampling hardware and is immune to unmodeled switching transients. While providing guarantees on the closed-loop system behavior is crucial in this application, off-the-shelf abstraction-based techniques cannot be directly employed to synthesize a controller in this setting because controller cannot always get instantaneous access to the current state. As a result, the switching action has to be based on slightly out-of-date measurements. To tackle this challenge, we introduce the out-of-date measurement as an extra state variable and project out the inaccessible real state to construct a belief space abstraction. The properties preserved by this belief space abstraction are analyzed. Finally, an abstraction-based synthesis method is applied to this abstraction. We demonstrate the controller on a constant on-time buck voltage regulator plant and a event-triggered sampler. The simulation verifies the effectiveness of our controller.
|
|
15:10-15:30, Paper WeB11.6 | Add to My Program |
Myopic Control of Systems with Unknown Dynamics (I) |
Ornik, Melkior | University of Illinois at Urbana-Champaign |
Carr, Steven Paull | The University of Texas at Austin |
Israel, Arie | University of Texas, Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Uncertain systems, Optimal control, Aerospace
Abstract: This paper introduces a strategy for satisfying basic control objectives for systems whose dynamics are almost entirely unknown. This setting is motivated by a scenario where a system undergoes a critical failure, thus significantly changing its dynamics. In such a case, retaining the ability to satisfy basic control objectives such as reach-avoid is imperative. To deal with significant restrictions on our knowledge of system dynamics, we develop a theory of myopic control. The primary goal of myopic control is to, at any given time, optimize the current direction of the system trajectory, given solely the limited information obtained about the system until that time. Building upon this notion, we propose a control algorithm which simultaneously uses small perturbations in the control effort to learn local system dynamics while moving in the direction which seems to be optimal based on previously obtained knowledge. We show that the algorithm results in a trajectory that is nearly optimal in the myopic sense, i.e., it is moving in a direction that seems to be nearly the best at the given time, and provide formal bounds for suboptimality. We demonstrate the usefulness of the proposed algorithm on a high-fidelity simulation of a damaged Boeing 747 seeking to remain in level flight.
|
|
WeB12 Regular Session, Room 403 |
Add to My Program |
Model-Reference Adaptive Control |
|
|
Chair: Nguyen, Nhan | NASA Ames Research Center |
Co-Chair: Dogan, Kadriye Merve | University of South Florida |
|
13:30-13:50, Paper WeB12.1 | Add to My Program |
Further Results on Model Reference Adaptive Control in the Presence of Actuator and Unmodeled Dynamics |
Dogan, Kadriye Merve | University of South Florida |
Yucelen, Tansel | University of South Florida |
Gruenwald, Benjamin | University of South Florida |
Muse, Jonathan | Wright Patterson Air Force Base |
Keywords: Adaptive control, Adaptive systems, LMIs
Abstract: In model reference adaptive control of uncertain dynamical systems, the presence of actuator and unmodeled dynamics are unavoidable. Our previous work focused on an adaptive control architecture for this problem and showed two sufficient stability conditions. In particular, the first condition captured the tradeoff between system uncertainties and actuator dynamics (related to the quadratic stability of a matrix) and the second condition captured the effect of unmodeled dynamics (related to the positive-definiteness of another matrix). This paper now proposes a robustifying term in this adaptive control architecture. Specifically, we show that this term results in an added nonnegative matrix in the second stability condition, where this can allow for a relaxed stability condition. Numerical examples are provided to demonstrate the efficacy of the proposed robustifying term on a coupled mechanical system.
|
|
13:50-14:10, Paper WeB12.2 | Add to My Program |
Automatic Identification and Switching of Multi-MRAC Systems |
Yechiel, Oded | Ben-Gurion University of the Negev |
Guterman, Hugo | Ben-Gurion University |
Keywords: Adaptive control, Machine learning, Switched systems
Abstract: Controlling hybrid systems - a system that exhibits continuous and discrete behavior simultaneously - is of great interest since the new millennium. Switched linear systems are especially interesting due to the large amount of applications that may be solved. However, applying different control schemes on switched systems entails difficulties in identifying the underlying models and the transitions that occur between them. In this paper an automatic identification and switching for Multi-Model Reference Adaptive Control (MMRAC) scheme is proposed. The identification of the submodels is performed by curve clustering of the states plotted in the phase portrait. An unsupervised learning algorithm is proposed to cluster the curves. Each curve represents a single submodel and is paired with an MRAC. After the clustering process, correlation between every submodel and the current state is checked. Then the MRAC paired with the best representing curve is used to control the plant, and update the parameters of the curve and the MRAC itself. The results of two simulations are presented in the end of this paper.
|
|
14:10-14:30, Paper WeB12.3 | Add to My Program |
A Set-Theoretic Model Reference Adaptive Control Architecture with Dead-Zone Effect |
Arabi, Ehsan | University of Michigan |
Yucelen, Tansel | University of South Florida |
Keywords: Control system architecture, Constrained control, Adaptive control
Abstract: By introducing a system error-dependent learning rate, the recently proposed set-theoretic model reference adaptive control architecture provides user-defined worst-case performance guarantees on the system error between an uncertain dynamical system of interest and a given reference model. In this architecture, the adaptation process is always active. However, it is of practical interest to stop the adaptation process when it is not needed (i.e., in the presence of small system errors). Motivated from this standpoint, we present a new set-theoretic model reference adaptive control architecture with dead-zone effect. The key feature of our framework utilizes a modified and continuous generalized restricted potential function in the adaptation update law, where it not only stops the adaptation process inside the dead-zone (i.e., when the system error is small) but also allows the norm of the system error to be less than a-priori, user-defined worst-case performance bound. The efficacy of the proposed architecture is also demonstrated through an illustrative numerical example.
|
|
14:30-14:50, Paper WeB12.4 | Add to My Program |
New Higher-Order Convergence Properties for Multivariable Model Reference Adaptive Control Systems |
Song, Ge | University of Virginia |
Tao, Gang | University of Virginia |
Keywords: Adaptive control
Abstract: For a general multi-input multi-output linear time-invariant system with unknown parameters, a multivariable model reference adaptive control (MRAC) design guarantees asymptotic output tracking, shown by a sophisticated analysis in the literature. This paper further shows a stronger higher-order convergence property for the signal components of the tracking error. It is proved that under the same MRAC design conditions, not only a tracking error component but its higher-order time-derivatives converge to zero, with the order related to system's infinite zero structure characterized by the system modified interactor matrix. Both cases of a diagonal modified interactor matrix and a non-diagonal modified interactor matrix are studied in the paper, and the new MRAC tracking property is proved for different forms of the modified interactor matrix.
|
|
14:50-15:10, Paper WeB12.5 | Add to My Program |
MRAC with Time-Varying Reference Model from Convex Combination |
Hashemi, Kelley | NASA Ames Research Center |
Nguyen, Nhan | NASA Ames Research Center |
Keywords: Direct adaptive control, Time-varying systems
Abstract: An extension of model reference adaptive control is presented that accommodates use of a time-varying reference model. Specifically, the reference model is taken to be a time-varying convex combination of two linear, time-invariant models. The design is intended to act as a way to smoothly transition between two different reference models without resorting to a scheduled switch. It also provides the ability to use an interpolated reference model when the plant is operating between design points. The time variation of the combination must satisfy some requirements to ensure stability but is otherwise user choice. Subject to these requirements, bounded tracking error behavior is demonstrated via Lyapunov stability analysis for the single-input, single-output, output feedback case. Tracking error convergence is asymptotic when time variation ceases. The proposed design is demonstrated in simulation of a numerical model.
|
|
WeB13 Regular Session, Room 404 |
Add to My Program |
Observers for Nonlinear Systems II |
|
|
Chair: Mishra, Hrishik | German Aerospace Center (DLR) |
Co-Chair: Ahmed, Saeed | Bilkent University |
|
13:30-13:50, Paper WeB13.1 | Add to My Program |
Prosthetic Legs Output Feedback Control Via Variable High Gain Observer |
de A. M. Ricart, Ignácio | Federal University of Rio De Janeiro |
Peixoto, Alessandro Jacoud | Federal University of Rio De Janeiro (UFRJ) |
Reis, Matheus | Federal University of Rio De Janeiro |
Keywords: Observers for nonlinear systems, Nonlinear output feedback, Uncertain systems
Abstract: This paper addresses the state estimation and control of a robot/prosthesis control system with four joints: vertical hip displacement, thigh, knee and ankle angles. The motivation was inspired by several drawbacks regarding the usage of load cells and/or sensors in robots and prosthetic legs to capture gait data, external forces (GRFs) and moments during walking. We propose the implementation of a high gain observer (HGO) to estimate the prosthesis joint velocities with a time-varying HGO gain synthesized from measurable signals designed to reduce the amount of noise in the control effort while keeping an acceptable tracking error transient performance. Numerical simulations analyze the robustness of the closed-loop control with respect to parametric errors and measurement noise.
|
|
13:50-14:10, Paper WeB13.2 | Add to My Program |
Guaranteed Performance of Nonlinear Pose Filter on SE(3) |
Hashim A, Hashim | Western Univeristy |
Brown, Lyndon J. | University of Western Ontario |
McIsaac, Kenneth Alexander | University of Western Ontario |
Keywords: Observers for nonlinear systems, Robotics, Spacecraft control
Abstract: This paper presents a novel nonlinear pose filter evolved directly on the Special Euclidean Group SE(3) with guaranteed characteristics of transient and steady-state performance. The above-mention characteristics can be achieved by trapping the position error and the error of the normalized Euclidean distance of the attitude in a given large set and guiding them to converge systematically to a small given set. The error vector is proven to approach the origin asymptotically from almost any initial condition. The proposed filter is able to provide a reliable pose estimate with remarkable convergence properties such that it can be fitted with measurements obtained from low-cost measurement units. Simulation results demonstrate high convergence capabilities and robustness considering large error in initialization and high level of uncertainties in measurements.
|
|
14:10-14:30, Paper WeB13.3 | Add to My Program |
A Nonlinear Observer for Free-Floating Target Motion Using Only Pose Measurements |
Mishra, Hrishik | German Aerospace Center (DLR) |
De Stefano, Marco | German Aerospace Center (DLR) |
Giordano, Alessandro Massimo | Technical University of Munich (TUM) |
Ott, Christian | German Aerospace Center (DLR) |
Keywords: Observers for nonlinear systems, Stability of nonlinear systems
Abstract: In this paper, we design a nonlinear observer to estimate the pose and the velocity of a free-floating non-cooperative target using only pose measurements. In the context of control design for orbital robotic capture of such a non-cooperative target, due to lack of navigational aids, only a pose estimate may be obtained from slow-sampled and noisy exteroceptive sensors. The velocity, however, cannot be measured directly. To address this problem, we develop a model-based observer which acts as an internal model for target kinematics/dynamics and therefore, may act as a predictor during periods of no measurement. To this end, firstly, we formalize the estimation problem on the SE(3) Lie group with different state and measurement spaces. Secondly, we develop the kinematics and dynamics observer such that the overall observer error dynamics possesses a stability property. Finally, the proposed observer is validated through robust Monte-Carlo simulations and experiments on a robotic facility.
|
|
14:30-14:50, Paper WeB13.4 | Add to My Program |
Relative Moving Target Tracking and Circumnavigation |
Nielsen, Jerel | Brigham Young University |
Beard, Randal W. | Brigham Young Univ |
Keywords: Observers for nonlinear systems, Vision-based control, Autonomous systems
Abstract: This paper develops observers and controllers for relative estimation and circumnavigation of a moving ground target using bearing-only measurements or range with bearing measurements. A bearing-only observer, range with bearing observer, a general circumnavigation velocity command for an arbitrary aircraft, and nonlinear velocity-based multirotor controller are developed. The observers are designed in the body-fixed reference frame, while the velocity command and multirotor controller are developed in the body-level frame, independent of aircraft heading. This enables target circumnavigation in GPS-denied environments when only a camera-IMU estimator is used for state estimation and ensures observable conditions for the estimator. Simulation results demonstrate the effectiveness of the observers, velocity command, and multirotor controller under various target motions.
|
|
14:50-15:10, Paper WeB13.5 | Add to My Program |
Multi-Rate Sampled-Data Observer Design for Nonlinear Systems with Asynchronous and Delayed Measurements |
Ling, Chen | Texas A&M University |
Kravaris, Costas | Texas A&M University |
Keywords: Observers for nonlinear systems
Abstract: In our previous work, we developed a multi-rate sampled-data observer design method in nonlinear systems with asynchronous sampling. In this article, possible measurement delays are accounted for in the multi-rate observer design. The proposed observer adopts an available multi-rate design in the time interval between two consecutive delayed measurements. A dead time compensation approach is developed to compensate for the effect of delay and update past estimates when a delayed measurement arrives. It is shown that stability of the multi-rate observer is preserved under non-constant, arbitrarily large delays, in the absence of measurement errors. The proposed multi-rate multi-delay observer is applied to a gas-phase polyethylene reactor example and provides reliable estimates in the presence of nonuniform sampling and non-constant delays.
|
|
15:10-15:30, Paper WeB13.6 | Add to My Program |
Output Feedback Stabilization by Reduced Order Finite Time Observers Using a Trajectory Based Approach |
Malisoff, Michael | Louisiana State University |
Mazenc, Frederic | Inria Saclay |
Ahmed, Saeed | Bilkent University |
Keywords: Nonlinear output feedback, Time-varying systems, Observers for nonlinear systems
Abstract: We use finite time reduced order continuous-discrete observers to solve an output feedback stabilization problem for a class of nonlinear time-varying systems whose outputs contain uncertainty. Unlike earlier works, our feedback is discontinuous, but it does not contain distributed control terms. Our trajectory based approach is based on a contractivity condition. We illustrate our control in the context of a tracking problem for nonholonomic systems in chained form.
|
|
WeB14 Regular Session, Room 405 |
Add to My Program |
Robust Control II |
|
|
Chair: Ampountolas, Konstantinos | University of Glasgow |
Co-Chair: Liu, Jinfeng | University of Alberta |
|
13:30-13:50, Paper WeB14.1 | Add to My Program |
Robust Stability of Time-Varying Polytopic Systems by the Attractive Ellipsoid Method |
García González, Pablo Josué | CINVESTAV-IPN, México D.F., A.P. 14-740, 07300, México |
Ampountolas, Konstantinos | University of Glasgow |
Keywords: Robust control, Stability of linear systems, Linear parameter-varying systems
Abstract: This paper concerns the robust stabilization of continuous-time polytopic systems subject to unknown but bounded perturbations. To tackle this problem, the attractive ellipsoid method (AEM) is employed. The AEM aims to determine an asymptotically attractive (invariant) ellipsoid such that the state trajectories of the system converge to a small neighborhood of the origin despite the presence of non-vanishing perturbations. An alternative form of the elimination lemma is used to derive new LMI conditions, where the state-space matrices are decoupled from the stabilizing Lyapunov matrix. Then a robust state-feedback control law is obtained by semi-definite convex optimization, which is numerically tractable. Further, the gain-scheduled state-feedback control problem is considered within the AEM framework. Numerical examples are given to illustrate the proposed AEM and its improvements over previous works. Precisely, it is demonstrated that the minimal size ellipsoids obtained by the proposed AEM are smaller compared to previous works, and thus the proposed control design is less conservative.
|
|
13:50-14:10, Paper WeB14.2 | Add to My Program |
Robust Model Predictive Control for Linear Systems with State and Input Dependent Uncertainties |
Malyuta, Danylo | University of Washington |
Acikmese, Behcet | University of Washington |
Cacan, Martin | Jet Propulsion Laboratory, California Institute of Technology |
Keywords: Robust control, Optimal control, Spacecraft control
Abstract: This paper presents a computationally efficient robust model predictive control law for discrete linear time invariant systems subject to additive disturbances that may depend on the state and/or input norms. Despite the dependency being non-convex, we are able to handle it as a second-order cone program. Both open-loop and semi-feedback planning strategies are presented. The formulation has linear complexity in the planning horizon length. The approach is thus amenable to efficient real-time implementation with a guarantee on recursive feasibility and global optimality. Robust position control of a satellite is considered as an illustrative example.
|
|
14:10-14:30, Paper WeB14.3 | Add to My Program |
Robust Tube-Based Model Predictive Control for Time-Constrained Robot Navigation |
Nikou, Alexandros | KTH Royal Institute of Technology |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Robust control, Predictive control for linear systems, Autonomous systems
Abstract: This paper deals with the problem of time-constrained navigation of a robot modeled by uncertain nonlinear non-affine dynamics in a bounded workspace of mathbb{R}^n. Initially, we provide a novel class of robust feedback controllers that drive the robot between Regions of Interest (RoI) of the workspace. The control laws consists of two parts: an on-line controller which is the outcome of a Finite Horizon Optimal Control Problem (FHOCP); and a backstepping feedback law which is tuned off-line and guarantees that the real trajectory always remains in a bounded hyper-tube centered along the nominal trajectory of the robot. The proposed controller falls within the so-called tube-based Nonlinear Model Predictive control (NMPC) methodology. Then, given a desired high-level specification for the robot in Metric Interval Temporal Logic (MITL), by utilizing the aforementioned controllers, a framework that provably guarantees the satisfaction of the formula is provided. The proposed framework can handle the rich expressiveness of MITL in both safety and reachability specifications. Finally, the proposed framework is validated by numerical simulations.
|
|
14:30-14:50, Paper WeB14.4 | Add to My Program |
Nonlinear Disturbance Observer Based Control for Polynomial Systems with Mismatched Uncertainties Using Sum-Of-Squares Programming |
Misra, Gaurav | Rutgers University |
Bai, Xiaoli | Rutgers, the State University of New Jer |
Keywords: Robust control, Optimization, Optimization algorithms
Abstract: Nonlinear disturbance observers owing to their simplicity in implementation have seen remarkable success in motion control. Although, the underlying principle behind disturbance observers is straightforward, finding the corresponding observer gain matrix is non-trivial and often becomes a problem specific task. In addition, for cases where the disturbance enters the system through a different channel than the input, termed as the mismatching condition, disturbance observer and compensation design can be challenging. In this paper, we propose a sum-of-squares method to design disturbance observers for polynomial nonlinear systems with guaranteed exponential stability. The exponential stability of the disturbance observer enables its usage in a composite control structure with any asymptotic or finite time stable control scheme. Furthermore, we demonstrate the design of the disturbance compensation gain which when applied to systems with mismatched uncertainties ensures input-to-state stability (ISS) of the system. The ISS-Lyapunov analysis for the combined disturbance observer and the polynomial system is carried out using sum-of-squares programming. To numerically validate our proposed approach, we investigate robust disturbance observer based control for both matched and mismatched disturbances.
|
|
14:50-15:10, Paper WeB14.5 | Add to My Program |
Min-Max MPC of Networked Control Systems with Transmission Delays |
Mao, Yawen | Jiangnan University |
Liu, Su | University of Alberta |
Decardi-Nelson, Benjamin | University of Alberta |
Liu, Jinfeng | University of Alberta |
Keywords: Robust control, Predictive control for nonlinear systems, Network analysis and control
Abstract: In this work, we consider a min-max economic model predictive control (EMPC) for nonlinear networked control systems (NCSs) subject to external disturbances and transmission delays in both sensor-to-controller and controller-to-actuator channels. The min-max EMPC scheme incorporates the disturbances within the design of the model predictive controller by optimizing the input for the worst case along the predictions, and thus can achieve better performance than the normal EMPC scheme. The semi-feedback min-max optimization algorithm is used to generate the control sequence to compensate for delayed control input. Simulation results of a numerical example and a CSTR process example are provided to demonstrate the applicability and effectiveness of our approach.
|
|
15:10-15:30, Paper WeB14.6 | Add to My Program |
Min-Max Differential Inequalities for Polytopic Tube MPC |
Feng, Xuhui | ShanghaiTech University |
Hu, Haimin | University of Pennsylvania |
Villanueva, Mario E. | ShanghaiTech University |
Houska, Boris | ShanghaiTech University |
Keywords: Robust control, Predictive control for nonlinear systems, Optimal control
Abstract: This paper is concerned with robust, tube-based MPC for control systems with bounded time-varying disturbances. In tube MPC, predicted trajectories are replaced by a robust forward invariant tube (RFIT), a set-valued function enclosing all possible state trajectories under a given feedback control law, regardless of the uncertainty realization. In this paper, the main idea is to characterize RFITs with polytopic cross-sections via a min-max differential inequality for their support functions. This result leads to a conservative but tractable polytopic tube MPC formulation, which can be solved using existing optimal control solvers. The corresponding theoretical developments are illustrated by a numerical case study.
|
|
WeB15 Regular Session, Room 406 |
Add to My Program |
Agent-Based Systems |
|
|
Chair: Hayakawa, Tomohisa | Tokyo Institute of Technology |
Co-Chair: Hashimoto, Kazumune | Osaka University |
|
13:30-13:50, Paper WeB15.1 | Add to My Program |
Realtime L1-Fault-And-State Estimation for Multi-Agent Systems |
Hashimoto, Kazumune | Osaka University |
Chong, Michelle S. | KTH Royal Institute of Technology |
Dimarogonas, Dimos V. | KTH Royal Institute of Technology |
Keywords: Agents-based systems, Fault detection, Estimation
Abstract: In this paper, we investigate state and fault estimation schemes for multi-agent systems. The proposed estimator is based on an ell_1-norm optimization problem, which is inspired by sparse signal recovery in the field of compressive sampling. Moreover, we provide a necessary and sufficient condition such that state and fault signals are correctly estimated. The result presents a fundamental limitation of the algorithm, which shows how many faulty nodes are allowed to ensure a correct estimation. An illustrative example of a vehicle platoon is given to validate the effectiveness of the proposed approach.
|
|
13:50-14:10, Paper WeB15.2 | Add to My Program |
Secure Control under Partial Observability with Temporal Logic Constraints |
Ramasubramanian, Bhaskar | University of Washington, Seattle |
Clark, Andrew | Worcester Polytechnic Institute |
Bushnell, Linda | University of Washington |
Poovendran, Radha | University of Washington |
Keywords: Agents-based systems, Formal verification/synthesis, Markov processes
Abstract: This paper studies the synthesis of control policies for an agent that has to satisfy a temporal logic specification in a partially observable environment, in the presence of an adversary. The interaction of the agent (defender) with the adversary is modeled as a partially observable stochastic game. The search for policies is limited to over the space of finite state controllers, which leads to a tractable approach to determine policies. The goal is to generate a defender policy to maximize satisfaction of a given temporal logic specification under any adversary policy. We relate the satisfaction of the specification in terms of reaching (a subset of) recurrent states of a Markov chain. We then present a procedure to determine a set of defender and adversary finite state controllers of given sizes that will satisfy the temporal logic specification. We illustrate our approach with an example.
|
|
14:10-14:30, Paper WeB15.3 | Add to My Program |
Distributed Solutions of Convex-Concave Games on Networks |
Xiao, Yingying | Purdue University |
Hou, Xiaodong | Purdue University |
Hu, Jianghai | Purdue University |
Keywords: Agents-based systems, Game theory, Randomized algorithms
Abstract: In this paper, we study the convex-concave games played by two teams on a network. Each node of the network has local variables from both teams and a local payoff function that is convex in the variables of one team and concave in the variables of the other. The local payoff function may depend on the variables from its neighbors as well. The goal is to find a saddle point of the sum of all local payoff functions. Using the saddle differential operator, we convert the problem to a fixed point problem and propose a synchronous distributed algorithm that can efficiently find the saddle points through a proper splitting of the payoff functions. Its randomized, asynchronous implementation is also discussed. Numerical examples are provided to illustrate the proposed algorithms.
|
|
14:30-14:50, Paper WeB15.4 | Add to My Program |
N-Dimensional Distributed Network Localization with Noisy Range Measurements and Arbitrary Anchor Placement |
Ventura Tecchio, Pedro Paulo | University of Pennsylvania |
Atanasov, Nikolay | University of California |
Shahrampour, Shahin | Texas A&M University |
Pappas, George J. | University of Pennsylvania |
Keywords: Sensor networks, Agents-based systems, Estimation
Abstract: This work presents a distributed algorithm for node localization problems in static sensor networks in n-dimensions. We focus on networks in which n+1 nodes with known locations (anchors) are arbitrarily placed among all other nodes with unknown locations. In the noiseless case, barycentric coordinates computed from range measurements are used to transform the non-convex node localization problem into a standard linear system of equations. Meanwhile, adding independent zero mean Gaussian noise to range measurements turns all barycentric coordinates to dependent random variables with no known standard distribution which may not even be identically distributed. Relying on online optimization methods, we provide a distributed online gradient descent algorithm to solve the noisy range-only localization problem. Finally, comparisons among simple barycentric coordinate averaging, a centralized gradient descent formulation and our distributed algorithm are provided.
|
|
14:50-15:10, Paper WeB15.5 | Add to My Program |
Nash Equilibrium Seeking with Linear Time-Invariant Dynamic Agents |
Ibrahim, Adrianto Ravi | Tokyo Institute of Technology |
Hayakawa, Tomohisa | Tokyo Institute of Technology |
Keywords: Agents-based systems, Linear systems
Abstract: Game with linear time-invariant dynamic agents is explored for the case where the payoff function of each agent is concave and continuously differentiable. By using passivation, a control law that asymptotically stabilize the Nash equilibrium is proposed. We use passivation to derive our control laws. We illustrate our approach with a numerical example. We also characterized the class of linear time-invariant system that can be made passive with respect to its output by dynamic feedback.
|
|
15:10-15:30, Paper WeB15.6 | Add to My Program |
Forwardstepping: A New Approach for Control of Dynamical Systems |
Wang, Hanlei | Beijing Institute of Control Engineering |
Ren, Wei | University of California, Riverside |
Cheah, C.C. | Nanyang Tech. Univ |
Keywords: Agents-based systems, Mechanical systems/robotics, Adaptive control
Abstract: In this paper, we mainly focus on developing a new paradigm motivated by investigating the consensus problem of networked Lagrangian systems with unknown time-varying delay and switching topologies. We propose a class of dynamic feedback by adding differentiators to accommodate the discontinuity and uncertainty resulting from time-varying delay and switching topologies, yielding arbitrary times differentiable reference velocities. Using these reference velocities, we develop delay/topology-independent adaptive controllers with arbitrary times differentiable control torques for networked Lagrangian systems. This specific practice motivates the formulation of a new paradigm, referred to as forwardstepping, for handling discontinuity, time-varying uncertainty, and unavailable state measurement in control systems.
|
|
WeB16 Regular Session, Room 407 |
Add to My Program |
Markov Processes I |
|
|
Chair: Hu, Jianghai | Purdue University |
Co-Chair: Li, Na | Harvard University |
|
13:30-13:50, Paper WeB16.1 | Add to My Program |
Cost-Bounded Active Classification Using Partially Observable Markov Decision Processes |
Wu, Bo | University of Texas at Austin |
Ahmadi, Mohamadreza | California Institute of Technology |
Bharadwaj, Sudarshanan | University of Texas, Austin |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Markov processes, Formal verification/synthesis, Autonomous systems
Abstract: Active classification, i.e., the sequential decision-making process aimed at data acquisition for classification purposes, arises naturally in many applications, including medical diagnosis, intrusion detection, and object tracking. In this work, we study the problem of actively classifying dynamical systems with a finite set of Markov decision process (MDP) models. We are interested in finding strategies that actively interact with the dynamical system, and observe its reactions so that the true model is determined efficiently with high confidence. To this end, we present a decision-theoretic framework based on partially observable Markov decision processes (POMDPs). The proposed framework relies on assigning a classification belief (a probability distribution) to each candidate MDP model. Given an initial belief, some misclassification probabilities, a cost bound, and a finite time horizon, we design POMDP strategies leading to classification decisions. We present two different approaches to find such strategies. The first approach computes the optimal strategy ``exactly'' using value iteration. To overcome the computational complexity of finding exact solutions, the second approach is based on adaptive sampling to approximate the optimal probability of reaching a classification decision. We illustrate the proposed methodology using two examples from medical diagnosis and intruder detection.
|
|
13:50-14:10, Paper WeB16.2 | Add to My Program |
Least Inferable Policies for Markov Decision Processes |
Karabag, Mustafa O. | The University of Texas at Austin |
Ornik, Melkior | University of Illinois at Urbana-Champaign |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Markov processes, Optimization, Estimation
Abstract: In a variety of applications, an agent's success depends on the knowledge that an adversarial observer has or can gather about the agent's decisions. It is therefore desirable for the agent to achieve a task while reducing the ability of an observer to infer the agent's policy. We consider the task of the agent as a reachability problem in a Markov decision process and study the synthesis of policies that minimize the observer's ability to infer the transition probabilities of the agent between the states of the Markov decision process. We introduce a metric that is based on the Fisher information as a proxy for the information leaked to the observer and using this metric formulate a problem that minimizes expected total information subject to the reachability constraint. We proceed to solve the problem using convex optimization methods. To verify the proposed method, we analyze the relationship between the expected total information and the estimation error of the observer, and show that, for a particular class of Markov decision processes, these two values are inversely proportional.
|
|
14:10-14:30, Paper WeB16.3 | Add to My Program |
Online Learning for Markov Decision Processes in Nonstationary Environments: A Dynamic Regret Analysis |
Li, Yingying | Harvard University |
Li, Na | Harvard University |
Keywords: Markov processes, Learning, Optimization algorithms
Abstract: In an online Markov decision process (MDP) with time-varying reward functions, a decision maker has to take an action before knowing the current reward function at each time step. This problem has received many research interests because of its wide range of applications. The literature usually focuses on static regret analysis by comparing the total reward of the optimal offline stationary policy and that of the online policies. This paper studies a different measure, dynamic regret, which is the reward difference between the optimal offline (possibly nonstationary) policies and the online policies. The measure suits better the time-varying environment. To obtain a meaningful regret analysis, we introduce a notion of total variation for the time-varying reward functions and bound the dynamic regret using the total variation. We propose an online algorithm, Follow the Weighted Leader (FWL), and prove that its dynamic regret can be upper bounded by the total variation. We also prove a lower bound of dynamic regrets for any online algorithm. The lower bound matches the upper bound of FWL, demonstrating the optimality of the algorithm. Finally, we show via simulation that our algorithm FWL significantly outperforms the existing algorithms in literature.
|
|
14:30-14:50, Paper WeB16.4 | Add to My Program |
Tolling for Constraint Satisfaction in Markov Decision Process Congestion Games |
Li, Sarah H.Q. | University of Washington |
Yu, Yue | University of Washington |
Calderone, Dan | University of Washington |
Ratliff, Lillian J. | University of Washington |
Acikmese, Behcet | University of Washington |
Keywords: Markov processes, Game theory, Traffic control
Abstract: Markov decision process (MDP) congestion game is an extension of classic congestion games, where a continuous population of selfish agents each solves a Markov decision processes with congestion: the payoff of a strategy decreases as more population uses it. We draw parallels between key concepts from capacitated congestion games and MDPs. In particular, we show that population mass constraints in MDP congestion games are equivalent to imposing tolls/incentives on the reward function, which can be utilized by social planners to achieve auxiliary objectives. We demonstrate such methods in a simulated Seattle ride-share model, where tolls and incentives are enforced for two separate objectives: to guarantee minimum driver density in downtown Seattle, and to shift the game equilibrium towards a maximum social output.
|
|
14:50-15:10, Paper WeB16.5 | Add to My Program |
Maximal Invariant Set Computation and Design for Markov Chains |
Janak, Dylan | University of Washington |
Acikmese, Behcet | University of Washington |
Keywords: Markov processes, Linear systems, LMIs
Abstract: We describe an algorithm for computing the maximal invariant set for a Markov chain with linear safety constraints on the distribution over states. We then propose a Markov chain synthesis method that guarantees finite determination of the maximal invariant set. Although this problem is bilinear in the general case, we are able to optimize the convergence rate to a desirable steady-state distribution over reversible Markov chains by solving a Semidefinite Program (SDP), which promotes efficient computation of the maximal invariant set. We then demonstrate this approach with a decentralized swarm guidance application subject to density upper bounds.
|
|
15:10-15:30, Paper WeB16.6 | Add to My Program |
Dynamic Programming for POMDP with Jointly Discrete and Continuous State-Spaces |
Lee, Donghwan | University of Illinois, Urbana-Champaign |
He, Niao | Georgia Tech |
Hu, Jianghai | Purdue University |
Keywords: Markov processes, Optimal control, Stochastic optimal control
Abstract: In this work, we study dynamic programming (DP) algorithms for partially observable Markov decision processes with jointly continuous and discrete state-spaces. We consider a class of stochastic systems which have coupled discrete and continuous systems, where only the continuous state is observable. Such a family of systems includes many realworld systems, for example, Markovian jump linear systems and physical systems interacting with humans. A finite history of observations is used as a new information state, and the convergence of the corresponding DP algorithms is proved. In particular, we prove that the DP iterations converge to a certain bounded set around an optimal solution. Although deterministic DP algorithms are studied in this paper, it is expected that this fundamental work lays foundations for advanced studies on reinforcement learning algorithms under the same family of systems.
|
|
WeB17 Regular Session, Room 408 |
Add to My Program |
Distributed Parameter Systems II |
|
|
Chair: Dubljevic, Stevan | University of Alberta |
Co-Chair: Xie, Junyao | University of Alberta |
|
13:30-13:50, Paper WeB17.1 | Add to My Program |
Dixon Resultant for the Exact Frequency Bounds and Stability of Distributed-Delay Systems |
Gao, Qingbin | California State University Long Beach |
Firoozy, Peyman | Tarbiat Modares University |
|
13:50-14:10, Paper WeB17.2 | Add to My Program |
Discrete Kalman Filter Design for Kuramoto-Sivashinsky Equation |
Xie, Junyao | University of Alberta |
Dubljevic, Stevan | University of Alberta |
Keywords: Distributed parameter systems, Process Control, Kalman filtering
Abstract: Kuramoto-Sivashinsky partial differential equation (KSE) has attracted a lot of attention from academia and industry due to its ability to describe various physical phenomena associated with both wave and propagation wave front dynamics. This work addresses infinite-dimensional discrete-time Kalman filter design for KSE by applying a state-of-the-art Crank-Nicolson discretization framework which does not account for spatial approximation or order reduction of the underlying model. A novel infinite-dimensional discrete-time Crank-Nicolson discretization is provided and utilized for KSE discretization in time, which is amenable to the ensuing discrete Kalman filter design. In addition, a two-step infinite-dimensional discrete-time Kalman filter is developed for the state estimation of KSE model augmented with the state and measurement noises. Finally, the effectiveness of the presented discrete-time Kalman filter is investigated and validated by simulations.
|
|
14:10-14:30, Paper WeB17.3 | Add to My Program |
Discrete Output Regulator Design for a Mono-Tubular Reactor with Recycle |
Ozorio Cassol, Guilherme | University of Alberta |
Dubljevic, Stevan | University of Alberta |
Keywords: Distributed parameter systems, Process Control, Linear systems
Abstract: This manuscript addresses design of discrete output regulator for an important class of distributed parameter systems problem given by the mono-tubular reactor with recycle stream. The proposed discrete regulator utilizes an output gain based boundary applied feedback to ensure the closed-loop system stability and output tracking of the polynomial type of reference signals. The discrete nature of design is achieved by application of structure preserving Caley-Tustin discretization to the mono-tubular reactor model with recycle given by the first order transport hyperbolic PDE without use of any spatial approximation and/or order reduction. The output regulator design admits the discrete exo-system representation which leads to the corresponding algebraic Sylvester equation which is easily solvable. Finally, the simulation studies provide an insight in the trajectory tracking performances of design controller.
|
|
14:30-14:50, Paper WeB17.4 | Add to My Program |
Output Feedback Controller Design for LTI Systems with Heat PDE Actuator Dynamics and Periodic Disturbances |
Yilmaz, Cemal Tugrul | Bogazici University |
Basturk, Halil I. | Bogazici University |
Keywords: Adaptive systems, Distributed parameter systems, Linear systems
Abstract: This paper focuses on rejection of unknown periodic disturbances in a known LTI system with diffusion PDE actuator dynamics by using output feedback. Firstly, the disturbance is parametrized and written as a boundary of heat PDE. Then, the problem is reformulated as an adaptive controller design for an uncertain ODE-PDE couple. Thirdly, an adaptive observer is designed to estimate the ODE system states and unknown disturbance. After that, to cancel the disturbance and compensate the input dynamics, an infinite dimensional backstepping procedure is applied. Finally, an observer based adaptive control algorithm is proposed and stability of the closed loop system equilibrium is confirmed. It is proven that the system states and observer error states converge to zero exponentially. The performance of the controller is validated with a numerical simulation.
|
|
14:50-15:10, Paper WeB17.5 | Add to My Program |
Adaptive Harmonic Disturbance Cancellation for LTI Systems with Heat PDE Actuator Dynamics |
Yilmaz, Cemal Tugrul | Bogazici University |
Basturk, Halil I. | Bogazici University |
Keywords: Adaptive systems, Distributed parameter systems, Linear systems
Abstract: The focus of this paper is cancellation of unknown harmonic disturbances in a known LTI system with diffusion PDE actuator dynamics. Firstly, the disturbance is parametrized and written as a boundary of heat PDE. From there on, the problem can be treated as an adaptive controller design for an uncertain ODE-PDE couple. To cancel the disturbance and compensate the input dynamics, an infinite dimensional backstepping procedure is applied. Finally, an adaptive control algorithm is designed and stability of the closed loop system equilibrium is confirmed. The convergence of the system states to zero as time goes to infinity and the perfect estimation of the disturbance are proven. The performance of the controller is validated with a numerical simulation.
|
|
WeB18 Regular Session, Room 409 |
Add to My Program |
Power Systems II |
|
|
Chair: Li, Pan | University of Washington |
Co-Chair: Mallada, Enrique | Johns Hopkins University |
|
13:30-13:50, Paper WeB18.1 | Add to My Program |
Hierarchical Management of Distributed Energy Resources Using Chance-Constrained OPF and Extremum Seeking Control |
Chen, Yue | National Renewable Energy Laboratory |
Lin, Yashen | University of Michigan |
Keywords: Hierarchical control, Power systems, Stochastic systems
Abstract: Distributed energy resources (DERs) are becoming an important part of distribution systems, due to their economical and environmental benefits. Although their inherent intermittency and volatility introduce uncertainties into the system, they have potentials to provide controllability to the system with proper coordination. In this paper, we propose a hierarchical control algorithm for distribution system with DERs, so that they have similar controllability as a generator bus. The upper level scheduler solves a chance-constrained optimal power flow (OPF) problem to plan the operation of the DERs based on forecast, and the lower level distributed DER controllers leverage the extremum seeking approach to deliver the planned power at the feeder head. The proposed algorithm is tested on a modified IEEE 13-node feeder, demonstrating its effectiveness.
|
|
13:50-14:10, Paper WeB18.2 | Add to My Program |
Multi-Layered Grid Admittance Matrix Estimation for Electric Power Systems with Partial Measurements |
Miao, Xia | Massachusetts Institute of Technology |
Wu, Xiaofan | Siemens |
Münz, Ulrich | Siemens AG |
Ilic, Marija | Massachusetts Inst. of Tech |
Keywords: Power systems, Estimation, Smart grid
Abstract: In this paper we propose a multi-layered method for estimating the grid admittance matrix with a limited number of measurement devices. Via the proposed multi-layered process with certain practical assumptions, we are capable of estimating the grid admittance matrix with high accuracy. In addition, the low computational complexity of the proposed method enables its online implementation, especially for large-scale power systems requiring a huge amount of measurement data. Effectiveness and robustness of the algorithm are illustrated on synthetically created electric power systems.
|
|
14:10-14:30, Paper WeB18.3 | Add to My Program |
A Passivity-Based Globally Stabilizing PI Controller for Primary Control of Radial Power Distribution Systems |
Milani, Alireza Afiat | North Carolina State University |
Cisneros, Rafael | Instituto Tecnológico Autónomo De México |
Chakrabortty, Aranya | North Carolina State University |
Husain, Iqbal | The University of Akron |
Keywords: Power systems, Lyapunov methods, PID control
Abstract: Proportional-Integral (PI) control is a commonly used control mechanism for regulation of power flows in distribution-level power systems. Such controls, however, come at the cost of guaranteeing only local stability, meaning that as the system load changes the controller gains need to be tuned as well in order to maintain stability of the primary control loop, thereby necessitating a large schedule of controller switching to cover the load space. This paper resolves this problem by designing an alternate PI controller that can stabilize a radial distribution network for any choice of load. The fundamental property behind this stabilization is passivity. It is shown that by choosing the right set of passive input-output pair for the models of the power converters it is possible to regulate the power flowing between the distribution feeder and the loads by a fixed set of control gains that are independent of the magnitude of the load as long as the power flow solution exists. Stability is proved using Lyapunov's theorem. Results are validated using a networked microgrid model with three power converters. Comparison is drawn between fully decentralized, sparsely distributed, and all-to-all connected communication topologies between the converters for implementing the output feedback.
|
|
14:30-14:50, Paper WeB18.4 | Add to My Program |
A Tractable Ellipsoidal Approximation for Voltage Regulation Problems |
Li, Pan | University of Washington |
Jin, Baihong | University of California, Berkeley |
Xiong, Ruoxuan | Stanford University |
Wang, Dai | Tesla Inc |
Sangiovanni-Vincentelli, Alberto L. | University of California at Berkeley |
Zhang, Baosen | University of Washington |
Keywords: Power systems, Machine learning, Statistical learning
Abstract: We present a machine learning approach to the solution of chance constrained optimizations in the context of voltage regulation problems in power system operation. The novelty of our approach resides in approximating the feasible region of uncertainty with an ellipsoid. We formulate this problem using a learning model similar to Support Vector Machines (SVM) and propose a sampling algorithm that efficiently trains the model. We demonstrate our approach on a voltage regulation problem using standard IEEE distribution test feeders.
|
|
14:50-15:10, Paper WeB18.5 | Add to My Program |
Differential Privacy of Aggregated DC Optimal Power Flow Data |
Zhou, Fengyu | California Institute of Technology |
Anderson, James | California Institute of Technology |
Low, Steven | California Institute of Technology |
Keywords: Power systems, Network analysis and control, Optimization
Abstract: We consider the problem of privately releasing aggregated network statistics obtained from solving a DC optimal power flow (OPF) problem. It is shown that the mechanism that determines the noise distribution parameters are linked to the topology of the power system and the monotonicity of the network. We derive a measure of “almost” monotonicity and show how it can be used in conjunction with a linear program in order to release aggregated OPF data using the differential privacy framework.
|
|
15:10-15:30, Paper WeB18.6 | Add to My Program |
Coordinating Distribution System Resources for Co-Optimized Participation in Energy and Ancillary Service Transmission System Markets |
Ji, Chengda | Johns Hopkins University |
Hajiesmaili, Mohammad | University of Massachusetts Amherst |
Gayme, Dennice | The Johns Hopkins University |
Mallada, Enrique | Johns Hopkins University |
Keywords: Power systems, Optimization, Smart grid
Abstract: This paper investigates the potential of using the aggregate controllable loads and energy storage systems from multiple heterogeneous feeders to jointly optimize a utility's energy procurement cost from the real-time market and revenue from participation in ancillary service markets. Toward this, we formulate an optimization problem that co-optimizes real-time and energy reserve markets based on real-time and ancillary service prices from the transmission markets along with available solar power, storage and demand data from each of the feeders within a distribution network. The optimization, which includes all network system constraints, provides real/reactive power and energy storage set-points for each feeder as well as a schedule for the aggregate system's participation in the two types of markets. We evaluate the performance of our optimization design using several trace-driven simulations based on a real-world circuit of a New Jersey utility. Our results demonstrate that active participation of the utility through controllable loads and storage significantly reduces their net costs, i.e., real-time energy market energy procurement minus ancillary market revenues.
|
|
WeC01 Regular Session, Franklin 1 |
Add to My Program |
Robotics III |
|
|
Chair: Kristiansen, Raymond | UiT - the Arctic University of Norway |
Co-Chair: Song, Xingyong | Texas A&M University, College Station |
|
16:00-16:20, Paper WeC01.1 | Add to My Program |
Feedback Motion Planning and Control of Brachiating Robots Traversing Flexible Cables |
Farzan, Siavash | Georgia Institute of Technology |
Hu, Ai-Ping | Georgia Tech Research Institute |
Davies, Evan | Georgia Institute of Technology |
Rogers, Jonathan | Georgia Tech |
Keywords: Mechanical systems/robotics, Control applications, Robotics
Abstract: This paper presents an optimal feedback control design for a two-link, underactuated brachiating robot traversing a flexible cable. Building on previous work that presented a dynamic model and optimal trajectory generation scheme, a parameterized time-varying linear quadratic regulator (LQR) is developed to track a generated optimal trajectory for the robot on a flexible cable. A simplified dynamic system, in which the brachiating robot is attached to a rigid bar, is linearized about the optimal trajectory and the dynamics of the flexible cable are treated as a disturbance to the system. An LQR approach is then employed to solve for a set of time-varying optimal feedback gains. Through simulation and comparison with a partial feedback linearization controller, it is shown that the LQR controller is able to reliably achieve the desired brachiating motion in the presence of dynamic uncertainty, external perturbations, and off-nominal initial conditions.
|
|
16:20-16:40, Paper WeC01.2 | Add to My Program |
Kinematics of Norma, a Spherical Robot, Rolling Over 3D Terrains |
Moazami, Saeed | Lamar University |
Palanki, Srinivas | University of South Alabama |
Zargarzadeh, Hassan | Lamar University |
Keywords: Mechanical systems/robotics, Modeling, Robotics
Abstract: Kinematics and dynamics of spherical robots (SRs) on horizontal and inclined flat surfaces are well-investigated, while their behavior on generic 3D terrains has remained unexplored. This paper studies the kinematics of a class of SRs rolling over 3D terrains. First, a brief description of the selected configuration for the SR is presented along with the characterization of the modeling method. Next, the kinematics equations of the SR are derived based on the mathematical description of the terrain and the mechanical constraints of the robot. Then, a path tracking method is utilized for tracking a 3D desired trajectory. Finally, simulations are carried out to validate the developed model and the effectiveness of the proposed control scheme.
|
|
16:40-17:00, Paper WeC01.3 | Add to My Program |
A Linear Perspective on Nonlinear Oscillations in Biological Control System for Locomotion |
Liu, Yiqin | UCLA |
Iwasaki, Tetsuya | UCLA |
Keywords: Neural networks, Robotics, Biological systems
Abstract: The adaptivity and robustness properties of neuronal central pattern generator (CPG) are of great value in autonomous gait generation, stabilization, and transitions for robotic locomotion systems. Yet the feedback control mechanisms and dynamics of CPGs have not been understood well. Here, we develop a simple integrated model for leech swimming as an exemplar for analytical study of biological control principles. The model is validated by simulations to reproduce adaptive oscillatory behaviors observed in leeches under nominal (water) and perturbed (air) conditions. An algorithm using the multivariable harmonic balance (MHB) method to estimate the oscillation profile will be proposed. Based on the MHB analysis, we study the adaptive and robust behaviors achieved by the nonlinear CPG oscillator from a linear system perspective.
|
|
17:00-17:20, Paper WeC01.4 | Add to My Program |
PD+ Based Trajectory Tracking of the Underactuated Quadrotor Platform Using Dual Quaternions |
Johansen, Tor-Aleksander | UiT the Arctic University of Norway |
Andersen, Tom Stian | UiT the Arctic University of Norway |
Kristiansen, Raymond | UiT - the Arctic University of Norway |
Keywords: Aerospace, Algebraic/geometric methods, Robotics
Abstract: We address the problem of state feedback trajec- tory tracking of the underactuated quadrotor platform in the dual quaternion framework through a PD+ tracking controller. The control law negates the need of generating a desired attitude trajectory as the translational error is mapped directly onto the rotational actuators through a virtual frame. More precisely, we show uniform practical asymptotic stability of the equilibrium points for the closed-loop system without the presence of disturbances. Simulation results demonstrate the performance of the control law and highlight future work.
|
|
17:20-17:40, Paper WeC01.5 | Add to My Program |
Control of a Downhole Drilling System Using Integral Barrier Lyapunov Functionals |
Tian, Dongzuo | Texas A&M University |
Song, Xingyong | Texas A&M University, College Station |
Keywords: Control applications, Mechanical systems/robotics, Lyapunov methods
Abstract: Emergence of shale oil & gas and the unconventional wellbore condition motivate an increasing number of studies on analysis and control of the downhole drilling system. Due to complex downhole environments and underactuated, nonlinear, and nonsmooth features of the drilling dynamics, control synthesis of the drilling system is a challenging task. In this study, we propose a novel nonlinear control design for set-point tracking of torsional velocity and axial rate of penetration, for a vertical drilling system with coupled axial and torsional dynamics and a velocity-independent bit-rock interaction model. To eliminate damaging oscillations such as stick-slip, the Barrier Lyapunov Function (BLF) approach is introduced to ensure smooth motion of the drill bit, and to avoid having drilling operate in undesired working conditions. Meanwhile, the stability, boundedness and convergence properties with respect to different system states are proved. To this end, simulation results of two case studies are given to evaluate efficacy and robustness of the proposed control approach.
|
|
17:40-18:00, Paper WeC01.6 | Add to My Program |
Model Predictive Force Control for Robots in Compliant Environments with Guaranteed Maximum Force |
Müller, Daniel | University of Stuttgart |
Mayer, Annika | University of Stuttgart |
Sawodny, Oliver | University of Stuttgart |
Keywords: Mechanical systems/robotics
Abstract: In this paper, we propose a model predictive force controller, which ensures that the force the object in an unknown environment exerts on the robot is limited by a user-defined value. The environment is assumed compliant and during movement, the internal model of the environment is constantly updated. This update is performed using position and force information. The information of past measurements is stored in a memory function in the form of additional constraints for the MPC. The proposed controller is tested in simulation where it has to overcome both convex and non-convex obstacles in an unknown environment.
|
|
WeC02 Invited Session, Franklin 2 |
Add to My Program |
Driving Behavior and Route Planning for Autonomous Vehicles |
|
|
Chair: Borhan, Ali | Cummins Inc |
Co-Chair: Langari, Reza | Texas A&M University |
Organizer: Siegel, Jason B. | University of Michigan |
Organizer: Pan, Selina | Toyota Research Institute |
Organizer: Borhan, Hoseinali | Cummins Inc |
Organizer: Orosz, Gabor | University of Michigan |
Organizer: Chen, Yan | Arizona State University |
|
16:00-16:20, Paper WeC02.1 | Add to My Program |
A Regularized Quadratic Programming Approach to Real-Time Scheduling of Autonomous Mobile Robots in a Prioritized Task Space (I) |
Bakshi, Soovadeep | The University of Texas at Austin |
Feng, Tianheng | University of Texas at Austin |
Yan, Zeyu | University of Texas at Austin |
Chen, Dongmei | The University of Texas at Austin |
Keywords: Optimization algorithms, Building and facility automation, Autonomous robots
Abstract: The use of Autonomous Mobile Robots (AMRs) for fast and efficient manufacturing has attracted the interest of academia and industry in recent times, especially due to significant improvements in computational efficiency. However, one of the biggest challenges in terms of controls is the optimal task assignment and scheduling of AMRs in order to finish the assigned tasks as quickly as possible, taking into account the priority of the tasks. This paper focuses on the single-AMR scheduling problem, i.e., once each AMR is assigned a set of tasks, the objective is to order these tasks efficiently while considering task priorities. The need for real-time algorithms to solve this problem renders exhaustive search algorithms inappropriate, since their focus is on the accuracy of the solution without considering time constraints. This paper proposes a gradient-based real-time approach for the scheduling problem based on a mathematical formulation in the structure of a regularized quadratic program. This scheduling algorithm is shown to perform better than a simulated annealing based pairwise exchange technique, which is a commonly used heuristic method, in terms of a defined cost metric. Therefore, the proposed algorithm allows for the generation of efficient real-time solutions to the scheduling problem for a single AMR.
|
|
16:20-16:40, Paper WeC02.2 | Add to My Program |
Receding Horizon Markov Game Autonomous Driving Strategy (I) |
Coskun, Serdar | Texas A&M University |
Zhang, Qingyu | Texas A&M University |
Langari, Reza | Texas A&M University |
Keywords: Markov processes, Game theory, Autonomous systems
Abstract: This paper presents a novel human-like autonomous driving algorithms for lane-changing problem. To this end, we present a multi-agent decision-making scheme by blending game theory with the Markov decision process, forming a Markov game (mathcal{MG}). In this decision-making process, interaction of a subject vehicle (SV) and traffic vehicles (TVs) are captured in a mathematically tractable manner via both a cooperative game (max-max) where vehicles perform their decisions for collective objectives and a non-cooperative game (max-min) where vehicles perform their decisions for individual objectives. Strategies of the players are computed via a Receding Horizon (RH) approach where optimal solutions are found through an optimization strategy by taking into account current and future constraints. The proposed approach is evaluated in a human-in-the-loop (HIL) environment built around a MATLAB/Simulink/dSPACE real-time simulator where the Markov game-guided SV controller interacts with programmed TVs and one human-driven vehicle (HV). Experimental results show that the Markov game driving strategy is capable of finding a safe gap in multi-move traffic that is consistent with human drivers' behaviours in mandatory lane-changing.
|
|
16:40-17:00, Paper WeC02.3 | Add to My Program |
A Game Theoretic Four-Stage Model Predictive Controller for Highway Driving (I) |
Zhang, Qingyu | Texas A&M University |
Filev, Dimitre P. | Ford Motor Company |
Tseng, Eric | Ford Motor Company |
Szwabowski, Steven | Ford Motor Company |
Langari, Reza | Texas A&M University |
Keywords: Game theory, Predictive control for linear systems, Autonomous robots
Abstract: We develop a game theoretic model predictive controller (GTMPC) for autonomous driving in highway traffic. The hierarchical GTMPC uses game theory as the basis for its high-level controller by continuously playing games with the surrounding vehicles, which we call game candidate vehicles (GCV), to evaluate options. We pose the lane change situation in highway driving as Stackelberg game, where subject vehicle's (SV) strategies are the proper times to initiate/complete a lane change and the corresponding trajectories, and GCV's strategies are defined as accelerations and lane decisions. To capture SV's actual on-road benefit, we define SV's payoff as the negative of the cost function of the model predictive controller (MPC). GCV's payoff considers three factors including her position, headway and speed. A four-stage hybrid MPC is established as the low-level controller that controls both SV's longitudinal position and lane decision. To validate the effect of the controller, we implemented it into a virtual highway environment built in MATLAB SIMULINK. We first tested the controller's performance in a normal driving scenario against programmed traffic vehicles. Then we conducted a human-in-the-loop simulation in a mandatory lane change (MLC) scenario. The simulations showed that GTMPC is able to well predict surrounding vehicle's behavior during the interaction and make reasonable decisions in different situations even at the presence of human driver.
|
|
17:00-17:20, Paper WeC02.4 | Add to My Program |
Motion Planning of Autonomous Road Vehicles by Particle Filtering: Implementation and Validation (I) |
Berntorp, Karl | Mitsubishi Electric Research Labs |
Inani, Pranav | University of Maryland - College Park, Mitsubishi Electric Resea |
Quirynen, Rien | Mitsubishi Electric Research Laboratories (MERL) |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Keywords: Automotive control, Automotive systems, Autonomous systems
Abstract: Autonomous driving in urban and highway scenarios involves a set of predefined requirements that the vehicle should obey, such as lane following, safety distances to surrounding vehicles, and speed preferences. We have previously shown that by interpreting the motion-planning problem as a nonlinear non-Gaussian estimation problem, we can leverage particle filtering to determine suitable vehicle trajectories. In this paper, we validate our proposed motion planner using scaled vehicles. We show that our motion planner is capable of determining safe and drivable trajectories for a number of challenging scenarios, and that the trajectories can be accurately tracked by a lower-level nonlinear model predictive control scheme.
|
|
17:20-17:40, Paper WeC02.5 | Add to My Program |
Social Force Aggregation Control for Autonomous Driving with Connected Preview (I) |
Yoon, Do | Clemson University International Center for Automotive Research |
Ayalew, Beshah | Clemson University |
Keywords: Hierarchical control, Predictive control for nonlinear systems, Automotive systems
Abstract: Vehicular social force modeling (SFM) aims at capturing social driving behavior of human drivers in traffic by drawing analogies to models of psychological forces that govern the navigation behavior of humans walking in crowds. In addition, the extended preview afforded by vehicular connectivity can be exploited to bring additional information about downstream traffic to be incorporated in the planning and guidance computations for an autonomous vehicle. This paper outlines a hierarchical vehicular social force control scheme that integrates both ideas. At the upper level, social force aggregation is applied to predictively select the most efficient lane over a long horizon covered by connectivity. This is then passed down to a lower level controller that enforces lane tracking while considering higher fidelity social force resolution and lane-changing dynamics within the shorter horizon captured by the ego vehicle’s sensor field of view. The workings and performance of the proposed framework are illustrated via simulations of the connected autonomous vehicle in multi-lane highway scenarios.
|
|
17:40-18:00, Paper WeC02.6 | Add to My Program |
A Development Platform for Real Time Routing of an Autonomous Ground Vehicle to Complete Prioritized Tasks (I) |
Chen, Dongmei | The University of Texas at Austin |
Woo, Sijin | The University of Texas at Austin |
Keller, Mathew A | University of Texas at Austin |
Choudhry, Wahab | University of Texas at Austin |
Trakhtengerts, Ran | University of Texas at Austin |
Bakshi, Soovadeep | The University of Texas at Austin |
Yan, Zeyu | University of Texas at Austin |
Keywords: Autonomous systems, Mechanical systems/robotics, Optimization
Abstract: Autonomous ground vehicles (AGVs) have been deployed for industrial automation. Despite the advancement that has been achieved in the field of AGV technology, there are still many challenges associated with this domain. For instance, it is highly challenging to optimally schedule and plan the routing of an AGV in real time, where the AGV is stochastically assigned tasks with various priorities. The AGV routing based on task priority might be different from that based on the shortest path. There will be a tradeoff between completing tasks in their priority order and completing the tasks within the shortest time. Additionally, real time planning of the routing is desirable so that the AGV can update its path to accommodate the assigned tasks and achieve optimal efficiency. In order to address these challenges, this paper introduces an AGV development platform that can optimally generate an optimal path to route the AGV in real time considering both to achieve the shortest route and to accommodate the task priority. The platform also provides a tool for the actual design of the AGV.
|
|
WeC03 Regular Session, Franklin 3 |
Add to My Program |
Distributed Control III |
|
|
Chair: Lavaei, Javad | UC Berkeley |
Co-Chair: Nowzari, Cameron | George Mason University |
|
16:00-16:20, Paper WeC03.1 | Add to My Program |
Distributed Average Tracking Over Weight-Unbalanced Directed Graphs |
Sun, Shan | University of California, Riverside |
Chen, Fei | Northeastern University |
Ren, Wei | University of California, Riverside |
Keywords: Distributed control, Networked control systems
Abstract: The distributed average tracking (DAT) problem in an unbalanced directed network is studied in this paper, in which each agent aims at tracking the average of a group of time-varying reference signals using only local information and local communication. While the existing literature primarily focuses on the case of undirected or weight-balanced directed networks, we deal with the much more challenging case of unbalanced directed networks. We propose a distributed continuous algorithm with a chain of two integrators coupled with a distributed estimator. We show that if the deviations among the reference accelerations tend to zero (respectively, are bounded), the algorithm can achieve DAT with zero (respectively, bounded) tracking error under an unbalanced directed network. The algorithm is robust to initialization errors in terms of agent states and achieve DAT for a wide class of reference signals. Numerical examples are presented to illustrate the derived theoretical results.
|
|
16:20-16:40, Paper WeC03.2 | Add to My Program |
Distributed Nonlinear Model Predictive Control through Accelerated Parallel ADMM |
Tang, Wentao | University of Minnesota |
Daoutidis, Prodromos | Univ. of Minnesota |
Keywords: Distributed control, Optimal control, Optimization algorithms
Abstract: Alternating direction method of multipliers (ADMM), as a powerful distributed optimization algorithm, provides a framework of distributed model predictive control (MPC) for nonlinear process systems based on local subsystem model information. However, the practical application of classical ADMM is largely limited by the high computational cost caused by its slow (linear) rate of convergence and nonparallelizability. In this work, we combine a recently developed multi-block parallel ADMM algorithm with a Nesterov acceleration technique into a fast ADMM scheme, and apply it to the solution of optimal control problems associated with distributed nonlinear MPC. A benchmark chemical process is considered for a case study, which demonstrates a significant reduction of computational time and communication effort compared to non-parallel and non-accelerated ADMM counterparts.
|
|
16:40-17:00, Paper WeC03.3 | Add to My Program |
Feedback-Feedforward Control Approach to Distributed Optimization |
Qiu, Zhirong | Nanyang Technological University |
Xie, Lihua | Nanyang Tech. Univ |
You, Keyou | Tsinghua University |
Keywords: Distributed control, Optimization algorithms
Abstract: In this work we study a basic distributed convex optimization problem where a network of nodes aims to reach consensus at the minimum of the sum of private convex costs. By treating the Laplacian operator under a weight balanced and strongly connected network as a pseudo projector, we consider the problem from a feedback-feedforward control viewpoint, and design distributed algorithms by using proportional-integral-feedforward control techniques. With the aid of quadratic Lyapunov functions, we show the convergence of the proposed algorithms to a common optimum for L-smooth costs; if the cost is also strongly convex, then the convergence is exponentially fast. We further analyze and compare the convergence rate of proportional-integral (PI) and proportional feedforward (PF) controllers for a class of quadratic costs, and show that the PF controller achieves better convergence with a proper choice of control gains.
|
|
17:00-17:20, Paper WeC03.4 | Add to My Program |
Distributed Model Predictive Control with Obstacle Communication |
Kloock, Christine | Hamburg University of Technology |
Werner, Herbert | Hamburg University of Technology |
Keywords: Distributed control, Predictive control for linear systems, Simulation
Abstract: This paper presents a distributed model predictive control approach for multiagent systems, where the agents are vehicles required to move from given initial positions to individual target points in the presence of obstacles. A global cost function is approximated by each agent minimizing a local cost function based on locally available information. Within a given communication distance agents exchange their position and target information together with information about detected obstacles, which are represented by ellipses. Simulation studies illustrate the proposed method.
|
|
17:20-17:40, Paper WeC03.5 | Add to My Program |
Distributed Dynamic Event-Triggered Coordination with a Designable Minimum Inter-Event Time |
Berneburg, James | George Mason University |
Nowzari, Cameron | George Mason University |
Keywords: Distributed control, Stability of hybrid systems, Networked control systems
Abstract: This paper revisits the classical multi-agent average consensus problem for which many different event-triggered control strategies have been proposed over the last decade. Many of the early versions of these works conclude asymptotic stability without proving that Zeno behavior, or deadlocks, do not occur along the trajectories of the system. More recent works that have studied this issue fall short in that they either: (i) propose the use of a dwell-time that forces inter-event times to be lower-bounded away from 0 but sacrifices asymptotic convergence in exchange for practical convergence (or convergence to a neighborhood; (ii) guarantee non-Zeno behaviors and asymptotic convergence but without a positive minimum inter-event time guarantee; or (iii) are not fully distributed. Instead, this work for the first time presents a fully distributed event-triggering algorithm for which a desired minimum inter-event time can be chosen by each agent while still guaranteeing asymptotic convergence to the average consensus state. Simulations illustrate our results.
|
|
17:40-18:00, Paper WeC03.6 | Add to My Program |
On the Exponential Number of Connected Components for the Feasible Set of Optimal Decentralized Control Problems |
Feng, Han | University of California, Berkeley |
Lavaei, Javad | UC Berkeley |
Keywords: Decentralized control, Distributed control, Large-scale systems
Abstract: The optimal decentralized control (ODC) problem is known to be NP-hard and many sufficient tractability conditions have been derived in the literature for its convex reformulations or approximations. To better understand the root cause of the non-existence of efficient methods for solving ODC, we propose a measure of problem complexity in terms of connectivity, and show that there is no polynomial upper bound on the number of connected components for the set of static stabilizing decentralized controllers. Specifically, we present a subclass of problems for which the number of connected components is exponential in the order of the system and, inparticular, any point in each of these components is the unique solution of the ODC problem for some quadratic objective functional. The results of this paper have two implications. First, the recent effort in machine learning advocating the use of local search algorithms for non-convex problems, which has also been successful for the optimal centralized control problem, fails to work for ODC since it needs an exponential number of initializations. Second, no reformulation of the problem through a smooth change of variables can reduce the complexity since it maintains the number of connected components. On the positive side, we show that structural assumptions can reduce the connectivity complexity of ODC, one such structure is the system being highly damped.
|
|
WeC04 Regular Session, Franklin 4 |
Add to My Program |
Networked Control Systems III |
|
|
Chair: Motee, Nader | Lehigh University |
Co-Chair: Danielson, Claus | Mitsubishi Electric Research Labs |
|
16:00-16:20, Paper WeC04.1 | Add to My Program |
Measurable Observations for Network Observability |
Mousavi, Hossein K. | Lehigh University |
Sun, Qiyu | University of Central Florida |
Motee, Nader | Lehigh University |
Keywords: Networked control systems, Sensor networks, Estimation
Abstract: We consider the initial state observability of linear time-invariant dynamical networks based on arbitrary noisy observations (in time) from spatial locations. We assume that the observation times are Lebesgue measurable and show that the estimation problem is feasible if a properly defined continuous frame exists. Moreover, the quality of the estimation depends on the spectra of a matrix, which can be explicitly calculated using the space-time observation strategy. It turns out that total observation time dictates a fundamental limit on the best achievable estimation quality. Next, we illustrate how to synthesize observation strategies for a stable estimation. Finally, we use a randomized method that efficiently sparsifies the observation strategies, while providing a performance guarantee.
|
|
16:20-16:40, Paper WeC04.2 | Add to My Program |
Stabilization of Nonlinear Networked Control Systems under Denial-Of-Service Attacks: A Linearization Approach |
Kato, Rui | Tokyo Institute of Technology |
Cetinkaya, Ahmet | Tokyo Institute of Technology |
Ishii, Hideaki | Tokyo Institute of Technology |
Keywords: Networked control systems, Stability of nonlinear systems, Switched systems
Abstract: In this paper, we consider the stability analysis of nonlinear networked control systems under Denial-of-Service (DoS) attacks. In particular, we investigate local stabilization through a linearization approach. To formulate the networked control problem subject to such attacks, a switched system representation is employed with the controlled and uncontrolled modes. We provide a characterization of the frequency and duration of DoS attacks under which local stability is guaranteed. Moreover we derive a sufficient condition for convergence that makes the state remain within the linearization region even in the presence of DoS attacks. Our results are demonstrated with a numerical example.
|
|
16:40-17:00, Paper WeC04.3 | Add to My Program |
Sequence-Based Receding Horizon Control Over Networks with Delays and Data Losses |
Rosenthal, Florian | Karlsruhe Institute of Technology |
Dolgov, Maxim | Robert Bosch GmbH |
Hanebeck, Uwe D. | Karlsruhe Institute of Technology (KIT) |
Keywords: Networked control systems, Stochastic optimal control, Switched systems
Abstract: In this paper, we are concerned with sequence-based receding horizon control over networks. We address the most general case where acknowledgments are provided but are also subject to delays and losses. This is in contrast to the majority of the related work in literature, where they are either delivered instantaneously and without losses or not issued at all. As in the case where acknowledgments are not issued, the separation principle does not hold in the considered setup, rendering the optimal control law generally nonlinear. Based on previous results, we present an iterative algorithm for the computation of the parameters of a linear receding horizon controller that does not assume separation a priori, taking the dual effect into account. The resulting controller is optimal in the sense that it minimizes an upper bound of the underlying quadratic cost function with respect to the control sequences. Its performance is demonstrated in a numerical example.
|
|
17:00-17:20, Paper WeC04.4 | Add to My Program |
Enforcing Spatiotemporal Constraints in Control of Multiagent Systems with Uncertainties |
Arabi, Ehsan | University of Michigan |
Yucelen, Tansel | University of South Florida |
Keywords: Networked control systems, Uncertain systems, Constrained control
Abstract: We study the problem of enforcing spatial and temporal (spatiotemporal) constraints in control of multiagent systems with uncertainties. We present a new distributed control algorithm for achieving both i) a user-defined system performance by limiting the worst-case difference between the agent state trajectories and their corresponding reference state trajectories (spatial constraint) and ii) a user-defined finite-time convergence (temporal constraint). Specifically, the presented algorithm effectively addresses these spatiotemporal constraints without the need for a strict knowledge of agent uncertainties upper bounds and without relying on agent initial conditions. The efficacy of the proposed distributed control algorithm is further illustrated in a numerical example.
|
|
17:20-17:40, Paper WeC04.5 | Add to My Program |
Moving Horizon Sensor Selection for Reducing Communication Costs with Applications to Internet of Vehicles |
Ahn, Heejin | Mitsubishi Electric Research Laboratories |
Danielson, Claus | Mitsubishi Electric Research Labs |
Keywords: Transportation networks, Sensor networks, Estimation
Abstract: Motivated by applications of the Internet of Vehicles where a large amount of data is available through communication, we consider the problem of reducing communication costs when estimating the dynamical state of a system. More specifically, assuming the knowledge of sensor specifications, such as noise characteristics, we solve the problem of deter- mining which sensor’s data are necessary to satisfy given time- varying constraints on the estimation errors. By receiving only the necessary data, instead of all available data, we reduce the communication and processing bandwidth usage. We formulate a moving horizon sensor selection problem and present an approximate, yet computationally tractable, solution to the problem by employing a greedy heuristic approach. For the heuristic, we define a metric that measures the contribution of each sensor data to the constraints in relation to its communication cost. We validate our solution on two collision avoidance examples and compare the performances of our approach with the conventional Kalman filter. The simulation results show that our approach significantly reduces communication costs without compromising the system’s performance, such as safety guarantee, with high probability.
|
|
17:40-18:00, Paper WeC04.6 | Add to My Program |
Geometric Programming-Based Control for Nonlinear, DAE-Constrained Water Distribution Networks |
Wang, Shen | The University of Texas at San Antonio |
Taha, Ahmad | University of Texas at San Antonio |
Gatsis, Nikolaos | The University of Texas at San Antonio |
Giacomoni, Marcio | The University of Texas at San Antonio |
Keywords: Emerging control applications, Networked control systems, Predictive control for linear systems
Abstract: Control of water distribution networks (WDNs) can be represented by an optimization problem with hydraulic models describing the nonlinear relationship between head loss, water flow, and demand. The problem is difficult to solve due to the non-convexity in the equations governing water flow. Previous methods used to obtain WDN controls (i.e., operational schedules for pumps and valves) have adopted simplified hydraulic models. One common assumption found in the literature is the modification of WDN topology to exclude loops and assume a known water flow direction. In this paper, we present a new geometric programming-based model predictive control approach, designed to solve the water flow equations and obtain WDN controls. The paper considers the nonlinear difference algebraic equation (DAE) form of the WDN dynamics, and the GP approach amounts to solving a series of convex optimization problems and requires neither the knowledge of water flow direction nor does it restrict the water network topology. A case study is presented to illustrate the performance of the proposed method.
|
|
WeC05 Regular Session, Franklin 5 |
Add to My Program |
Optimization III |
|
|
Chair: Granichin, Oleg | Saint Petersburg State University |
Co-Chair: Hota, Ashish | Indian Institute of Technology (IIT), Kharagpur |
|
16:00-16:20, Paper WeC05.1 | Add to My Program |
Stochastic Fast Gradient for Tracking |
Kosaty, Dmitry | Saint Petersburg State University |
Vakhitov, Alexander | Saint Petersburg State University |
Granichin, Oleg | Saint Petersburg State University |
Yuchi, Ming | Huazhong University of Science and Technology |
Keywords: Optimization, Randomized algorithms, Adaptive systems
Abstract: In recent applications first order optimization methods are often applied in non-stationary setting, when the minimum point is drifting in time, called parameter tracking, or non-stationary optimization (NSO). In this paper we propose a new method derived from the Nesterov’s Fast Gradient for the NSO problem. We derive theoretical bounds on the expected estimation error. We illustrate our results with simulation showing that the proposed method gives more accurate estimates of the minimum points than the unmodified FG or Stochastic Gradient in case of deterministic drift while in purely random walk all methods behave similarly.
|
|
16:20-16:40, Paper WeC05.2 | Add to My Program |
A Minimal Computation Approach to Optimal Routing of Swarm Agents in Dynamic Environments |
Tasdighi Kalat, Shadi | Worcester Polytechnic Institute |
Farzad, Milad | Worcester Polytechnic Institute (WPI) |
Ghorbani Faal, Siamak | Worcester Polytechnic Institute |
Keywords: Optimization, Robotics, Multivehicle systems
Abstract: In this paper, we introduce a method to reduce the computations required to solve a combinatorial optimization problem for a swarm system. In particular, we focus on finding a solution to assignment problems where the agents are required to visit a number of targets periodically while minimizing a cost functional. Our methodology utilizes a family of pre-fractal curves as a mapping from a bounded two dimensional domain to a bounded real interval. Using this map, we obtain a one dimensional representation of the optimization problems that yields a near-optimal solution in a swarm with 500 agents in less than 0.2 seconds on a regular desktop computer. Moreover, we compute the least upper bound on the optimality of the solution and demonstrate that the optimality improves as the number of agents and targets increase, which makes it favorable for large-scale systems. The effectiveness and efficiency of the method is evaluated through more than 100 simulations with different number of agents and targets.
|
|
16:40-17:00, Paper WeC05.3 | Add to My Program |
Powertrain Design Optimization for a Battery Electric Heavy-Duty Truck |
Verbruggen, Franciscus Johannes Rudolf | University of Technology Eindhoven |
Rangarajan, Varun | Eindhoven University of Technology |
Hofman, Theo | Technische Universiteit Eindhoven |
Keywords: Optimization, Simulation, Automotive control
Abstract: In this paper, the energetic benefits of a multispeed transmission compared to a single speed transmission is analyzed for a long-haul truck. The truck is simulated using a reference long-haul cycle from the Vehicle Energy consumption Calculation Tool (VECTO). A nested optimization routine is used to optimize the battery, electric machine size and the gear ratio value(s) in an outer loop with the particle swarm optimization algorithm and in the inner loop the gear shifting is optimized, as a local minimization problem. It is found that the electric machine size can be reduced (-16%) without compromising the vehicles top speed and acceleration performance, and with a minor reduction in energy usage (-1.4%). The total number of gears did not significantly influence the energy usage on the long-haul drive cycle studied. The results show the potential of reducing the size of an electric machine and increase in gradeability of the vehicle with the usage of a multi-speed for trucks. Much larger gains in energy usage, without compromising performance, are expected on more dynamic driving conditions and using a dedicated (more compact and integrated) electric machine design for a multispeed transmission, which is seen as future work.
|
|
17:00-17:20, Paper WeC05.4 | Add to My Program |
On the Time-Varying Distributions of Online Stochastic Optimization |
Cao, Xuanyu | Princeton University |
Zhang, Junshan | Arizona State University |
Poor, H. Vincent | Princeton Univ |
Keywords: Optimization, Stochastic systems, Time-varying systems
Abstract: This paper studies online stochastic optimization where the random parameters follow time-varying distributions. In each time slot, after a control variable is determined, a sample drawn from the current distribution is revealed as feedback information. This form of stochastic optimization has broad applications in online learning and signal processing, where the underlying ground-truth is inherently time-varying, e.g., tracking a moving target. Dynamic optimal points are adopted as the performance benchmark to define the regret, as opposed to the static optimal point used in stochastic optimization with fixed distributions. Stochastic optimization with time-varying distributions is examined and a projected stochastic gradient descent algorithm is presented. An upper bound on its regret is established with respect to the drift of the dynamic optima, which measures the variations of the optimal solutions due to the varying distributions. In particular, the algorithm possesses sublinear regret as long as the drift of the optima is sublinear, i.e., the distributions do not vary too drastically. Finally, numerical results are presented to corroborate the efficacy of the proposed algorithm and the derived analytical results.
|
|
17:20-17:40, Paper WeC05.5 | Add to My Program |
Data-Driven Chance Constrained Optimization under Wasserstein Ambiguity Sets |
Hota, Ashish | Indian Institute of Technology (IIT), Kharagpur |
Cherukuri, Ashish | University of Groningen |
Lygeros, John | ETH Zurich |
Keywords: Optimization, Stochastic systems, Uncertain systems
Abstract: We present a data-driven approach for distributionally robust chance constrained optimization problems (DRCCPs). We consider the case where the decision maker has access to a finite number of samples or realizations of the uncertainty. The chance constraint is then required to hold for all distributions that are close to the empirical distribution constructed from the samples (where the distance between two distributions is defined via the Wasserstein metric). We first reformulate DRCCPs under data-driven Wasserstein ambiguity sets and a general class of constraint functions. When the feasibility set of the chance constraint program is replaced by its convex inner approximation, we present a convex reformulation of the program and show its tractability when the constraint function is affine in both the decision variable and the uncertainty. For constraint functions concave in the uncertainty, we show that a cutting-surface algorithm converges to an approximate solution of the convex inner approximation of DRCCPs. Finally, for constraint functions convex in the uncertainty, we compare the feasibility set with other sample-based approaches for chance constrained programs.
|
|
17:40-18:00, Paper WeC05.6 | Add to My Program |
Joint Optimization of Plant, Controller, and Sensor/Actuator Design |
Goyal, Raman | Texas A&M University |
Skelton, Robert E. | Texas A&M University |
Keywords: LMIs, Optimization, Linear parameter-varying systems
Abstract: This paper presents a Linear Matrix Inequality (LMI) framework for selecting sensor and actuator precision jointly with the determination of control law and free structure parameters. The sub-optimal solution of this non-convex system design problem is found by iterating over an approximated convex problem through the use of a convexifying potential function which enables convergence to a local minimum. The authors believe this is the first time an integrated approach combining structure design, control law, and information architecture is developed to further advance the theory of system-level design optimization.
|
|
WeC06 Regular Session, Franklin 6 |
Add to My Program |
Biological Systems |
|
|
Chair: Ghusinga, Khem Raj | University of North Carolina at Chapel Hill |
Co-Chair: Gyorgy, Andras | New York University Abu Dhabi |
|
16:00-16:20, Paper WeC06.1 | Add to My Program |
Comparison of Feedback Strategies for Noise Suppression in Protein Level |
Smith, Madeline | University of Delaware |
Ghusinga, Khem Raj | University of North Carolina at Chapel Hill |
Singh, Abhyudai | University of Delaware |
Keywords: Biological systems, Cellular dynamics, Genetic regulatory systems
Abstract: Stochastic variation in the level of protein among cells of the same population is ubiquitous across cell types and organisms. These random variations are a consequence of low-copy numbers, amplified by the characteristically probabilistic nature of biochemical reactions associated with gene-expression. We systematically compare and contrast negative feedback architectures in their ability to regulate random fluctuations in protein levels. Recent studies have revealed the role of unspliced, precursor mRNA versus stable, cytoplasmic mRNA in gene-expression regulation and noise. Our work takes advantage of this distinction and creates a model describing mRNA as two separate species: pre-mRNA inside the nucleus and cytoplasmic mRNA outside the nucleus. Each gene synthesizes pre-mRNAs in transcriptional bursts. Then, each pre-mRNA transcript is exported to the cytoplasm and is subsequently translated into protein molecules. In this setup, three feedback architectures are implemented: protein inhibiting transcription of its own gene (I), protein enhancing the nuclear pre-mRNA degradation rate (II), and protein inhibiting the export of pre-mRNAs (III). Explicit analytic expressions are developed to quantify the protein noise levels for each feedback strategy. Mathematically controlled comparisons provide insights into the noise-suppression properties of these feedback architectures. For example, when the pre-mRNA export rate is greater than its degradation rate, then feedback architecture I provides the best noise attenuation. In contrast, when mRNA is highly unstable, feedback architecture III is superior to both II and I. We finally discuss biological relevance of these findings in context of precursor mRNA and noise suppression in HIV.
|
|
16:20-16:40, Paper WeC06.2 | Add to My Program |
Dynamical Behavior of Biological Healthy Steady State in Leukemia Using a New Leukemic & Healthy Stem Cells Cohabitation Model with Distributed Delay |
Zenati, Abdelhafid | The National Polytechnic School |
Laleg-Kirati, Taous-Meriem | King Abdullah University of Science and Technology (KAUST) |
Chakir, Messaoud | Laboratoire De Commande Des Processus Ecole Nationale Polytechni |
Tadjine, Mohamed | Ecole Nationale Polytechnique, |
Keywords: Cellular dynamics, Delay systems, Stability of nonlinear systems
Abstract: Acute Myeloid Leukemia (AML) treatment protocol from clinical point of view, aims to maintain a normal amount of healthy cells and to eradicate all malignant cells. This particular objective is biologically qualified as a positive healthy situation. In this paper, we give sufficient and necessary conditions for the global stability of such a healthy situation. To this end, we first propose a new distributed delay model of AML. The latter is an improvement of an existing delayed coupled model describing the dynamics of hematopoesis stem cells in AML. We modify the PDEs equations and transform them into a set of distributed delay equations. The proposed model is more suitable for biological phenomena than constant delay models as the proliferation time differs from a cell type to another. Furthermore in the proposed model, we consider the sub-population of cells that have lost their capacity of self-renewal and became progenitors. In second, we derive sufficient and necessary conditions for the global stability of healthy steady state. For this, the positivity of the obtained model and sequences of functions theory are used to construct new Lyapunov function candidates. Finally, we conduct numerical simulations to show that the obtained results complete and generalize those published in the literature.
|
|
16:40-17:00, Paper WeC06.3 | Add to My Program |
Mathematical Models of Physiological Responses to Exercise |
Sojoudi, Somayeh | UC Berkeley |
Recht, Benjamin | University of California, Berkeley |
Doyle, John C. | Caltech |
Keywords: Biological systems, Optimization algorithms, Control applications
Abstract: This paper develops empirical mathematical models for physiological responses to exercise. We first find single-input single-output models describing heart rate variability, ventilation, oxygen consumption and carbon dioxide production in response to workload changes and then identify a single-input multi-output model from workload to these physiological variabilities. We also investigate the possibility of the existence of a universal model for physiological variability in different individuals during treadmill running. Simulations based on real data substantiate that the obtained models accurately capture the physiological responses to workload variations. In particular, it is observed that (i) different physiological responses to exercise can be captured by low-order linear or mildly nonlinear models; and (ii) there may exist a universal model for oxygen consumption that works for different individuals.
|
|
17:00-17:20, Paper WeC06.4 | Add to My Program |
Genetic Circuit-Host Ribosome Transactions: Diffusion-Reaction Model |
Barajas, Carlos | Massachusetts Institute of Technology |
Del Vecchio, Domitilla | Massachusetts Institute of Technology |
Keywords: Cellular dynamics, Biomolecular systems, Reduced order modeling
Abstract: Deterministic models of bacterial genetic circuits commonly assume a well-mixed ensemble of species. This assumption results in ordinary differential equations (ODEs) describing the rate of change of the mean species concentration. It is however well known that species are non-homogenously distributed within a bacterial cell, where genes on the chromosome are found mostly at the center of the cell while synthetic genes residing on plasmids are often found at the poles. Most importantly, ribosomes, the key gene expression resource, are also arranged according to a non-homogenous profile. Therefore, when analyzing the effects of sharing gene expression resources, such as ribosomes, among synthetic genetic circuits and chromosomal genes, it may be important to consider the effects of spatial heterogeneity of the relevant species. In this paper, we use a partial differential equation (PDE) model to capture the spatial heterogeneity of species concentration. Solutions to the model are gathered numerically and approximations are %derived via perturbation analysis in the limit of fast diffusion. The solutions are compared to those of the conventional "well-mixed" ODE model. The fast-diffusion approximation predicts higher protein production rates for all mRNAs in the cell and in some cases, these rates are more sensitive to the activation of synthetic genes relative to %the well-mixed model. This trend is confirmed numerically using common biological parameters to simulate the full PDE system.
|
|
17:20-17:40, Paper WeC06.5 | Add to My Program |
Bistability Requires Better Balanced Toggle Switches in the Presence of Competition for Shared Cellular Resources |
Gyorgy, Andras | New York University Abu Dhabi |
Keywords: Biomolecular systems, Stability of nonlinear systems, Network analysis and control
Abstract: Synthetic biology seeks to create complex systems in living organisms modularly. Unfortunately, modularity is hindered by several factors. One major factor limiting the scalability of rationally engineered large-scale genetic circuits is unwanted coupling among modules due to competition for shared cellular resources. Leveraging a mechanistic model explicitly accounting for the limited availability of these resources, in this paper we reveal how competition for shared resources affects the stability profile of the toggle switch, one of the most widespread genetic modules. As a result, we uncover the connection between parameter asymmetry, resource sequestration and bistability, not only in the case of a single toggle switch, but also when multiple modules all share the same pool of resources. To demonstrate the relevance of our results, we illustrate when and why the collective behavior of bistable toggle switches becomes monostable, and reveal how the interplay between parameter asymmetry and resource sequestration contributes to the emergence of this surprising phenomenon.
|
|
17:40-18:00, Paper WeC06.6 | Add to My Program |
Coupled Reaction Networks for Noise Suppression |
Xiao, Fangzhou | California Institute of Technology |
Fang, Meichen | Peking University |
Yan, Jiawei | Harvard University |
Doyle, John C. | Caltech |
Keywords: Biomolecular systems, Systems biology, Genetic regulatory systems
Abstract: Noise is intrinsic to many important regulatory processes in living cells, and often forms obstacles to be overcome for reliable biological functions. However, due to stochastic birth and death events of all components in biomolecular systems, suppression of noise of one component by another is fundamentally hard and costly. Quantitatively, a widely-cited severe lower bound on noise suppression in biomolecular systems was established by Lestas et. al. in 2010, assuming that the plant and the controller have separate birth and death reactions. This makes the precision observed in several biological phenomena, e.g. cell fate decision making and cell cycle time ordering, seem impossible. We demonstrate that coupling, a mechanism widely observed in biology, could suppress noise lower than the bound of Lestas et. al. with moderate energy cost. Furthermore, we systematically investigate the coupling mechanism in all two-node reaction networks, showing that negative feedback suppresses noise better than incoherent feedforward achitectures, coupled systems have less noise than their decoupled version for a large class of networks, and coupling has its own fundamental limitations in noise suppression. Results in this work have implications for noise suppression in biological control and provide insight for a new efficient mechanism of noise suppression in biology.
|
|
WeC07 Invited Session, Franklin 7 |
Add to My Program |
Control, Optimization and Diagnostics of Energy Storage Systems |
|
|
Chair: Dey, Satadru | University of Colorado Denver |
Co-Chair: Donkers, M.C.F. | Eindhoven University of Technology |
Organizer: Dey, Satadru | University of Colorado Denver |
Organizer: Moura, Scott | University of California, Berkeley |
Organizer: Lin, Xinfan | University of California, Davis |
Organizer: Anderson, R. Dyche | Ford Motor Company |
Organizer: Parvini, Yasha | University of Detroit Mercy |
Organizer: Perez, Hector E. | University of California, Berkeley |
Organizer: Kim, Youngki | University of Michigan - Dearborn |
|
16:00-16:20, Paper WeC07.1 | Add to My Program |
LQ-MPC Design for Degradation-Conscious Control of PEM Fuel Cells (I) |
Goshtasbi, Alireza | University of Michigan |
Ersal, Tulga | University of Michigan |
Keywords: Energy systems, Predictive control for nonlinear systems, Constrained control
Abstract: This paper presents a formulation for degradation-conscious control of polymer electrolyte membrane (PEM) fuel cells with the particular goal of improving the membrane’s mechanical durability. Specifically, a 1D through-the-membrane model of the PEM fuel cell is developed as the plant model based on the authors’ previous work. The model is two-phase, non-isothermal, and has 36 states in total. This model is then reduced for control purposes to obtain an 8-state, parameter varying model that retains the main features of the full-order model. The reduced model is then linearized about the current operating point to render a linear model for a linear quadratic model predictive control (LQ-MPC) problem formulation. The control objective is to meet a power demand while satisfying various constraints on membrane hydration and temperature, liquid accumulation in the catalyst layers, and actuator limits. Simulation results demonstrate the promise of the resulting LQ-MPC framework in enabling degradation-conscious control for PEM fuel cells.
|
|
16:20-16:40, Paper WeC07.2 | Add to My Program |
Safer Batteries Via Active Fault Tolerant Control (I) |
Dey, Satadru | University of Colorado Denver |
Shi, Ying | National Renewable Energy Laboratory |
Khanra, Munmun | National Institute of Technology, Silchar, India |
Smith, Kandler | National Renewable Energy Lab |
Keywords: Energy systems, Fault accomodation
Abstract: Safety remains a critical technological barrier for Lithium-ion batteries. Besides safer battery materials, intelligent battery management can be the key to safer batteries. Motivated by this scenario, we propose an active fault tolerant control scheme which can potentially improve battery safety. Essentially, we focus on battery internal thermal faults which may lead to thermal runaway, and design a control scheme to alleviate such fault effect at an early stage. The control scheme consists of a fault tolerant control algorithm coupled with a fault and state co-estimator. A multi-objective optimal control technique has been used to design the control algorithm whereas an unknown state-input co-estimation approach is used for the fault and state estimator. Finally, simulation studies illustrate the effectiveness of the proposed control scheme.
|
|
16:40-17:00, Paper WeC07.3 | Add to My Program |
Range Maximisation of Electric Vehicles through Active Cell Balancing Using Reachability Analysis (I) |
Hoekstra, Feye Sietze Johan | University of Technology Eindhoven |
Bergveld, Hendrik Johannes | Eindhoven University of Technology |
Donkers, M.C.F. | Eindhoven University of Technology |
Keywords: Energy systems, Optimal control, Automotive control
Abstract: Due to internal differences between cells inside a battery pack, active cell balancing during discharging potentially leads to an extension of the range of electric vehicles. This paper poses range maximisation of electric vehicles as a reachability problem. It is solved by converting this reachability problem into a feasibility problem for a given range. This leads to a large-scale nonlinear feasibility/optimisation problem, which we propose to solve using sequential linearisation of the dynamics and a dual decomposition. This method provides the necessary balancing currents to extend and maximise the range of the vehicle, if the drive cycle, and the model parameters and states are completely known. This result shows the maximum potential for range maximisation through active balancing and can serve as a benchmark for evaluating controllers which are applicable in real-time.
|
|
17:00-17:20, Paper WeC07.4 | Add to My Program |
Coordinated Control of Energy Storage in Networked Microgrids under Unpredicted Load Demands |
Khan, Md Tanvir Arafat | Tabuchi Electric Company of America Ltd |
Cisneros, Rafael | Instituto Tecnológico Autónomo De México |
Chakrabortty, Aranya | North Carolina State University |
Husain, Iqbal | The University of Akron |
Keywords: Power systems, Feedback linearization, Power electronics
Abstract: In this paper a nonlinear control design for power balancing in networked microgrids using energy storage devices is presented. Each microgrid is considered to be interfaced to the distribution feeder though a solid-state transformer (SST). The internal duty cycle based controllers of each SST ensures stable regulation of power commands during normal operation. But problem arises when a sudden change in load or generation occurs in any microgrid in a completely unpredicted way in between the time instants at which the SSTs receive their power setpoints. In such a case, the energy storage unit in that microgrid must produce or absorb the deficit power. The challenge lies in designing a suitable regulator for this purpose owing to the nonlinearity of the battery model and its coupling with the nonlinear SST dynamics. We design an input-output linearization based controller, and show that it guarantees closed-loop stability for either the autonomous operation of a SST or co-operative operation between SSTs, in which each SST assist a given SST whose storage capacity is insufficient to serve the unpredicted load. The design is verified using the IEEE 34-bus distribution system with nine SST-driven microgrids.
|
|
17:20-17:40, Paper WeC07.5 | Add to My Program |
Distributed Storage Investment in Power Networks |
Qin, Junjie | UC Berkeley |
Li, Sen | University of California, Berkeley |
Poolla, Kameshwar | Univ. of California at Berkeley |
Varaiya, Pravin | Univ. of California at Berkeley |
Keywords: Power systems, Smart grid, Game theory
Abstract: The value created by aggregating behind-the-meter distributed energy storage devices for grid services depends on how much storage is in the system and the power network operation conditions. To understand whether market-driven distributed storage investment will result in a socially desirable outcome, we formulate and analyze a network storage investment game. By explicitly characterizing the set of Nash equilibria (NE) for two examples, we establish that the uniqueness and efficiency of NE depend critically on the power network conditions. Furthermore, we show it is guaranteed that NE support social welfare for general power networks, provided we include two modifications in our model. These modifications suggest potential directions for regulatory interventions.
|
|
17:40-18:00, Paper WeC07.6 | Add to My Program |
Hardware-In-The-Loop Testbed Development for Validating Novel Photovoltaic Battery Energy Storage System Concepts |
Doosthosseini, Mahsa | Pennsylvania State University |
Mishra, Partha | Pennsylvania State University |
Fathy, Hosam K. | Penn State University |
Keywords: Energy systems, Power electronics, Simulation
Abstract: This paper presents a real-time hardware-in-the-loop (HIL) setup capable of experimentally emulating the coupling between lithium-ion batteries and photovoltaic (PV) cells. The paper is motivated by earlier research showing that certain ``hybrid" battery-PV integration topologies are inherently self-balancing, in the sense that differences in state of charge between battery cells diminish with time without the need for active balancing circuitry. The literature shows this self-balancing property using both theoretical analyses and simulation studies, but there is still a need for experimental demonstrations. Our goal in this paper is to validate this self-balancing property in a hybrid string experimentally. Towards this goal, we construct a HIL setup that physically emulates the voltage-current characteristics of three PV arrays and exposes three series-connected battery cells to these characteristics in real time. The setup uses an ARM microprocessor, together with three DC-DC converters and isolated serial communications, to achieve this emulation. Experiments conducted using this setup show that certain topologies for integrating PV cells with lithium-ion batteries are indeed self-balancing. Moreover, the setup provides the flexibility for exploring and testing other potential integration topologies and operating conditions.
|
|
WeC08 Tutorial Session, Franklin 8 |
Add to My Program |
NSF Career Awardees-Emerging Research in Control Systems |
|
|
Chair: Baheti, Radhakisan | National Science Foundation |
Co-Chair: Chen, Cynthia | University of Washington, Seattle |
Organizer: Baheti, Radhakisan | National Science Foundation |
|
16:00-16:30, Paper WeC08.1 | Add to My Program |
Resilient Distributed Algorithms for Coordination in Networks under Attacks (I) |
Sundaram, Shreyas | Purdue University |
Keywords: Control of networks
Abstract: Large-scale networked systems (such as the power grid, the internet, multi-robot systems, and smart cities) to function effectively, the components of those systems must collectively estimate the state of the system and take appropriate actions. However, such large-scale networked systems are also increasingly under threat from sophisticated cyber-attacks that can compromise some of the components and cause them to behave erratically or inject malicious information into the network. In this talk, focus is on addressing this problem via the creation of algorithms that enable components in large-scale networks to cooperatively take optimal actions and estimate the state of the system despite attacks on a large number of the components. Specifically, I describe new classes of simple, scalable algorithms for distributed optimization, consensus, and state estimation that can tolerate a potentially large number of worst-case adversaries. I also describe some of the new insights that we have gained about how to design networked systems to be more resilient against attacks.
|
|
16:30-16:50, Paper WeC08.2 | Add to My Program |
Automated Vehicle Control Based on Secure Collaborative Sensing (I) |
Humphreys, Todd | The University of Texas at Austin |
Keywords: Autonomous systems
Abstract: Future Vehicle-to-vehicle (V2V) and vehicle-to-infrastructure (V2I) connectivity will permit vehicles to relay their positions and velocities to each other with millisecond latency, enabling tight coordinated platooning and efficient intersection management. More ambitiously, broad- band V2V and V2I enabled by 5G wireless networks will permit vehicles to share unprocessed or lightly-processed sensor data, allowing ad-hoc networks of vehicles and infrastructure to function as a single sensing organism. The risk of collisions, especially with pedestrians and cyclists-notoriously unpredictable and much harder to sense reliably than vehicles-will be significantly reduced as vehicles and infrastructure collaborate to build a blind-spot-free model of their surroundings. Such collaborative sensing and traffic coordination requires vehicles to know and share their own position. How accurately? The proposed DSRC basic safety message, a first step in V2V coordination, does not yet define a position accuracy requirement, effectively accepting whatever accuracy a standard GNSS receiver can provide. But automated intersection management, tight-formation platooning, and unified processing of sensor data-all involving vehicles of different makes who may not share a common map-will be greatly facilitated by globally referenced positioning with sub-30-cm accuracy. Poor weather also motivates high-accuracy absolute positioning. Every current high-profile automated vehicle initiative depends crucially on lidar or cameras for fine-grained relative positioning within a local map. But these sensing modalities perform poorly in low-visibility conditions such as a snowy whiteout, dense fog, or heavy rain. Moreover, high-definition 3D maps created with lidar and camera data, maps that have proven crucial to recent progress in reliable vehicle automation, can be rendered dangerously obsolete by a single snowstorm. What sensor combinations will enable automated vehicles to reliably operate despite heavy rain, snow, fog, and dark of night? This talk will focus on reliable automated vehicle control based on collaborative mapping and localization despite poor weather, dense urban environments, and even adversarial sensor deception.
|
|
16:50-17:10, Paper WeC08.3 | Add to My Program |
Wind Farm Modeling and Control for Power Grid Support (I) |
Gayme, Dennice | The Johns Hopkins University |
Keywords: Power systems
Abstract: Traditional wind farm modeling and control strategies have focused on layout design and maximizing wind power output. However, transitioning into the role of a major power system supplier necessitates new models and control designs that enable wind farms to provide the grid services that are often required of conventional generators. This talk introduces a model-based wind farm control approach for tracking a time-varying power signal such as a frequency regulation command. The underlying time-varying wake model extends commonly used static models to account for wake advection and lateral wake interactions. We perform numerical studies of the controlled wind farm using a large eddy simulation (LES) with actuator disks as a wind farm model with local turbine thrust coefficients (‘synthetic pitch’) as the control actuation. Our results show that embedding this type of dynamic wake model within a model-based receding horizon control framework leads to a controlled wind farm that qualifies to participate in markets for correcting short-term imbalances in active power generation and load on the power grid (frequency regulation). Accounting for the aerodynamic interactions between turbines within the proposed control strategy yields large increases in efficiency over prevailing approaches by achieving commensurate up-regulation with smaller derates (reductions in wind farm power set points). This potential for derate reduction has important economic implications because smaller derates directly correspond to reductions in the loss of bulk power revenue associated with participating in regulation markets.
|
|
17:10-17:30, Paper WeC08.4 | Add to My Program |
Think Globally, Act Locally: From Local Network Structure to Global Graph Spectrum (I) |
Preciado, Victor M. | University of Pennsylvania |
Keywords: Networked control systems
Abstract: Using methods from algebraic graph theory and convex optimization we study the relationship between local structural features of a network and global spectral properties of relevance in networked dynamical systems. In particular, we derive expressions for the so-called spectral moments of a graph in terms of local structural measurements, such as local subgraph densities. Furthermore, we propose a series of semidefinite programs to compute bounds on the spectral radius, and other spectral properties of dynamical relevance, from a truncated sequence of spectral moments. Using these results, we illustrate how local structural features strongly constraint graph spectral properties of relevance to global networked dynamics.
|
|
17:30-17:50, Paper WeC08.5 | Add to My Program |
NSF Programs in Control, Learning, Robotics, Smart-Grid, and Cyber-Physical Systems (I) |
Baheti, Radhakisan | National Science Foundation |
Keywords: Control applications
Abstract: The goal of the session is to provide an update on National Science Foundation (NSF) funding opportunities Control and Networked Systems research and education. The presentation will include NSF programs in Smart-Grid, Cyber-Physical Systems (CPS), and National Robotics Initiative. The CPS program brings together researchers from computations, communications, and control disciplines to address important engineering problems. The presentation will include recent activities at NSF in AI, Machine Learning, and Smart and Connected Communities.
|
|
WeC09 Invited Session, Franklin 9 |
Add to My Program |
Control and Optimization of Engine Aftertreatment Systems |
|
|
Chair: Chen, Pingen | Tennessee Technological University |
Co-Chair: Mohammadpour Velni, Javad | University of Georgia |
Organizer: Chen, Pingen | Tennessee Technological University |
Organizer: Hall, Carrie | Illinois Institute of Technology |
Organizer: Zhang, Chen | University of Minnesota |
Organizer: Chen, Yan | Arizona State University |
|
16:00-16:20, Paper WeC09.1 | Add to My Program |
A Predictive Control Method for Automotive Selective Catalytic Reduction Systems (I) |
Ma, Yao | The University of Texas at Austin |
Wang, Junmin | University of Texas at Austin |
Keywords: Automotive control, Predictive control for nonlinear systems, Chemical process control
Abstract: This paper presents a predictive control method for automotive Selective Catalytic Reduction (SCR) systems to minimize vehicle tailpipe Nitrogen Oxides (NOx) and ammonia (NH3) emissions. SCR systems have been indispensable in Diesel-powered vehicles to reduce the toxic emissions. To balance the tradeoff between NOx and NH3, the ammonia storage level in an SCR needs to be critically controlled. The proposed control method consists of an ammonia coverage ratio tracking controller and a predictive reference ammonia coverage ratio generator. The reference generator will utilize the predictive information, enabled by growing vehicle connectivity and intelligence, to determine an optimal level of ammonia coverage ratio within the preview horizon. The tracking controller will then drive ammonia coverage ratio to a desired level. The effectiveness of the proposed design approach is demonstrated through simulation studies with experimentally acquired data.
|
|
16:20-16:40, Paper WeC09.2 | Add to My Program |
Optimization of Combustion Mode Duration for Lean Gasoline Engine with NOx Storage-Capable Passive Selective Catalytic Reduction System (I) |
Strange, Dakota | Tennessee Technological University |
Chen, Pingen | Tennessee Technological University |
Prikhodko, Vitaly Y. | Oak Ridge National Laboratory |
Parks, James E. | Oak Ridge National Laboratory |
Keywords: Automotive control, Automotive systems, Optimization
Abstract: Lean-burn gasoline engines have demonstrated promising potentials to achieve higher fuel efficiency than stoichiometric gasoline engines. However, severe concerns arise in lean NOx emission control. Three-way catalysts (TWCs), which are broadly applied in stoichiometric gasoline engines, fail to achieve high NOx conversion efficiency in the presence of excessive oxygen. Emerging passive selective catalytic reduction (SCR) systems with NOx storage capability on TWC, offer great potential in NOx emission reduction for lean-burn gasoline engines at low fuel penalty due to on-board ammonia generation in periodic rich operation. The purpose of this paper is to derive local and global optimization algorithms for optimizing lean and rich operation times in each lean-rich period for lean-burn gasoline engines by considering not only fuel penalty associated with NH3 production but also lean/rich switching frequency. Optimization results demonstrate that both local and optimal optimization strategies result in comparable fuel penalties at the same level of mode-switching frequency. However, the genetic algorithm-based global optimization method requires much higher computational load than the local optimization method and thus is less preferred for real-time applications.
|
|
16:40-17:00, Paper WeC09.3 | Add to My Program |
A Tailpipe NOx Sensor Decoupling Algorithm for Integrated SCR and AMOX Systems (I) |
Lin, Qinghua | Tennessee Technological University |
Chen, Pingen | Tennessee Technological University |
Haas, Michael | Cummins Inc |
Khayyer, Pardis | Industry |
Keywords: Automotive systems, Observers for nonlinear systems, Kalman filtering
Abstract: Urea-based selective catalytic reduction (SCR) system coupled with a downstream ammonia oxidation catalyst (AMOX), has become a standard NOx reduction device for Diesel engines. On-board diagnostics of tailpipe NOx and ammonia (NH3) emissions and closed-loop controls using only tailpipe NOx sensor, are critical for SCR systems to achieve high NOx conversion efficiency and low tailpipe NH3 slip. However, due to commercial NOx sensor NH3 cross-sensitivity issue, the tailpipe NH3 emissions can be misinterpreted as NOx emissions, which may lead to erratic diagnostics and unstable control systems. The purpose of this study is to develop a high-fidelity control-oriented SCR-AMOX model and a model-based estimation algorithm using extended Kalman filter (EKF) for effectively decoupling NOx and NH3 concentrations from the mixed tailpipe NOx sensor signals for an SCR-AMOX system. The proposed model and EKF-based decoupling algorithm were validated using the experimental data collected from a Diesel engine platform during both steady-state and transient driving cycles. Experimental verification results demonstrated high accuracy of the control-oriented model and proved the efficacy of the proposed decoupling algorithm in meeting the preset thresholds. The robustness of the decoupling algorithm against the uncertainty from catalyst aging was also demonstrated and verified. Such EKF-based robust decoupling algorithm can be instrumental in the diagnostics and controls of urea-based SCR systems.
|
|
17:00-17:20, Paper WeC09.4 | Add to My Program |
Reduced-Order Long-Horizon Predictive Thermal Management for Diesel Engine Aftertreatment Systems (I) |
Salehi, Rasoul | University of Michigan |
Stefanopoulou, Anna G. | University of Michigan |
Mahesh, Siddharth | Detroit Diesel Corp |
Allain, Marc | Detroit Diesel Corp |
Keywords: Automotive control, Optimal control, Autonomous systems
Abstract: Model predictive thermal management of a heavy duty diesel engine aftertreatment system (ATS) requires optimization over a long horizon due to slow thermal dynamics of the ceramic-based catalysts. A model-based optimization architecture is presented to decouple the diesel engine air path and torque with fast dynamics from the ATS slow thermal dynamics and simplify solving the thermal management optimal control problem (OCP). The key idea presented is to estimate the air path variables with static models and control the engine torque within an internal control loop. Then, an ATS predictive thermal management system is proposed as a high-level controller and a reduced order OCP is formulated with only ATS temperatures as states and two control variables, namely the engine intake manifold pressure and fuel injection timing. Simulation results over the FTP drive cycle indicate from 3% to 4% increase in the cycle-averaged diesel oxidation catalyst (DOC) and selective catalytic reduction (SCR) system efficiency, depending on the catalyst location and length of the controller's prediction horizon, along with 2-3% brake specific fuel consumption reduction over the test cycle. Results also show long-term predictions are required to avoid temperature drop after warm-up which happens during low exhaust temperature operations such as a long engine idle.
|
|
17:20-17:40, Paper WeC09.5 | Add to My Program |
Data-Driven Modeling and Predictive Control of Combustion Phasing for RCCI Engines (I) |
Khoshbakht Irdmousa, Behrouz | Michigan Technological University |
Rizvi, Syed Z. | Corning Inc |
Mohammadpour Velni, Javad | University of Georgia |
Naber, Jeffrey | Michigan Technological University |
Shahbakhti, Mahdi | Michigan Technological University |
Keywords: Automotive control
Abstract: Reactivity controlled compression ignition (RCCI) engines center on a combustion strategy with higher thermal efficiency, lower particulate matter (PM), and lower oxides of nitrogen (NOx) emissions compared to conventional diesel combustion (CDC) engines. However, real time optimal control of RCCI engines is challenging during transient operation due to the need for high fidelity combustion models. Development of a simple, yet accurate control-oriented RCCI model from physical laws is time consuming and often requires substantial calibrations. To overcome these challenges, data-driven models can be developed. In this paper, a data-driven linear parameter varying (LPV) model for an RCCI engine is developed. An LPV state space model is identified to predict RCCI combustion phasing as a function of multiple RCCI control variables. The results show that the proposed method provides a fast and reliable route to identify an RCCI engine model. The developed model is then used for the design of a model predictive controller (MPC) to control crank angle for 50% fuel burnt (CA50) for varying engine conditions. The experimental results show that the designed MPC with the data-driven LPV model can track desired CA50 with less than 1 crank angle degree (CAD) error against changes in engine load.
|
|
17:40-18:00, Paper WeC09.6 | Add to My Program |
Extremum-Seeking Control for Combined EGR Fraction Tracking and Constrained Pumping-Loss Minimization in Diesel Engines |
van der Weijst, Robert | Eindhoven University of Technology |
van Keulen, Thijs | Eindhoven University of Technology |
Willems, Frank | Eindhoven University of Technology |
Keywords: Automotive control, Adaptive control, Constrained control
Abstract: Exhaust gas recirculation (EGR) is an often applied mechanism to suppress the emission of NOx in Diesel engines. EGR however, induces a pumping-loss, which reduces the fuel efficiency of the engine. The corresponding control problem is to track a reference EGR fraction, while simultaneously using the available actuators to minimize pumping-loss. These are conflicting objectives, as the minimum pumping-loss corresponds to zero EGR fraction. In addition, a lower constraint on the air/fuel equivalence ratio is taken into account to prevent high emission of particulate matter (PM). An extension of extremum-seeking (ES) is proposed which combines multivariable proportional-integral (PI) tracking control with optimization, where the conflicting objectives are decoupled by gradient projection. The controller does not rely on parametric models, disturbance knowledge, or explicit optimization, hence it is robust with respect to real-world disturbances and the additional computational effort compared with a standard PI controller is low. The controller is demonstrated in a simulation example using a physics based Diesel engine model.
|
|
WeC10 Regular Session, Franklin 10 |
Add to My Program |
Predictive Control for Nonlinear Systems II |
|
|
Chair: Mesbah, Ali | University of California, Berkeley |
Co-Chair: Nghiem, Truong X. | Northern Arizona University |
|
16:00-16:20, Paper WeC10.1 | Add to My Program |
Linearized Gaussian Processes for Fast Data-Driven Model Predictive Control |
Nghiem, Truong X. | Northern Arizona University |
Keywords: Predictive control for nonlinear systems, Optimization, Machine learning
Abstract: Data-driven Model Predictive Control (MPC), where the system model is learned from data with machine learning, has recently gained increasing interests in the control community. Gaussian Processes (GP), as a type of statistical models, are particularly attractive due to their modeling flexibility and their ability to provide probabilistic estimates of prediction uncertainty. GP-based MPC has been developed and applied, however the optimization problem is typically non-convex and highly demanding, and scales poorly with model size. This causes unsatisfactory solving performance, even with state-of-the-art solvers, and makes the approach less suitable for real-time control. We develop a method based on a new concept, called linearized Gaussian Process, and Sequential Convex Programming, that can significantly improve the solving performance of GP-based MPC. Our method is not only faster but also much more scalable and predictable than other commonly used methods, as it is much less influenced by the model size. The efficiency and advantages of the algorithm are demonstrated clearly in a numerical example.
|
|
16:20-16:40, Paper WeC10.2 | Add to My Program |
A Model Predictive Control Based Iterative Trajectory Optimization Method for Systems with State-Like Disturbances |
Edmonds, Merrill | Rutgers, the State University of New Jersey |
Yi, Jingang | Rutgers University |
Keywords: Predictive control for nonlinear systems, Robotics
Abstract: Robots performing aggressive maneuvers in fluids must contend with disturbances caused by the dynamics of the fluids themselves. In this paper, we investigate the effects on system dynamics under disturbances that evolve in a state-like fashion, i.e., based on some internal state. Such a configuration has implications for the stability and controllability properties of the system, and has an effect on the optimality of any trajectories. We introduce an iterative method based on linear time-varying model predictive control to help deal with systems where the internal state of the fluid is not observable, but the disturbance is predictable. We then demonstrate the applicability of this method to optimal trajectory generation by planning a landing trajectory for a simplified planar quadcopter model.
|
|
16:40-17:00, Paper WeC10.3 | Add to My Program |
A Constraint-Tightening Approach to Nonlinear Model Predictive Control with Chance Constraints for Stochastic Systems |
Santos, Tito Luís Maia | Federal University of Bahia |
Bonzanini, Angelo Domenico | UC Berkeley |
Heirung, Tor Aksel Notland | University of California, Berkeley |
Mesbah, Ali | University of California, Berkeley |
Keywords: Predictive control for nonlinear systems, Stochastic optimal control
Abstract: This paper presents a nonlinear model predictive control (NMPC) strategy for stochastic systems subject to chance constraints. The notion of stochastic tubes is extended to nonlinear systems to present a constraint tightening strategy that ensures stability and recursive feasibility of NMPC in the presence of stochastic uncertainties. State constraints are tightened recursively by constructing a sequence of sets from an initial constraint set, which is tightened using constraint backoff parameters obtained from either the probability distribution or the empirical cumulative distribution of the uncertainties. The performance of the NMPC strategy with chance constraints is compared to that of robust NMPC on a DC-DC converter benchmark case study.
|
|
17:00-17:20, Paper WeC10.4 | Add to My Program |
Fault-Tolerant Tube-Based Robust Nonlinear Model Predictive Control |
Paulson, Joel | University of California, Berkeley |
Heirung, Tor Aksel Notland | University of California, Berkeley |
Mesbah, Ali | University of California, Berkeley |
Keywords: Predictive control for nonlinear systems, Uncertain systems
Abstract: This paper extends the tube-based robust nonlinear model predictive control approach to include robustness to a finite number of faults. The proposed control approach ensures there are feasible trajectories to some safe state under any given fault scenario and any time of fault occurrence. The safe state is chosen by the controller, which enlarges the feasible region relative to specifying fixed safe regions as a part of the control design. A numerical example demonstrates the efficacy of the proposed control approach and shows the benefits of letting the safe state be a decision variable at every possible time that the fault may occur.
|
|
17:20-17:40, Paper WeC10.5 | Add to My Program |
Dynamic Tube MPC for Nonlinear Systems |
Lopez, Brett | MIT |
How, Jonathan P. | MIT |
Slotine, Jean-Jacques | Massachusetts Institute of Technology |
Keywords: Predictive control for nonlinear systems, Variable-structure/sliding-mode control, Robust control
Abstract: Modeling error or external disturbances can severely degrade the performance of Model Predictive Control (MPC) in real-world scenarios. Robust MPC (RMPC) addresses this limitation by optimizing over feedback policies but at the expense of increased computational complexity. Tube MPC is an approximate solution strategy in which a robust controller, designed offline, keeps the system in an invariant tube around a desired nominal trajectory, generated online. Naturally, this decomposition is suboptimal, especially for systems with changing objectives or operating conditions. In addition, many tube MPC approaches are unable to capture state-dependent uncertainty due to the complexity of calculating invariant tubes, resulting in overly-conservative approximations. This work presents the Dynamic Tube MPC (DTMPC) framework for nonlinear systems where both the tube geometry and open-loop trajectory are optimized textit{simultaneously}. By using boundary layer sliding control, the tube geometry can be expressed as a simple relation between control parameters and uncertainty bound; enabling the tube geometry dynamics to be added to the nominal MPC optimization with minimal increase in computational complexity. In addition, DTMPC is able to leverage state-dependent uncertainty to reduce conservativeness and improve optimization feasibility. DTMPC is demonstrated to robustly perform obstacle avoidance and modify the tube geometry in response to obstacle proximity.
|
|
17:40-18:00, Paper WeC10.6 | Add to My Program |
Information Theoretic Model Predictive Control on Jump Diffusion Processes |
Wang, Ziyi | Georgia Institute of Technology |
Williams, Grady | Georgia Institute of Technology |
Theodorou, Evangelos A. | Georgia Institute of Technology |
Keywords: Information theory and control, Predictive control for nonlinear systems, Optimization
Abstract: In this paper we present an information theoretic approach to stochastic optimal control problems for systems with compound Poisson noise. We generalize previous work on information theoretic path integral control to discontinuous dynamics with compound Poisson noise. We also derive a control update law of the same form using a stochastic optimization approach. We develop a sampling-based iterative model predictive control (MPC) algorithm. The proposed algorithm is parallelizable and when implemented on a Graphical Processing Unit (GPU) can run in real time. We test the performance of the proposed algorithm in simulation for two control tasks using a cartpole and a quadrotor system. Our simulations demonstrate improved performance of the new scheme and indicate the importance of incorporating the statistical characteristics of stochastic disturbances in the computation of the stochastic optimal control policies.
|
|
WeC11 Regular Session, Room 401-402 |
Add to My Program |
Formal Verification/Synthesis |
|
|
Chair: Zamani, Majid | Technical University of Munich |
Co-Chair: Belta, Calin | Boston University |
|
16:00-16:20, Paper WeC11.1 | Add to My Program |
Memory Efficient Symbolic Solution of Quantitative Reach-Avoid Problems |
Macoveiciuc, Elisei | University of the Armed Forces Munich |
Reissig, Gunther | Bundeswehr University Munich |
Keywords: Formal verification/synthesis, Computational methods, Constrained control
Abstract: Abstraction-based controller synthesis is an emerging approach to automatically synthesize correct-by-design controllers for a wide class of continuous-state control problems. Its application is currently limited, however, since the number of transitions of non-deterministic discrete abstractions for a state-input pair is exponential in dimension of the state space. In this paper, we present a novel synthesis algorithm for quantitative reach-avoid problems that does not require pre-computation of abstraction or any part of it. Our approach outperforms existing on-the-fly works by the fact that, regardless of the state space dimension, it provably stores at most one transition for any abstract state-input pair at any point in time. Hence, memory-wise, one of "bottlenecks" of abstraction-based control is removed. To achieve reasonable time complexity, we place assumptions only on the geometry of the problem data. We illustrate performance of our method on several examples.
|
|
16:20-16:40, Paper WeC11.2 | Add to My Program |
Compositional Synthesis of Almost Maximally Permissible Safety Controllers |
Liu, Siyuan | Technical University of Munich |
Zamani, Majid | University of Colorado Boulder |
Keywords: Formal verification/synthesis, Decentralized control, Large-scale systems
Abstract: In this work, we present a compositional safety controller synthesis approach for the class of discrete-time linear control systems. Here, we leverage a state-of-the-art result on the computation of robust controlled invariant sets. To tackle the complexity of controller synthesis over complex interconnected systems, this paper introduces a decentralized controller synthesis scheme. Rather than treating the interconnected system as a whole, we first design local safety controllers for each subsystem separately to enforce local safety properties, with polytopic state and input constraints as well as bounded disturbance set. Then, by composing the local controllers, the interconnected system is guaranteed to satisfy the overall safety specification. Finally, we provide a vehicular platooning example to illustrate the effectiveness of the proposed approach by solving the overall safety controller synthesis problem by computing less complex local safety controllers for subsystems and then composing them.
|
|
16:40-17:00, Paper WeC11.3 | Add to My Program |
Synthesis of Monitoring Rules Via Data Mining |
Ketenci, Ahmet | Middle East Technical University, Department of Computer Enginee |
Aydin Gol, Ebru | Middle East Technical University |
Keywords: Formal verification/synthesis, Learning
Abstract: In online monitoring of critical systems, it is important to detect an abnormal behavior as early as possible. Signal temporal logic (STL) formulas are used to specify these undesired behaviors due to the expressivity and interpretability of the logic and the existence of efficient online monitoring algorithms. In this paper, we present a new method to synthesize formulas that belong to past time fragment of STL from a labeled dataset. In particular, we consider a dataset that includes signals and their labels marking the moment of occurrence of undesired behaviors, and propose a formula synthesis algorithm based on data mining algorithms. We first transform the dataset into a new dataset with attributes encoding basic temporal formulas, then learn a classifier from the transformed dataset and finally generate a ptSTL formula from the classifier. The proposed method requires much less computational time compared to similar algorithms and achieves competitive detection performance as shown in the case studies.
|
|
17:00-17:20, Paper WeC11.4 | Add to My Program |
Arithmetic-Geometric Mean Robustness for Control from Signal Temporal Logic Specifications |
Mehdipour, Noushin | Boston University |
Vasile, Cristian Ioan | Massachusetts Institute of Technology |
Belta, Calin | Boston University |
Keywords: Formal verification/synthesis, Robotics
Abstract: Abstract— We present a new average-based robustness score for Signal Temporal Logic (STL) and a framework for optimal control of a dynamical system under STL constraints. By averaging the scores of different specifications or subformulae at different time points, our new definition highlights the frequency of satisfaction, as well as how robustly each specification is satisfied at each time point. We show that this definition provides a better score for how well a specification is satisfied. Its usefulness in monitoring and control synthesis problems is illustrated through case studies.
|
|
17:20-17:40, Paper WeC11.5 | Add to My Program |
Approximate Dynamic Programming with Probabilistic Temporal Logic Constraints |
Li, Lening | Worcester Polytechnic Institute |
Fu, Jie | Worcester Polytechnic Institute |
Keywords: Formal verification/synthesis, Stochastic optimal control, Markov processes
Abstract: In this paper, we develop approximate dynamic programming methods for stochastic systems modeled as Markov Decision Processes, given both soft performance criteria and hard constraints in a class of probabilistic temporal logic called Probabilistic Computation Tree Logic (PCTL). Our approach consists of two steps: First, we show how to transform a class of PCTL formulas into chance constraints that can be enforced during planning in stochastic systems. Second, by integrating randomized optimization and dynamic programming with softmax Bellman operator, we devise a novel trajectory sampling-based approximate value iteration method to iteratively solve for an upper bound on the value function while ensuring the constraints that PCTL specifications are satisfied. Particularly, we show that by the on-policy sampling of the trajectories, a tight bound can be achieved between the upper bound given by the approximation and the true value function. The correctness and efficiency of the method are demonstrated using robotic motion planning examples.
|
|
17:40-18:00, Paper WeC11.6 | Add to My Program |
A Modal Interface Contract Theory for Guarded Input/Output Automata with an Application in Traffic System Design |
Phan, Tung, M | California Institute of Technology |
Guo, Steve | California Institute of Technology |
Schürmann, Bastian | Technical University of Munich |
Althoff, Matthias | Technische Universität München |
Murray, Richard M. | California Inst. of Tech |
Keywords: Automata, Modeling, Formal verification/synthesis
Abstract: As a direct contribution to recent efforts of bringing formal design-by-contract methods to hybrid systems, we introduce a variant of modal interface contract theory based on input/output automata with guarded transitions. We present an algebra of operators for interface composition, contract composition, contract conjunction, contract refinement and some theorems to demonstrate that our contract object has reasonably universal semantics. As an application, we use our framework to aid the design of a networked control system of traffic.
|
|
WeC12 Regular Session, Room 403 |
Add to My Program |
Applications of Adaptive Control |
|
|
Chair: Uchiyama, Naoki | Toyohashi University of Technology |
Co-Chair: Silvestre, Carlos | University of Macau |
|
16:00-16:20, Paper WeC12.1 | Add to My Program |
Adaptive Backstepping Control Design for Active Suspension Systems with Output Feedback |
Yilmaz, Cemal Tugrul | Bogazici University |
Basturk, Halil I. | Bogazici University |
Keywords: Adaptive control, Observers for Linear systems, Estimation
Abstract: The paper focuses on designing an output feedback adaptive controller which maintains the comfort and safety of the vehicle body. The road disturbance is modelled as a finite sum of sinusoidal waves with unknown frequencies, amplitudes and phases. The road disturbance is parametrized and estimation of the derivative of the unknown road profile as well as the unmeasured system states are achieved. An adaptive controller is proposed using a backstepping approach. It is shown that the equilibrium of the closed loop system is exponentially stable. The effectiveness of the observer and controller designs is illustrated with a simulation of a road test.
|
|
16:20-16:40, Paper WeC12.2 | Add to My Program |
Adaptive Sliding Mode Control for Precision Motion of Industrial Feed Drive Systems with Uncertainty Dynamics |
Msukwa, Mathew Renny | Toyohashi University of Technology |
Nshama, Enock William | Toyohashi University of Technology |
Uchiyama, Naoki | Toyohashi University of Technology |
Keywords: Adaptive control, Uncertain systems, Lyapunov methods
Abstract: This study proposes an approach for high speed and precision motion control for industrial feed drive systems. Although sliding mode control is among the well-known approaches, ignoring plant uncertainties in controller design could hinder the control performance. Therefore, in this study, a nonlinear sliding mode control is designed with an additional controller to compensate for plant uncertainties. The control stability is proven by the Lyapunov stability theory, and the convergence of the motion trajectory to the sliding surface is guaranteed. To verify the performance, an adaptive sliding mode controller with a nonlinear sliding surface has been considered for comparison. Simulation results show that the proposed controller can significantly enhance the performance of feed drive systems. The proposed method has shown that the maximum tracking error can be reduced by 50.5% with little increase of energy consumption.
|
|
16:40-17:00, Paper WeC12.3 | Add to My Program |
Design and Experimental Verification of Adaptive Sliding Mode Control for Motion Accuracy and Energy Saving in Industrial Feed Drive Systems |
Farrage, Abdallah | Toyohashi University of Technology |
Uchiyama, Naoki | Toyohashi University of Technology |
Keywords: Adaptive control, Manufacturing systems
Abstract: Reduction of energy consumption is one of the fundamental requirements in industry, in particular computer numerical controlled (CNC) machines. Because these machines operate for a long time and extensively contribute in diverse applications all over the world, reducing even a small percentage of consumed energy can lead to significant energy saving in manufacturing sectors. This paper concerns with improving motion accuracy and energy saving based on adaptive sliding mode control (ASMC) for industrial feed drive machine tool. The proposed control approach is derived based on the Lyapunov stability theory and its control gain is designed to be mainly relied on resultant motion errors of drive axes. Once the tracking error is changed, the control gain is simultaneously adjusted to generate appropriate control signal to provide good tracking performance with reducing energy consumption. Furthermore, the proposed adaptive gain does not alter only during the reaching phase but also through the sliding phase, and hence consumed energy reduction is further expected. In order to verify the effectiveness of the proposed approach, it was compared with non-adaptive and typical adaptive sliding mode control approaches with a circular trajectory of an industrial feed drive system. Experimental results show that the mean and maximum tracking errors of the proposed scenario could be largely reduced by 34.81% and 33.66% on average compared to a constant control gain without any increase of consumed energy, respectively. The proposed approach effectively improved the control input variance by 1.54% and 2.34% compared to constant and typical adaptive gains, respectively. Consequentially, consumed energy was reduced by 2.89% and 1.26% on average.
|
|
17:00-17:20, Paper WeC12.4 | Add to My Program |
Adaptive Backstepping of Synergistic Hybrid Feedbacks with Application to Obstacle Avoidance |
Casau, Pedro | Instituto Superior Técnico, University of Lisbon |
Sanfelice, Ricardo G. | University of California at Santa Cruz |
Silvestre, Carlos | Instituo Superior Técnico |
Keywords: Adaptive systems, Hybrid systems, Autonomous robots
Abstract: In this paper, we show that the hybrid controller that is induced by a Synergistic Lyapunov Function and Feedback (SLFF) pair relative to a compact set, can be extended to the case where the original affine control system is subject to a class of additive disturbances known as matched uncertainties, provided that the estimator dynamics do not add new equilibria to the closed-loop system. We also show that the proposed adaptive hybrid controller is amenable to backstepping. Finally, we apply the proposed hybrid control strategy to the problem of global asymptotic stabilization of a compact set in the presence of an obstacle and we illustrate this application by means of simulation results.
|
|
17:20-17:40, Paper WeC12.5 | Add to My Program |
Adaptive Optimal Control for Suppressing Vehicle Longitudinal Vibrations |
Hao, Donghao | Beijing Institute of Technology |
Zhao, Changlu | Beijing Institute of Technology |
Zhu, Guoming | Michigan State University |
Huang, Ying | Beijing Institute of Technology |
Yang, Long | Beijing Institute of Technology |
Keywords: Automotive control, Optimal control, Adaptive control
Abstract: Sudden torque change under the tip-in operation often causes driveline low-frequency torsional vibrations, which seriously impacts vehicle drivability. Typical driveline resonance frequency is under 10Hz in the longitudinal direction and it cannot be eliminated through mechanical design optimization. To provide a smooth acceleration with minimal vibrations, an adaptive optimal tracking controller of engine torque is designed in this paper. A nonlinear model, elaborating the driveline and vehicle longitudinal dynamics, is developed. Based on the linearized control-oriented model, a receding horizon linear quadratic tracking (RHLQT) controller is designed along with the Kalman optimal state estimation. The optimal control design parameters (weightings) are tuned under different road conditions. In addition, the road surface contact friction coefficient is estimated using the recursive Least-Squares method. The RHLQT adapts to the estimated road condition (surface friction). The control performance of the adaptive RHLQT is studied under different road conditions, compared with fixed control parameters LQT controllers. The simulation results confirm the effectiveness of the proposed control scheme.
|
|
17:40-18:00, Paper WeC12.6 | Add to My Program |
Cycling with Functional Electrical Stimulation and Adaptive Neural Network Admittance Control |
Cousin, Christian | University of Florida |
Deptula, Patryk | University of Florida |
Rouse, Courtney | University of Florida |
Dixon, Warren E. | University of Florida |
Keywords: Stability of nonlinear systems, Lyapunov methods, Adaptive control
Abstract: For individuals with neurological conditions (NCs) affecting the muscles of their legs, motorized functional electrical stimulation (FES) cycling is a rehabilitation strategy which offers numerous health benefits. Motorized FES cycling is an example of cooperative physical human-robot interaction where both the cycle’s motor and rider’s muscles (through electrical stimulation) must be well controlled to achieve desired performance. Since every NC is unique, adaptive control of motorized FES cycling is motivated over a one-size-fits-all approach. In this paper, a robust sliding-mode controller is employed on the rider’s muscles while an adaptive neural network admittance controller is employed on the cycle’s motor to preserve rider comfort and safety. Through a Lyapunov-like switched systems stability analysis, global asymptotic stability of the cycle controller is guaranteed and the muscle controller is proven to be passive with respect to the cycle. Experiments on one able-bodied participant were conducted to validate the control design.
|
|
WeC13 Regular Session, Room 404 |
Add to My Program |
Constrained Control |
|
|
Chair: Findeisen, Rolf | OVG University Magdeburg |
Co-Chair: Ossareh, Hamid | University of Vermont |
|
16:00-16:20, Paper WeC13.1 | Add to My Program |
Constraint Management of Rotating Machinery with Application to Xerography |
Ossareh, Hamid | University of Vermont |
Keywords: Constrained control, Control applications, Predictive control for linear systems
Abstract: This paper is concerned with the problem of constraint management for rotating machinery with actuators and sensors fixed in inertial space. Such systems arise in xerography, drilling and milling machines, and turbo machinery. The proposed approach consists of first discretizing the rotating device spatially and temporally to obtain a discrete-time lumped linear periodic model of the rotating device. Linear tracking controllers are then designed to stabilize the system, followed by the application of the Reference Governor (RG) technique for constraint management. To accomplish the latter, we extend the earlier results in the literature of RG to the case of periodic systems with disturbances, which arise in applications. We illustrate the theory using a numerical simulation of the fusing stage of a xerographic process.
|
|
16:20-16:40, Paper WeC13.2 | Add to My Program |
Modular Design for Constrained Control of Actuator-Plant Cascades |
Di Cairano, Stefano | Mitsubishi Electric Research Labs |
Bäthge, Tobias | Otto Von Guericke University Magdeburg |
Findeisen, Rolf | OVG University Magdeburg |
Keywords: Hierarchical control, Constrained control, Control system architecture
Abstract: We consider layered control architectures where a constraint-enforcing upper layer is cascaded with a lower layer controlled actuator. As we aim for a design where each layer requires as little knowledge as possible of the other, the upper layer is based on a model that neglects the lower layer dynamics, and includes instead additive uncertainty. The uncertainty set is constructed and ``declared'' by the lower layer based only on constraints on the command ``declared'' by the upper layer. This results in a contract between upper layer and lower layer guaranteeing a bound on the prediction error if the command satisfies the declared constraints. The command and plant constraints are robustly enforced by model predictive control with a robust control invariant set. The stability properties are analyzed, and a case study of vehicle steering control is shown.
|
|
16:40-17:00, Paper WeC13.3 | Add to My Program |
A Strict Lyapunov Function for the Finite-Time Regulation of Robot Manipulators with Bounded Inputs |
Suárez-Nuño, Rubén | Universidad De Guadalajara |
Cruz-Zavala, Emmanuel | University of Guadalajara (UdG) |
Nuño, Emmanuel | University of Guadalajara |
Keywords: Constrained control, Lyapunov methods, Mechanical systems/robotics
Abstract: This paper proposes strict Lyapunov functions (SLFs) for the Saturated-Proportional-Saturated-Derivative with gravity cancellation controller for the case when the robot manipulator has non-ideal actuators and without taking into account the viscous friction in the model. The proposal of an SLF in this scenario has remained as an open problem in the regulation case. Here, we propose two different SLFs, one to ensure that the desired equilibrium is globally asymptotically stable and, the other, to ensure that such equilibrium is finite time stable. The comparison of the finite-time controller versus its linear implementation is illustrated via simulations, on a two degrees-of-freedom robot manipulator.
|
|
17:00-17:20, Paper WeC13.4 | Add to My Program |
Incrementally Passive Primal-Dual Dynamics for Real-Time Constrained Optimization |
Adegbege, Ambrose Adebayo | The College of New Jersey |
Keywords: Constrained control, Optimization algorithms, Stability of nonlinear systems
Abstract: In this paper, we present a class of globally convergent primal-dual dynamics for the solution of constrained optimization commonly encountered in real-time optimal control applications. By exploiting the incremental passivity properties of the primal and the dual dynamics, and the associated input-nonlinearity, we construct a suitable antiwindup compensator that enforces a specified level of performance that captures allowable constraint violation. The ensuring dynamics can be considered a generalization of the classical Arrow-Uzawa gradient system and can easily be implemented in embedded optimal control applications.
|
|
17:20-17:40, Paper WeC13.5 | Add to My Program |
Mitigating Noise-Induced Tracking Loss in PI Controlled Systems with Saturating Actuators |
Shin, YiRang | DGIST |
Eun, Yongsoon | DGIST |
Keywords: Constrained control, PID control
Abstract: This technical note addresses a problem of mitigating noise induced tracking loss in a closed-loop system with linear plant, PI controller, saturating actuator, and anti-windup. For such systems, it was recently discovered that with the presence of zero mean measurement noise the mean of the output process at steady-state exhibits a level of tracking error. This phenomenon was termed as “Noise-Induced Tracking Error (NITE).” Low pass filtering the measurement noise may be a solution to mitigate NITE, however, adding a filter affects the stability and also the transient tracking performance. This paper proposes to use an observer as a filter to decouple filter dynamics and the system stability, avoid performance loss in transient tracking, and most importantly, eliminate the noise induced tracking error. To accomplish these, a standard is necessary for observer gain selection, which is provided based on Quasilinear Control Theory. Finally, proof of the separation principle for PI-controlled feedback system is derived and the region of stability that considers the actuator saturation nonlinearity is presented.
|
|
17:40-18:00, Paper WeC13.6 | Add to My Program |
A Reference Governor Approach towards Recovery from Constraint Violation |
Osorio, Joycer | University of Vermont |
Santillo, Mario | Ford Motor Company |
Buckland, Julia | Ford Motor Company |
Jankovic, Mrdjan | Ford Research & Advanced Engineering |
Ossareh, Hamid | University of Vermont |
Keywords: Constrained control, Predictive control for linear systems, Uncertain systems
Abstract: This paper proposes a new formulation for the Reference Governor (RG) applied to linear systems affected by exogenous unmodeled disturbances, specifically those large enough to cause constraint violation. This formulation is based on a set-theoretic approach, which includes external disturbances within a new RG, that we call a Recovery RG (RRG). The idea is to update the Maximal Output Admissible Set (MAS) and compute a constraint-admissible input that recovers the system from constraint violation at steady-state. The proposed RRG overcomes some of the limitations of standard RG schemes, and maintains their desirable features such as formulation simplicity and finite time determination of the MAS. We validate this new scheme by simulating a linearized turbocharged gasoline engine affected by additive disturbances.
|
|
WeC14 Regular Session, Room 405 |
Add to My Program |
Robust Control III |
|
|
Chair: Regruto, Diego | Politecnico Di Torino |
Co-Chair: Bashash, Saeid | San Jose State University |
|
16:00-16:20, Paper WeC14.1 | Add to My Program |
IQC-Based Robustness Analysis with Time-Varying Multipliers |
Fry, J. Micah | Virginia Tech |
Farhood, Mazen | Virginia Tech |
Keywords: Robust control, Time-varying systems, Uncertain systems
Abstract: This work deals with the use of time-varying integral quadratic constraint (IQC) multipliers when conducting robustness analysis. The main result enables robustness analysis of interconnections where the nominal plant and the IQC multiplier are general time-varying linear systems. When the nominal plant and the IQC multiplier are eventually periodic (not necessarily of the same period), robustness analysis can be accomplished by solving a finite-dimensional semidefinite program. Time-varying IQC multipliers are beneficial in analysis because they (1) provide the possibility of reducing conservatism and (2) are capable of expressing uncertainties which have unique characteristics in the time domain.
|
|
16:20-16:40, Paper WeC14.2 | Add to My Program |
Efficient and Safe Exploration in Deterministic Markov Decision Processes with Unknown Transition Models |
Biyik, Erdem | Stanford University |
Margoliash, Jonathan | UC San Diego |
Alimo, Shahrouz | NASA Jet Propulsion Laboratory (JPL) |
Sadigh, Dorsa | Stanford University |
Keywords: Robust control, Uncertain systems, Autonomous robots
Abstract: We propose a safe exploration algorithm for deterministic Markov Decision Processes with unknown transition models. Our algorithm guarantees safety by leveraging Lipschitz-continuity to ensure that no unsafe states are visited during exploration. Unlike many other existing techniques, the provided safety guarantee is deterministic. Our algorithm is optimized to reduce the number of actions needed for exploring the safe space. We demonstrate the performance of our algorithm in comparison with baseline methods in simulation on navigation tasks.
|
|
16:40-17:00, Paper WeC14.3 | Add to My Program |
Structured Robust Synthesis with Parameter-Dependent D-Scales |
Patartics, Bálint | Institute for Computer Science and Control, Hungarian Academy Of |
Seiler, Peter | University of Minnesota |
Vanek, Balint | MTA SZTAKI |
Keywords: Robust control, Uncertain systems, Optimal control
Abstract: Structured robust control synthesis has been actively researched in recent years. The advantage of any structured design technique is that it is capable of bringing advanced optimization-based methods to real-life applications. Drawing on a recently published paper, a novel algorithm is presented for structured control synthesis against mixed uncertainty. The method is iterative, alternating between collecting worst-case perturbation samples of the parametric uncertainty, and designing a controller for all the samples. During the synthesis procedure, the controller is designed for a set of plants with structured dynamic uncertainty employing a process similar to the classical D-K iteration. The key feature of this algorithm is that separate D-scales are assigned to the individual samples. Two numerical examples are provided, one specifically chosen to highlight the advantage of this approach.
|
|
17:00-17:20, Paper WeC14.4 | Add to My Program |
H_infty Mixed-Sensitivity Design with Fixed Structure Controller through Putinar Positivstellensatz |
Cerone, Vito | Politecnico Di Torino |
Razza, Valentino | Politecnico Di Torino |
Regruto, Diego | Politecnico Di Torino |
Keywords: H-infinity control, Robust control
Abstract: In this paper we describe a novel approach for H_infty mixed-sensitivity design with fixed structure controller. We introduce the feasible controller set as the set of controllers, within a given class, which guarantees fulfillment of requirements on robust stability and nominal performances for the closed loop system. We formulate the H_infty problem as a non convex optimization problem. Results on Putinar positivstellensatz and convex relaxation techniques are exploited to check the feasibility of the problem, thus the existence of a suitable controller, and to extract the desired parameters from the feasible controller set.
|
|
17:20-17:40, Paper WeC14.5 | Add to My Program |
Clustering-Based Control Optimization of Hard Disk Drive Servo System for Population-Level Performance Enhancement |
Bashash, Saeid | San Jose State University |
Shariat, Shahriar | San Jose State University |
Keywords: Data storage systems, Pattern recognition and classification, Robust control
Abstract: This paper presents a data-driven control design framework for population-level robustness and performance enhancement in hard disk drives (HDDs). First, a frequency-domain control design scheme is presented, where the stability, robustness, and performance properties of the closed-loop system are simultaneously optimized through a numerical optimization scheme. The validity of the controller is verified through a time-domain simulation. Then, a clustering-based control optimization framework is proposed to further improve the population-level performance of the system. Simulation results indicate that plant clustering based on the spectral frequency response data provides an effective solution for designing high-performance servo controllers for the HDDs.
|
|
17:40-18:00, Paper WeC14.6 | Add to My Program |
Crank Angle Based Active Disturbance Rejection Control for a Marine Diesel Engine |
Wang, Runzhi | Harbin Engineering University |
Li, Xuemin | Harbin Engineering University |
Ahmed, Qadeer | The Ohio State University |
Zhang, Jian | Harbin Engineering University |
Liu, Yufei | Harbin Engineering University |
Ma, Xiuzhen | College of Power and Energy, Harbin Engineering University |
Keywords: Maritime control, Robust control, Observers for nonlinear systems
Abstract: Internal combustion (IC) engines are typical event-triggered system, which makes it an advantage to design controller in the crank-angle (CA) domain rather than in the time domain. The general active disturbance rejection control (ADRC) where the sampling and control are executed at equidistant intervals in time domain has drawn a lot of attention in the last two decades. However, there is no paper that studies the application of ADRC algorithm based on the CA domain in IC engines. In this paper, a CA based ADRC controller is designed for the speed control of a marine engine. Extensive comparative simulations are given to assess the outstanding control effect of the proposed controller.
|
|
WeC15 Regular Session, Room 406 |
Add to My Program |
Consensus and Formation Control |
|
|
Chair: Mohammadi, Arash | Concordia University |
Co-Chair: Ishii, Hideaki | Tokyo Institute of Technology |
|
16:00-16:20, Paper WeC15.1 | Add to My Program |
Directed Formation Control of N Planar Agents with Distance and Area Constraints |
Liu, Tairan | Louisiana State University |
de Queiroz, Marcio | Louisiana State University |
Zhang, Pengpeng | Louisiana State University |
Khaledyan, Milad | The University of New Mexico |
Keywords: Agents-based systems, Multivehicle systems, Stability of nonlinear systems
Abstract: In this paper, we take a first step towards generalizing a recently proposed method for dealing with the problem of convergence to incorrect equilibrium points of distance-based formation controllers. Specifically, we introduce a distance and area-based scheme for the formation control of n-agent systems in two dimensions using directed graphs and the single-integrator model. We show that under certain conditions on the edge lengths of the triangulated desired formation, the control ensures almost-global convergence to the correct formation.
|
|
16:20-16:40, Paper WeC15.2 | Add to My Program |
Performance Constrained Distributed Event-Triggered Consensus in Multi-Agent Systems |
Amini, Amir | Concordia University |
Zeinali, Zahra | Tarbiat Modares University |
Asif, Amir | Concordia University |
Mohammadi, Arash | Concordia University |
Keywords: Agents-based systems, Networked control systems, Robust control
Abstract: The paper proposes a distributed event-triggered consensus approach for linear multi-agent systems with guarantees over rate of convergence, resilience to control gain uncertainties, and Pareto optimality of design parameters, namely, the event-triggering threshold (ET) and control gain. The event-triggered consensus problem is first converted to stability problem of an equivalent system. The Lyapunov stability theorem is then used to incorporate the performance constraints with the event-triggered consensus. Using an approximated linear scalarization method, the ET and control gain are designed simultaneously from a convex constrained optimization. The optimization step can be performed locally, i.e., no global information is required. The effectiveness of the proposed approach is studied through simulations for an experimental multi-agent system.
|
|
16:40-17:00, Paper WeC15.3 | Add to My Program |
Statistical Privacy in Distributed Average Consensus on Bounded Real Inputs |
Gupta, Nirupam | University of Maryland |
Katz, Jonathan | University of Maryland |
Chopra, Nikhil | University of Maryland, College Park |
Keywords: Agents-based systems, Sensor fusion, Cooperative control
Abstract: This paper proposes a privacy protocol for distributed average consensus algorithms on bounded real-valued inputs that guarantees statistical privacy of honest agents' inputs against colluding (passive adversarial) agents, if the set of colluding agents is not a vertex cut in the underlying communication network. This implies that privacy of agents' inputs is preserved against t number of arbitrary colluding agents if the connectivity of the communication network is at least (t+1). A similar privacy protocol has been proposed for the case of bounded integral inputs in our previous paper~cite{gupta2018information}. However, many applications of distributed consensus concerning distributed control or state estimation deal with real-valued inputs. Thus, in this paper we propose an extension of the privacy protocol in~cite{gupta2018information}, for bounded real-valued agents' inputs, where bounds are known apriori to all the agents.
|
|
17:00-17:20, Paper WeC15.4 | Add to My Program |
Resilient Consensus through Asynchronous Event-Based Communication |
Wang, Yuan | Tokyo Institute of Technology |
Ishii, Hideaki | Tokyo Institute of Technology |
Keywords: Agents-based systems, Cooperative control, Fault tolerant systems
Abstract: We consider resilient versions of discrete-time multi-agent consensus in the presence of faulty or even malicious agents in the network. In particular, we develop event-triggered update rules which can mitigate the influence of the malicious agents and at the same time reduce the necessary communication. Each regular agent updates its state based on a given rule using its neighbors' information. Only when the triggering condition is satisfied, the regular agents send their current states to their neighbors. Otherwise, the neighbors will continue to use the state received the last time. Assuming that a bound on the number of malicious nodes is known, we propose two update rules with event-triggered communication. They follow the so-called mean subsequence reduced (MSR) type algorithms and ignore values received from potentially malicious neighbors. We provide full characterizations for the necessary connectivity in the network for the algorithms to perform correctly, which are stated in terms of the notion of graph robustness. A numerical example is provided to demonstrate the effectiveness of the proposed approach.
|
|
17:20-17:40, Paper WeC15.5 | Add to My Program |
Distributed Leader-Follower Tracking Control for Multi-Agent Systems Subject to Disturbances |
Yan, Chuan | University of Kansas |
Fang, Huazhen | University of Kansas |
Keywords: Agents-based systems, Communication networks, Uncertain systems
Abstract: This paper studies robust tracking control for a leader follower multi-agent system (MAS) subject to disturbances. A challenging problem is considered here, which differs from those in the literature in two aspects. First, we consider the case when all the leader and follower agents are affected by disturbances, while the existing studies assume only the followers to suffer disturbances. Second, we assume the disturbances to be bounded only in rates of change rather than magnitude as in the literature. To address the new challenges, we propose a novel observer-based distributed tracking control design. As a distinguishing feature, the followers can cooperatively estimate the disturbance affecting the leader through to adjust their maneuvers accordingly, which is enabled by the design of first-of-its kind distributed disturbance observer. We build a specific approach for MASs. Further, we prove that they lead to bounded-error tracking for the considered context and further, asymptotically convergent tracking under under a mild relaxation of disturbance setting. We validate the proposed approach using a simulation example.
|
|
17:40-18:00, Paper WeC15.6 | Add to My Program |
Distributed Average Consensus Over Random Networks |
Alaviani, Seyyed Shaho | Iowa State University |
Elia, Nicola | University of Minnesota |
Keywords: Agents-based systems, Stochastic systems, Switched systems
Abstract: In this paper, the distributed consensus problem of multi-agent networked systems is considered where agents make decisions using local information in the presence of random communication topologies. This problem is included in the framework given in cite{alavianiTAC}-cite{alavseattle} that allows random interconnection topologies to have distributions possibly depending on each other or time. It is shown that the random Krasnoselskii-Mann iterative algorithm converges almost surely and in mean square to the average of initial states of the agents under suitable assumptions. The algorithm does not require the distribution of random interconnection topologies or B-connectivity assumption for convergence. Therefore, it applies to asynchronous updates or/and unreliable communication protocols. We also show that the algorithm converges for synchronous updates when the weighted graph matrix is periodic and irreducible. It is shown that the agents interact among themselves to approach the consensus subspace in such a way that the projection of their states onto the consensus subspace at each time is equal to the average of their initial states. Eventually, a numerical example is given to exhibit the results.
|
|
WeC16 Regular Session, Room 407 |
Add to My Program |
Markov Processes II |
|
|
Chair: Yin, Yanyan | Curtin University |
Co-Chair: Halder, Abhishek | University of California, Santa Cruz |
|
16:00-16:20, Paper WeC16.1 | Add to My Program |
Mesh-Based Methods for Quantifying and Improving Robustness of a Planar Biped Model to Random Push Disturbances |
Talele, Nihar | University of California at Santa Barbara |
Byl, Katie | University of California at Santa Barbara |
Keywords: Markov processes, Robotics, Reduced order modeling
Abstract: In this paper, we apply meshing tools to improve and analyze the performance of a 5-link planar biped model to random push perturbations. Creating a mesh for a 14-dimensional state space would typically be infeasible. However, as we show in this paper, low level controllers can restrict the reachable space of the system to a much lower dimensional manifold, which makes it possible to apply our tools to improve the performance. To validate the effectiveness of our tools in analyzing, quantifying and improving the performance of a system, we conduct simulations on two different sets of trajectories: one consisting of trajectories having only a single support phase, and a second set consisting of trajectories having both a double support as well as a single support phase.
|
|
16:20-16:40, Paper WeC16.2 | Add to My Program |
H-Infinity Constraint Pareto Suboptimal Static Output Feedback Strategy for Uncertain Markov Jump Linear Stochastic Systems |
Mukaidani, Hiroaki | Hiroshima University |
Xu, Hua | Univ. of Tsukuba |
Keywords: Markov processes, Robust control, Game theory
Abstract: This paper considers H-infinity constraint Pareto suboptimal control problems for a class of uncertain Markov jump linear stochastic systems (UMJLSSs) via static output feedback (SOF). The conditions for existence of a Pareto suboptimal strategy set are defined with a set of cross-coupled stochastic algebraic Riccati type inequalities (CCSARIs). The optimality conditions for the guaranteed cost are established using the Karush-Kuhn-Tucker (KKT) condition. These conditions are expressed as a set of cross-coupled stochastic algebraic Riccati type equations (CCSAREs). Finally, a simple numerical example is provided to demonstrate reliability and usefulness of the proposed strategy set.
|
|
16:40-17:00, Paper WeC16.3 | Add to My Program |
Stability Analysis of Opinion Dynamics Over Influence Networks |
Askarzadeh, Zahra | University of California, Irvine |
Fu, Rui | University of California, Irvine |
Halder, Abhishek | University of California, Santa Cruz |
Chen, Yongxin | Georgia Institute of Technology |
Georgiou, Tryphon T. | University of California, Irvine |
Keywords: Markov processes, Stability of nonlinear systems, Networked control systems
Abstract: We consider models of social interactions where the state of the ensemble is represented by a probability vector, and the dynamics account for coupling between individual agents and the ensemble. Such models for social exchanges take the form of a nonlinear Markov chain, a slight misnomer that refers to discrete space interacting particles (agents), and where the transition mechanism is akin to McKean-Vlasov dynamics. In this paper we advance an approach to stability analysis for such systems where the l1-norm on probability vectors effectively serves as Lyapunov function. Sufficient conditions for stability may be ascertained based on the entry-wise positivity of the Jacobian map of the nonlinear state-transition law. This approach has apparent links to recent advances addressing monotone maps and differential positive systems. We propose general group of models for opinion dynamics based on DeGroot-Friedkin model and analyze their stability properties, and discuss various generalizations.
|
|
17:00-17:20, Paper WeC16.4 | Add to My Program |
Robust Filtering for Markov Jump Systems by Randomized Algorithm Approach |
Yin, Yanyan | Curtin University |
Liu, Yanqing | Jiangnan University |
Luan, Xiaoli | Institute of Automation, Jiangnan University |
Wang, Song | Department of Mathematics and Statistics, Curtin University |
Liu, Fei | Jiangnan University |
Keywords: Markov processes, Stochastic systems, Filtering
Abstract: The issue of probabilistic filtering for a class of Markov jump systems with random uncertain parameters is addressed. A scenario random approach is proposed for designing a probabilistic filter to achieve probabilistic stochastic stabilization, and satisfying an L_{2}-L_{infty} disturbance rejection performance requirement. In Particular, conditions on which the resulting filter based system is stochastically asymptotically stable with a confidence level are established.
|
|
17:20-17:40, Paper WeC16.5 | Add to My Program |
A Vehicle Routing Problem with Dynamic Demands and Restricted Failures Solved Using Stochastic Predictive Control |
Liu, Kang | University of Michigan, Ann Arbor |
Li, Nan | University of Michigan |
Kolmanovsky, Ilya V. | The University of Michigan |
Girard, Anouck | University of Michigan, Ann Arbor |
Keywords: Constrained control, Markov processes, Optimization
Abstract: In this paper, we describe a vehicle routing problem representing real-time route scheduling for an agent delivering services to customers where the service demands are dynamically evolving. A failure is defined as an occurrence of service demand overload at a customer location. A stochastic predictive control algorithm applied to a partially observable Markov decision process model is used to solve the routing problem, minimizing the service agent’s travel effort while maintaining the occurrence rate of failures to be low.
|
|
17:40-18:00, Paper WeC16.6 | Add to My Program |
Information-Guided Temporal Logic Inference with Prior Knowledge |
Xu, Zhe | University of Texas, Austin |
Ornik, Melkior | University of Illinois at Urbana-Champaign |
Julius, Agung | Rensselaer Polytechnic Institute |
Topcu, Ufuk | The University of Texas at Austin |
Keywords: Pattern recognition and classification, Markov processes, Automata
Abstract: This paper investigates the problem of inferring knowledge from data that is interpretable and informative to humans who have prior knowledge. Specifically, given a dataset as a collection of system trajectories, we infer parametric linear temporal logic (pLTL) formulas that are informative and satisfied by the trajectories in the dataset with high probability. The informativeness of the inferred formula is measured by the information gain with respect to given prior knowledge represented by a prior probability distribution. We first present two algorithms to compute the information gain with a focus on two types of prior probability distributions: stationary probability distributions and probability distributions governed by discrete time Markov chains. Then we provide a heuristic method to solve the inference problem for a subset of pLTL formulas with polynomial time complexity with respect to the number of Boolean connectives in the formula. We provide implementations of the proposed approach on explaining anomalous patterns, patterns changes and explaining the policies of Markov decision processes.
|
|
WeC17 Regular Session, Room 408 |
Add to My Program |
Algebraic and Geometric Methods |
|
|
Chair: Jungers, Raphaël M. | University of Louvain |
Co-Chair: Colombo, Leonardo Jesus | Consejo Superior De Investigaciones Científicas (CSIC) |
|
16:00-16:20, Paper WeC17.1 | Add to My Program |
Parametric Resonant Control of Macroscopic Behaviors of Multiple Oscillators |
Xie, Pengcheng | Xi'an Jiaotong University |
Tao, Molei | Georgia Institute of Technology |
Keywords: Algebraic/geometric methods
Abstract: Consider a finite collection of oscillators, which a user has limited means to perturb due to physical restrictions. We show that as long as the stiffness parameters of these oscillators can be harmonically perturbed, one can design a single shared perturbation, such that macroscopic trajectory tracking is achieved independently in each oscillator; that is, the oscillation amplitudes of all oscillators will approximate, respectively, an arbitrary collection of target functions. This control mechanism is based on the dynamical phenomenon of parametric resonance, which not only permits both increase and decrease of the oscillation amplitude by design, but also the simultaneous control of multiple oscillators with distinct intrinsic frequencies. A simulated animation of a remotely-powered-and-controlled array of circuits illustrates the efficacy of this control. Oscillators that can be controlled by this mechanism are not limited to harmonic ones, but those subject to additional weak damping, noise, and nonlinearity.
|
|
16:20-16:40, Paper WeC17.2 | Add to My Program |
Non-Local Linearization of Nonlinear Differential Equations Via Polyflows |
Jungers, Raphaël M. | University of Louvain |
Tabuada, Paulo | University of California at Los Angeles |
Keywords: Algebraic/geometric methods, Computational methods, Stability of nonlinear systems
Abstract: Motivated by the mathematics literature on the algebraic properties of so-called “polynomial vector flows”, we propose a technique for approximating nonlinear differential equations by linear differential equations. Although the idea of approximating nonlinear differential equations with linear ones is not new, we propose a new approximation scheme that captures both local as well as global properties. This is achieved via a hierarchy of approximations, where the Nth degree of the hierarchy is a linear differential equation obtained by globally approximating the Nth Lie derivatives of the trajectories. We show how the proposed approximation scheme has good approximating capabilities both with theoretical results and empirical observations. In particular, we show that our approximation has convergence range at least as large as a Taylor approximation while, at the same time, being able to account for asymptotic stability (a nonlocal behavior). We also compare the proposed approach with recent and classical work in the literature.
|
|
16:40-17:00, Paper WeC17.3 | Add to My Program |
What Is the Koopman Operator? a Simplified Treatment for Discrete-Time Systems |
Bruce, Adam | University of Michigan |
Zeidan, Vera | Michagan State Univ |
Bernstein, Dennis S. | Univ. of Michigan |
Keywords: Algebraic/geometric methods, Control education
Abstract: This paper provides an introduction to the discrete-time Koopman operator for nonexperts, including a treatment of the basic definitions and properties of the Koopman operator and a numerical method for approximating the Koopman spectrum. Furthermore, the paper stresses the role of compositional completeness for spaces of Koopman observables and gives conditions under which the Lp spaces are compositionally complete. Numerical examples are given to illustrate the basic concepts.
|
|
17:00-17:20, Paper WeC17.4 | Add to My Program |
On Modal Properties of the Koopman Operator for Nonlinear Systems with Symmetry |
Mesbahi, Afshin | University of Washington |
Bu, Jingjing | University of Washington |
Mesbahi, Mehran | University of Washington |
Keywords: Network analysis and control, Control of networks, Algebraic/geometric methods
Abstract: This paper explores how symmetry in nonlinear dynamical systems is reflected in the modal properties of the corresponding Koopman operator. We first observe that symmetry in the dynamics is reflected in the symmetry of the Koopman eigenfunctions, as well as presence of repeated Koopman eigenvalues. Next, we show that the resulting infinite-dimensional linear system (constructed using independent Koopman eigenfunctions) also has an inherent symmetry. The proposed results are supported by an analytical example.
|
|
17:20-17:40, Paper WeC17.5 | Add to My Program |
Optimal Trajectory Tracking of Nonholonomic Mechanical Systems: A Geometric Approach |
Nayak, Aradhana | IIT Bombay |
Rodrigo, Sato de Almagro | ICMAT-CSIC |
Colombo, Leonardo Jesus | Consejo Superior De Investigaciones Científicas (CSIC) |
Martin de Diego, David | High Council for Scientific Research |
Keywords: Algebraic/geometric methods, Nonholonomic systems, Optimal control
Abstract: We study the tracking of a trajectory for a nonholonomic system by recasting the problem as an optimal control problem. The cost function is chosen to minimize the error in positions and velocities between the trajectory of a nonholonomic system and the desired reference trajectory evolving on the distribution which defines the nonholonomic constraints. We propose a geometric framework since it describes the class of nonlinear systems under study in a coordinate-free framework. Necessary conditions for the existence of extrema are determined by the Pontryagin Minimum Principle. A nonholonomic fully actuated particle is used as a benchmark example to show how the proposed method is applied.
|
|
17:40-18:00, Paper WeC17.6 | Add to My Program |
Trajectory Generation on SE(3) for an Underactuated Vehicle with Pointing Direction Constraints |
Dhullipalla, Mani Hemanth | University of Alberta |
Hamrah, Reza | Syracuse University |
Warier, Rakesh R | Indian Institute of Science |
Sanyal, Amit | Syracuse University |
Keywords: Algebraic/geometric methods, Variational methods, Autonomous systems
Abstract: This paper addresses the problem of generating a position trajectory with pointing direction constraints at waypoints for underactuated unmanned vehicles. The problem is initially posed on the configuration space R3 x S2 which, after suitable modifications, is re-posed as a problem on the Lie group SE(3). This is done by determining a vector orthogonal to the pointing direction and using it as the vehicle’s thrust direction. This translates to converting reduced attitude constraints to full attitude constraints at the waypoints. For the position trajectory, in addition to position constraints, this modification adds acceleration constraints at the waypoints. For real-time implementation with low computational expenses, a linearquadratic regulator (LQR) approach is adopted to design the position trajectory with smoothness up to the fourth time derivative of position (snap). For the attitude trajectory, the thrust direction is extracted from the position trajectory and used to propagate the attitude in time, and then correct it over time to achieve the desired attitude at the waypoints. Finally, numerical simulation results are presented to validate the trajectory generation scheme.
|
|
WeC18 Regular Session, Room 409 |
Add to My Program |
Power Systems III |
|
|
Chair: Mallada, Enrique | Johns Hopkins University |
Co-Chair: Nagarajan, Harsha | Los Alamos National Laboratory |
|
16:00-16:20, Paper WeC18.1 | Add to My Program |
Characterizing the Nonlinearity of Power System Generator Models |
Nugroho, Sebastian Adi | The University of Texas at San Antonio |
Taha, Ahmad | University of Texas at San Antonio |
Qi, Junjian | University of Central Florida |
Keywords: Power systems, Smart grid, Observers for nonlinear systems
Abstract: Power system dynamics are naturally nonlinear. The nonlinearity stems from power flows, generator dynamics, and electromagnetic transients. Characterizing the nonlinearity of the dynamical power system model is useful for designing superior estimation and control methods, providing better situational awareness and system stability. In this paper, we consider the synchronous generator model with a phasor measurement unit (PMU) that is installed at the terminal bus of the generator. The corresponding nonlinear process-measurement model is shown to be locally Lipschitz, i.e., the dynamics are limited in how fast they can evolve in an arbitrary compact region of the state-space. We then investigate different methods to compute Lipschitz constants for this model, which is vital for performing dynamic state estimation (DSE) or state-feedback control using Lyapunov theory. In particular, we compare a derived analytical bound with numerical methods based on low discrepancy sampling algorithms. Applications of the computed bounds to dynamic state estimation are showcased. The paper is concluded with numerical tests.
|
|
16:20-16:40, Paper WeC18.2 | Add to My Program |
Adaptive Packet Dropout Compensator for Wide-Area Damping Control: A MIMO Observer-Driven Reduced Copy Approach |
Chaudhuri, Nilanjan Ray | Penn State |
Yogarathinam, Amirthagunaraj | EE |
Keywords: Power systems, Smart grid, Power electronics
Abstract: Wide-Area Measurement and Control Systems (WAMCSs) will have a significant impact on a smart power grid implementation to enhance the power system stability. The dynamic performance of such WAMCSs can significantly deteriorate in presence of data dropout in the remote feedback signals from Phasor Measurement Units. Consideration of such an issue is important for any networked control system for ensuring efficient and reliable operation. To that end, in this paper, a new multi-input multi-output (MIMO) Observerdriven Reduced Copy (ORC) i.e. MIMO-ORC architecture is proposed for wide-area damping control using multiple doubly fed induction generator-based wind farms to mitigate the issue of packet dropout with multiple feedback signals. In this context, the concepts of cyber-physical self-coupling and cross-coupling are introduced and their impact on deterioration of closedloop performance with data dropout is quantified through an analytical derivation. A framework for stability analysis of MIMO-ORC architecture is also presented. Finally, time-domain simulations show superiority of the proposed approach over its single-input single-output (SISO) ORC counterpart in a WAMCS for power grid.
|
|
16:40-17:00, Paper WeC18.3 | Add to My Program |
Designing Power Grid Topologies for Minimizing Network Disturbances: An Exact MILP Formulation |
Bhela, Siddharth | Virginia Tech |
Deka, Deepjyoti | Los Alamos National Lab |
Nagarajan, Harsha | Los Alamos National Laboratory |
Kekatos, Vassilis | Virginia Tech |
Keywords: Power systems, Stability of linear systems, Optimization
Abstract: The dynamic response of power grids to small transient events or persistent stochastic disturbances influences their stable operation. This paper studies the effect of topology on the linear time-invariant dynamics of power networks. For a variety of stability metrics, a unified framework based on the H2-norm of the system is presented. The proposed framework assesses the robustness of power grids to small disturbances and is used to study the optimal placement of new lines on existing networks as well as the design of radial (tree) and meshed (loopy) topologies for new networks. Although the design task can be posed as a mixed-integer semidefinite program (MI-SDP), its performance does not scale well with network size. Using McCormick relaxation, the topology design problem can be reformulated as a mixed-integer linear program (MILP). To improve the computation time, graphical properties are exploited to provide tighter bounds on the continuous optimization variables. Numerical tests on the IEEE 39-bus feeder demonstrate the efficacy of the optimal topology in minimizing disturbances.
|
|
17:00-17:20, Paper WeC18.4 | Add to My Program |
Voltage Collapse Stabilization in Star DC Networks |
Avraam, Charalampos | Johns Hopkins University |
Rines, Jesse | Johns Hopkins University |
Sarker, Aurik | Johns Hopkins University |
Paganini, Fernando | Universidad ORT Uruguay |
Mallada, Enrique | Johns Hopkins University |
Keywords: Power systems, Stability of nonlinear systems, Cooperative control
Abstract: Voltage collapse is a type of blackout-inducing dynamic instability that occurs when the power demand exceeds the maximum power that can be transferred through the network. The traditional (preventive) approach to avoid voltage collapse is based on ensuring that the network never reaches its maximum capacity. However, such an approach leads to inefficiencies as it prevents operators to fully utilize the network resources and does not account for unprescribed events. o overcome this limitation, this paper seeks to initiate the study of voltage collapse stabilization. More precisely, for a DC star network, we formulate the problem of voltage stability as a dynamic problem where each load seeks to achieve a constant power consumption by updating its conductance as the voltage changes. We show that such a system can be interpreted as a game, where each player (load) seeks to myopically maximize their utility using a gradient-based response. Using this framework, we show that voltage collapse is the unique Nash Equilibrium of the induced game and is caused by the lack of cooperation between loads. Finally, we propose a Voltage Collapse Stabilizer (VCS) controller that uses (flexible) loads that are willing to cooperate and provides a fair allocation of the curtailed demand. Our solution stabilizes voltage collapse even in the presence of non-cooperative loads. Numerical simulations validate several features of our controllers.
|
|
17:20-17:40, Paper WeC18.5 | Add to My Program |
A Performance and Stability Analysis of Low-Inertia Power Grids with Stochastic System Inertia |
Guo, Yi | University of Texas at Dallas |
Summers, Tyler H. | University of Texas at Dallas |
Keywords: Power systems, Stochastic systems, Smart grid
Abstract: Traditional synchronous generators with rota- tional inertia are being replaced by low-inertia renewable energy resources (RESs) in many power grids and operational scenarios. Due to emerging market mechanisms, inherent vari- ability of RESs, and existing control schemes, the resulting system inertia levels can not only be low but also markedly time-varying. In this paper, we investigate performance and stability of low-inertia power systems with stochastic system inertia. In particular, we consider system dynamics modeled by a linearized stochastic swing equation, where stochastic system inertia is regarded as multiplicative noise. The H2 norm is used to quantify the performance of the system in the presence of per- sistent disturbances or transient faults. The performance metric can be computed by solving a generalized Lyapunov equation, which has fundamentally different characteristics from systems with only additive noise. For grids with uniform inertia and damping parameters, we derive closed-form expressions for the H2 norm of the proposed stochastic swing equation. The analysis gives insights into how the H2 norm of the stochastic swing equation depends on 1) network topology; 2) system parameters; and 3) distribution parameters of disturbances. A mean-square stability condition is also derived. Numerical results provide additional insights for performance and stability of the stochastic swing equation.
|
|
17:40-18:00, Paper WeC18.6 | Add to My Program |
Nonlinear Control Strategy of Single Phase Half Bridge Shunt Active Power Filter Interfacing Renewable Energy Source and Grid |
Hekss, Zineb | Hassan II University of Casablanca, Faculty of Sciences Ben M'si |
Lachkar, Ibtissam | ENSEM, Hassan II University of Casablanca, Morocco |
Abouloifa, Abdelmajid | EMI |
Echalih, Salwa | Hassan II University of Casablanca, Faculty of Sciences Ben M'si |
Aourir, Meriem | LTI Lab, Faculty of Sciences Ben M'sik, Hassan II University Of |
Giri, Fouad | University of Caen Normandie |
Keywords: Control applications, Energy systems, Power systems
Abstract: In this paper, we are considering the problem of controlling single phase shunt active power filter integrated with the PV system through a half bridge inverter. We seek a control strategy that meets, simultaneously, the following two control objectives: (i) imposing the voltage in the output of PV panel to track a reference provided by the MPPT block in order to guarantee the power exchange between the source and AC grid; (ii) ensuring a satisfactory power factor correction (PFC) by compensating the harmonic and reactive currents introduced by the nonlinear load. The considered problem is dealt with using a double-loop controller developed and based on an averaged nonlinear model. The inner loop is designed using a sliding mode approach in order to achieve power factor correction. A proportional-integral PI regulator is used in the outer loop to guarantee the MPPT issue with a well-known Incremental Conductance algorithm. Finally, it is formally demonstrated, through theoretical analysis and simulation results under MatlabSimulinkSimPowerSystems, that the proposed design controller does achieve its objectives.
|
| |