Journal of Guangdong University of Technology ›› 2016, Vol. 33 ›› Issue (04): 30-36.doi: 10.3969/j.issn.1007-7162.2016.04.006

Previous Articles     Next Articles

Research on Path Planning Algorithm for Cleaning Robot Based on Improved Potential Field Grid Method

Liang Jia-jun, Zeng Bi, He Yuan-lie   

  1. School of Computers, Guangdong University of Technology, Guangzhou 510006, China
  • Received:2015-10-08 Online:2016-08-02 Published:2016-08-02

Abstract:

An improved potential field grid method is presented in this paper to solve the problems of general artificial potential field method including the trap situation, no path existing among adjacent obstacles and not up to the object near the obstacle. With the full coverage path planning algorithm of cattle farming, a global optimal sweep path of the robot in the known environment model is given. By combining the laser radar and the potential field force, it has the ability to avoid dynamic collision. The verifying experiment indicates that the algorithm has practical value. It can make cleaning robot in a shorter path traversal environment and enhance the obstacle avoidance capability, improve safety and efficiency of cleaning robot.

Key words: artificial potential field method; cleaning robot; full-coverage; obstacle avoidance

No related articles found!
Viewed
Full text
3731
HTML PDF
Just accepted Online first Issue Just accepted Online first Issue
0 0 0 0 0 3731

  From Others local
  Times 451 3280
  Rate 12% 88%

Abstract
406
Just accepted Online first Issue
0 0 406
  From Others local
  Times 102 304
  Rate 25% 75%

Cited

Web of Science  Crossref   ScienceDirect  Search for Citations in Google Scholar >>
 
This page requires you have already subscribed to WoS.
  Shared   
  Discussed   
No Suggested Reading articles found!