Optimal control of the Shuttle-Tethered-Subsatellite system

Bainum, Peter M.; Kumar, Vijay

doi:10.1016/0094-5765(80)90010-7

Cited by 142 publications

(51 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The mechanical model of the tether is a perfectly flexible, massive, continuous, visco-elastic string with variable length ( [3], [6], [21]). The endbodies are modeled either as point masses or rigid bodies ( [6], [14]).…”

Section: Modelingmentioning

confidence: 99%

Tethered satellite systems: A challenge for mechanics and applied mathematics

Schwarzbart

Steindl

Steiner³

et al. 2009

GAMM-Mitteilungen

View full text Add to dashboard Cite

Tethered satellite systems that is two or more satellites in orbit connected by thin long cables, pose a number of challenging problems in mechanics concerning modeling and derivation of the equations of motion and in applied mathematics, concerning the numerical simulation of their dynamics, deciding on stability of relative equilibria and the proof of chaotic dynamics. We also compare for the practically important process of deployment of one satellite from another satellite uncontrolled deployment with steered deployment, according to Pontrijagin's Maximum Principle. Related to the stability of relative equilibria, as example the Space elevator, which is a tethered system extending from the surface of the Earth beyond geostationary height, is considered.

show abstract

Section: Modelingmentioning

confidence: 99%

Tethered satellite systems: A challenge for mechanics and applied mathematics

Schwarzbart

Steindl

Steiner³

et al. 2009

GAMM-Mitteilungen

View full text Add to dashboard Cite

show abstract

“…and then writing the Lagrange equations for each of the generalized coordinates as follows 50,51,52 :…”

Section: Preliminary Analysis Of Gravity Gradient Induced Deploymentmentioning

confidence: 99%

The dynamics and control of the CubeSail mission: A solar sailing demonstration

Pukniel

Coverstone

Burton

et al. 2011

Advances in Space Research

View full text Add to dashboard Cite

The proposed study addresses two issues related to the slow emergence of solar sailing as a viable space propulsion method. The low technology readiness level and complications related to stowage, deployment, and support of the sail structure are both addressed by combining the CU Aerospace and University of Illinois-developed UltraSail and CubeSat expertise to design a small-scale solar sail deployment and propulsion experiment in low Earth orbit. The study analyzes multiple aspects of the problem from initial sizing and packaging of the solar sail film into two CubeSat-class spacecraft, through on-orbit deployment dynamics, attitude control of large and flexible space structure, and predictions of performance and orbital maneuvering capability.iii ACKNOWLEDGEMENTS

show abstract

“…Dynamic optimization has been widely applied in chemical engineering [6,48], mechanical engineering [26,46], aerospace engineering [1] and other disciplines [20]. Constrained dynamic optimization problems are practically important, e.g., to enforce product quality or to guarantee safety [17,48].…”

Section: Introductionmentioning

confidence: 99%

Local optimization of dynamic programs with guaranteed satisfaction of path constraints

Faust

Chachuat

et al. 2015

Automatica

View full text Add to dashboard Cite

An algorithm is proposed for locating a feasible point satisfying the KKT conditions to a specified tolerance of feasible inequalitypath-constrained dynamic programs (PCDP) within a finite number of iterations. The algorithm is based on iteratively approximating the PCDP by restricting the right-hand side of the path constraints and enforcing the path constraints at finitely many time points. The main contribution of this article is an adaptation of the semi-infinite program (SIP) algorithm proposed in [Mitsos, Optimization, 2011, 60(10-11):1291-1308] to PCDP. It is proved that the algorithm terminates finitely with a guaranteed feasible point which satisfies the first-order KKT conditions of the PCDP to a specified tolerance. The main assumptions are: i) availability of a nonlinear program (NLP) local solver that generates a KKT point of the constructed approximation to PCDP at each iteration if this problem is indeed feasible; ii) existence of a Slater point of the PCDP that also satisfies the first-order KKT conditions of the PCDP to a specified tolerance; iii) all KKT multipliers are nonnegative and uniformly bounded with respect to all iterations. The performance of the algorithm is analyzed through two numerical case studies.

show abstract

Optimal control of the Shuttle-Tethered-Subsatellite system

Cited by 142 publications

References 1 publication

Tethered satellite systems: A challenge for mechanics and applied mathematics

Tethered satellite systems: A challenge for mechanics and applied mathematics

The dynamics and control of the CubeSail mission: A solar sailing demonstration

Local optimization of dynamic programs with guaranteed satisfaction of path constraints

Contact Info

Product

Resources

About