%0 Journal Article
%T Algorithm of intelligent cleaning-robot charging return<br>一种室内智能吸尘器充电返回算法
%A REN Sheng-yi
%A CAO Chang-xiu
%A MA Shi-wen
%A ZHANG Ming-han
%A <br>任盛怡
%A 曹长修
%A 马世文
%A 张明瀚
%J 计算机应用
%D 2009
%I 
%X 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 breadth-first 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.
%K breadth-first traversal
%K depth-first traversal
%K Dijkstra algorithm<br>广度优先算法
%K 深度优先算法
%K Dijkstra算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=F40A31BDD0C535EF04FF43416D32785B&yid=DE12191FBD62783C&vid=771469D9D58C34FF&iid=B31275AF3241DB2D&sid=044F0D973C30117E&eid=3ACD4359575EFDCA&journal_id=1001-9081&journal_name=计算机应用&referenced_num=0&reference_num=8