Data-driven adaptive model-based predictive control with application in wastewater systems

This study is concerned with the development of a new data-driven adaptive model-based predictive controller (MBPC) with input constraints. The proposed methods employ subspace identification technique and a singular value decomposition (SVD)-based optimisation strategy to formulate the control algorithm and incorporate the input constraints. Both direct adaptive model-based predictive controller (DAMBPC) and indirect adaptive model-based predictive controller (IAMBPC) are considered. In DAMBPC, the direct identification of controller parameters is desired to reduce the design effort and computational load while the IAMBPC involves a two-stage process of model identification and controller design. The former method only requires a single QR decomposition for obtaining the controller parameters and uses a receding horizon approach to process input/output data for the identification. A suboptimal SVD-based optimisation technique is proposed to incorporate the input constraints. The proposed techniques are implemented and tested on a fourth order non-linear model of a wastewater system. Simulation results are presented to compare the direct and indirect adaptive methods and to demonstrate the performance of the proposed algorithms

Improvement of a Fixed Point Transformations and SVD-based Adaptive Controller

In this paper some refinement of a novel control approach is reported that fits to the “traditional line of thinking” according to which in the most practical cases neither very precise, nor even complete system model is needed for obtaining precise control for dynamical systems. The validity of this statement is briefly pointed out in the most popular approaches as the main idea of the “Robust Sliding Mode / Variable Structure Controllers”, in the Adaptive Inverse Dynamics and in the Slotine-Li Adaptive Controllers based on Lyapunov's 2nd Method, and in a recently published problem tackling using the simple geometric interpretation of the Singular Value Decomposition (SVD). In the present approach the originally proposed convergent, iterative Cauchy sequences are nonlinearly moderated to adaptively control a coupled nonlinear system, the cart plus double pendulum serving as popular paradigm of dynamicall not very well conditioned systems. It is shown that the proposed moderation removes the small sharp fluctuation in the control torque that inherently belonged to the original solution without significantly degrading the control quality. This statement is substantiated by simulation results.N/

Efficient Recursive Data-enabled Predictive Control: an Application to Consistent Predictors

In the field of model predictive control, the Data-enabled Predictive Controller (DeePC) offers direct predictive control, bypassing traditional modeling. However, challenges emerge with increased computational demand due to recursive I/O data updates. This paper introduces a novel recursive updating mechanism for DeePC. It emphasizes the use of Singular Value Decomposition (SVD) for efficient low-dimensional transformations of DeePC in its general form, as well as a fast SVD update scheme. We apply the mechanism to two data-driven predictors ensuring consistent predictions for open-loop and closed-loop data. Our proposed methodologies' efficacy is validated through simulation studies

Törtrendű deriváltak integrálása nemlineáris rendszerek új lágy számítási eljárásokon alapuló adaptív szabályozásával = Integration of Fractional Order Derivatives in the Adaptive Control of Nonlinear Systems on the Basis of Novel Soft Computing Techniques

A projektben speciális, "Single Input - Single Output" rendszerekre hasonló háromszögeken alapuló adaptív fixpont transzformációs szabályozót dolgoztunk ki és alkalmaztunk nemlineáris paradigmákra (Ball-Beam System, polimerizációs reakció, hidraulikus munkahenger). A következő lépés e módszer robusztus változatának kidolgozása, majd "Multiple Input - Multiple Output" rendszerekre való kétféle általánosítása volt. A frakcionális deriváltak Caputo féle alakjából numerikus közelítéssel bevezettük a frakcionális derivált három paraméteres változatát és a "kezdeti érték" helyett a "kezdeti történet" fogalmát. Megmutattuk, hogy ez disszipatív és gerjedő rendszerek modellezésére is alkalmas. E deriváltat felhasználtuk egész rendű rendszerek szabályozásának javítására és hipotetikus frakcionális rendszerek modellezésére. Kimutattuk, hogy az általunk javasolt adaptív szabályozó e rendszerekre nehézség nélkül alkalmazható. Adaptív szabályozásunkat különféle egész és törtrendű rendszerek szabályozására alkalmaztuk szimulációval. Széles körű szimulációs vizsgálatokkal kimutattuk a legtipikusabb, Lyapunov függvényt használó adaptív módszerek hiányosságait. Végül ezek kiküszöbölésére kidolgoztuk a "Model Reference Adaptive Control" szabályozók új változatát, amely Lyapunov direkt módszere helyett robusztus fixpont transzformációval működik. | In the project special adaptive controllers were proposed for "Single Input - Single Output" systems. It applies similar triangles for formulating the control law. It was successfully applied for nonlinear paradigms as the Ball-Beam System, a polymerization reaction, and a hydraulic cylinder. In the next step the robust version of this method was elaborated, it was generalized for "Multiple Input - Multiple Output" systems in two different ways. Via numerically approximating Caputo's definition of fractional order (FO) systems a three parameters, finite memory generalization of the FO derivatives was proposed with the concept of the "preceding history" instaed of the "initial conditions". It was shown that it can be used for modeling stable dissipative and unstable systems, too. The new fractional derivative was utilized for improving the adaptive control elaborated for integer order systems, and for modeling the fractional order systems. It was shown that the fixed point transformations based control can easily be applied for the adaptive control of such hypothetical systems. Our method was applied for various integer and fractional order systems via simulations. The most important deficiencies of the most popular adaptive methods using Lyapunov's direct method were pointed out. To eliminate these deficiencies a novel approach was elaborated for the "Model Reference Adaptive Control" in which Lyapunov's method is replaced by robust fixed point transformation

