CAJ | 학술논문

清扫机器人作为服务机器人领域中的一个新产品已成为人们家庭当中的重要一员,全覆盖路径规划问题是其重要技术之一。提出一种新的路径规划算法,该算法对室内环境进行栅格模型建模,生成一个无向完全图G,对图 G 采用深度优先搜索和广度优先搜索,并应用拓扑排序动态更新图 G,生成最短全覆盖规划路径,最后用生成树来验证该算法的有效性和可行性。
청소궤기인작위복무궤기인영역중적일개신산품이성위인문가정당중적중요일원,전복개로경규화문제시기중요기술지일。제출일충신적로경규화산법,해산법대실내배경진행책격모형건모,생성일개무향완전도G,대도 G 채용심도우선수색화엄도우선수색,병응용탁복배서동태경신도 G,생성최단전복개규화로경,최후용생성수래험증해산법적유효성화가행성。
Cleaning robots has become an important one among the family as service robots; full coverage path planning is one of the important technologies. This paper presents a new path planning algorithm, which uses a grid model for modeling for the indoor environment, and generates an undirected complete graph G. It uses depth-first search and breadth-first search combined in figure G, while applying topological sorting constantly updated graph G to generate the full coverage of the shortest path planning. Finally, it uses the spanning tree to prove the effectiveness and feasibility of this algorithm.