HNHoai-Nam Nguyen

Hoai-Nam Nguyen

*This is an algorithmically generated author record based on publicly available information.

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


Hoai-Nam Nguyen has a total of 23 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Model predictive control for linear parameter varying systems: a double-sum-free parameter-dependent lyapunov function approach

    by Jin Yan, Hoai-Nam Nguyen, Nel Samama

    1. Model Predictive Control (MPC) is widely recognised as an effective method for handling multivariate control systems with input and state constraints (Camacho & Bordons, 2007; Kouvaritakis & Can...

  • Commande sous contraintes pour des systèmes dynamiques incertains : une approache basée sur l'interpolation

    by Hoai Nam Nguyen

    Un problème fondamental à résoudre en Automatique réside dans la commande des systèmes incertains qui présentent des contraintes sur les variables de l’entrée, de l’état ou la sortie. Ce problème peut être théoriquement résolu au moyen d’une commande optimale. Cependant la commande optimale par principe n’est pas une commande par retour d’état ou retour de sortie et offre seulement une trajectoire optimale le plus souvent par le biais d’une solution numérique.Par conséquent, dans la pratique, le problème peut être approché par de nombreuses méthodes, tels que”commande over-ride” et ”anti-windup”. Une autre solution, devenu populaire au cours des dernières décennies est la commande prédictive. Selon cette méthode, un problème de la commande optimale est résolu à chaque instant d’échantillonnage, et le composant du vecteur de commande destiné à l’échelon curant est appliquée. En dépit de la montée en puissance des architecture de calcul temps-réel, la commande prédictive est à l’heure actuelle principalement approprié lorsque l’ordre est faible, bien connu, et souvent pour des systèmes linéaires. La version robuste de la commande prédictive est conservatrice et compliquée à mettre en œuvre, tandis que la version explicite de la commande prédictive donnant une solution affine par morceaux implique une compartimentation de l’état-espace en cellules polyédrales, très compliquée.Dans cette thèse, une solution élégante et peu coûteuse en temps de calcul est présentée pour des systèmes linéaire, variant dans le temps ou incertains. Les développements se concentre sur les dynamiques en temps discret avec contraintes polyédriques sur l’entrée et l’état (ou la sortie) des vecteurs, dont les perturbations sont bornées. Cette solution est basée sur l’interpolation entre un correcteur pour la région extérieure qui respecte les contraintes sur l’entrée et de l’état, et un autre pour la région intérieure, ce dernier plus agressif, conçue par n’importe quelle méthode classique, ayant un ensemble robuste positivement invariant associé à l’intérieur des contraintes. Une simple fonction de Lyapunov est utilisée afin d’apporter la preuve de la stabilité en boucle fermée.

  • Optimal Parameter Selection for ADMM: Quadratically Constrained Quadratic Program

    by Hoai-Nam Nguyen

    We propose two new algorithms for solving quadratically constrained quadratic programming (QCQP) problems arising from real-time optimization based control such as model predictive control or interpolating control. The proposed algorithms are based on the Alternating Direction Method of Multipliers (ADMM). ADMM is a powerful tool for solving a wide class of constrained optimization problems. There are two main challenges when applying ADMM: Its performance depends greatly on the efficiency of solving the suboptimization problems associated with the ADMM at each iteration; it is not trivial to find the correct penalty parameters. For the first challenge, we provide a way to reformulate the original QCQP problem into a form such that there exist analytical solutions for the suboptimization problems. Hence, the computational cost per iteration is low. For the second challenge, we provide two procedures to compute systematically the penalty parameters. In the first procedure, a closed-form expression for the optimal constant scalar parameter is derived in terms of the matrix condition number. In the second one, the penalty parameters are adaptively tuned to achieve fast convergence. The results are validated via numerical simulations.


  • Open Access

    Experimental validation of scenario-based stochastic model predictive control of nanogrids

    by Vahid Hamdipoor, Hoai Nam Nguyen, Bouchra Mekhaldi, Johan Parra, Jordi Badosa, Fausto Calderon Obaldia


    • 24 October 2024
    • Published by HAL in HAL
    Open Access

    Scalable command governor via semi-ellipsoidal set for linear systems with time-varying soft constraints

    by Hoai-Nam Nguyen

    HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des établissements d'enseignement et de recherche français ou étrangers, des laboratoires publics ou privés. Scalable command governor via semi-ellipsoidal set for linear systems with time-varying soft constraints

    • 31 July 2024
    • Published by HAL in HAL
    Open Access

    Maximal admissible set for graph-dependent switched systems with Dwell time restriction

    by Hoai-Nam Nguyen

    In this paper we present an extension of the concept of the maximal admissible set for constrained graph-dependent switched systems with bounded disturbances under dwell time restriction. Termed as the maximal switch-dependently robustly admissible set (MSDRAS), we provide efficient numerical procedures for its determination. For this purpose, we exploit available information about the current active mode, minimum dwell times, and mode transition graph. We employ the MSDRAS for three purposes: i) characterizing the largest set of initial states ensuring constraint satisfaction; ii) establishing necessary and sufficient conditions for stability of switched systems; iii) computing the minimum mode-dependent dwell times. Furthermore, we extend the results to switched systems with parametric uncertainties. Through three numerical examples, we compare our solutions with earlier from the literature to illustrate the effectiveness of our approach.

  • Further Results on the Control Law via the Convex Hull of Ellipsoids

    by Hoai-Nam Nguyen

    Recently, a new Lyapunov function based on the convex hull of ellipsoids was introduced for the study of uncertain and/or time-varying linear discrete-time systems with/without constraints. The new Lyapunov function has many attractive features such as: i) the associated ellipsoids are not required to be robustly invariant; ii) the design conditions are formulated as linear matrix inequality constraints. The control law is obtained by solving a convex optimization problem online. This optimization problem generally does not have a closed-form solution, and hence it is solved by numerical methods. In this paper, we intend to complement the results by analyzing the geometric structures of the solution of the optimization problem, and of the control law. In particular, we show that the control law is a piecewise linear and Lipschitz continuous function of the state.


  • Open Access

    LMI Conditions for Robust Invariance of the Convex Hull of Ellipsoids with Application to Nonlinear State Feedback Control

    by Nguyen Hoai Nam

    The convex hull of ellipsoids was suggested in the literature for robust invariance of constrained uncertain and/or time-varying linear discrete-time systems. It was show that a robust invariant set obtained with the convex hull of ellipsoids can be significantly larger than that with the ellipsoidal set. However, the design conditions are given in terms of bilinear matrix inequalities (BMIs), which are non-convex. The main purpose of this paper is to present a way to overcome this weakness by providing new convex linear matrix inequality (LMI) design conditions. It is shown that the conditions are losslessly extended to robust controlled invariance and to nonlinear state feedback control design. Two examples are included with comparison to earlier solutions from the literature to illustrate the results.

  • Adaptive PI Control of Wave Energy Converters With Force and Motion Constraints

    by Hoai-Nam Nguyen

    This paper presents the application of adaptive PI control design to a point absorber - wave energy converter (WEC) under force and motion constraints. Adaptive PI control has several features that make it attractive for WEC system. In particular, it has a clear physical interpretation. The “P” component converts the wave energy into useful energy, while the “I” component changes the WEC system natural frequency allowing the absorber to be more in phase with the incoming waves. However, standard adaptive PI control schemes in the literature do not have the ability to incorporate the constraints in the design phase. The main objective of this paper is to fill this gap by proposing a new adaptive PI control law that can take the constraints into account. Simulation results show that the new control law can improve the performance while respecting system limitations.


  • Efficient min–max MPC: Achieving a large domain of attraction with short horizon

    by Hoai‐Nam Nguyen

    This article considers the regulation problem of a constrained linear system with bounded disturbance. The objective is to overcome the offline and online problems of the standard dual‐mode min–max model predictive control (MPC). The offline problem is related to the construction of a polyhedral terminal set, which is prohibitively complex especially for high order systems. We propose to replace the polyhedral set with the ellipsoidal one, which is much easier to construct. The online problem is related to the computational burden, which grows exponentially with the prediction horizon . We show how to employ a new terminal cost function, that results in a new min–max MPC with a large domain of attraction even with or . Hence the computational complexity is drastically reduced. Two numerical examples with comparison to earlier solutions from the literature illustrate the effectiveness of the proposed approach.