Zobrazeno 1 - 10
of 40
pro vyhledávání: '"Claeys, Mathieu"'
Autor:
Claeys, Mathieu
Cette thèse s’intéresse au calcul de solutions globales de problèmes de commande optimaleen boucle ouverte. La méthodologie générale se base sur l’approche par les moments, oùun problème d’optimisation est relâché en un problème gén
Externí odkaz:
http://www.theses.fr/2013ISAT0009/document
Converging hierarchies of finite-dimensional semi-definite relaxations have been proposed for state-constrained optimal control problems featuring oscillation phe-nomena, by relaxing controls as Young measures. These semi-definite relaxations were la
Externí odkaz:
http://arxiv.org/abs/1412.2278
This paper presents a linear programming approach for the optimal control of nonlinear switched systems where the control is the switching sequence. This is done by introducing modal occupation measures, which allow to relax the problem as a primal l
Externí odkaz:
http://arxiv.org/abs/1404.4699
Autor:
Claeys, Mathieu
Moment optimization techniques have been recently proposed to solve globally various classes of optimal control problems. As those methods return truncated moment sequences of occupation measures, this paper explores a numeric method for reconstructi
Externí odkaz:
http://arxiv.org/abs/1404.4079
We propose a new LMI approach to the design of optimal switching sequences for polynomial dynamical systems with state constraints. We formulate the switching design problem as an optimal control problem which is then relaxed to a linear programming
Externí odkaz:
http://arxiv.org/abs/1303.1988
In the 1960s, a moment approach to linear time varying (LTV) minimal norm impulsive optimal control was developed, as an alternative to direct approaches (based on discretization of the equations of motion and linear programming) or indirect approach
Externí odkaz:
http://arxiv.org/abs/1303.1707
This paper shows how to find lower bounds on, and sometimes solve globally, a large class of nonlinear optimal control problems with impulsive controls using semi-definite programming (SDP). This is done by relaxing an optimal control problem into a
Externí odkaz:
http://arxiv.org/abs/1110.3674
Publikováno v:
In European Journal of Operational Research 1 September 2017 261(2):450-459
Publikováno v:
In Automatica February 2016 64:143-154
Publikováno v:
In IFAC Proceedings Volumes 2010 43(15):309-314