Dynamic Path Planning Based on Hybrid Intelligence Algorithm

In view of the limitations of the traditional bubbling ranking algorithm in the study of dynamic path planning, a research scheme of dynamic path planning based on hybrid intelligent algorithm is proposed. Firstly, the influencing factors is accurately located through the simulated annealing theory, and the indicators is reasonably divided to reduce interference, and the hybrid intelligent algorithm is used to construct a dynamic path planning research scheme. Experimental results show that under certain evaluation criteria, the proposed scheme is superior to the traditional bubble sorting algorithm in terms of the accuracy of dynamic path planning research and the processing time of influencing factors, and has obvious advantages. Dynamic path planning research plays an extremely important role in movable objects, which can accurately predict and optimize the growth characteristics and product generation of movable objects. However, the traditional bubble sorting algorithm has some limitations in solving the path planning simulation problem, especially when dealing with complex problems. In this paper, a dynamic path planning scheme based on hybrid intelligence algorithm is proposed to better solve this problem. In this scheme, the influencing factors is accurately located through the simulated annealing theory, so as to determine the division of indicators, and the hybrid intelligence algorithm is used to construct the scheme. Experimental results show that under certain evaluation criteria, the accuracy and speed of the scheme is significantly improved for different problems, and it has better performance. Therefore, the simulation scheme based on hybrid intelligence algorithm can better solve the limitations of traditional bubbling sorting algorithms and improve the simulation accuracy and efficiency in the study of dynamic path planning.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/gccit63234.2024.10862258
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Path Planning Based on Hybrid Intelligence Algorithm

Jie Zhu, Wenjuan Zhou, Jingjing Dai
Robotic Path Planning Algorithms
article

Dynamic Path Planning Based on Hybrid Intelligence Algorithm

Jie Zhu, Wenjuan Zhou, Jingjing Dai
article en

Abstract

In view of the limitations of the traditional bubbling ranking algorithm in the study of dynamic path planning, a research scheme of dynamic path planning based on hybrid intelligent algorithm is proposed. Firstly, the influencing factors is accurately located through the simulated annealing theory, and the indicators is reasonably divided to reduce interference, and the hybrid intelligent algorithm is used to construct a dynamic path planning research scheme. Experimental results show that under certain evaluation criteria, the proposed scheme is superior to the traditional bubble sorting algorithm in terms of the accuracy of dynamic path planning research and the processing time of influencing factors, and has obvious advantages. Dynamic path planning research plays an extremely important role in movable objects, which can accurately predict and optimize the growth characteristics and product generation of movable objects. However, the traditional bubble sorting algorithm has some limitations in solving the path planning simulation problem, especially when dealing with complex problems. In this paper, a dynamic path planning scheme based on hybrid intelligence algorithm is proposed to better solve this problem. In this scheme, the influencing factors is accurately located through the simulated annealing theory, so as to determine the division of indicators, and the hybrid intelligence algorithm is used to construct the scheme. Experimental results show that under certain evaluation criteria, the accuracy and speed of the scheme is significantly improved for different problems, and it has better performance. Therefore, the simulation scheme based on hybrid intelligence algorithm can better solve the limitations of traditional bubbling sorting algorithms and improve the simulation accuracy and efficiency in the study of dynamic path planning.

Wuhan Technology and Business University (CN)
Openalex Percentile: Top 73%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.