Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 4 of 4
Full-Text Articles in Aerospace Engineering
Stationkeeping Of An L₂ Libration Point Satellite With Θ-D Technique, Ming Xin, S. N. Balakrishnan, Henry J. Pernicka, Michael W. Dancer
Stationkeeping Of An L₂ Libration Point Satellite With Θ-D Technique, Ming Xin, S. N. Balakrishnan, Henry J. Pernicka, Michael W. Dancer
Mechanical and Aerospace Engineering Faculty Research & Creative Works
A new method for L2 libration-point orbit stationkeeping is proposed in this paper using continuous thrust. The circular restricted three-body problem with Sun and Earth as the two primaries is considered. The unstable orbit about the L2 libration-point requires stationkeeping maneuvers to maintain the nominal path. In this study, an approach, called the "θ-D technique," based on optimal control theory gives a closed-form suboptimal feedback solution to solve this nonlinear control problem. In this approach the Hamiltonian-Jacobi-Bellman (HJB) equation is solved approximately by adding some perturbations to the cost function. The controller is designed such that the actual …
Optimal Control Synthesis Of A Class Of Nonlinear Systems Using Single Network Adaptive Critics, Radhakant Padhi, Nishant Unnikrishnan, S. N. Balakrishnan
Optimal Control Synthesis Of A Class Of Nonlinear Systems Using Single Network Adaptive Critics, Radhakant Padhi, Nishant Unnikrishnan, S. N. Balakrishnan
Mechanical and Aerospace Engineering Faculty Research & Creative Works
Adaptive critic (AC) neural network solutions to optimal control designs using dynamic programming has reduced the need of complex computations and storage requirements that typical dynamic programming requires. In this paper, a "single network adaptive critic" (SNAC) is presented. This approach is applicable to a class of nonlinear systems where the optimal control (stationary) equation is explicitly solvable for control in terms of state and costate variables. The SNAC architecture offers three potential advantages; a simpler architecture, significant savings of computational load and reduction in approximation errors. In order to demonstrate these benefits, a real-life micro-electro-mechanical-system (MEMS) problem has been …
Nonlinear H Infinity Missile Longitudinal Autopilot Design With Θ-D Method, Ming Xin, S. N. Balakrishnan
Nonlinear H Infinity Missile Longitudinal Autopilot Design With Θ-D Method, Ming Xin, S. N. Balakrishnan
Mechanical and Aerospace Engineering Faculty Research & Creative Works
In this paper, a new nonlinear control synthesis technique, the theta- D method, is employed to design a missile longitudinal autopilot. The θ-D technique yields suboptimal solutions to nonlinear optimal control problems in the sense that it provides approximate solution to the Hamilton-Jacobi-Bellman (HJB) equation. Semi-global asymptotic stability can be achieved by manipulating the perturbation terms which are added to the cost function in developing a series solution. Furthermore, this method can be used to provide an approximate closed-form solution to the state dependent Riccati equation. The particular θ-D methodology adopted in this paper is referred to as θ-D H …
Infinite Time Optimal Neuro Control For Distributed Parameter Systems, S. N. Balakrishnan, Radhakant Padhi
Infinite Time Optimal Neuro Control For Distributed Parameter Systems, S. N. Balakrishnan, Radhakant Padhi
Mechanical and Aerospace Engineering Faculty Research & Creative Works
The conventional dynamic programming methodology for the solution of optimal control, despite having many desirable features, is severely restricted by its computational requirements. However, in recent times, an alternate formulation, known as the adaptive-critic synthesis, has given it a new perspective. In this paper, we have attempted to use the philosophy of adaptive-critic design to the optimal control of distributed parameter systems. An important contribution of this study is the derivation of the necessary conditions of optimality for distributed parameter systems, described in discrete domain, following the principle of approximate dynamic programming. Then the derived necessary conditions of optimality are …