计算机工程与应用Issue(21)：262-265,4.DOI:10.3778/j.issn.1002-8331.1201-0301
飞行试验航路规划方法研究与实现
Research and implementation of route planning method for flying test
刘宇 1赵怀慈 2花海洋3
作者信息
- 1. 中国科学院 沈阳自动化研究所，沈阳 110016
- 2. 中国科学院 研究生院，北京 100039
- 3. 中国科学院 光电信息处理重点实验室，沈阳 110016
- 折叠
摘要
Abstract
The flying test of an opto-electronic module has high demand to the aircraft route, and a route that satisfies the con-straints of the test is the precondition to fulfill the objective of the test. According to this question, a search space construction method based on visibility graph is used here;the shortest polylines path between two targets is got by the Dijkstra algorithm;the GA algorithm is used to get an optimized order of targets;then the final route is got from the polylines path and minimum turning radius is satisfied. The result shows that this route computing method can be well used to get an aircraft route which sat-isfies the constraints of the opto-electronic module test.关键词
航路规划/可见性图/Dijkstra算法/组合优化/遗传算法Key words
route planning/visibility graph/Dijkstra algorithm/combinational optimization/Genetic Algorithm(GA)分类
信息技术与安全科学引用本文复制引用
刘宇,赵怀慈,花海洋..飞行试验航路规划方法研究与实现[J].计算机工程与应用,2013,(21):262-265,4.
