IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/9367093.html
   My bibliography  Save this article

A Novel Particle Swarm Optimization with Improved Learning Strategies and Its Application to Vehicle Path Planning

Author

Listed:
  • En Lu
  • Lizhang Xu
  • Yaoming Li
  • Zheng Ma
  • Zhong Tang
  • Chengming Luo

Abstract

In order to balance the exploration and exploitation capabilities of the PSO algorithm to enhance its robustness, this paper presents a novel particle swarm optimization with improved learning strategies (ILSPSO). Firstly, the proposed ILSPSO algorithm uses a self-learning strategy, whereby each particle stochastically learns from any better particles in the current personal history best position ( pbest ), and the self-learning strategy is adjusted by an empirical formula which expresses the relation between the learning probability and evolution iteration number. The cognitive learning part is improved by the self-learning strategy, and the optimal individual is reserved to ensure the convergence speed. Meanwhile, based on the multilearning strategy, the global best position ( gbest ) of particles is replaced with randomly chosen from the top k of gbest and further improve the population diversity to prevent premature convergence. This strategy improves the social learning part and enhances the global exploration capability of the proposed ILSPSO algorithm. Then, the performance of the ILSPSO algorithm is compared with five representative PSO variants in the experiments. The test results on benchmark functions demonstrate that the proposed ILSPSO algorithm achieves significantly better overall performance and outperforms other tested PSO variants. Finally, the ILSPSO algorithm shows satisfactory performance in vehicle path planning and has a good result on the planned path.

Suggested Citation

  • En Lu & Lizhang Xu & Yaoming Li & Zheng Ma & Zhong Tang & Chengming Luo, 2019. "A Novel Particle Swarm Optimization with Improved Learning Strategies and Its Application to Vehicle Path Planning," Mathematical Problems in Engineering, Hindawi, vol. 2019, pages 1-16, November.
  • Handle: RePEc:hin:jnlmpe:9367093
    DOI: 10.1155/2019/9367093
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2019/9367093.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2019/9367093.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2019/9367093?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:9367093. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.