合肥工业大学学报(自然科学版)
閤肥工業大學學報(自然科學版)
합비공업대학학보(자연과학판)
JOURNAL OF HEFEI UNIVERSITY OF TECHNOLOGY
2010年
2期
208-211
,共4页
高速无人飞行器%Voronoi图%航迹规划%航迹代价
高速無人飛行器%Voronoi圖%航跡規劃%航跡代價
고속무인비행기%Voronoi도%항적규화%항적대개
high-speed uninhabited air vehicles%Voronoi diagram%route planning%route cost
文章根据遍布威胁的战场环境,构造了基于威胁源的Voronoi图,得到规避威胁的航迹路线;综合各种威胁的强度信息,计算出每条航迹路线的代价;最后采用Dijkstra算法,搜索出最优航迹路线,并运用C#编制图形化界面,实现了仿真结果的图形显示.
文章根據遍佈威脅的戰場環境,構造瞭基于威脅源的Voronoi圖,得到規避威脅的航跡路線;綜閤各種威脅的彊度信息,計算齣每條航跡路線的代價;最後採用Dijkstra算法,搜索齣最優航跡路線,併運用C#編製圖形化界麵,實現瞭倣真結果的圖形顯示.
문장근거편포위협적전장배경,구조료기우위협원적Voronoi도,득도규피위협적항적로선;종합각충위협적강도신식,계산출매조항적로선적대개;최후채용Dijkstra산법,수색출최우항적로선,병운용C#편제도형화계면,실현료방진결과적도형현시.
A Voronoi diagram is constructed in this paper based on the battlefield environment full of threats.The Voronoi diagram yields the optimal routes to travel among a set of threat source points to Dijkstra algorithm is used to search the optimal routes.The simulation is completed under C# plat-form and the simulation result is presented in graph form.