东南大学学报(英文版)
東南大學學報(英文版)
동남대학학보(영문판)
JOURNAL OF SOUTHEAST UNIVERSITY
2008年
2期
188-191
,共4页
路径规划%完全遍历算法%矩形分解
路徑規劃%完全遍歷算法%矩形分解
로경규화%완전편력산법%구형분해
path planning%complete coverage algorithm%rectangular decomposition
提出了一种矩形分解的环境建模方法.该方法模型用环境分解出的节点及节点之间的连接关系网络来表示.环境建模首先将环境分解为正方形区域,区域中心点代表该区域位置.在邻近区域有障碍物情况下,扩大正方形边长形成矩形区域,有利于提高局部遍历效率.在这种环境建模思想下,提出了一种包含局部和全局2层结构路径规划下的机器人遍历方法.在全局路径规划中子区域之间的探索采用了基于知识规则的方法,定义了决定局部子区域向周围区域移动的一维优先权数组,该数组综合表征了本区域与相邻区域的遍历情况、连通关系和用户定义优先权级别.局部子区域根据环境形状采用模版匹配法实现遍历.仿真实验结果说明,该方法简单、高效,并适合解决复杂二维环境遍历问题.
提齣瞭一種矩形分解的環境建模方法.該方法模型用環境分解齣的節點及節點之間的連接關繫網絡來錶示.環境建模首先將環境分解為正方形區域,區域中心點代錶該區域位置.在鄰近區域有障礙物情況下,擴大正方形邊長形成矩形區域,有利于提高跼部遍歷效率.在這種環境建模思想下,提齣瞭一種包含跼部和全跼2層結構路徑規劃下的機器人遍歷方法.在全跼路徑規劃中子區域之間的探索採用瞭基于知識規則的方法,定義瞭決定跼部子區域嚮週圍區域移動的一維優先權數組,該數組綜閤錶徵瞭本區域與相鄰區域的遍歷情況、連通關繫和用戶定義優先權級彆.跼部子區域根據環境形狀採用模版匹配法實現遍歷.倣真實驗結果說明,該方法簡單、高效,併適閤解決複雜二維環境遍歷問題.
제출료일충구형분해적배경건모방법.해방법모형용배경분해출적절점급절점지간적련접관계망락래표시.배경건모수선장배경분해위정방형구역,구역중심점대표해구역위치.재린근구역유장애물정황하,확대정방형변장형성구형구역,유리우제고국부편력효솔.재저충배경건모사상하,제출료일충포함국부화전국2층결구로경규화하적궤기인편력방법.재전국로경규화중자구역지간적탐색채용료기우지식규칙적방법,정의료결정국부자구역향주위구역이동적일유우선권수조,해수조종합표정료본구역여상린구역적편력정황、련통관계화용호정의우선권급별.국부자구역근거배경형상채용모판필배법실현편력.방진실험결과설명,해방법간단、고효,병괄합해결복잡이유배경편력문제.
The environment modeling algorithm namedrectangular decomposition, which is composed of cellular nodesand interleaving networks, is proposed. The principle ofenvironment modeling is to divide the environment intoindividual square sub-areas. Each sub-area is orientated by thecentral point of the sub-areas called a node. The rectangular mapbased on the square map can enlarge the square area side size toincrease the coverage efficiency in the case of there being anadjacent obstacle. Based on this algorithm, a new coveragealgorithm, which includes global path planning and local pathplanning, is introduced. In the global path planning, uncoveredsubspaces are found by using a special rule. A one-dimensionalarray P, which is used to obtain the searching priority of node inevery direction, is defined as the search rule. The array P includesthe condition of coverage towards the adjacent cells, the conditionof connectivity and the priorities defined by the user in all eightdirections. In the local path planning, every sub-area is coveredby using template models according to the shape of theenvironment. The simulation experiments show that the coveragealgorithm is simple, efficient and adapted for complex two-dimensional environments.