Search citation statements
Paper Sections
Citation Types
Year Published
Publication Types
Relationship
Authors
Journals
This paper investigates the optimal control of loose leader-following spacecraft formations near libration points. The formation reconfigurations and keepings can be applied at the same time for the loose formations. A loose sphere leader-following formation, i.e., the leader spacecraft moves along the reference Halo orbits while the motions of all follower spacecrafts are restricted to a sphere formation with its center located at the leader, is explored in this study carefully. Collision avoidances among follower spacecrafts are taken into consideration since there are no constraints between followers and then the formation for all followers is loose. A symplectic penalty iteration algorithm is proposed to obtain the optimal solutions with minimization of energy cost. An effective penalty function to avoid collision is developed, and a high efficiency and structure-preserving symplectic method is introduced in the iteration algorithm. Several optimal control problems including formation reconfigurations and formation keepings are solved to show the effectiveness of the proposed algorithm. Numerical results show that errors of formations can be reduced to millimeters or smaller only by few control input and the collision can be avoided successfully by the developed penalty function.
This paper investigates the optimal control of loose leader-following spacecraft formations near libration points. The formation reconfigurations and keepings can be applied at the same time for the loose formations. A loose sphere leader-following formation, i.e., the leader spacecraft moves along the reference Halo orbits while the motions of all follower spacecrafts are restricted to a sphere formation with its center located at the leader, is explored in this study carefully. Collision avoidances among follower spacecrafts are taken into consideration since there are no constraints between followers and then the formation for all followers is loose. A symplectic penalty iteration algorithm is proposed to obtain the optimal solutions with minimization of energy cost. An effective penalty function to avoid collision is developed, and a high efficiency and structure-preserving symplectic method is introduced in the iteration algorithm. Several optimal control problems including formation reconfigurations and formation keepings are solved to show the effectiveness of the proposed algorithm. Numerical results show that errors of formations can be reduced to millimeters or smaller only by few control input and the collision can be avoided successfully by the developed penalty function.
Summary This paper proposes a robust algorithm for time‐optimal rigid spacecraft reorientation trajectory generation. Based on the Pontryagin's maximum principle, the first‐order necessary optimality conditions are derived. These optimality conditions are numerically satisfied by adopting a pseudospectral method integrated homotopic approach to solve the associated shooting functions. First, the energy‐optimal reorientation solution is obtained using the Radau pseudospectral method, which has a spectral convergence speed and can give a precise estimation of the initial costates used to start the homotopic approach. Then, a modified homotopy scheme is given to deform the associated energy‐optimal solution to the desired time‐optimal solution continuously. Finally, for the inertially symmetric spacecraft reorientation problem, the newly found time‐optimal solutions are presented. The performance of the algorithm is illustrated by simulating a general asymmetric rigid spacecraft time‐optimal reorientation problem. Copyright © 2014 John Wiley & Sons, Ltd.
Differential-algebraic equations (DAEs) can model constrained dynamical systems and processes from practical engineering. Therefore, research on nonlinear optimal control problems of DAEs is of theoretical significance for optimal control of constrained systems, which can generate reference trajectories and control inputs for online control strategies. In terms of the numerical solution of this type of problem, research on indirect numerical methods is still insufficient and less research focuses on symplectic-preserving methods. In this article, a symplectic indirect approach is proposed for optimal control problems subject to index-1 DAEs. Necessary conditions of the optimal control problem constitute a Hamiltonian boundary value problem (HBVP) and there exists a symplectic structure in the Hamiltonian system. In the proposed approach, based on specified properties of generating functions, discrete equations can preserve the symplectic structure of the Hamiltonian system. In the iterative solution, the Jacobian matrices of the discrete equations are sparse and symmetric, which are very significant to save memory and improve efficiency in practical computation. In numerical examples, the proposed approach can provide highly accurate state variables and control inputs with fewer iterations. More accurate cost functional can be obtained. Problems from the chemistry process also can be solved effectively, it verifies the problem-solving ability of the proposed approach. K E Y W O R D Sconstrained systems, differential-algebraic equations, nonlinear optimal control, symplectic methods INTRODUCTIONOriginating from practical engineering applications such as motion planning of robots and optimal strategies of processes, optimal control problems 1-4 have been widely researched in the past decades. Generally, there are a defined cost functional and dynamical constraints in the optimal control problem. The aim is to find optimal state variables and control inputs that fulfill dynamical constraints and minimize the cost functional. The cost functional is a scalar function with respect to state variables and control inputs, which is defined according to practical requirements. For example, the task is to 2712
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.