Study on track planning problem of multi-constrained and double-targeted
Abstract Aiming at the positioning error of the aircraft, the error accumulation to a certain extent may lead to the failure of the mission. A track correction method based on oriented graph search was proposed, and the dynamic programming idea was applied to solve the path optimization problem. Fir...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2020-07-01
|
| Series: | Journal of Mathematics in Industry |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13362-020-00089-x |
| _version_ | 1819295293147971584 |
|---|---|
| author | Yi Nie Xiangjun Xie Xianfeng Ding Qianyu Zhang Jingyu Zhou |
| author_facet | Yi Nie Xiangjun Xie Xianfeng Ding Qianyu Zhang Jingyu Zhou |
| author_sort | Yi Nie |
| collection | DOAJ |
| description | Abstract Aiming at the positioning error of the aircraft, the error accumulation to a certain extent may lead to the failure of the mission. A track correction method based on oriented graph search was proposed, and the dynamic programming idea was applied to solve the path optimization problem. Firstly, the correction points in the flight space were preprocessed, and the planning of the correction points in the flight space was transformed into a graph theory problem. It effectively solves the problem that traditional methods did not adapt well to dynamic changes in flight space. And the problem of too high complexity in the calculation space. Using the dynamic programming idea to carry out the flight path planning for the flight space, the path-correction number optimal double-objective model is comprehensively established. Finally, the oriented graph and dynamic programming ideas were used to solve the problem, and the visual analysis of the aircraft track was realized. The simulation results show that the established path-corrected optimal double-objective model can calculate an optimal track with relatively small correction times and short length. |
| first_indexed | 2024-12-24T04:39:55Z |
| format | Article |
| id | doaj.art-d5f9af731ee34cc2843b5f5d7a2d7853 |
| institution | Directory Open Access Journal |
| issn | 2190-5983 |
| language | English |
| last_indexed | 2024-12-24T04:39:55Z |
| publishDate | 2020-07-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | Journal of Mathematics in Industry |
| spelling | doaj.art-d5f9af731ee34cc2843b5f5d7a2d78532022-12-21T17:14:52ZengSpringerOpenJournal of Mathematics in Industry2190-59832020-07-0110111110.1186/s13362-020-00089-xStudy on track planning problem of multi-constrained and double-targetedYi Nie0Xiangjun Xie1Xianfeng Ding2Qianyu Zhang3Jingyu Zhou4School of Science, Southwest Petroleum UniversitySchool of Science, Southwest Petroleum UniversitySchool of Science, Southwest Petroleum UniversitySchool of Computer Science, Southwest Petroleum UniversitySchool of Computer Science, Southwest Petroleum UniversityAbstract Aiming at the positioning error of the aircraft, the error accumulation to a certain extent may lead to the failure of the mission. A track correction method based on oriented graph search was proposed, and the dynamic programming idea was applied to solve the path optimization problem. Firstly, the correction points in the flight space were preprocessed, and the planning of the correction points in the flight space was transformed into a graph theory problem. It effectively solves the problem that traditional methods did not adapt well to dynamic changes in flight space. And the problem of too high complexity in the calculation space. Using the dynamic programming idea to carry out the flight path planning for the flight space, the path-correction number optimal double-objective model is comprehensively established. Finally, the oriented graph and dynamic programming ideas were used to solve the problem, and the visual analysis of the aircraft track was realized. The simulation results show that the established path-corrected optimal double-objective model can calculate an optimal track with relatively small correction times and short length.http://link.springer.com/article/10.1186/s13362-020-00089-xOriented graphDynamic programmingRouteTrack planning |
| spellingShingle | Yi Nie Xiangjun Xie Xianfeng Ding Qianyu Zhang Jingyu Zhou Study on track planning problem of multi-constrained and double-targeted Journal of Mathematics in Industry Oriented graph Dynamic programming Route Track planning |
| title | Study on track planning problem of multi-constrained and double-targeted |
| title_full | Study on track planning problem of multi-constrained and double-targeted |
| title_fullStr | Study on track planning problem of multi-constrained and double-targeted |
| title_full_unstemmed | Study on track planning problem of multi-constrained and double-targeted |
| title_short | Study on track planning problem of multi-constrained and double-targeted |
| title_sort | study on track planning problem of multi constrained and double targeted |
| topic | Oriented graph Dynamic programming Route Track planning |
| url | http://link.springer.com/article/10.1186/s13362-020-00089-x |
| work_keys_str_mv | AT yinie studyontrackplanningproblemofmulticonstrainedanddoubletargeted AT xiangjunxie studyontrackplanningproblemofmulticonstrainedanddoubletargeted AT xianfengding studyontrackplanningproblemofmulticonstrainedanddoubletargeted AT qianyuzhang studyontrackplanningproblemofmulticonstrainedanddoubletargeted AT jingyuzhou studyontrackplanningproblemofmulticonstrainedanddoubletargeted |