Saeed Shamaghdari
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Saeed Shamaghdari has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
- Razieh Darshi
Iran University of Science and Technology
5 shared publications - Ali Shokrollahi
School of Electrical Engineering, Iran University of Science & Technology, Tehran, Iran
4 shared publications Sajad Roshanravan
Electrical Engineering Department, Iran University of Science and Technology (IUST), Tehran, Iran
4 shared publications- Javad Poshtan
School of Electrical Engineering, Iran University of Science and Technology, Tehran, Iran
3 shared publications Mohammad Fiuzy
Department of Electrical engineering, Iran University of Science and Technology, Iran
3 shared publications- Reza Yavari
Department of Electrical engineering, Iran University of Science and Technology, Iran
3 shared publications
Latest Publications
- Open Access
- 25 November 2025
- Published by Academic World Research in Journal of Aerospace Mechanics
- Vol. 21 (4) , 77-87
Real-Time Tangent Based Path Planning for Autonomous Robots in Convex Obstacle Environments
This study introduces a novel geometric algorithm for online path planning of autonomous robots in two-dimensional environments with convex obstacles. The proposed method models obstacles using optimized inscribed ellipses and generates candidate trajectories through tangent lines. By doing so, the planning problem at each step is confined to a convex region, and the optimal path is determined by minimizing a three-term cost function that incorporates path length, angular deviation, and obstacle clearance. This formulation not only simplifies the computational process but also supports rapid, real-time path updates in dynamic environments.Extensive simulations confirm that the algorithm considerably outperforms well-established approaches such as A*, RRT*, and ACO. In the first test environment, it achieved an execution time of only 0.032 s (versus 3.981 s for A* and 4.1 s for RRT*), a path length of 1896.9 m (shorter than 1952.2 m for RRT*), and a smoothness value of 0.225 (compared with 696.6 for A* and 5.147 for RRT*). In the second environment, the computation time was 0.124 s and the smoothness 0.40, representing at least a 60% improvement over A* and a 20% improvement over RRT*. Furthermore, the method reduced the average energy consumption by 5–10% compared with competing algorithms.Overall, the findings demonstrate that the proposed algorithm produces shorter, smoother, and more energy-efficient paths while significantly reducing computational cost. These advantages make it a promising candidate for large-scale, real-time robotic applications, with potential for further extension to three-dimensional environments.
- 25 November 2025
- Published by Academic World Research in Journal of Aerospace Mechanics
- Vol. 21 (4) , 77-87
Open AccessReal-Time Tangent Based Path Planning for Autonomous Robots in Convex Obstacle Environments
This study introduces a novel geometric algorithm for online path planning of autonomous robots in two-dimensional environments with convex obstacles. The proposed method models obstacles using optimized inscribed ellipses and generates candidate trajectories through tangent lines. By doing so, the planning problem at each step is confined to a convex region, and the optimal path is determined by minimizing a three-term cost function that incorporates path length, angular deviation, and obstacle clearance. This formulation not only simplifies the computational process but also supports rapid, real-time path updates in dynamic environments.Extensive simulations confirm that the algorithm considerably outperforms well-established approaches such as A*, RRT*, and ACO. In the first test environment, it achieved an execution time of only 0.032 s (versus 3.981 s for A* and 4.1 s for RRT*), a path length of 1896.9 m (shorter than 1952.2 m for RRT*), and a smoothness value of 0.225 (compared with 696.6 for A* and 5.147 for RRT*). In the second environment, the computation time was 0.124 s and the smoothness 0.40, representing at least a 60% improvement over A* and a 20% improvement over RRT*. Furthermore, the method reduced the average energy consumption by 5–10% compared with competing algorithms.Overall, the findings demonstrate that the proposed algorithm produces shorter, smoother, and more energy-efficient paths while significantly reducing computational cost. These advantages make it a promising candidate for large-scale, real-time robotic applications, with potential for further extension to three-dimensional environments.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (1) , 46-58
Integrated Fault Detection and Fault-Tolerant Optimal Tracking Control for Unknown Nonlinear Systems With State and Input Constraints Using Safe Reinforcement Learning
This article deals with the problem of fault detection (FD) and fault-tolerant optimal control in unknown affine nonlinear systems subject to actuator and process faults with state and input constraints. In this regard, a novel integrated fault-tolerant optimal tracking control (FTOTC) scheme is proposed based on safe reinforcement learning (RL) without requiring prior knowledge of the system dynamics. First, by introducing a discounted cost function that incorporates a control barrier function (CBF) term, the constrained FTOTC problem is transformed into an unconstrained optimal regulation problem for an augmented system formed from the dynamics of the tracking error and the reference trajectory. Subsequently, we adopt an identifier-critic framework to solve the associated Hamilton–Jacobi-Bellman (HJB) equation online, training both neural networks (NNs) simultaneously. We propose an experience replay (ER)-enhanced update law for the identifier NN, where the forgetting factor (FF) is considered to be variable and dependent on the state estimation errors and measurement noise estimation. It is shown that the proposed identifier update law improves the convergence rate and reduces NN weight estimation error in comparison with the constant FF condition without the ER enhancement, while increasing robustness against measurement noise. Distinct from typical RL algorithms, the initial admissible control condition is eliminated by using a modified variable gain gradient descent-based update law for the critic NN, which leverages a stabilizing term. The learning rate of critic update law is a function of instantaneous HJB error, yielding a tighter a tighter residual error bound for the NN weights. We prove that all the system states and the identifier and critic NN weight errors are uniformly ultimately bounded (UUB) by the Lyapunov stability theory. Simulation results on a single-link robotic manipulator demonstrate the effectiveness of the presented integrated scheme in different fault scenarios.
- 30 October 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (1) , 46-58
Integrated Fault Detection and Fault-Tolerant Optimal Tracking Control for Unknown Nonlinear Systems With State and Input Constraints Using Safe Reinforcement Learning
This article deals with the problem of fault detection (FD) and fault-tolerant optimal control in unknown affine nonlinear systems subject to actuator and process faults with state and input constraints. In this regard, a novel integrated fault-tolerant optimal tracking control (FTOTC) scheme is proposed based on safe reinforcement learning (RL) without requiring prior knowledge of the system dynamics. First, by introducing a discounted cost function that incorporates a control barrier function (CBF) term, the constrained FTOTC problem is transformed into an unconstrained optimal regulation problem for an augmented system formed from the dynamics of the tracking error and the reference trajectory. Subsequently, we adopt an identifier-critic framework to solve the associated Hamilton–Jacobi-Bellman (HJB) equation online, training both neural networks (NNs) simultaneously. We propose an experience replay (ER)-enhanced update law for the identifier NN, where the forgetting factor (FF) is considered to be variable and dependent on the state estimation errors and measurement noise estimation. It is shown that the proposed identifier update law improves the convergence rate and reduces NN weight estimation error in comparison with the constant FF condition without the ER enhancement, while increasing robustness against measurement noise. Distinct from typical RL algorithms, the initial admissible control condition is eliminated by using a modified variable gain gradient descent-based update law for the critic NN, which leverages a stabilizing term. The learning rate of critic update law is a function of instantaneous HJB error, yielding a tighter a tighter residual error bound for the NN weights. We prove that all the system states and the identifier and critic NN weight errors are uniformly ultimately bounded (UUB) by the Lyapunov stability theory. Simulation results on a single-link robotic manipulator demonstrate the effectiveness of the presented integrated scheme in different fault scenarios.
- 14 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (5) , 2024-2037
Data-Driven Inverse Reinforcement Learning for Heterogeneous Optimal Robust Formation Control
This article presents novel data-driven inverse reinforcement learning (IRL) algorithms to optimally address heterogeneous formation control problems in the presence of disturbances. We propose expert-estimator-learner multiagent systems (MASs) as independent systems with similar interaction graphs. First, a model-based IRL algorithm is introduced for the estimator MAS to determine its optimal control and reward functions. Using the estimator IRL algorithm results, a robust algorithm for model-free IRL is presented to reconstruct the learner MAS’s optimal control and reward functions without knowing the learners’ dynamics. Therefore, estimator MAS aims to estimate experts’ desired formation and learner MAS wants to track the estimators’ trajectories optimally. As a final step, data-driven implementations of these proposed IRL algorithms are presented. Consequently, this research contributes to identifying unknown reward functions and optimal controls by conducting demonstrations. Our analysis shows that the stability and convergence of MASs are thoroughly ensured. The effectiveness of the given algorithms is demonstrated via simulation results.
- 14 March 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 55 (5) , 2024-2037
Data-Driven Inverse Reinforcement Learning for Heterogeneous Optimal Robust Formation Control
This article presents novel data-driven inverse reinforcement learning (IRL) algorithms to optimally address heterogeneous formation control problems in the presence of disturbances. We propose expert-estimator-learner multiagent systems (MASs) as independent systems with similar interaction graphs. First, a model-based IRL algorithm is introduced for the estimator MAS to determine its optimal control and reward functions. Using the estimator IRL algorithm results, a robust algorithm for model-free IRL is presented to reconstruct the learner MAS’s optimal control and reward functions without knowing the learners’ dynamics. Therefore, estimator MAS aims to estimate experts’ desired formation and learner MAS wants to track the estimators’ trajectories optimally. As a final step, data-driven implementations of these proposed IRL algorithms are presented. Consequently, this research contributes to identifying unknown reward functions and optimal controls by conducting demonstrations. Our analysis shows that the stability and convergence of MASs are thoroughly ensured. The effectiveness of the given algorithms is demonstrated via simulation results.
- Open Access
- 2 January 2025
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 111 (1) , 1-21
Autonomous Drone Detection and Classification Using Computer Vision and Prony Algorithm-Based Frequency Feature Extraction
- 2 January 2025
- Published by Springer Nature in Journal of Intelligent & Robotic Systems
- Vol. 111 (1) , 1-21
Open AccessAutonomous Drone Detection and Classification Using Computer Vision and Prony Algorithm-Based Frequency Feature Extraction
- Open Access
- 1 January 2025
- Published by Wiley in International Transactions on Electrical Energy Systems
- Vol. 2025 (1)
Multiagent Energy Management System Design Using Reinforcement Learning: The New Energy Lab Training Set Case Study
This paper proposes a multiagent reinforcement learning (MARL) approach to optimize energy management in a grid‐connected microgrid (MG). Renewable energy resources (RES) and customers are modeled as autonomous agents using reinforcement learning (RL) to interact with their environment. Agents are unaware of the actions or presence of others, which ensures privacy. Each agent aims to maximize its expected rewards individually. A double auction (DA) algorithm determines the price of the internal market. After market clearing, any unmet loads or excess energy are exchanged with the main grid. The New Energy Lab (NEL) at Staffordshire University is used as a case study, including wind turbines (WTs), photovoltaic (PV) panels, a fuel cell (FC), a battery, and various loads. We introduce a model‐free Q‐learning (QL) algorithm for managing energy in the NEL. Agents explore the environment, evaluate state‐action pairs, and operate in a decentralized manner during training and implementation. The algorithm selects actions that maximize long‐term value. To fairly consider the algorithms for both customers and producers, a fairness factor criterion is used. QL achieves a fairness factor of 1.2643, compared to 1.2358 for MC. It also has a shorter training time of 1483 compared with 1879.74 for MC and requires less memory, making it more efficient.
- 1 January 2025
- Published by Wiley in International Transactions on Electrical Energy Systems
- Vol. 2025 (1)
Open AccessMultiagent Energy Management System Design Using Reinforcement Learning: The New Energy Lab Training Set Case Study
This paper proposes a multiagent reinforcement learning (MARL) approach to optimize energy management in a grid‐connected microgrid (MG). Renewable energy resources (RES) and customers are modeled as autonomous agents using reinforcement learning (RL) to interact with their environment. Agents are unaware of the actions or presence of others, which ensures privacy. Each agent aims to maximize its expected rewards individually. A double auction (DA) algorithm determines the price of the internal market. After market clearing, any unmet loads or excess energy are exchanged with the main grid. The New Energy Lab (NEL) at Staffordshire University is used as a case study, including wind turbines (WTs), photovoltaic (PV) panels, a fuel cell (FC), a battery, and various loads. We introduce a model‐free Q‐learning (QL) algorithm for managing energy in the NEL. Agents explore the environment, evaluate state‐action pairs, and operate in a decentralized manner during training and implementation. The algorithm selects actions that maximize long‐term value. To fairly consider the algorithms for both customers and producers, a fairness factor criterion is used. QL achieves a fairness factor of 1.2643, compared to 1.2358 for MC. It also has a shorter training time of 1483 compared with 1879.74 for MC and requires less memory, making it more efficient.
- Open Access
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 171368-171395
Comparative Analysis of Control Strategies for Microgrid Energy Management with a Focus on Reinforcement Learning
The depletion of fossil fuel reserves and the urgent need to cut greenhouse gas emissions are driving a significant shift in the global energy sector. This transformation necessitates advanced energy management strategies in microgrids to integrate renewable energy sources efficiently. Traditional methods, including classical, metaheuristic, model predictive, stochastic, and robust control techniques, have been extensively studied. However, these approaches often struggle with slow performance and high computational demands, making them less effective for real-time applications due to the need for frequent re-optimization. In contrast, reinforcement learning, a branch of machine learning, excels by continuously learning and optimizing through real-time interactions This approach offers greater flexibility and adaptability in complex and dynamic environments. This paper provides a comparative review of various control strategies for microgrid energy management, examining their strengths and limitations. We place a particular focus on reinforcement learning algorithms and their application in microgrids. This paper conducts a detailed analysis of studies on reinforcement learning-based energy management systems, evaluating their potential to enhance energy efficiency, optimize usage, and contribute to the sustainability of modern energy infrastructures. This review aims to enhance understanding in this field and offer insights for future research on smart energy management systems.
- 11 November 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 12, 171368-171395
Open AccessComparative Analysis of Control Strategies for Microgrid Energy Management with a Focus on Reinforcement Learning
The depletion of fossil fuel reserves and the urgent need to cut greenhouse gas emissions are driving a significant shift in the global energy sector. This transformation necessitates advanced energy management strategies in microgrids to integrate renewable energy sources efficiently. Traditional methods, including classical, metaheuristic, model predictive, stochastic, and robust control techniques, have been extensively studied. However, these approaches often struggle with slow performance and high computational demands, making them less effective for real-time applications due to the need for frequent re-optimization. In contrast, reinforcement learning, a branch of machine learning, excels by continuously learning and optimizing through real-time interactions This approach offers greater flexibility and adaptability in complex and dynamic environments. This paper provides a comparative review of various control strategies for microgrid energy management, examining their strengths and limitations. We place a particular focus on reinforcement learning algorithms and their application in microgrids. This paper conducts a detailed analysis of studies on reinforcement learning-based energy management systems, evaluating their potential to enhance energy efficiency, optimize usage, and contribute to the sustainability of modern energy infrastructures. This review aims to enhance understanding in this field and offer insights for future research on smart energy management systems.
- 14 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 4867-4880
Optimal Robust Formation of Multi-Agent Systems as Adversarial Graphical Apprentice Games With Inverse Reinforcement Learning
This paper introduces a novel approach to solving robust optimal formation control problems in heterogeneous multi-agent systems (MASs) with disturbances. Our approach frames this problem as an adversarial graphical apprentice game problem, using the game concept and an inverse reinforcement learning (IRL) algorithm. This work innovates the derivation of unknown reward functions through demonstrations to achieve the desired formation. In addition, we define learner, estimator, and expert MASs as separate entities. This aim is achieved by introducing a model-based IRL algorithm with three stages of learning. After determining the optimal control of estimators in the first stage, the optimal control of learners is found in the second stage by using them. In the third stage, the reward functions of the estimator and learner MASs are updated in the inverse optimal control (IOC) stage simultaneously. Following that, we present an algorithm for model-free IRL that does not require knowledge of learner agents’ dynamics and can reconstruct reward functions after observing online trajectories. As subproblems, both proposed IRL algorithms address optimal control and IOC. We analyze these approaches for stability and convergence and demonstrate that state reward weights are non-unique. Simulation results show the effectiveness of the introduced algorithms for a group of unmanned aerial vehicles (UAVs). Note to Practitioners —Designing an optimal controller is challenging in MAS, especially where we only have access to the optimal reference path. The challenge is compounded if we do not know the agents’ dynamics and the appropriate reward function needed to achieve the desired path. This article proposes two IRL algorithms with the motivation to solve this problem. This study considers the optimal reference path for agents as expert MAS. Also, the MAS, we want to follow the desired path with the minor error, is represented as a learner MAS. The proposed approach is suitable for a large class of linear MAS since we have modeled the learner MAS with disturbance. Therefore, this method suits tracking, path-planning, and optimal formation problems in MASs. It requires minimal information but yields impressive results.
- 14 June 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 22 (15455955) , 4867-4880
Optimal Robust Formation of Multi-Agent Systems as Adversarial Graphical Apprentice Games With Inverse Reinforcement Learning
This paper introduces a novel approach to solving robust optimal formation control problems in heterogeneous multi-agent systems (MASs) with disturbances. Our approach frames this problem as an adversarial graphical apprentice game problem, using the game concept and an inverse reinforcement learning (IRL) algorithm. This work innovates the derivation of unknown reward functions through demonstrations to achieve the desired formation. In addition, we define learner, estimator, and expert MASs as separate entities. This aim is achieved by introducing a model-based IRL algorithm with three stages of learning. After determining the optimal control of estimators in the first stage, the optimal control of learners is found in the second stage by using them. In the third stage, the reward functions of the estimator and learner MASs are updated in the inverse optimal control (IOC) stage simultaneously. Following that, we present an algorithm for model-free IRL that does not require knowledge of learner agents’ dynamics and can reconstruct reward functions after observing online trajectories. As subproblems, both proposed IRL algorithms address optimal control and IOC. We analyze these approaches for stability and convergence and demonstrate that state reward weights are non-unique. Simulation results show the effectiveness of the introduced algorithms for a group of unmanned aerial vehicles (UAVs). Note to Practitioners —Designing an optimal controller is challenging in MAS, especially where we only have access to the optimal reference path. The challenge is compounded if we do not know the agents’ dynamics and the appropriate reward function needed to achieve the desired path. This article proposes two IRL algorithms with the motivation to solve this problem. This study considers the optimal reference path for agents as expert MAS. Also, the MAS, we want to follow the desired path with the minor error, is represented as a learner MAS. The proposed approach is suitable for a large class of linear MAS since we have modeled the learner MAS with disturbance. Therefore, this method suits tracking, path-planning, and optimal formation problems in MASs. It requires minimal information but yields impressive results.
- 25 April 2024
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 47 (2) , 220-237
Robust H ∞ adaptive model following control for fractional-order systems with polytopic and bounded uncertainties subject to input saturation
This paper investigates a type of robust observer-based tracking control for the well-known inverted pendulum as an uncertain fractional-order system with two-norm bounded uncertainties subject to input saturation along with external disturbance that focuses on the case of a fractional-order α such that 0 < α < 1 . The main goal is to design a robust model following tracking control servomechanism by the side of stability analysis. This paper addresses the well-known quadratic Lyapunov function in addition to the Gronwall–Bellman lemma and the sector condition of the saturation function stability synthesis. This paper proposes an outstanding strategy to achieve the best model following robust observer in the cast of output-feedback control subject to input saturation in the framework of an uncertain fractional-order system based on the linear matrix inequality (LMI) solution. The LMI procedure can be used to achieve static output-feedback tracking control and observer gain. Several valuable theorems support this approach, and various simulation scenarios are available to showcase its effectiveness.
- 25 April 2024
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 47 (2) , 220-237
Robust H ∞ adaptive model following control for fractional-order systems with polytopic and bounded uncertainties subject to input saturation
This paper investigates a type of robust observer-based tracking control for the well-known inverted pendulum as an uncertain fractional-order system with two-norm bounded uncertainties subject to input saturation along with external disturbance that focuses on the case of a fractional-order α such that 0 < α < 1 . The main goal is to design a robust model following tracking control servomechanism by the side of stability analysis. This paper addresses the well-known quadratic Lyapunov function in addition to the Gronwall–Bellman lemma and the sector condition of the saturation function stability synthesis. This paper proposes an outstanding strategy to achieve the best model following robust observer in the cast of output-feedback control subject to input saturation in the framework of an uncertain fractional-order system based on the linear matrix inequality (LMI) solution. The LMI procedure can be used to achieve static output-feedback tracking control and observer gain. Several valuable theorems support this approach, and various simulation scenarios are available to showcase its effectiveness.
- 23 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (7) , 4198-4209
Robust State-Coupled Fault Estimation Based on Observer Design for Lipschitz Nonlinear Systems With State Disturbance Using Polytopic Linear Model
This article aims to design observers for the purpose of simultaneously estimating the fault and states of a class of Lipschitz nonlinear systems and attenuating the effect of disturbances. Fault and disturbance are considered as nonlinear functions coupled with the states of the system. To estimate a fault coupled with the states, two observers are designed separately. In the first method, the nonlinear function of the fault is represented by a polytopic linear model (PLM) with unmeasurable premise variables. Also, based on the dissipativity theory, the effect of disturbance can be attenuated using Lipschitz matrix. To declare the conditions for the existence of the proposed observer, the Lyapunov method and S-Procedure Lemma are used through the linear matrix inequality (LMI) formulation. Then in the second method, fault and states of system are estimated by designing an observer and considering an $\mathbf{\varepsilon}$ -accurate PLM with bounds on Taylor remainder. The second approach is able to increase the feasibility of the design and the accuracy of fault estimation. However, the main advantage of the first method is that it has less computational complexity compared to the second method. The efficiency of the proposed methods has been validated by the simulation of an Electro-pump system subject to fault and disturbance both coupled with the system states.
- 23 April 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 54 (7) , 4198-4209
Robust State-Coupled Fault Estimation Based on Observer Design for Lipschitz Nonlinear Systems With State Disturbance Using Polytopic Linear Model
This article aims to design observers for the purpose of simultaneously estimating the fault and states of a class of Lipschitz nonlinear systems and attenuating the effect of disturbances. Fault and disturbance are considered as nonlinear functions coupled with the states of the system. To estimate a fault coupled with the states, two observers are designed separately. In the first method, the nonlinear function of the fault is represented by a polytopic linear model (PLM) with unmeasurable premise variables. Also, based on the dissipativity theory, the effect of disturbance can be attenuated using Lipschitz matrix. To declare the conditions for the existence of the proposed observer, the Lyapunov method and S-Procedure Lemma are used through the linear matrix inequality (LMI) formulation. Then in the second method, fault and states of system are estimated by designing an observer and considering an $\mathbf{\varepsilon}$ -accurate PLM with bounds on Taylor remainder. The second approach is able to increase the feasibility of the design and the accuracy of fault estimation. However, the main advantage of the first method is that it has less computational complexity compared to the second method. The efficiency of the proposed methods has been validated by the simulation of an Electro-pump system subject to fault and disturbance both coupled with the system states.
- Open Access
- 12 April 2024
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 18 (10) , 1248-1261
Policy iteration for H ∞ control of polynomial time‐varying systems
This paper studies the H ∞ control problem for polynomial time‐varying systems. The H ∞ control problem has been much less investigated for time‐varying systems in comparison to the time‐invariant systems. Approximate dynamic programming (ADP) is an optimal method to solve the control problems. Therefore, it is valuable to solve the polynomial time‐varying H ∞ control problem with the ADP approach. Considering the time as an independent variable for sum‐of‐squares (SOS) optimization problems, an SOS‐based ADP method is proposed to solve this problem. A policy iteration algorithm is presented, where in its policy evaluation step it is sufficient to solve an optimization problem. Some constraints are added to this optimization problem to guarantee the closed‐loop exponential stability. The convergence and stability properties of the proposed algorithm are stated and proven. Moreover, in order to design an H ∞ controller with a smaller disturbance attenuation coefficient, a two‐loop algorithm is suggested. Finally, the effectiveness of the proposed method is demonstrated by simulation examples.
- 12 April 2024
- Published by Institution of Engineering and Technology (IET) in IET Control Theory & Applications
- Vol. 18 (10) , 1248-1261
Open AccessPolicy iteration for H ∞ control of polynomial time‐varying systems
This paper studies the H ∞ control problem for polynomial time‐varying systems. The H ∞ control problem has been much less investigated for time‐varying systems in comparison to the time‐invariant systems. Approximate dynamic programming (ADP) is an optimal method to solve the control problems. Therefore, it is valuable to solve the polynomial time‐varying H ∞ control problem with the ADP approach. Considering the time as an independent variable for sum‐of‐squares (SOS) optimization problems, an SOS‐based ADP method is proposed to solve this problem. A policy iteration algorithm is presented, where in its policy evaluation step it is sufficient to solve an optimization problem. Some constraints are added to this optimization problem to guarantee the closed‐loop exponential stability. The convergence and stability properties of the proposed algorithm are stated and proven. Moreover, in order to design an H ∞ controller with a smaller disturbance attenuation coefficient, a two‐loop algorithm is suggested. Finally, the effectiveness of the proposed method is demonstrated by simulation examples.