一种室内智能吸尘器充电返回算法  

Algorithm of intelligent cleaning-robot charging return

作　　者：任盛怡[1] 曹长修[1] 马世文[1] 张明瀚[1] 

机构地区：[1]重庆大学自动化学院,重庆400030

出　　处：《计算机应用》2009年第6期1551-1553,1574,共4页journal of Computer Applications

基　　金：重庆市科技攻关重点项目(2004AA2001-8277-02)

摘　　要：针对智能吸尘器自动返回充电所遇到的问题,提出在不增加传感器的条件下,使用Dijkstra算法实现返回充电座最短路径的方法。利用简化栅格法建立环境地图并分块,基于广度优先和深度优先算法对其进行生成树,最后使用Dijkstra算法得到最短路径。该算法通过软件实现了智能吸尘器自动返回充电的功能,在实际应用中效果良好。A Dijkstra algorithm to find the shortest path for cleaning-robot returns to charge was presented. After a subarea map was established based on simplified grid world maps, a spanning tree was fabricated through using the breadthfirst and depth-first traversals, finally the shortest path was obtained by Dijkstra arithmetic. Without increasing other sensors, the cleaning-robot can achieve return to charge automatically. This algorithm has a good effect in its practical application.

关 键 词：广度优先算法 深度优先算法 DIJKSTRA算法 

分 类 号：TP242.6[自动化与计算机技术—检测技术与自动化装置]