Data-driven nonlinear aeroelastic models of morphing wings for control

Accurate and efficient aeroelastic models are critically important for enabling the optimization and control of highly flexible aerospace structures, which are expected to become pervasive in future transportation and energy systems. Advanced materials and morphing wing technologies are resulting in next-generation aeroelastic systems that are characterized by highly-coupled and nonlinear interactions between the aerodynamic and structural dynamics. In this work, we leverage emerging data-driven modeling techniques to develop highly accurate and tractable reduced-order aeroelastic models that are valid over a wide range of operating conditions and are suitable for control. In particular, we develop two extensions to the recent dynamic mode decomposition with control (DMDc) algorithm to make it suitable for flexible aeroelastic systems: 1) we introduce a formulation to handle algebraic equations, and 2) we develop an interpolation scheme to smoothly connect several linear DMDc models developed in different operating regimes. Thus, the innovation lies in accurately modeling the nonlinearities of the coupled aerostructural dynamics over multiple operating regimes, not restricting the validity of the model to a narrow region around a linearization point. We demonstrate this approach on a high-fidelity, three-dimensional numerical model of an airborne wind energy (AWE) system, although the methods are generally applicable to any highly coupled aeroelastic system or dynamical system operating over multiple operating regimes. Our proposed modeling framework results in real-time prediction of nonlinear unsteady aeroelastic responses of flexible aerospace structures, and we demonstrate the enhanced model performance for model predictive control. Thus, the proposed architecture may help enable the widespread adoption of next-generation morphing wing technologies

구조로봇을 위한 강건한 계층적 동작 계획 및 제어

