hal-01194766
https://hal.science/hal-01194766
[UNIV-BREST] Université de Bretagne occidentale - Brest (UBO)
[INSTITUT-TELECOM] Institut Mines Télécom
[ENSTA-BRETAGNE] ENSTA Bretagne
[CNRS] CNRS - Centre national de la recherche scientifique
[UNIV-UBS] Université de Bretagne Sud
[ENSTA-BRETAGNE-STIC] Département STIC
[INSMI] CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions
[ENIB] Ecole Nationale d'Ingénieurs de Brest
[LAB-STICC_ENIB] Laboratoire des Sciences et Techniques de l'Information, de la Communication et de la Connaissance, site ENIB Brest
[LAB-STICC] Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
[TDS-MACS] Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes
[INSTITUTS-TELECOM] composantes instituts telecom
$H_\infty$ control synthesis under structural constraints based on Global Optimization
Clement, Benoit
Monnet, Dominique
Ninin, Jordan
[INFO.INFO-RO] Computer Science [cs]/Operations Research [cs.RO]
[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC]
[SPI.AUTO] Engineering Sciences [physics]/Automatic
COMM
Controlling an autonomous vehicle or a robot requires the synthesis of control laws for steering and guiding. To generate efficient control laws, a lot of specifications, constraints and requirements have been translated into norm constraints and then into an constraint feasibility problem. This problem has been solved, sometimes with relaxations, using numerical methods based on LMI (Linear Matrix Inequalities) or SDP (Semi Definite Program). The main limitation of these approaches are the complexity of the controller for implementation in an embedded system. But, if a physical structure is imposed to the law control in order to make easier the implementation, the synthesis of this robust control law is much more complex. And this complexity has been identified as a key issue for several years. A efficient first approach was given by Apkarian and Noll based on local non-smooth optimization. In this talk, we will present a new approach based on global optimization in order to generate robust control laws. This new global optimization algorithm is based on interval arithmetic and contractor programming. Contractor Programming is a methodology which allows to enclose each algorithm in a unify framework, in order to interact heterogeneous formulations or techniques. It is a set-membership method, considering sets in place of floating points. Using Contractor Programming, we will show a user-friendly way to solve problems with non-smooth functions and constraints with quantifiers. The main idea consists in constructing a contractor based on the feasible region of the optimization problem and its complementary. This contractor is then used to accelerate the convergence of a Branch and Bound algorithm. We will illustrate this new approach on a example on the control of a periodic second order system G with a PID controller K subject to two frequency constraints on the error e and on the command u of the closed loop system. The objective is to find $k = (k_p, k_i, k_d)$ minimizing the $H_\infty$ norm of the controlled system.
2015-07-08
en
13thEUROPT Workshop on Advances in Continuous Optimization
Edinburgh, United Kingdom