Ali Heydari
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
Ali Heydari has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
- Tohid Sardarmehni
Department of Mechanical Engineering, California State University Northridge, Northridge, CA, USA
2 shared publications S.N. Balakrishnan
1 shared publication
Latest Publications
- 17 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 32 (10) , 4544-4552
Optimal Impulsive Control Using Adaptive Dynamic Programming and its Application in Spacecraft Rendezvous
Optimal control of nonlinear impulsive systems with free impulse instants and the number of impulses is investigated in this study. A scheme based on adaptive dynamic programming is developed, which leads to a feedback (approximate) solution to the defined optimal impulsive control problem. This is done by proposing a learning algorithm for tuning parameters of a function approximator, which, once tuned offline, provides feedback solution on-the-fly. The scheme is shown to handle single and multiple impulsive actuators with a small online computational burden. Afterward, the controller is applied to a challenging problem, namely, the orbital maneuver of spacecraft with the fixed final time using impulsive actuators. The objective is triggering the actuators in a fuel-optimal manner such that the spacecraft transfers to the desired orbit at a prescribed time. It was shown that the proposed scheme leads to simultaneous and feedback path planning and control for the maneuver. The potentials of the scheme are analyzed in different scenarios, including enforcing a shorter final time, selecting different initial states, and incorporating actuator faults.
- 17 September 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 32 (10) , 4544-4552
Optimal Impulsive Control Using Adaptive Dynamic Programming and its Application in Spacecraft Rendezvous
Optimal control of nonlinear impulsive systems with free impulse instants and the number of impulses is investigated in this study. A scheme based on adaptive dynamic programming is developed, which leads to a feedback (approximate) solution to the defined optimal impulsive control problem. This is done by proposing a learning algorithm for tuning parameters of a function approximator, which, once tuned offline, provides feedback solution on-the-fly. The scheme is shown to handle single and multiple impulsive actuators with a small online computational burden. Afterward, the controller is applied to a challenging problem, namely, the orbital maneuver of spacecraft with the fixed final time using impulsive actuators. The objective is triggering the actuators in a fuel-optimal manner such that the spacecraft transfers to the desired orbit at a prescribed time. It was shown that the proposed scheme leads to simultaneous and feedback path planning and control for the maneuver. The potentials of the scheme are analyzed in different scenarios, including enforcing a shorter final time, selecting different initial states, and incorporating actuator faults.
- 5 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 66 (1) , 482-490
Optimal Codesign of Control Input and Triggering Instants for Networked Control Systems Using Adaptive Dynamic Programming
The problem of codesign or simultaneous synthesis of triggering and input policies is investigated. The policies are synthesized to minimize a cost function incorporating a data transmission cost. This is unlike the common practice of utilizing an a priori -designed stabilizing control policy and designing a triggering policy, which retains stability. Initially, a finite-horizon cost function that penalizes the state, the control input, and each data transmission is selected. The optimal actions comprised of the control input and the triggering decision, under the operation choice of zero-order hold (ZOH), are approximately obtained in a feedback form, using adaptive dynamic programming. Afterward, the design is extended to the case of generalized ZOH, where the last transmitted state information is updated using a possibly imperfect model. Extension to infinite-horizon cost functions is presented. After analysis of convergence and optimality, the performance of the method is demonstrated through some numerical examples.
- 5 April 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 66 (1) , 482-490
Optimal Codesign of Control Input and Triggering Instants for Networked Control Systems Using Adaptive Dynamic Programming
The problem of codesign or simultaneous synthesis of triggering and input policies is investigated. The policies are synthesized to minimize a cost function incorporating a data transmission cost. This is unlike the common practice of utilizing an a priori -designed stabilizing control policy and designing a triggering policy, which retains stability. Initially, a finite-horizon cost function that penalizes the state, the control input, and each data transmission is selected. The optimal actions comprised of the control input and the triggering decision, under the operation choice of zero-order hold (ZOH), are approximately obtained in a feedback form, using adaptive dynamic programming. Afterward, the design is extended to the case of generalized ZOH, where the last transmitted state information is updated using a possibly imperfect model. Extension to infinite-horizon cost functions is presented. After analysis of convergence and optimality, the performance of the method is demonstrated through some numerical examples.
- 1 April 2018
- Published by Elsevier in Neurocomputing
- Vol. 285, 10-22
Sub-optimal scheduling in switched systems with continuous-time dynamics: A gradient descent approach
- 1 April 2018
- Published by Elsevier in Neurocomputing
- Vol. 285, 10-22
Sub-optimal scheduling in switched systems with continuous-time dynamics: A gradient descent approach
- 5 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (9) , 3119-3126
Stability Analysis of Optimal Adaptive Control Using Value Iteration With Approximation Errors
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed in terms of stability of the system during the learning stage without ignoring the effects of approximation errors. This analysis includes the system operated using any single/constant resulting control policy and also using an evolving/time-varying control policy. A feature of the presented results is providing estimations of the region of attraction so that if the initial condition is within the region, the whole trajectory will remain inside it and hence, the function approximation results remain valid.
- 5 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 63 (9) , 3119-3126
Stability Analysis of Optimal Adaptive Control Using Value Iteration With Approximation Errors
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed in terms of stability of the system during the learning stage without ignoring the effects of approximation errors. This analysis includes the system operated using any single/constant resulting control policy and also using an evolving/time-varying control policy. A feature of the presented results is providing estimations of the region of attraction so that if the initial condition is within the region, the whole trajectory will remain inside it and hence, the function approximation results remain valid.
- 31 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (6) , 2167-2178
Suboptimal Scheduling in Switched Systems With Continuous-Time Dynamics: A Least Squares Approach
Two approximate solutions for optimal control of switched systems with autonomous subsystems and continuous-time dynamics are presented. The first solution formulates a policy iteration (PI) algorithm for the switched systems with recursive least squares. To reduce the computational burden imposed by the PI algorithm, a second solution, called single loop PI, is presented. Online and concurrent training algorithms are discussed for implementing each solution. At last, effectiveness of the presented algorithms is evaluated through numerical simulations.
- 31 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (6) , 2167-2178
Suboptimal Scheduling in Switched Systems With Continuous-Time Dynamics: A Least Squares Approach
Two approximate solutions for optimal control of switched systems with autonomous subsystems and continuous-time dynamics are presented. The first solution formulates a policy iteration (PI) algorithm for the switched systems with recursive least squares. To reduce the computational burden imposed by the PI algorithm, a second solution, called single loop PI, is presented. Online and concurrent training algorithms are discussed for implementing each solution. At last, effectiveness of the presented algorithms is evaluated through numerical simulations.
- Open Access
Stability Analysis of Optimal Adaptive Control using Value Iteration with Approximation Errors
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed in terms of stability of the system during the learning stage without ignoring the effects of approximation errors. This analysis includes the system operated using any single/constant resulting control policy and also using an evolving/time-varying control policy. A feature of the presented results is providing estimations of the \textit{region of attraction} so that if the initial condition is within the region, the whole trajectory will remain inside it and hence, the function approximation results remain valid.
Open AccessStability Analysis of Optimal Adaptive Control using Value Iteration with Approximation Errors
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed in terms of stability of the system during the learning stage without ignoring the effects of approximation errors. This analysis includes the system operated using any single/constant resulting control policy and also using an evolving/time-varying control policy. A feature of the presented results is providing estimations of the \textit{region of attraction} so that if the initial condition is within the region, the whole trajectory will remain inside it and hence, the function approximation results remain valid.
- 16 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (9) , 4522-4527
Stability Analysis of Optimal Adaptive Control Under Value Iteration Using a Stabilizing Initial Policy
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed. The analysis is in terms of stability of the system during the learning stage and includes the system controlled by any fixed control policy and also by an evolving policy. A feature of the presented results is finding subsets of the region of attraction. This is done so that if the initial condition belongs to this region, the entire state trajectory remains within the training region. Therefore, the function approximation results remain reliable, as no extrapolation will be conducted.
- 16 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (9) , 4522-4527
Stability Analysis of Optimal Adaptive Control Under Value Iteration Using a Stabilizing Initial Policy
Adaptive optimal control using value iteration initiated from a stabilizing control policy is theoretically analyzed. The analysis is in terms of stability of the system during the learning stage and includes the system controlled by any fixed control policy and also by an evolving policy. A feature of the presented results is finding subsets of the region of attraction. This is done so that if the initial condition belongs to this region, the entire state trajectory remains within the training region. Therefore, the function approximation results remain reliable, as no extrapolation will be conducted.
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. PP (2162237X) , 1-11
Optimal Triggering of Networked Control Systems
This paper is focused on bandwidth allocation in nonlinear networked control systems. The objective is optimal triggering/scheduling for transmitting sensor measurements to the controller through a communication network. An algorithm based on approximate dynamic programming is developed for problems with fixed final times and then the result is extended to problems with infinite horizon. Zero-order-hold (ZOH), generalized ZOH, and networks with packet dropouts are the investigated cases. Problems with unknown models are also addressed and a model-free scheme is established for learning the (approximate) optimal solution. The convergence, optimality, and stability of the results are analyzed and, afterwards, some numerical analyses are presented for demonstrating the potentials of the algorithms in practice.
- 27 June 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. PP (2162237X) , 1-11
Optimal Triggering of Networked Control Systems
This paper is focused on bandwidth allocation in nonlinear networked control systems. The objective is optimal triggering/scheduling for transmitting sensor measurements to the controller through a communication network. An algorithm based on approximate dynamic programming is developed for problems with fixed final times and then the result is extended to problems with infinite horizon. Zero-order-hold (ZOH), generalized ZOH, and networks with packet dropouts are the investigated cases. Problems with unknown models are also addressed and a model-free scheme is established for learning the (approximate) optimal solution. The convergence, optimality, and stability of the results are analyzed and, afterwards, some numerical analyses are presented for demonstrating the potentials of the algorithms in practice.
- Open Access
- 29 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (3) , 586-596
Optimal Switching of DC–DC Power Converters Using Approximate Dynamic Programming
Optimal switching between different topologies in step-down dc-dc voltage converters, with nonideal inductors and capacitors, is investigated in this paper. Challenges including constraint on the inductor current and voltage leakages across the capacitor (due to switching) are incorporated. The objective is generating the desired voltage with low ripples and high robustness toward line and load disturbances. A previously developed tool, which is based on approximate dynamic programming, is adapted for this application. The scheme leads to tuning a parametric function approximator to provide optimal switching in a feedback form. No fixed cycle time is assumed, as the cycle time and the duty ratio will be adjusted on the fly in an optimal fashion. The controller demonstrates good capabilities in controlling the system even under parameter uncertainties. Finally, some modifications on the scheme are conducted to handle optimal switching problems with state jumps at the switching times.
- 29 December 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. 29 (3) , 586-596
Open AccessOptimal Switching of DC–DC Power Converters Using Approximate Dynamic Programming
Optimal switching between different topologies in step-down dc-dc voltage converters, with nonideal inductors and capacitors, is investigated in this paper. Challenges including constraint on the inductor current and voltage leakages across the capacitor (due to switching) are incorporated. The objective is generating the desired voltage with low ripples and high robustness toward line and load disturbances. A previously developed tool, which is based on approximate dynamic programming, is adapted for this application. The scheme leads to tuning a parametric function approximator to provide optimal switching in a feedback form. No fixed cycle time is assumed, as the cycle time and the duty ratio will be adjusted on the fly in an optimal fashion. The controller demonstrates good capabilities in controlling the system even under parameter uncertainties. Finally, some modifications on the scheme are conducted to handle optimal switching problems with state jumps at the switching times.
- 1 December 2013
- Published by Elsevier in Neural Networks
- Vol. 48, 61-71
Fixed-final-time optimal control of nonlinear systems with terminal constraints
- 1 December 2013
- Published by Elsevier in Neural Networks
- Vol. 48, 61-71
Fixed-final-time optimal control of nonlinear systems with terminal constraints