Local obstacle avoidance method based on velocity space approach in dynamic environments

被引:0
作者
Shi, Chaoxia [1 ]
Hong, Bingrong [1 ]
Wang, Yanqing [2 ]
机构
[1] School of Computer Science and Technology, Harbin Institute of Technology
[2] School of Computer Science and Technology, Harbin University of Science and Technology
来源
Jisuanji Yanjiu yu Fazhan/Computer Research and Development | 2007年 / 44卷 / 05期
关键词
Autonomous navigation; Dynamic obstacle avoidance; Extended Kalman filter; Mobile robot; Trajectory prediction;
D O I
10.1360/crad20070523
中图分类号
学科分类号
摘要
Local obstacle avoidance in dynamic environments, as a principal capability for mobile robots, plays an important role in autonomous navigation. A variety of velocity space methods such as the curvature velocity method (CVM), the lane curvature method (LCM) and the beam curvature method (BCM) formulate the local obstacle avoidance problem as one of constrained optimization in the velocity space and thus perform better than other local obstacle avoidance techniques by taking into account the physical constraints of the environment and the dynamics of the vehicle. A new local obstacle avoidance approach is presented in this paper to remedy some limitations of the traditional velocity space method. The conversion from Cartesian space to configuration space makes it possible for the proposed method to be used in unknown or partially known environments. By adding the beam width into the objective function and combining the proposed prediction model of collision with the improved BCM, not only does the method inherit the smoothness of CVM, the safety of LCM and the speediness of BCM, but also it can realize smooth, safe and speedy navigation in dynamic environments. The comparative navigation experiments executed by actual mobile robots in both static and dynamic scenes demonstrate that the proposed method is not only feasible but also valid.
引用
收藏
页码:898 / 904
页数:6
相关论文
共 10 条
  • [1] Khatib O., Real-time obstacle avoidance for manipulators and mobile robots, The Int'l Journal of Robotics Research, 5, 1, pp. 90-98, (1986)
  • [2] Masehian E., Amin-Naseri M.R., A Voronoi diagram-visibility graph-potential field compound algorithm for robot path planning, Journal of Robotic Systems, 21, 6, pp. 275-300, (2004)
  • [3] Cheng Y., Jiang P., Zhu J., Application of limit-cycle navigation improved by potential field approach to mobile robots, Robot, 26, 2, pp. 133-138, (2004)
  • [4] Borenstein J., Koren Y., The vector field histogram-Fast obstacle avoidance for mobile robots, IEEE Journal of Robotics and Automation, 7, 3, pp. 278-288, (1991)
  • [5] Zhang R., Yang G., Gu G., Q-learning and its application in local path planning of intelligent robots, Journal of Computer Research and Development, 36, 12, pp. 1430-1436, (1999)
  • [6] Simmons R.G., The curvature velocity method for local obstacle avoidance, The IEEE Int'l Conf on Robotics and Automation, (1996)
  • [7] Ko N.Y., Simmons R.G., The lane-curvature method for local obstacle avoidance, The Int'l Conf on Intelligent Robotics and Systems, (1998)
  • [8] Fernandez J.L., Sanz R., Benayas J.A., Improving collision avoidance for mobile robots in partially known environments: The beam curvature method, Robotics and Autonomous Systems, 46, pp. 205-219, (2004)
  • [9] Julier S., Uhlmann J., Durrant-Whyte F., A new method for the nonlinear transformation of means and covariances in filters and estimators, IEEE Trans on Automatic Control, 45, 3, pp. 477-482, (2000)
  • [10] Ivanjko E., Petrovic I., Extended Kalman filter based mobile robot pose tracking using occupancy grid maps, IEEE Melecon 2004, (2004)