期刊文献+

基于NAO的迷宫解决算法研究 被引量:4

Research of the solving algorithm in the maze based on NAO
下载PDF
导出
摘要 迷宫的最优路径是指从迷宫入口到迷宫出口的最近通路。求解迷宫路径问题的算法很多,基于法国Aldebaran公司新兴研制的人工智能机器人NAO,以机器视觉NAO Marks和位置点数据队列为基础,提出了一种新的解决机器人迷宫路径优化算法。实验结果表明,该算法实现简单,在复杂迷宫环境下能有效地实现迷宫路径规划。 The optimal path of the maze is the recent passage of the entrance to the maze exit.Many algorithms are to solve the maze routing problem,but this paper proposes a novel method of optimal path planning of the maze for French Aldebaran artificial intelligence robot NAO based on machine vision NAO Marks and the location point data queue.The experimental results show that the algorithm is simple,effective path planning in a complex maze environment.
作者 张婷
出处 《国外电子测量技术》 2013年第6期68-71,共4页 Foreign Electronic Measurement Technology
基金 2012上海市教育委员会高校中青年教师国外访学进修计划(2012沪教委人30号文)项目
关键词 迷宫最优路径 人工智能机器人NAO 机器视觉 NAOMarks 位置点数据队列 the optimal path of the maze artificial intelligence robot NAO machine vision NAO Marks location point data queue
  • 相关文献

参考文献7

二级参考文献29

  • 1张美玉,黄翰,郝志峰,杨晓伟.基于蚁群算法的机器人路径规划[J].计算机工程与应用,2005,41(25):34-37. 被引量:46
  • 2蒋杰,方力,张鹤颖,窦文华.无线传感器网络最小连通覆盖集问题求解算法[J].软件学报,2006,17(2):175-184. 被引量:90
  • 3王科俊,徐晶,王磊,张燕.基于可拓遗传算法的机器人路径规划[J].哈尔滨工业大学学报,2006,38(7):1135-1138. 被引量:10
  • 4张新谊.一种电脑鼠走迷宫的算法[J].单片机与嵌入式系统应用,2007(5):84-85. 被引量:23
  • 5R.Dechter and J.Pearl. Generalized best-first search strategies and the optimality of A*.JACM,32(3):505-536.1985. 被引量:1
  • 6R.E.Korf. Real-time heuristic search. Artificial Intelligence, 42 (3):189-211, 1990. 被引量:1
  • 7WONG R, HU S, CABRERA-MORA F, et al. A distributed algorithm for mobile robot localization and mapping in wireless sensor networks[C]. Proceedings of IEEE International Conference on Information and Automation, Zhangjiajie, China, 2008: 560-566. 被引量:1
  • 8SHENOY S, Tan J D. Simultaneous localization and mobile robot navigation in a hybrid sensor network [ C ]. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, Edmonton, Canada, 2005 : 1636-1641. 被引量:1
  • 9MORIOKA K, IEE J H, HASHIMOTO H. Human-following mobile robot in a distributed intelligent setter network[J]. IEEE Transactions on Industrial Electronics, 2004, 51 (1): 229-237. 被引量:1
  • 10DISSANAYAKE G, NEWMAN P, CLARK S, et al. A solution to the simultaneous localization and map building (SLAM) problem [ J ]. IEEE Transactions on Robotics and Automation, 2001, 17 (3) : 229-241. 被引量:1

共引文献37

同被引文献46

  • 1董焰民,王保保.Python与Matlab混合语言编程[J].现代电子技术,2007,30(14):108-110. 被引量:2
  • 2柴毅,凌睿.自主移动掘进机器人控制系统研究[c].哈尔滨:中国自动化学会控制理论专业委员会,第25届中国控制会议论文集,2006:1651.1654. 被引量:1
  • 3ORTEU J J, CATALINA J C, DEVY M. Perception for a roadheader in automatic selective cutting operation [ C]. Proceedings of IEEE International Conference on Robotics and Automation. Nice, Fr: 1992 : 626 - 632. 被引量:1
  • 4ZHONG S H, XU J X. Freeway traffic control using it- erative learning control-based ramp metering and speed signaling[ J]. IEEE Transactions on Vehicular Technol- ogy, 2007, 56(2) :466-477. 被引量:1
  • 5ARIMOTO S, KAWAMURA S, MIYAZAKI F. Bette- ring operation of robots by learning [ J ]. Journal of Ro- botic Systems, 1984, 1 (2) : 123-140. 被引量:1
  • 6TAYEBE A. Adaptive Iterative learning control for robot manipulators [ J ]. Automatica, 2004 (40) : 1195-1203. 被引量:1
  • 7JIANG J G, ZHANG Y D,WEI CH G,et al. A reviewon robot in prosthodontics and orthodontics[ J]. Advancesin Mechanical Engineering, 2015 , 7(1): 198748. 被引量:1
  • 8ZHANG Y D, JIANG J X. Analysis and experimentationof the robotic system for archwire bending [ J ]. AppliedMechanics and Materials, 2012, 121-126: 3805-3809. 被引量:1
  • 9ZHANG Y D, WEI CH G, JIANG J G,et al. Motionplanning for archwire bending robot in orthodontic treat-ments [J]. International Journal of Control and Automa-tion, 2014, 7(7) : 287-297. 被引量:1
  • 10JIANG J G, ZHANG Y D, JIN M L,et al. Bendingprocess analysis and structure design of orthodontic arch-wire bending robot [ J ]. International Journal of SmartHome, 2013,7(5) : 345-352. 被引量:1

引证文献4

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部