Asma Al-Tamimi | Hashemite University (original) (raw)
Uploads
Papers by Asma Al-Tamimi
Systems, Man, and …, Jan 1, 2008
Systems, Man, and …, Jan 1, 2007
In this correspondence, adaptive critic approximate dynamic programming designs are derived to so... more In this correspondence, adaptive critic approximate dynamic programming designs are derived to solve the discrete-time zero-sum game in which the state and action spaces are continuous. This results in a forward-in-time reinforcement learning algorithm that converges to the Nash equilibrium of the corresponding zero-sum game. The results in this correspondence can be thought of as a way to solve the Riccati equation of the well-known discrete-time H(infinity) optimal control problem forward in time. Two schemes are presented, namely: 1) a heuristic dynamic programming and 2) a dual-heuristic dynamic programming, to solve for the value function and the costate of the game, respectively. An H(infinity) autopilot design for an F-16 aircraft is presented to illustrate the results.
Neural Networks, 2007 …, Jan 1, 2007
Abstract In this paper, we present online model-free adaptive critic (AC) schemes based on appro... more Abstract In this paper, we present online model-free adaptive critic (AC) schemes based on approximate dynamic programming (ADP) to solve optimal control problems in both discrete-time and continuous-time domains for linear systems with unknown dynamics. In ...
Attention: This paper is not yet published. If you are interested in purchasing it - via Mail, Fa... more Attention: This paper is not yet published. If you are interested in purchasing it - via Mail, Fax or Download - please click on the "Mail" shopping cart icon below and proceed through the checkout process once you are finished browsing our web site. When this paper becomes ...
Systems, Man, and …, Jan 1, 2008
Systems, Man, and …, Jan 1, 2007
In this correspondence, adaptive critic approximate dynamic programming designs are derived to so... more In this correspondence, adaptive critic approximate dynamic programming designs are derived to solve the discrete-time zero-sum game in which the state and action spaces are continuous. This results in a forward-in-time reinforcement learning algorithm that converges to the Nash equilibrium of the corresponding zero-sum game. The results in this correspondence can be thought of as a way to solve the Riccati equation of the well-known discrete-time H(infinity) optimal control problem forward in time. Two schemes are presented, namely: 1) a heuristic dynamic programming and 2) a dual-heuristic dynamic programming, to solve for the value function and the costate of the game, respectively. An H(infinity) autopilot design for an F-16 aircraft is presented to illustrate the results.
Neural Networks, 2007 …, Jan 1, 2007
Abstract In this paper, we present online model-free adaptive critic (AC) schemes based on appro... more Abstract In this paper, we present online model-free adaptive critic (AC) schemes based on approximate dynamic programming (ADP) to solve optimal control problems in both discrete-time and continuous-time domains for linear systems with unknown dynamics. In ...
Attention: This paper is not yet published. If you are interested in purchasing it - via Mail, Fa... more Attention: This paper is not yet published. If you are interested in purchasing it - via Mail, Fax or Download - please click on the "Mail" shopping cart icon below and proceed through the checkout process once you are finished browsing our web site. When this paper becomes ...