首页 /研究 /A Complete Coverage Path Planning Method for Mobile Robots in Uncertain Dynamic Environments
LEARNING

A Complete Coverage Path Planning Method for Mobile Robots in Uncertain Dynamic Environments

Xuena Qiu, Shirong Liu

发表年份
2006
引用次数
6

摘要

A new approach to complete coverage path planning for mobile robots,which integrates biologically inspired neural network,rolling window and heuristic searching,is presented.The local environment of mobile robot is modeled with Grossberg's biological neural networks.The concept of rolling window is introduced into local path planning,and the local path planning goal in the rolling window can be determined by heuristic searching methods.The complete coverage path planning with dynamic obstacle avoidance for mobile robots can be efficiently implemented by the proposed method in uncertain dynamic environments.The effectiveness and feasiblity of the proposed method are illustrated by simulations.

关键词

Computer scienceMotion planningHeuristicMobile robotPath (computing)ObstacleObstacle avoidanceWindow (computing)RobotAny-angle path planning

相关论文

查看 LEARNING 分类全部论文