Mobile Robot Path Planning Based on Improved Coyote Optimization Algorithm

Jingyao Huang, Huihui Wu and Dimitris Mourtzis

Mathematical Problems in Engineering, 2022, vol. 2022, 1-14

Abstract: An improved coyote optimization algorithm (ICOA) is proposed to meet the requirements of global search capability, convergence speed, and stability for mobile robot path planning problems. Firstly, the population is divided into the elite group and the general groups after initialization, and the coyote individuals in the general groups are evolved by introducing the strategy of the best leading the poor. Secondly, after returning to the original position, coyotes adopt a new growth mode, and each individual makes a certain contribution to improve the level of the whole group. Thirdly, different from the original greedy algorithm, the survival of the fittest is carried out after each group of coyotes grows up, and the individuals do not affect each other. Finally, ICOA and the other seven optimization algorithms are simulated on four maps for mobile robot path planning. The simulation results show that ICOA can keep the diversity of the population, and has a strong global search ability, better stability, fast convergence speed, which reflects the strong optimization ability.

Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/mpe/2022/4465542.pdf (application/pdf)
http://downloads.hindawi.com/journals/mpe/2022/4465542.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:4465542

DOI: 10.1155/2022/4465542

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().