Yi Nie, Xiangjun Xie, Xianfeng Ding, Qianyu Zhang, Jingyu Zhou
{"title":"多约束双目标轨道规划问题研究","authors":"Yi Nie, Xiangjun Xie, Xianfeng Ding, Qianyu Zhang, Jingyu Zhou","doi":"10.1186/s13362-020-00089-x","DOIUrl":null,"url":null,"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.","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2020-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Study on track planning problem of multi-constrained and double-targeted\",\"authors\":\"Yi Nie, Xiangjun Xie, Xianfeng Ding, Qianyu Zhang, Jingyu Zhou\",\"doi\":\"10.1186/s13362-020-00089-x\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":1,\"journal\":{\"name\":\"Accounts of Chemical Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":16.4000,\"publicationDate\":\"2020-07-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Accounts of Chemical Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1186/s13362-020-00089-x\",\"RegionNum\":1,\"RegionCategory\":\"化学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"CHEMISTRY, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1186/s13362-020-00089-x","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
Study on track planning problem of multi-constrained and double-targeted
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.
期刊介绍:
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.