Searcharxiv⌕ Search

arXiv subjects

Corentin Briat

Publications and source records attributed to Corentin Briat.

47 records · Page 3Linked to original sources
arXiv2013

Integral population control of a quadratic dimerization process

Moment control of a simple quadratic reaction network describing a dimerization process is addressed. It is shown that the moment closure problem can be circumvented without invoking any moment closure technique. Local stabilization and convergence of the average dimer population to any desired reference value is ensured using a pure integral control law. Explicit bounds on the controller gain are provided and shown to be valid for any reference value. As a byproduct, an explicit upper-bound of the variance of the monomer species, acting on the system as unknown input due to the moment openness, is obtained. The obtained results are illustrated by an example relying on the simulation of a cell population using stochastic simulation algorithms.

math.OC↗
arXiv2013

Deterministic and Stochastic Approaches to Supervisory Control Design for Networked Systems with Time-Varying Communication Delays

This paper proposes a supervisory control structure for networked systems with time-varying delays. The control structure, in which a supervisor triggers the most appropriate controller from a multi-controller unit, aims at improving the closed-loop performance relative to what can be obtained using a single robust controller. Our analysis considers average dwell-time switching and is based on a novel multiple Lyapunov-Krasovskii functional. We develop stability conditions that can be verified by semi-definite programming, and show that the associated state feedback synthesis problem also can be solved using convex optimization tools. Extensions of the analysis and synthesis procedures to the case when the evolution of the delay mode is described by a Markov chain are also developed. Simulations on small and large-scale networked control systems are used to illustrate the effectiveness of our approach.

eess.SY↗
arXiv2012

Affine characterizations of minimum and mode-dependent dwell-times for uncertain linear switched systems

An alternative approach for minimum and mode-dependent dwell-time characterization for switched systems is derived. The proposed technique is related to Lyapunov looped-functionals, a new type of functionals leading to stability conditions affine in the system matrices, unlike standard results for minimum dwell-time. These conditions are expressed as infinite-dimensional LMIs which can be solved using recent polynomial optimization techniques such as sum-of-squares. The specific structure of the conditions is finally utilized in order to derive dwell-time stability results for uncertain switched systems. Several examples illustrate the efficiency of the approach.

math.OC↗
arXiv2012

A conservation-law-based modular fluid-flow model for network congestion modeling

A modular fluid-flow model for network congestion analysis and control is proposed. The model is derived from an information conservation law stating that the information is either in transit, lost or received. Mathematical models of network elements such as queues, users, and transmission channels, and network description variables, including sending/acknowledgement rates and delays, are inferred from this law and obtained by applying this principle locally. The modularity of the devised model makes it sufficiently generic to describe any network topology, and appealing for building simulators. Previous models in the literature are often not capable of capturing the transient behavior of the network precisely, making the resulting analysis inaccurate in practice. Those models can be recovered from exact reduction or approximation of this new model. An important aspect of this particular modeling approach is the introduction of new tight building blocks that implement mechanisms ignored by the existing ones, notably at the queue and user levels. Comparisons with packet-level simulations corroborate the proposed model.

cs.NI↗
arXiv2012

Computer control of gene expression: Robust setpoint tracking of protein mean and variance using integral feedback

Protein mean and variance levels in a simple stochastic gene expression circuit are controlled using proportional integral feedback. It is shown that the protein mean level can be globally and robustly tracked to any desired value using a simple PI controller that satisfies explicit sufficient conditions. Controlling both the mean and variance on the other hand requires the use of an additional control input, chosen here as the mRNA degradation rate. Local robust tracking of mean and variance is proved to be achievable using multivariable PI control, provided that the reference point satisfies necessary conditions imposed by the system. Even more importantly, it is shown that there exist PI controllers that locally, robustly and simultaneously stabilize all the equilibrium points inside the admissible region. Simulation examples illustrate the results.

math.OC↗
arXiv2012

A looped-functional approach for robust stability analysis of linear impulsive systems

A new functional-based approach is developed for the stability analysis of linear impulsive systems. The new method, which introduces looped-functionals, considers non-monotonic Lyapunov functions and leads to LMIs conditions devoid of exponential terms. This allows one to easily formulate dwell-times results, for both certain and uncertain systems. It is also shown that this approach may be applied to a wider class of impulsive systems than existing methods. Some examples, notably on sampled-data systems, illustrate the efficiency of the approach.

math.OC↗
arXiv2012

Robust stability and stabilization of uncertain linear positive systems via Integral Linear Constraints: L1- and Linfinity-gains characterization

Copositive linear Lyapunov functions are used along with dissipativity theory for stability analysis and control of uncertain linear positive systems. Unlike usual results on linear systems, linear supply-rates are employed here for robustness and performance analysis using L1- and Linfinity-gains. Robust stability analysis is performed using Integral Linear Constraints (ILCs) for which several classes of uncertainties are discussed. The approach is then extended to robust stabilization and performance optimization. The obtained results are expressed in terms of robust linear programming problems that are equivalently turned into finite dimensional ones using Handelman's Theorem. Several examples are provided for illustration.

eess.SY↗
arXiv2012

Convex dwell-time characterizations for uncertain linear impulsive systems

New sufficient conditions for the characterization of dwell-times for linear impulsive systems are proposed and shown to coincide with continuous decrease conditions of a certain class of looped-functionals, a recently introduced type of functionals suitable for the analysis of hybrid systems. This approach allows to consider Lyapunov functions that evolve non-monotonically along the flow of the system in a new way, broadening then the admissible class of systems which may be analyzed. As a byproduct, the particular structure of the obtained conditions makes the method is easily extendable to uncertain systems by exploiting some convexity properties. Several examples illustrate the approach.

math.OC↗
arXiv2012

Memory Resilient Gain-scheduled State-Feedback Control of Uncertain LTI/LPV Systems with Time-Varying Delays

The stabilization of uncertain LTI/LPV time delay systems with time varying delays by state-feedback controllers is addressed. At the difference of other works in the literature, the proposed approach allows for the synthesis of resilient controllers with respect to uncertainties on the implemented delay. It is emphasized that such controllers unify memoryless and exact-memory controllers usually considered in the literature. The solutions to the stability and stabilization problems are expressed in terms of LMIs which allow to check the stability of the closed-loop system for a given bound on the knowledge error and even optimize the uncertainty radius under some performance constraints; in this paper, the $\mathcal{H}_\infty$ performance measure is considered. The interest of the approach is finally illustrated through several examples.

eess.SY↗
arXiv2012

Convergence and Equivalence results for the Jensen's inequality - Application to time-delay and sampled-data systems

The Jensen's inequality plays a crucial role in the analysis of time-delay and sampled-data systems. Its conservatism is studied through the use of the Grüss Inequality. It has been reported in the literature that fragmentation (or partitioning) schemes allow to empirically improve the results. We prove here that the Jensen's gap can be made arbitrarily small provided that the order of uniform fragmentation is chosen sufficiently large. Non-uniform fragmentation schemes are also shown to speed up the convergence in certain cases. Finally, a family of bounds is characterized and a comparison with other bounds of the literature is provided. It is shown that the other bounds are equivalent to Jensen's and that they exhibit interesting well-posedness and linearity properties which can be exploited to obtain better numerical results.

eess.SY↗