期刊文献+

机器人探测未知环境的螺旋形导航算法 被引量:2

A Spiral Navigation Algorithm for Robotic Exploration of Unknown Environment
下载PDF
导出
摘要 在很多情况下,机器人对作业环境并没有预先了解,这就使得机器人对环境的探测成为必要。因此,设计合理的导航算法,从而使机器人在较短的时间内能够较完整地构建出环境地图,为机器人完成作业提供了基础。本文提出了一种基于虚拟力的螺旋形导航算法,采用超声距离传感器,对未知环境进行实时在线的探测,采用本算法可以避免机器人之间以及机器人与障碍物发生碰撞。本文推导了机器人的运动学和动力学方程。仿真对比实验表明了该算法的有效性。本文进行了若干作业任务的仿真实验,使算法得到了进一步验证。 In many cases, robots have no prior knowledge of the environment, it is necessary that the robot need to explore the environment. Navigation algorithms for robots to map the environment completely in short time play a very important role in the robotic task. A spiral navigation algorithm based on virtual force is proposed in this paper to explore the unknown environment using rang sensors. Collisions between robot and obstacle or between robots can be avoided with the application of the proposed navigation rules. The kinematics and dynamics equations of the robot adopting the algorithm are also given. The simulation experiments demonstrate the operation of the algorithm. Several simulation experiments of various representative robotic tasks are carried out, based on the explorative navigation algorithm, which successfully validate the virtual force based spiral navigation algorithm.
作者 苏丽颖 谭民
出处 《系统仿真学报》 CAS CSCD 2003年第10期1426-1430,共5页 Journal of System Simulation
基金 国家863计划(863-512-9935-02) 国家自然科学基金(69975022)。
关键词 导航算法 虚拟力 环境探测 多机器人任务 Navigation algorithm virtual force environment exploration multi-robotic task
  • 相关文献

参考文献27

  • 1S Thrum. Robotic mapping: a survey [M]. CMU-CS-02-111 School of Computer Science, Carnegie Mellon University Pittsburgh, PA,31 pages, February 2002.
  • 2I Sutherland. A method for solving arbitrary wall mazes by computer [J]. IEEE Trans On Computers, C-18 (12): 1092-1097,1969.
  • 3V Lumelsky. Algorithmic and complexity issues of robot motion in uncertain environment [J]. Journal of Complexity, 3: 146-182, 1987.Sankaranarayanan and Isao Masuda.
  • 4A new algorithm for robot curve-following amidst unknown obstacles, and a generalization of maze searching [A]. Proc. IEEE Conference on Robotics and Automation [C], 2487-2494, 1992.
  • 5R A Baeza-Yates, J C Culberson, and G J Rawlins. Searching in the plane[J]. Information and Computation, 106(2): 234-252, Oct 1993.
  • 6C H Papadimitriou and M Yanakakis. Shortest paths without a map[J]. Theoretical Computer Science, 84:127-150,1991.
  • 7A Blum, P Raghavan, B Schieber. Navigation in unfamiliar terrain[A]. In 19th 23rd Symposium on Theory of Computing [C], 494-504,1991.
  • 8H Abelson, A diSessa. Turtle Geometry [M]. MIT Press, Cambridge,MA, 191-198, 1980.
  • 9J Cox, C K Yap. On-line motion planning: moving a planar arm by probing an unknown environment [R]. Technical report. Courant Institute of Mathematical Sciences, New York. 1988.
  • 10A Sankaranarayanan, M Vidyasagar. Path planning for moving a point object amist unknown obstacles tn a plane: the universal lower bound on the worst case path lengths, and a classification of algorithms [A]. Proc. IEEE Conference on Robotics and Automation[C], 1734-1741, 1991.

同被引文献22

引证文献2

二级引证文献12

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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