Volume 5, Issue 1 (Journal of Control, V.5, N.1 Spring 2011)                   JoC 2011, 5(1): 64-76 | Back to browse issues page

XML Persian Abstract Print

Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Moaveni B, Ghanbari Gol D. Solving the Local Minimum Problem in Path Planning Algorithm based on the Virtual Potential Field and the Principles of Liquid Movement. JoC 2011; 5 (1) :64-76
URL: http://joc.kntu.ac.ir/article-1-96-en.html
Abstract:   (11188 Views)
Path planning and obstacle avoidance are important problems in intelligent mobile agent systems. In this paper, a novel path planning algorithm and a new obstacle avoidance approach to solve the local minimum problem of mobile agents are presented. This path planning algorithms is introduced based on the principles of liquid movement. In addition to, by modifying the potential function methodology for this algorithm, a new obstacle avoidance approach is presented. This new algorithm, by finding the collision free path, guarantees the global convergence to the target when the target is reachable. Also, in this paper, an online version of the algorithm is presented. Simulation results are given to show the effectiveness of the methodology
Full-Text [PDF 358 kb]   (2529 Downloads)    
Type of Article: Research paper | Subject: Special
Received: 2014/06/16 | Accepted: 2014/06/16 | Published: 2014/06/16

Add your comments about this article : Your username or Email:

Send email to the article author

Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

© 2024 CC BY-NC 4.0 | Journal of Control

Designed & Developed by : Yektaweb