학위논문(박사) -- 서울대학교대학원 : 공과대학 기계항공공학부, 2021.8. 박종우.Over the last several years, robotics has experienced a striking development, and a new generation of robots has emerged that shows great promise in being able to accomplish complex tasks associated with human behavior. Nowadays the objectives of the robots are no longer restricted to the automaton in the industrial process but are changing into explorers for hazardous, harsh, uncooperative, and extreme environments. As these robots usually operate in dynamic and unstructured environments, they should be robust, adaptive, and reactive under various changing operation conditions. We propose online hierarchical optimization-based planning and control methodologies for a rescue robot to execute a given mission in such a highly unstructured environment. A large number of degrees of freedom is provided to robots in order to achieve diverse kinematic and dynamic tasks. However, accomplishing such multiple objectives renders on-line reactive motion planning and control problems more difficult to solve due to the incompatible tasks. To address this problem, we exploit a hierarchical structure to precisely resolve conflicts by creating a priority in which every task is achieved as much as possible according to the levels. In particular, we concentrate on the reasoning about the task regularization to ensure the convergence and robustness of a solution in the face of singularity. As robotic systems with real-time motion planners or controllers often execute unrehearsed missions, a desired task cannot always be driven to a singularity free configuration. We develop a generic solver for regularized hierarchical quadratic programming without resorting to any off-the-shelf QP solver to take advantage of the null-space projections for computational efficiency. Therefore, the underlying principles are thoroughly investigated. The robust optimal solution is obtained under both equality and inequality tasks or constraints while addressing all problems resulting from the regularization. Especially as a singular value decomposition centric approach is leveraged, all hierarchical solutions and Lagrange multipliers for properly handling the inequality constraints are analytically acquired in a recursive procedure. The proposed algorithm works fast enough to be used as a practical means of real-time control system, so that it can be used for online motion planning, motion control, and interaction force control in a single hierarchical optimization. Core system design concepts of the rescue robot are presented. The goals of the robot are to safely extract a patient and to dispose a dangerous object instead of humans. The upper body is designed humanoid in form with replaceable modularized dual arms. The lower body is featured with a hybrid tracked and legged mobile platform to simultaneously acquire versatile manipulability and all-terrain mobility. Thus, the robot can successfully execute a driving task, dangerous object manipulation, and casualty extraction missions by changing the pose and modularized equipments in an optimized manner. Throughout the dissertation, all proposed methods are validated through extensive numerical simulations and experimental tests. We highlight precisely how the rescue robot can execute a casualty extraction and a dangerous object disposal mission both in indoor and outdoor environments that none of the existing robots has performed.최근에 등장한 새로운 세대의 로봇은 기존에는 인간만이 할 수 있었던 복잡한 일을 로봇 또한 수행할 수 있음을 보여주었다. 특히 DARPA Robotics Challenge를 통해 이러한 사실을 잘 확인할 수 있으며, 이 로봇들은 공장과 같은 정형화된 환경에서 자동화된 일을 반복적으로 수행하던 임무에서 더 나아가 극한의 환경에서 인간을 대신하여 위험한 임무를 수행할 수 있는 방향으로 발전하고 있다. 그래서 사람들은 재난환경에서 안전하고 시의 적절하게 대응할 수 있는 여러 가지 대안 중에서 실현 가능성이 높은 대처 방안으로 로봇을 생각하게 되었다. 하지만 이러한 로봇은 동적으로 변화하는 비정형 환경에서 임무를 수행할 수 있어야 하기 때문에 불확실성에 대해 강건해야하고, 다양한 환경 조건에서 능동적으로 반응을 할 수 있어야 한다. 본 학위논문에서는 로봇이 비정형 환경에서 강건하면서도 적응적으로 동작할 수 있는 실시간 최적화 기반의 동작 계획 및 제어 방법과 구조 로봇의 설계 개념을 제안하고자 한다. 인간은 많은 자유도를 가지고 있으며, 하나의 전신 동작을 생성할 때 다양한 기구학 혹은 동역학적 특성을 가지는 세부 동작 혹은 작업을 정의하고, 이를 효과적으로 종합할 수 있다. 그리고 학습을 통해 각 동작 요소들을 최적화할 뿐만 아니라 상황 에 따라 각 동작 요소에 우선순위를 부여하여 이를 효과적으로 결합하거나 분리하여 실시간으로 최적의 동작을 생성하고 제어한다. 즉, 상황에 따라 중요한 동작요소를 우선적으로 수행하고 우선순위가 낮은 동작요소는 부분 혹은 전체적으로 포기하기도 하면서 매우 유연하게 전체 동작을 생성하고 최적화 한다. 인간과 같이 다자유도를 보유한 로봇 또한 기구학과 동역학적 특성을 가지는 다양한 세부 동작 혹은 작업을 작업공간(task space) 혹은 관절공간(configuration space)에서 정의할 수 있으며, 우선순위에 따라 이를 효과적으로 결합하여 전체 동작을 생 성하고 제어할 수 있다. 서로 양립하기 어려운 로봇의 동작 문제를 해결하기 위해 동작들 사이에 우선순위를 부여하여 계층을 생성하고, 이에 따라 로봇의 전신 동작을 구현하는 방법은 오랫동안 연구가 진행되어 왔다. 이러한 계층적 최적화를 이용하면 우선순위가 높은 동작부터 순차적으로 실행하지만, 우선순위가 낮은 동작요소들도 가능한 만족시키는 최적의 해를 찾을 수 있다. 하지만 관절의 구동 범위와 같은 부등식의 조건이 포함된 계층적 최적화 문제에서 특이점에 대한 강건성까지 확보할 수 있는 방법에 대해서는 아직까지 많은 부분이 밝 혀진 바가 없다. 따라서 본 학위논문에서는 등식과 부등식으로 표현되는 구속조건 혹은 동작요소를 계층적 최적화에 동시에 포함시키고, 특이점이 존재하더라도 강건성과 수렴성을 보장하는 관절공간에서의 최적해를 확보하는데 집중한다. 왜나하면 비정형 임무를 수행하는 로봇은 사전에 계획된 동작을 수행하는 것이 아닌 변화하는 환경조건에 따라 실시간으로 동작을 계획하고 제어해야 하기 때문에 특이점이 없는 자세로 로봇을 항상 제어하기가 어렵다. 그리고 이렇게 특이점을 회피하는 방향으로 로봇을 제어하는 것은 로봇의 운용성을 심각하게 저해시킬 수 있다. 특이점 근방에서의 해의 강건성이 보장되지 않으면 로봇 관절에 과도한 속도 혹은 토크가 발생하여 로봇의 임무 수행이 불가능하거나 환경과 로봇의 손상을 초래할 수 있으며, 나아가 로봇과 함께 임무를 수행하는 사람에게 상해를 가할 수도 있다. 특이점에 대한 강건성을 확보하기 위해 우선순위 기반의 계층적 최적화와 정규화 (regularization)를 통합하여 정규화된 계층적 최적화 (RHQP: Regularized Hierarchical Quadratic Program) 문제를 다룬다. 부등식이 포함된 계층적 최적화에 정규화를 동시에 고려함으로써 야기되는 많은 문제점들을 해결하고 해의 최적성과 강건성을 확보할 수 있는 방법을 제안한다. 특히 외부의 최적화 프로그램을 사용하지 않고 수치적 최적화 (numerical optimization) 이론과 우선순위에 기반을 두는 여유자유도 로봇의 해석 기법을 이용하여 계산의 효율성을 극대화할 수 있는 이차 프로그램(quadratic programming)을 제안한다. 또한 이와 동시에 정규화된 계층적 최적화 문제의 이론적 구조를 철저하게 분석한다. 특히 특이값 분해 (singular value decomposition)를 통해 최적해와 부등식 조건을 처리하는데 필요한 라그랑지 승수를 재귀적인 방법으로 해석적 형태로 구함으로써 계산의 효율성을 증대시키고 동시에 부등식의 조건을 오류 없이 정확하게 처리할 수 있도록 하였다. 그리고 정규화된 계층적 최적화를 힘제어까지 확장하여 환경과 로봇의 안전한 상호작용을 보장하여 로봇이 적절한 힘으로 환경과 접촉할 수 있도록 하였다. 불확실성이 존재하는 비정형 환경에서 비정형 임무를 수행할 수 있는 구조로봇의 핵심 설계 개념을 제시한다. 비정형 환경에서의 조작 성능과 이동 성능을 동시에 확보할 수 있는 형상으로 로봇을 설계하여 구조 로봇으로 하여금 최종 목적으로 설정된 인간을 대신하여 부상자를 구조하고 위험물을 처리하는 임무를 효과적으로 수행할 수 있도록 한다. 구조 로봇에 필요한 매니퓰레이터는 부상자 구조 임무와 위험물 처리 임무에 따라 교체 가능한 모듈형으로 설계하여 각각의 임무에 따라 최적화된 매니퓰 레이터를 장착하여 임무를 수행할 수 있다. 하체는 트랙과 관절이 결합된 하이브리드 형태를 취하고 있으며, 주행 임무와 조작임무에 따라 형상을 변경할 수 있다. 형상 변경과 모듈화된 매니퓰레이터를 통해서조작 성능과 험한 지형에서 이동할 수 있는 주행 성능을 동시에 확보하였다. 최종적으로 구조로봇의 설계와 실시간 계층적 제어를 이용하여 비정형 실내외 환경에서 구조로봇이 주행임무, 위험물 조작임무, 부상자 구조 임무를 성공적으로 수 행할 수 있음을 해석과 실험을 통하여 입증함으로써 본 학위논문에서 제안한 설계와 정규화된 계층적 최적화 기반의 제어 전략의 유용성을 검증하였다.1 Introduction 1 1.1 Motivations 1 1.2 Related Works and Research Problems for Hierarchical Control 3 1.2.1 Classical Approaches 3 1.2.2 State-of-the-Art Strategies 4 1.2.3 Research Problems 7 1.3 Robust Rescue Robots 9 1.4 Research Goals 12 1.5 Contributions of ThisThesis 13 1.5.1 Robust Hierarchical Task-Priority Control 13 1.5.2 Design Concepts of Robust Rescue Robot 16 1.5.3 Hierarchical Motion and ForceControl 17 1.6 Dissertation Preview 18 2 Preliminaries for Task-Priority Control Framework 21 2.1 Introduction 21 2.2 Task-Priority Inverse Kinematics 23 2.3 Recursive Formulation of Null Space Projector 28 2.4 Conclusion 31 3 Robust Hierarchical Task-Priority Control 33 3.1 Introduction 33 3.1.1 Motivations 35 3.1.2 Objectives 36 3.2 Task Function Approach 37 3.3 Regularized Hierarchical Optimization with Equality Tasks 41 3.3.1 Regularized Hierarchical Optimization 41 3.3.2 Optimal Solution 45 3.3.3 Task Error and Hierarchical Matrix Decomposition 49 3.3.4 Illustrative Examples for Regularized Hierarchical Optimization 56 3.4 Regularized Hierarchical Optimization with Inequality Constraints 60 3.4.1 Lagrange Multipliers 61 3.4.2 Modified Active Set Method 66 3.4.3 Illustrative Examples of Modified Active Set Method 70 3.4.4 Examples for Hierarchical Optimization with Inequality Constraint 72 3.5 DLS-HQP Algorithm 79 3.6 Concluding Remarks 80 4 Rescue Robot Design and Experimental Results 83 4.1 Introduction 83 4.2 Rescue Robot Design 85 4.2.1 System Design 86 4.2.2 Variable Configuration Mobile Platform 92 4.2.3 Dual Arm Manipulators 95 4.2.4 Software Architecture 97 4.3 Performance Verification for Hierarchical Motion Control 99 4.3.1 Real-Time Motion Generation 99 4.3.2 Task Specifications 103 4.3.3 Singularity Robust Task Priority 106 4.3.4 Inequality Constraint Handling and Computation Time 111 4.4 Singularity Robustness and Inequality Handling for Rescue Mission 117 4.5 Field Tests 122 4.6 Concluding Remarks 126 5 Hierarchical Motion and Force Control 129 5.1 Introduction 129 5.2 Operational Space Control 132 5.3 Acceleration-Based Hierarchical Motion Control 134 5.4 Force Control 137 5.4.1 Force Control with Inner Position Loop 141 5.4.2 Force Control with Inner Velocity Loop 144 5.5 Motion and Force Control 145 5.6 Numerical Results for Acceleration-Based Motion and Force Control 148 5.6.1 Task Specifications 150 5.6.2 Force Control Performance 151 5.6.3 Singularity Robustness and Inequality Constraint Handling 155 5.7 Velocity Resolved Motion and Force Control 160 5.7.1 Velocity-Based Motion and Force Control 161 5.7.2 Experimental Results 163 5.8 Concluding Remarks 167 6 Conclusion 169 6.1 Summary 169 6.2 Concluding Remarks 173 A Appendix 175 A.1 Introduction to PID Control 175 A.2 Inverse Optimal Control 176 A.3 Experimental Results and Conclusion 181 Bibliography 183 Abstract 207박

