作战仿真中区域到达问题研究  

Research on Region Fetching Problem in Military Simulation

作　　者：刘洋[1] 黄柯棣[1] 杨山亮[1] 黄健[1] 

机构地区：[1]国防科技大学机电工程与自动化学院,湖南长沙410073

出　　处：《计算机仿真》2012年第1期36-40,共5页Computer Simulation

摘　　要：区域到达是军事行动中路径规划的重要环节。研究区域到达问题对执行区域巡逻任务和预警侦察任务的飞行实体路径优化具有重要意义。为寻求最短路径,首先针对区域到达与传统路径规划的不同提出了区域到达问题,并将其分类为平面区域到达问题和椭球面区域到达问题,提出最短距离点为目标区域边界点;然后以平面几何学、白塞尔投影几何学为基础针对两种不同的区域到达问题设计了相应的最短距离点解算方法。采用两组多边目标区域分别对两种区域到达问题的解算方法进行仿真,结果表明了算法的正确性,为优化区域到达提供了依据。Region Fetching Problem is an important part of route plan in military operation, and it is significant for flight entity route optimization to research region fetching problem of region patrolling and early-warning mission. According to the difference between region fetching and traditional route plan, this paper first defined the region fetching problem and classified it two sorts： Plane Region Fetching Problem （PRFP） and Elliptical Sphere Region Fetching Problem （ESRFP）, and demonstrated that the Min-distance point is the point on the borderline of the goal region. Then we designed the region Min-distance point solving methods of the problems based on the plane geometry and Bessel earth projective geometry. Finally, we utilized two groups of polygonal regions to verify the solving methods and validate the correctness of solving methods.

关 键 词：区域到达 路径规划 最短距离点 解算方法 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]