English  |  正體中文  |  简体中文  |  Items with full text/Total items : 60932/93628 (65%)
Visitors : 1250598      Online Users : 12
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/65284

    Title: Approximate Chattering ARC for Minimum Time Flight
    Authors: Chern, Jeng-shing;Hong, Zuu-chang;Chen, Yu-tai
    Contributors: 淡江大學機械與機電工程學系
    Date: 1995-05
    Issue Date: 2013-05-30 15:26:01 (UTC+8)
    Publisher: Kidlington: Pergamon
    Abstract: The purpose of this paper is to investigate the G-constrained approximate chattering arc for the minimum-time aerobraking maneuver of the shuttle-type space vehicle at constant altitude. Theoretically, in a chattering arc of the first kind, the control chatters between its maximum and minimum values at an infinite rate. As an example, for flight at constant altitude, the bank angle switches between its positive and negative maximum values at an infinite rate to generate maximum drag. The resulting flight path is along the arc of a large circle and is one-dimensional. There is a complete analytical solution for this theoretical chattering arc. For practical application, switching of the bank control at an infinite rate is not possible. In the approximate chattering arc, the bank control switches at a finite rate. The resulting flight path is two-dimensional and there is the penalty of a shorter longitudinal range. If we allow the vehicle to coast for a short distance and then change to an approximate chattering arc, the longitudinal range is satisfied and longer flight time becomes the penalty. The penalty of longer flight time is minimized by increasing the number of control switchings and, at the same time, selecting the optimal instants for the switchings. It is found that when the number of control switchings is five, the resulting optimal trajectory is good enough. With more times of control switchings, too much numerical computation must be made while the improvement in the performance index is small. The G constraint has a significant effect on the trajectory.
    Relation: Acta Astronautica 35(9-11), pp.623-631
    DOI: 10.1016/0094-5765(95)00012-O
    Appears in Collections:[機械與機電工程學系暨研究所] 期刊論文

    Files in This Item:

    File SizeFormat

    All items in 機構典藏 are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback