IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v141y2009i3d10.1007_s10957-008-9482-3.html
   My bibliography  Save this article

Analytic Solution for Fuel-Optimal Reconfiguration in Relative Motion

Author

Listed:
  • H.-C. Cho

    (Yonsei University)

  • S.-Y. Park

    (Yonsei University)

Abstract

The current paper presents simple and general analytic solutions to the optimal reconfiguration of multiple satellites governed by a variety of linear dynamic equations. The calculus of variations is used to analytically find optimal trajectories and controls. Unlike what has been determined from previous research, the inverse of the fundamental matrix associated with the dynamic equations is not required for the general solution in the current study if a basic feature in the state equations is met. This feature is very common due to the fact that most relative motion equations are represented in the LVLH frame. The method suggested not only reduces the amount of calculations required, but also allows predicting the explicit form of optimal solutions in advance without having to solve the problem. It is illustrated that the optimal thrust vector is a function of the fundamental matrix of the given state equations, and other quantities, such as the cost function and the state vector during the reconfiguration, can be concisely represented as well. The analytic solutions developed in the current paper can be applied to most reconfiguration problems in linearized relative motions. Numerical simulations confirm the brevity and accuracy of the general analytic solutions developed in the current paper.

Suggested Citation

  • H.-C. Cho & S.-Y. Park, 2009. "Analytic Solution for Fuel-Optimal Reconfiguration in Relative Motion," Journal of Optimization Theory and Applications, Springer, vol. 141(3), pages 495-512, June.
  • Handle: RePEc:spr:joptap:v:141:y:2009:i:3:d:10.1007_s10957-008-9482-3
    DOI: 10.1007/s10957-008-9482-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-008-9482-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-008-9482-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:joptap:v:141:y:2009:i:3:d:10.1007_s10957-008-9482-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.