Searcharxiv⌕ Search

arXiv subjects

Jérémy Rouot

Publications and source records attributed to Jérémy Rouot.

5 recordsLinked to original sources

Necessary Conditions for Free End-Time Sweeping Process Problems

This paper derives necessary optimality conditions for free end-time optimal control problems governed by sweeping process dynamics. In contrast to classical optimal control problems, the presence of the normal cone term in the state equation introduces discontinuities with respect to the state variable and prevents the standard Lipschitz regularity assumptions typically used in optimal control theory. As a result, both the analysis of trajectories and the formulation of optimality conditions require refined tools. We address problems with general endpoint constraints and time-dependent data, considering both the case in which the dynamics are Lipschitz continuous in time and the more challenging setting of merely measurable time dependence. Special attention is devoted to the additional transversality conditions associated with the free end-time variable. In the Lipschitz case, these conditions are expressed in terms of a function of bounded variation that coincides almost everywhere with the maximized Hamiltonian. In the measurable case, we show that a suitable interpretation can be obtained via the notions of sub- and super-essential values of the maximized Hamiltonian, recently introduced in the literature, leading to strengthened transversality conditions. These conditions also involve an additional term reflecting the interaction between the costate arc and the normal cone to the moving set at the optimal endpoints. Our approach combines suitable perturbation techniques with a penalization method tailored to sweeping processes. The moving set is modelled as a finite intersection of inequality-defined sets satisfying suitable constraint qualifications, including a positive linear independence condition and a diagonal dominance property of the associated Gramian matrix. We also introduce a local version of the constraint qualification condition. Our results apply to a broad class of problems, including those involving unbounded moving sets such as polyhedra. The resulting optimality system extends and sharpens recent results for classical free end-time problems to the non-Lipschitz, discontinuous framework of sweeping processes. The relevance of the transversality conditions obtained in this article is illustrated through two simple examples.

math.OC↗

Finite Dimensional Approximation to Muscular Response in Force-Fatigue Dynamics using Functional Electrical Stimulation

Recent dynamical models, based on the seminal work of V. Hill, allow to predict the muscular response to functional electrostimulation (FES), in the isometric and non-isometric cases. The physical controls are modeled as Dirac pulses and lead to a sampled-data control system, sampling corresponding to times of the stimulation, where the output is the muscular force response. Such a dynamics is suitable to compute optimized controls aiming to produce a constant force or force strengthening, but is complex for real time applications. The objective of this article is to construct a finite dimensional approximation of this response to provide fast optimizing schemes, in particular for the design of a smart electrostimulator for muscularreinforcement or rehabilitation. It is an on-going industrial project based on force-fatigue models, validated by experiments.Moreover it opens the road to application of optimal control to track a reference trajectory in the joint angular variable to produce movement in the non-isometric models.

math.OC↗

Towards Geometric Time Minimal Control without Legendre Condition and with Multiple Singular Extremals for Chemical Networks

This article deals with the problem of maximizing the production of a species for a chemical network by controlling the temperature. Under the so-called mass kinetics assumption the system can be modeled as a single-input control system using the Feinberg-Horn-Jackson graph associated to the reactions network. Thanks to Pontryagin's Maximum Principle, the candidates as minimizers can be found among extremal curves, solutions of a (non smooth) Hamiltonian dynamics and the problem can be stated as a time minimal control problem with a terminal target of codimension one. Using geometric control and singularity theory the time minimal syntheses (closed loop optimal control) can be classified near the terminal manifold under generic conditions. In this article we focus to the case where the generalized Legendre-Clebsch condition is not satisfied, which paves the road to complicated syntheses with several singular arcs. In particular it is related to the situation for a weakly reversible network like the McKeithan scheme of two reactions.

math.OC↗

On inverse optimal control via polynomial optimization

We consider the class of control systems where the differential equation, state and control system are described by polynomials. Given a set of trajectories and a class of Lagrangians, we are interested to find a Lagrangian in this class for which these trajectories are optimal. To model this inverse problem we use a relaxed version of Hamilton-Jacobi-Bellman optimality conditions, in the continuity of previous work in this vein. Then we provide a general numerical scheme based on polynomial optimization and positivity certificates, and illustrate the concepts on a few academic examples.

math.OC↗