Author
Listed:
- Wantong Chen
- Tianru Diao
- Shiyu Ren
- Shuguang Sun
- Ruihua Liu
Abstract
Closing the static suborbital debris hazard zone method leads to low airspace resource utilization and long delays for civil aircraft, while the dynamic delineation of suborbital debris hazard zone method can solve the above phenomena. However, the existing research lacks the decision instruction for civil aircraft to avoid the dynamic suborbital debris hazard zone. To address the above problems, this paper creates probability ellipsoids of suborbital debris with different ballistic coefficients in the two-dimensional plane and use the divide-and-conquer algorithm for the dynamic delineation of the suborbital debris hazard zone. The suborbital debris hazard zone is extended outward by 10 km. Subsequently, the standard A* algorithm, the standard Lazy theta* algorithm, the improved Lazy theta* algorithm, and a flight path planning strategy are designed to avoid the suborbital debris hazard zone and provide safe dynamic avoidance commands for civil aircraft with fixed time intervals. The simulation results show that the average area of the dynamically delineated suborbital debris hazard zone is lower than the traditional static no-fly zone; the standard A* algorithm and improved Lazy theta* algorithm provides shorter flight path lengths and flight time and fewer waypoints in windless and windy conditions, respectively.
Suggested Citation
Wantong Chen & Tianru Diao & Shiyu Ren & Shuguang Sun & Ruihua Liu, 2023.
"Dynamic avoidance decision method for civil aircraft in a suborbital debris hazard zone,"
PLOS ONE, Public Library of Science, vol. 18(8), pages 1-21, August.
Handle:
RePEc:plo:pone00:0289500
DOI: 10.1371/journal.pone.0289500
Download full text from publisher
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:plo:pone00:0289500. 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.