Hamid. R. Ossareh
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
Hamid. R. Ossareh has a total of 63 co-authors. Here are the top co-authors by number of shared publications:
- Mostafaali Ayubirad
Department of Electrical and Biomedical Engineering, University of Vermont, Burlington, VT, USA
7 shared publications - Sarnaduti Brahma
Bradley Department of Electrical and Computer Engineering, Virginia Polytechnic Institute and State University, Blacksburg, VA, USA
6 shared publications - Zeng Qiu
Research & Advanced Engineering Ford Motor Company 48124 Dearborn MI USA
5 shared publications - Chris Weinkauf3 shared publications
- Dhananjay Anand
Idaho National Laboratory (INL), Idaho Falls, ID (United States)
3 shared publications - Hao Wang
Research and Advanced Engineering, Ford Motor Company, Dearborn, MI, USA
3 shared publications
Latest Publications
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 907-912
Synthesis of Data-Driven Discrete-Time Control Barrier Functions Using Maximal Admissible Sets
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 10, 907-912
Synthesis of Data-Driven Discrete-Time Control Barrier Functions Using Maximal Admissible Sets
- Open Access
Comprehensive Dynamic Modeling and Constraint-Aware Air Supply Control for Localized Water Management in Automotive Polymer Electrolyte Membrane Fuel Cells
In this paper, a predictive constraint-aware control scheme is formulated within the Command Governor (CG) framework for localized hydration management of a proton exchange membrane (PEM) fuel cell system. First, a comprehensive nonlinear dynamic model of the fuel cell system is presented which includes a pseudo 2-dimensional (P2D) model of the stack, reactant supply and cooling subsystems. The model captures the couplings among the various subsystems and serves as the basis for designing output feedback controllers to track the optimal set-points of the air supply and cooling systems for power optimization. The closed-loop nonlinear model is then used to analyze the dynamic behavior of membrane hydration near the anode inlet, the driest region of the membrane in a counter-flow configuration, under various operating conditions. A reduced-order linearized model is then derived to approximate hydration behavior with sufficient fidelity for constraint enforcement. This model is used within the CG framework to adjust the air supply set-points when necessary to prevent membrane dry-out. The effectiveness of the proposed approach in maintaining local membrane hydration while closely tracking the requested net power is demonstrated through realistic drive-cycle simulations.
Open AccessComprehensive Dynamic Modeling and Constraint-Aware Air Supply Control for Localized Water Management in Automotive Polymer Electrolyte Membrane Fuel Cells
In this paper, a predictive constraint-aware control scheme is formulated within the Command Governor (CG) framework for localized hydration management of a proton exchange membrane (PEM) fuel cell system. First, a comprehensive nonlinear dynamic model of the fuel cell system is presented which includes a pseudo 2-dimensional (P2D) model of the stack, reactant supply and cooling subsystems. The model captures the couplings among the various subsystems and serves as the basis for designing output feedback controllers to track the optimal set-points of the air supply and cooling systems for power optimization. The closed-loop nonlinear model is then used to analyze the dynamic behavior of membrane hydration near the anode inlet, the driest region of the membrane in a counter-flow configuration, under various operating conditions. A reduced-order linearized model is then derived to approximate hydration behavior with sufficient fidelity for constraint enforcement. This model is used within the CG framework to adjust the air supply set-points when necessary to prevent membrane dry-out. The effectiveness of the proposed approach in maintaining local membrane hydration while closely tracking the requested net power is demonstrated through realistic drive-cycle simulations.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 33 (6) , 2271-2287
A Machine Learning-Based Reference Governor for Nonlinear Systems With Application to Automotive Fuel Cells
The prediction-based nonlinear reference governor (PRG) is an add-on algorithm to enforce constraints on prestabilized nonlinear systems by modifying, whenever necessary, the reference signal. The implementation of PRG carries a heavy computational burden, as it may require multiple numerical simulations of the plant model at each sample time. To this end, this article proposes an alternative approach based on machine learning, where we first use a regression neural network (NN) to approximate the input-output map of the PRG from a set of training data. During the real-time operation, at each sample time, we use the trained NN to compute a nominal reference command, which may not be constraint admissible due to training errors and limited data. We adopt a novel sensitivity-based approach to minimally adjust the nominal reference while ensuring constraint enforcement. We thus refer to the resulting control strategy as the modified NN reference governor (MNN-RG), which is computationally more efficient than the PRG. The computational and theoretical properties of the MNN-RG are presented. Finally, the effectiveness and limitations of the proposed method are studied by applying it as a load governor for constraint management in automotive fuel cell (FC) systems through simulation-based case studies.
- 24 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control Systems Technology
- Vol. 33 (6) , 2271-2287
A Machine Learning-Based Reference Governor for Nonlinear Systems With Application to Automotive Fuel Cells
The prediction-based nonlinear reference governor (PRG) is an add-on algorithm to enforce constraints on prestabilized nonlinear systems by modifying, whenever necessary, the reference signal. The implementation of PRG carries a heavy computational burden, as it may require multiple numerical simulations of the plant model at each sample time. To this end, this article proposes an alternative approach based on machine learning, where we first use a regression neural network (NN) to approximate the input-output map of the PRG from a set of training data. During the real-time operation, at each sample time, we use the trained NN to compute a nominal reference command, which may not be constraint admissible due to training errors and limited data. We adopt a novel sensitivity-based approach to minimally adjust the nominal reference while ensuring constraint enforcement. We thus refer to the resulting control strategy as the modified NN reference governor (MNN-RG), which is computationally more efficient than the PRG. The computational and theoretical properties of the MNN-RG are presented. Finally, the effectiveness and limitations of the proposed method are studied by applying it as a load governor for constraint management in automotive fuel cell (FC) systems through simulation-based case studies.
- 23 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7588-7595
Uncertainty Quantification of Data-Driven Output Predictors in the Output Error Setting
We revisit the problem of predicting the output of a linear time-invariant (LTI) system using offline input–output data in the behavioral setting, without relying on parametric models. Existing works calculate the output predictions by projecting the recent data samples onto the column space of a Hankel matrix constructed from offline data, but the noise in these data renders these predictions inexact. While low-rank approximations, such as truncated singular value decomposition, have been proposed to mitigate noise, the ensuing prediction accuracy remains unquantified. This article introduces two novel upper bounds on prediction error under small-noise assumptions, one using raw data and one using the low-rank approximation. These bounds do not require access to the true system output and depend only on noisy data, a known noise level and system order. Simulations show that both bounds decrease linearly with noise. Interestingly, applying the denoising heuristic does not generally improve prediction accuracy or result in a tighter error bound compared to raw data, but it allows for a more general upper bound, as the first upper bound requires a specific condition on the construction of the Hankel matrix.
- 23 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (11) , 7588-7595
Uncertainty Quantification of Data-Driven Output Predictors in the Output Error Setting
We revisit the problem of predicting the output of a linear time-invariant (LTI) system using offline input–output data in the behavioral setting, without relying on parametric models. Existing works calculate the output predictions by projecting the recent data samples onto the column space of a Hankel matrix constructed from offline data, but the noise in these data renders these predictions inexact. While low-rank approximations, such as truncated singular value decomposition, have been proposed to mitigate noise, the ensuing prediction accuracy remains unquantified. This article introduces two novel upper bounds on prediction error under small-noise assumptions, one using raw data and one using the low-rank approximation. These bounds do not require access to the true system output and depend only on noisy data, a known noise level and system order. Simulations show that both bounds decrease linearly with noise. Interestingly, applying the denoising heuristic does not generally improve prediction accuracy or result in a tighter error bound compared to raw data, but it allows for a more general upper bound, as the first upper bound requires a specific condition on the construction of the Hankel matrix.
- Open Access
Modeling and Constraint-Aware Control of Pressure Dynamics in Water Electrolysis Systems
This paper addresses the challenge of pressure constraint violations in water electrolysis systems operating under dynamic power conditions, a problem common to both Proton Exchange Membrane and alkaline technologies. To investigate this issue, a control-oriented model of an alkaline electrolyzer is developed, capturing key pressure and flow dynamics. To manage rapid power fluctuations that may cause pressure to exceed manufacturer-defined operational boundaries, a model-based constraint-aware power governor based on the Reference Governor (RG) framework is proposed. Simulation results show that the strategy effectively maintains pressure within the specified operating range, outperforming conventional filtering methods while enhancing hydrogen production and reducing auxiliary energy consumption.
Open AccessModeling and Constraint-Aware Control of Pressure Dynamics in Water Electrolysis Systems
This paper addresses the challenge of pressure constraint violations in water electrolysis systems operating under dynamic power conditions, a problem common to both Proton Exchange Membrane and alkaline technologies. To investigate this issue, a control-oriented model of an alkaline electrolyzer is developed, capturing key pressure and flow dynamics. To manage rapid power fluctuations that may cause pressure to exceed manufacturer-defined operational boundaries, a model-based constraint-aware power governor based on the Reference Governor (RG) framework is proposed. Simulation results show that the strategy effectively maintains pressure within the specified operating range, outperforming conventional filtering methods while enhancing hydrogen production and reducing auxiliary energy consumption.
- 23 January 2025
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 147 (4) , 1-17
Parametrized Maximal Admissible Sets With Application to Constraint Management of Systems With Slowly Varying Parameters
Real-time constraint management schemes for time-varying or parameter-varying systems often result in conservative (slow) responses or carry a heavy computational burden. This makes some of the existing solutions less suitable for practical applications within these systems. To address this issue, this paper proposes a numerically efficient reference governor (RG) scheme for constraint management of systems with slowly time-varying parameters and constraints. The solution, which we call the adaptive-contractive reference governor (RG-AC), utilizes a contractive, parameterized characterization of the so-called maximal admissible set (MAS). To ensure low computational overhead, this parameter-dependent MAS (PD-MAS) is approximated using a sensitivity-based method that describes the changes in the facets of PD-MAS as a function of the system parameters around a nominal operating point. The computational and theoretical properties of the PD-MAS and RG-AC are presented. The effectiveness and limitations of the proposed method are demonstrated by studying a basic mass–spring–damper system.
- 23 January 2025
- Published by ASME International in Journal of Dynamic Systems, Measurement, and Control
- Vol. 147 (4) , 1-17
Parametrized Maximal Admissible Sets With Application to Constraint Management of Systems With Slowly Varying Parameters
Real-time constraint management schemes for time-varying or parameter-varying systems often result in conservative (slow) responses or carry a heavy computational burden. This makes some of the existing solutions less suitable for practical applications within these systems. To address this issue, this paper proposes a numerically efficient reference governor (RG) scheme for constraint management of systems with slowly time-varying parameters and constraints. The solution, which we call the adaptive-contractive reference governor (RG-AC), utilizes a contractive, parameterized characterization of the so-called maximal admissible set (MAS). To ensure low computational overhead, this parameter-dependent MAS (PD-MAS) is approximated using a sensitivity-based method that describes the changes in the facets of PD-MAS as a function of the system parameters around a nominal operating point. The computational and theoretical properties of the PD-MAS and RG-AC are presented. The effectiveness and limitations of the proposed method are demonstrated by studying a basic mass–spring–damper system.
- 27 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6389-6396
On Complexity Bounds for the Maximal Admissible Set of Linear Time-Invariant Systems
Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for discrete-time, linear, time-invariant, stable, observable systems with polytopic constraints, this set is a polytope described by a finite number of inequalities (i.e., has finite complexity). However, it is not possible to know the number of inequalities a priori from problem data. To address this gap, this contribution presents two computationally efficient methods to obtain upper bounds on the complexity of the MAS. The first method is algebraic and is based on matrix power series, while the second is geometric and is based on Lyapunov analysis. The two methods are rigorously introduced, a detailed numerical comparison between the two is provided, and an extension to systems with constant inputs is presented.
- 27 March 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 69 (9) , 6389-6396
On Complexity Bounds for the Maximal Admissible Set of Linear Time-Invariant Systems
Given a dynamical system with constrained outputs, the maximal admissible set (MAS) is defined as the set of all initial conditions such that the output constraints are satisfied for all time. It has been previously shown that for discrete-time, linear, time-invariant, stable, observable systems with polytopic constraints, this set is a polytope described by a finite number of inequalities (i.e., has finite complexity). However, it is not possible to know the number of inequalities a priori from problem data. To address this gap, this contribution presents two computationally efficient methods to obtain upper bounds on the complexity of the MAS. The first method is algebraic and is based on matrix power series, while the second is geometric and is based on Lyapunov analysis. The two methods are rigorously introduced, a detailed numerical comparison between the two is provided, and an extension to systems with constant inputs is presented.