紧急通信下通信节点覆盖算法的实现
首发时间:2016-11-01
摘要:研究区域覆盖问题,首先要建立环境地图模型。目前环境地图的建模方法有:栅格法、单元分解法、扑朔逻辑图法等。环境地图模型建立后,覆盖路径规划算法是区域覆盖问题的核心。目前,有很多机器人全区域覆盖问题的研究,我们将它的一些思路方法应用到不能自主移动的无线区域覆盖问题上。本文依靠了几何覆盖,电路布线问题数学算法,在整体拓扑结构的引导下,理论研究了一种适用的区域覆盖问题实现方法。
关键词: 区域覆盖、组网、圆形划分、栅格划分、路径搜索、路由
For information in English, please click here
Implementation of communication node coverage algorithm in emergency communication
Abstract:To study the regional coverage problem, we must first establish the environmental map model. At present, the modeling methods of the environmental map include: grid method, unit decomposition method, and the method of the logic diagram. After the environment map model is established, the coverage path planning algorithm is the core of the regional coverage problem. At present, there are many researches about the full area coverage problem of the robot, and we apply it to the wireless area coverage problem that can not be moved independently.In this paper, we rely on the geometric coverage, circuit wiring problem mathematical algorithm, under the guidance of the overall topology, the theory of a suitable area coverage problem to achieve the method.
Keywords: Regional coverage, networking, circular division, grid division, path search, routing
基金:
论文图表:
引用
No.4705312114251714****
同行评议
共计0人参与
勘误表
紧急通信下通信节点覆盖算法的实现
评论
全部评论0/1000