Abstract
The time-optimal rest-to-rest maneuvering control problem of a rigid spacecraft is studied in this paper. By utilizing an iterative procedure, this problem is formulated and solved as a constrained nonlinear programming (NLP) one. In this novel method, the count of control steps is fixed initially and the sampling period is treated as a variable in the optimization process. The optimization object is to minimize the sampling period below a specific minimum value, which is set in advance considering the accuracy of discretization. To generate initial feasible solutions of the NLP problem, a genetic-algorithm-based is also proposed such that the optimization process can be started from many different points to find the globally optimal solution. With the proposed method, one can find a time-optimal rest-to-rest maneuver of the rigid spacecraft between two attitudes. To show the feasibility of the proposed method, simulation results are included for illustration.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
