Laurent Bako
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Laurent Bako has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Vincent Andrieu
Universit Claude Bernard Lyon 1, CNRS, LAGEPP UMR 5007, Villeurbanne, France
4 shared publications - Federico Morelli
Univ Lyon, UMR CNRS 5005, Ecole Cent Lyon, Lab Ampere, Ecully, France
3 shared publications - Kévin Colin
Centre for Advanced Bio Production and Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH, Stockholm, Sweden
3 shared publications - Necmiye Ozay
University of Michigan
3 shared publications - Paolo Massioni
Laboratoire Ampère, UMR CNRS 5005, INSA de Lyon, Université de Lyon, France
3 shared publications - Xavier Bombois
Laboratoire Ampère École Centrale de Lyon Université de Lyon Ecully France
3 shared publications
Latest Publications
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 541-546
Decentralized Stubborn Observer Redesign With Exact Outlier Cancellation
We propose a decentralized stubborn observer architecture for linear time-invariant (LTI) systems. Partitioning the outputs into blocks with individual adaptive thresholds isolates measurement corruptions and prevents their propagation. By mapping the system into a lower block-triangular form, we prove global exponential stability (GES) in the disturbance-free case. Moreover, we establish Input-to-State Stability (ISS) to output disturbances and exact cancellation of impulsive outliers under relaxed block-wise dwell-time conditions. Numerical simulations on a vehicle platoon illustrate the improved robustness compared with centralized designs.
- 2 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 541-546
Decentralized Stubborn Observer Redesign With Exact Outlier Cancellation
We propose a decentralized stubborn observer architecture for linear time-invariant (LTI) systems. Partitioning the outputs into blocks with individual adaptive thresholds isolates measurement corruptions and prevents their propagation. By mapping the system into a lower block-triangular form, we prove global exponential stability (GES) in the disturbance-free case. Moreover, we establish Input-to-State Stability (ISS) to output disturbances and exact cancellation of impulsive outliers under relaxed block-wise dwell-time conditions. Numerical simulations on a vehicle platoon illustrate the improved robustness compared with centralized designs.
- 30 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Contribution à l'identification de systèmes dynamiques hybrides
Dans de nombreuses applications modernes, l’interaction de plus en plus importante entre les systèmes numériques (ordinateurs, logiciels, composants logiques, etc.) et les processus physiques (relations entre signaux continus) a conduit, en Automatique, à l’émergence et à la formalisation des systèmes dits hybrides. Formellement, les systèmes hybrides peuvent être définis comme des systèmes mixtes où interagissent des phénomènes de nature à la fois continue et événementielle. L’analyse et la conduite de tels systèmes comme de tout autre type de système dynamique nécessitent bien souvent que l’on dispose d’un modèle mathématique de ces systèmes. Ainsi, nous nous intéressons dans ce travail, à l’identification de systèmes hybrides linéaires à partir de mesures entrée-sortie. Après avoir fait le point sur les méthodes disponibles dans la littérature récente en relation avec ce sujet, nous mettons en évidence la nécessité de développer des méthodes d’identification de systèmes hybrides multivariables dans le contexte très délicat où ni le nombre de sous-modèles constitutifs du système hybride, ni les ordres de ces sous-modèles, ni leurs paramètres ne sont connus a priori. Nous considérons d’abord des modèles d’état à commutations. Pour estimer ces modèles par les méthodes des sous-espaces, il est indispensable de contrôler dans l’espace d’état, les bases de représentation des matrices de paramètres associées aux différents sous-modèles à estimer. Cela nous a conduit au développement de nouvelles techniques d’identification structurée de modèles linéaires d’état qui possèdent cette propriété. Nous généralisons ensuite les techniques ainsi développées à l’identification de systèmes multivariables commutants, représentés par des modèles d’état. Cependant, dans le cas général, l’identification de modèles d’état hybrides est limitée par de sévères problèmes de complexité numérique. De ce fait, nous étudions le cas particulier où les instants de commutation sont séparés par un certain temps de séjour minimum dans les différents modes du système. Afin de nous affranchir de cette contrainte, nous investiguons l’identification de modèles MIMO commutants de type Auto-Regressif à entrée eXogène (ARX). Nous généralisons alors la méthode algébro-géométrique (GPCA) à l’identification de systèmes multivariables, discutons quelques problèmes de complexité numérique et suggérons des alternatives. La dernière partie du travail est consacrée à la validation de nos méthodes sur des exemples de simulation.
- 30 March 2026
- Published by Agence Bibliographique de l'Enseignement Supérieur
Contribution à l'identification de systèmes dynamiques hybrides
Dans de nombreuses applications modernes, l’interaction de plus en plus importante entre les systèmes numériques (ordinateurs, logiciels, composants logiques, etc.) et les processus physiques (relations entre signaux continus) a conduit, en Automatique, à l’émergence et à la formalisation des systèmes dits hybrides. Formellement, les systèmes hybrides peuvent être définis comme des systèmes mixtes où interagissent des phénomènes de nature à la fois continue et événementielle. L’analyse et la conduite de tels systèmes comme de tout autre type de système dynamique nécessitent bien souvent que l’on dispose d’un modèle mathématique de ces systèmes. Ainsi, nous nous intéressons dans ce travail, à l’identification de systèmes hybrides linéaires à partir de mesures entrée-sortie. Après avoir fait le point sur les méthodes disponibles dans la littérature récente en relation avec ce sujet, nous mettons en évidence la nécessité de développer des méthodes d’identification de systèmes hybrides multivariables dans le contexte très délicat où ni le nombre de sous-modèles constitutifs du système hybride, ni les ordres de ces sous-modèles, ni leurs paramètres ne sont connus a priori. Nous considérons d’abord des modèles d’état à commutations. Pour estimer ces modèles par les méthodes des sous-espaces, il est indispensable de contrôler dans l’espace d’état, les bases de représentation des matrices de paramètres associées aux différents sous-modèles à estimer. Cela nous a conduit au développement de nouvelles techniques d’identification structurée de modèles linéaires d’état qui possèdent cette propriété. Nous généralisons ensuite les techniques ainsi développées à l’identification de systèmes multivariables commutants, représentés par des modèles d’état. Cependant, dans le cas général, l’identification de modèles d’état hybrides est limitée par de sévères problèmes de complexité numérique. De ce fait, nous étudions le cas particulier où les instants de commutation sont séparés par un certain temps de séjour minimum dans les différents modes du système. Afin de nous affranchir de cette contrainte, nous investiguons l’identification de modèles MIMO commutants de type Auto-Regressif à entrée eXogène (ARX). Nous généralisons alors la méthode algébro-géométrique (GPCA) à l’identification de systèmes multivariables, discutons quelques problèmes de complexité numérique et suggérons des alternatives. La dernière partie du travail est consacrée à la validation de nos méthodes sur des exemples de simulation.
- 8 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 3987-3994
Noise Sensitivity of the Semidefinite Programs for Direct Data-Driven LQR
In this article, we study the noise sensitivity of the semidefinite program (SDP) proposed for direct data-driven infinite-horizon linear quadratic regulator (LQR) problem for discrete-time linear time-invariant systems. While this SDP is shown to find the true LQR controller in the noise-free setting, we show that it leads to a trivial solution with zero gain matrices when data are corrupted by noise, even when the noise is arbitrarily small. We then study a variant of the SDP that includes a robustness-promoting regularization term, and prove that regularization does not fully eliminate the sensitivity issue. In particular, the solution of the regularized SDP converges in probability also to a trivial solution.
- 8 December 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 71 (6) , 3987-3994
Noise Sensitivity of the Semidefinite Programs for Direct Data-Driven LQR
In this article, we study the noise sensitivity of the semidefinite program (SDP) proposed for direct data-driven infinite-horizon linear quadratic regulator (LQR) problem for discrete-time linear time-invariant systems. While this SDP is shown to find the true LQR controller in the noise-free setting, we show that it leads to a trivial solution with zero gain matrices when data are corrupted by noise, even when the noise is arbitrarily small. We then study a variant of the SDP that includes a robustness-promoting regularization term, and prove that regularization does not fully eliminate the sensitivity issue. In particular, the solution of the regularized SDP converges in probability also to a trivial solution.
- Open Access
Exponentially Stable Stubborn Observers for Discrete-Time Linear Systems (Extended Version)
State estimation is crucial for control and monitoring of dynamical systems, but sporadic disturbances (outliers) can severely degrade the estimator's performance. This paper studies the stability of a so-called "stubborn" observer, designed to mitigate the effects of outliers, for discrete-time linear systems. We prove that the detectability of the system is both necessary and sufficient for global exponential stability of the observer, providing an improvement over existing results that rely on potentially infeasible LMI conditions. The proof is constructive, leading to practical guidelines for selecting the observer parameters. Numerical simulations demonstrate the observer's effectiveness in mitigating outliers and its superior performance compared to a classical Luenberger observer.
Open AccessExponentially Stable Stubborn Observers for Discrete-Time Linear Systems (Extended Version)
State estimation is crucial for control and monitoring of dynamical systems, but sporadic disturbances (outliers) can severely degrade the estimator's performance. This paper studies the stability of a so-called "stubborn" observer, designed to mitigate the effects of outliers, for discrete-time linear systems. We prove that the detectability of the system is both necessary and sufficient for global exponential stability of the observer, providing an improvement over existing results that rely on potentially infeasible LMI conditions. The proof is constructive, leading to practical guidelines for selecting the observer parameters. Numerical simulations demonstrate the observer's effectiveness in mitigating outliers and its superior performance compared to a classical Luenberger observer.
- Open Access
Noise Sensitivity of the Semidefinite Programs for Direct Data-Driven LQR
In this paper, we study the noise sensitivity of the semidefinite program (SDP) proposed for direct data-driven infinite-horizon linear quadratic regulator (LQR) problem for discrete-time linear time-invariant systems. While this SDP is shown to find the true LQR controller in the noise-free setting, we show that it leads to a trivial solution with zero gain matrices when data is corrupted by noise, even when the noise is arbitrarily small. We then study a variant of the SDP that includes a robustness promoting regularization term and prove that regularization does not fully eliminate the sensitivity issue. In particular, the solution of the regularized SDP converges in probability also to a trivial solution.
Open AccessNoise Sensitivity of the Semidefinite Programs for Direct Data-Driven LQR
In this paper, we study the noise sensitivity of the semidefinite program (SDP) proposed for direct data-driven infinite-horizon linear quadratic regulator (LQR) problem for discrete-time linear time-invariant systems. While this SDP is shown to find the true LQR controller in the noise-free setting, we show that it leads to a trivial solution with zero gain matrices when data is corrupted by noise, even when the noise is arbitrarily small. We then study a variant of the SDP that includes a robustness promoting regularization term and prove that regularization does not fully eliminate the sensitivity issue. In particular, the solution of the regularized SDP converges in probability also to a trivial solution.
- Open Access
Minimal L2-Consistent Data-Transmission
In this work, we consider non-collocated sensors and actuators, and we address the problem of minimizing the number of sensor-to-actuator transmissions while ensuring that the L2 gain of the system remains under a threshold. By using causal factorization and system level synthesis, we reformulate this problem as a rank minimization problem over a convex set. When heuristics like nuclear norm minimization are used for rank minimization, the resulting matrix is only numerically low rank and must be truncated, which can lead to an infeasible solution. To address this issue, we introduce approximate causal factorization to control the factorization error and provide a bound on the degradation of the L2 gain in terms of the factorization error. The effectiveness of our method is demonstrated using a benchmark.
Open AccessMinimal L2-Consistent Data-Transmission
In this work, we consider non-collocated sensors and actuators, and we address the problem of minimizing the number of sensor-to-actuator transmissions while ensuring that the L2 gain of the system remains under a threshold. By using causal factorization and system level synthesis, we reformulate this problem as a rank minimization problem over a convex set. When heuristics like nuclear norm minimization are used for rank minimization, the resulting matrix is only numerically low rank and must be truncated, which can lead to an infeasible solution. To address this issue, we introduce approximate causal factorization to control the factorization error and provide a bound on the degradation of the L2 gain in terms of the factorization error. The effectiveness of our method is demonstrated using a benchmark.
- Open Access
A note on the convergence of a class of adaptive optimal identifiers
This paper proposes a unifying framework for the convergence analysis of a class of adaptive optimal identifiers. The considered class of identifiers is constructed from the sequence of minimizing sets of a family of objective functions. For the purpose of the analysis we introduce a generalized version of the classical persistence of excitation condition. Based on this an Input-to-State-Stability (ISS)-type of property is derived for the studied class of adaptive estimators.
Open AccessA note on the convergence of a class of adaptive optimal identifiers
This paper proposes a unifying framework for the convergence analysis of a class of adaptive optimal identifiers. The considered class of identifiers is constructed from the sequence of minimizing sets of a family of objective functions. For the purpose of the analysis we introduce a generalized version of the classical persistence of excitation condition. Based on this an Input-to-State-Stability (ISS)-type of property is derived for the studied class of adaptive estimators.
- 1 June 2023
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Guidance, Control, and Dynamics
- Vol. 46 (6) , 1038-1051
Reduced-Order Identification of Aeroelastic Systems with Constrained and Imposed Poles
This work investigates the identification of reduced-order state-space models from aeroelastic simulations of the interaction of a built-in structural finite element model and a linear aerodynamic ...
- 1 June 2023
- Published by American Institute of Aeronautics and Astronautics (AIAA) in Journal of Guidance, Control, and Dynamics
- Vol. 46 (6) , 1038-1051
Reduced-Order Identification of Aeroelastic Systems with Constrained and Imposed Poles
This work investigates the identification of reduced-order state-space models from aeroelastic simulations of the interaction of a built-in structural finite element model and a linear aerodynamic ...
- 10 November 2022
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 33 (1) , 3-5
Special Issue on Sparsity‐inducing Methods in Control Theory
- 10 November 2022
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 33 (1) , 3-5
Special Issue on Sparsity‐inducing Methods in Control Theory
- Open Access
On the tightest interval-valued state estimator for linear systems
This paper discusses an interval-valued state estimator for linear dynamic systems. In particular, we derive an expression of the tightest possible interval-valued estimator in the sense that it is the intersection of all interval-valued estimators. This estimator appears, in a general setting, to be an infinite dimensional dynamic system. Therefore, practical implementation requires some over-approximations which would yield a good trade-off between computational complexity and tightness.
Open AccessOn the tightest interval-valued state estimator for linear systems
This paper discusses an interval-valued state estimator for linear dynamic systems. In particular, we derive an expression of the tightest possible interval-valued estimator in the sense that it is the intersection of all interval-valued estimators. This estimator appears, in a general setting, to be an infinite dimensional dynamic system. Therefore, practical implementation requires some over-approximations which would yield a good trade-off between computational complexity and tightness.