SOLVING THE LOCAL MINIMUM PROBLEM IN PATH PLANNING ALGORITHM BASED ON THE VIRTUAL POTENTIAL FIELD AND THE PRINCIPLES OF LIQUID MOVEMENT

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MOAVENI BIJAN; GHANBARI GOL DAVOUD

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Journal of Control Year:2011 | Volume:5 | Issue:1 Page(s): 64-76

Download Full-Text

Persian Verion

View:

638

Download:

Cites:

Information Journal Paper

Title

SOLVING THE LOCAL MINIMUM PROBLEM IN PATH PLANNING ALGORITHM BASED ON THE VIRTUAL POTENTIAL FIELD AND THE PRINCIPLES OF LIQUID MOVEMENT

Author(s)

MOAVENI BIJAN | GHANBARI GOL DAVOUD | Issue Writer Certificate

Keywords

MOBILE AGENTQ3

PATH PLANNINGQ2

OBSTACLE AVOIDANCEQ3

POTENTIAL FUNCTIONSQ3

Abstract

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.

Cites

No record.

References

No record.

Cite

APA: Copy

MOAVENI, BIJAN, & GHANBARI GOL, DAVOUD. (2011). SOLVING THE LOCAL MINIMUM PROBLEM IN PATH PLANNING ALGORITHM BASED ON THE VIRTUAL POTENTIAL FIELD AND THE PRINCIPLES OF LIQUID MOVEMENT. JOURNAL OF CONTROL, 5(1), 64-76. SID. https://sid.ir/paper/120811/en

Vancouver: Copy

MOAVENI BIJAN, GHANBARI GOL DAVOUD. SOLVING THE LOCAL MINIMUM PROBLEM IN PATH PLANNING ALGORITHM BASED ON THE VIRTUAL POTENTIAL FIELD AND THE PRINCIPLES OF LIQUID MOVEMENT. JOURNAL OF CONTROL[Internet]. 2011;5(1):64-76. Available from: https://sid.ir/paper/120811/en

IEEE: Copy

BIJAN MOAVENI, and DAVOUD GHANBARI GOL, “SOLVING THE LOCAL MINIMUM PROBLEM IN PATH PLANNING ALGORITHM BASED ON THE VIRTUAL POTENTIAL FIELD AND THE PRINCIPLES OF LIQUID MOVEMENT,” JOURNAL OF CONTROL, vol. 5, no. 1, pp. 64–76, 2011, [Online]. Available: https://sid.ir/paper/120811/en

Related Journal Papers