Adaptive Control and Regret Minimization in Linear Quadratic Gaussian (LQG) Setting

We study the problem of adaptive control in partially observable linear quadratic Gaussian control systems, where the model dynamics are unknown a priori. We propose LqgOpt, a novel reinforcement learning algorithm based on the principle of optimism in the face of uncertainty, to effectively minimize the overall control cost. We employ the predictor state evolution representation of the system dynamics and deploy a recently proposed closed-loop system identification method, estimation, and confidence bound construction. LqgOpt efficiently explores the system dynamics, estimates the model parameters up to their confidence interval, and deploys the controller of the most optimistic model for further exploration and exploitation. We provide stability guarantees for LqgOpt and prove the regret upper bound of O(√T) for adaptive control of linear quadratic Gaussian (LQG) systems, where T is the time horizon of the problem

Optimization for Probabilistic Machine Learning

We have access to great variety of datasets more than any time in the history. Everyday, more data is collected from various natural resources and digital platforms. Great advances in the area of machine learning research in the past few decades have relied strongly on availability of these datasets. However, analyzing them imposes significant challenges that are mainly due to two factors. First, the datasets have complex structures with hidden interdependencies. Second, most of the valuable datasets are high dimensional and are largely scaled. The main goal of a machine learning framework is to design a model that is a valid representative of the observations and develop a learning algorithm to make inference about unobserved or latent data based on the observations. Discovering hidden patterns and inferring latent characteristics in such datasets is one of the greatest challenges in the area of machine learning research. In this dissertation, I will investigate some of the challenges in modeling and algorithm design, and present my research results on how to overcome these obstacles. Analyzing data generally involves two main stages. The first stage is designing a model that is flexible enough to capture complex variation and latent structures in data and is robust enough to generalize well to the unseen data. Designing an expressive and interpretable model is one of crucial objectives in this stage. The second stage involves training learning algorithm on the observed data and measuring the accuracy of model and learning algorithm. This stage usually involves an optimization problem whose objective is to tune the model to the training data and learn the model parameters. Finding global optimal or sufficiently good local optimal solution is one of the main challenges in this step. Probabilistic models are one of the best known models for capturing data generating process and quantifying uncertainties in data using random variables and probability distributions. They are powerful models that are shown to be adaptive and robust and can scale well to large datasets. However, most probabilistic models have a complex structure. Training them could become challenging commonly due to the presence of intractable integrals in the calculation. To remedy this, they require approximate inference strategies that often results in non-convex optimization problems. The optimization part ensures that the model is the best representative of data or data generating process. The non-convexity of an optimization problem take away the general guarantee on finding a global optimal solution. It will be shown later in this dissertation that inference for a significant number of probabilistic models require solving a non-convex optimization problem. One of the well-known methods for approximate inference in probabilistic modeling is variational inference. In the Bayesian setting, the target is to learn the true posterior distribution for model parameters given the observations and prior distributions. The main challenge involves marginalization of all the other variables in the model except for the variable of interest. This high-dimensional integral is generally computationally hard, and for many models there is no known polynomial time algorithm for calculating them exactly. Variational inference deals with finding an approximate posterior distribution for Bayesian models where finding the true posterior distribution is analytically or numerically impossible. It assumes a family of distribution for the estimation, and finds the closest member of that family to the true posterior distribution using a distance measure. For many models though, this technique requires solving a non-convex optimization problem that has no general guarantee on reaching a global optimal solution. This dissertation presents a convex relaxation technique for dealing with hardness of the optimization involved in the inference. The proposed convex relaxation technique is based on semidefinite optimization that has a general applicability to polynomial optimization problem. I will present theoretical foundations and in-depth details of this relaxation in this work. Linear dynamical systems represent the functionality of many real-world physical systems. They can describe the dynamics of a linear time-varying observation which is controlled by a controller unit with quadratic cost function objectives. Designing distributed and decentralized controllers is the goal of many of these systems, which computationally, results in a non-convex optimization problem. In this dissertation, I will further investigate the issues arising in this area and develop a convex relaxation framework to deal with the optimization challenges. Setting the correct number of model parameters is an important aspect for a good probabilistic model. If there are only a few parameters, model may lack capturing all the essential relations and components in the observations while too many parameters may cause significant complications in learning or overfit to the observations. Non-parametric models are suitable techniques to deal with this issue. They allow the model to learn the appropriate number of parameters to describe the data and make predictions. In this dissertation, I will present my work on designing Bayesian non-parametric models as powerful tools for learning representations of data. Moreover, I will describe the algorithm that we derived to efficiently train the model on the observations and learn the number of model parameters. Later in this dissertation, I will present my works on designing probabilistic models in combination with deep learning methods for representing sequential data. Sequential datasets comprise a significant portion of resources in the area of machine learning research. Designing models to capture dependencies in sequential datasets are of great interest and have a wide variety of applications in engineering, medicine and statistics. Recent advances in deep learning research has shown exceptional promises in this area. However, they lack interpretability in their general form. To remedy this, I will present my work on mixing probabilistic models with neural network models that results in better performance and expressiveness of the results