Application of Hybrid Intelligent Algorithms in Path Planning

Combining with the classical combinatorial optimization problem in the field of mathematics, this paper decides to take the optimal path planning problem as the research object. A new neighborhood search operator is introduced into the basic worker bee colony algorithm, and the optimization strategy...

Full description

Saved in:
Bibliographic Details
Published inJournal of physics. Conference series Vol. 1487; no. 1; pp. 12004 - 12008
Main Authors Cuan, Ying, Li, Yike, Li, Xiangjuan
Format Journal Article
LanguageEnglish
Published Bristol IOP Publishing 01.03.2020
Subjects
Algorithms
Combinatorial analysis
Hybrid systems
Optimization
Path planning
Physics
Search algorithms
Simulated annealing
Swarm intelligence
Online AccessGet full text

Cover

More Information
Summary:Combining with the classical combinatorial optimization problem in the field of mathematics, this paper decides to take the optimal path planning problem as the research object. A new neighborhood search operator is introduced into the basic worker bee colony algorithm, and the optimization strategy of the algorithm is updated by combining the simulated annealing algorithm. Finally, the improved algorithm is applied to the optimal layout of the path planning, and the optimization results are compared with those of other algorithms. The simulation test shows that the intelligent optimization scheme proposed in this paper can get better optimization results, and has certain feasibility in the path planning. It provides valuable reference for solving the classical problems of the same type.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1487/1/012004