基于地面搜索区域的全覆盖路径规划问题  

Problems of the Whole Coverage Path Planning Based on the Ground Search Areas

作　　者：黄世华[1] 

机构地区：[1]兰州文理学院,甘肃兰州730000

出　　处：《兰州文理学院学报（自然科学版）》2013年第5期14-17,共4页Journal of Lanzhou University of Arts and Science(Natural Sciences)

摘　　要：对固定区域地面搜索问题的研究,可采用连续问题离散化的思想,将矩形目标区域按每组人数与每人实际搜索宽度的乘积将正方形边长分割成若干个小正方形区域,用奇偶校验思想验证从中心点出发不重复不遗漏地搜索完所有区域到集结点集合是一个可行方案.基于上述思想,本文建立了地面搜索的优化模型,利用最优化原理比较直观地解决了地面搜索问题,并得出了最优搜索路线和最优搜索时间.Continuous problem can be discretized.Based on this idea,we can explore the problems of the fixed ground search.Number of people of each group multiplying by actual search width of each person,and using their product as the width of square,rectangular target area can be divided into several small square areas.After this,from the central point all the areas were searched without repletion and missing according to the idea of parity,and massed at rally points.As described above,optimization model of ground search was explored,using the principle of optimality the most optimal search route,time were put forward,thus the problems of ground search were solved intuitively.

关 键 词：地面搜索 区域划分 数学模型 全覆盖路径规划 

分 类 号：N[自然科学总论]