Physics-Informed Neural Networks for Optimal Planar Orbit Transfers
This paper presents a novel framework, combining the indirect method and Physics-Informed Neural Networks (PINNs), to learn optimal control actions for a series of optimal planar orbit transfer problems. According to the indirect method, the optimal control is retrieved by directly applying the Pont...
Gespeichert in:
Veröffentlicht in: | Journal of spacecraft and rockets 2022-05, Vol.59 (3), p.834-849 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | This paper presents a novel framework, combining the indirect method and Physics-Informed Neural Networks (PINNs), to learn optimal control actions for a series of optimal planar orbit transfer problems. According to the indirect method, the optimal control is retrieved by directly applying the Pontryagin minimum principle, which provides the first-order necessary optimality conditions. The necessary conditions result in a two-point boundary value problem (TPBVP) in the state–costate pair, constituting a system of ordinary differential equations, representing the physics constraints of the problem. More precisely, the goal is to model a neural network (NN) representation of the state–costate pair for which the residuals of the TPVBP are as close to zero as possible. This is done using PINNs, which are particular NNs where the training is driven by the problem’s physics constraints. A particular PINN method will be used, named Extreme Theory of Functional Connections (X-TFC), which is a synergy of the classic PINN and the Theory of Functional Connections. With X-TFC, the TPBVP’s boundary conditions are analytically satisfied. This avoids having unbalanced gradients during the network training. The results show the feasibility of employing PINNs to tackle this class of optimal control problems for space applications. |
---|---|
ISSN: | 0022-4650 1533-6794 |
DOI: | 10.2514/1.A35138 |