A game‐theoretic cooperative path planning strategy using hybrid heuristic optimization algorithm

Abstract A novel method based on game theory and LCD‐SCA optimization algorithm is proposed for solving the cooperative path planning challenge for multiple UAVs in a desired formation configuration. The cooperative path planning problem is solved by identifying the optimal strategy for the Stackelberg‐Nash game. The conventional sine‐cosine algorithm method is enhanced by incorporating linear differential decrement, chaos theory, and differential evolution, and the proposed heuristic method is integrated into the path planning problem. An optimal strategy for finding the game by minimising the global cost function via the heuristic method is integrated. Extensive simulation and comparison results are provided to evaluate the performance through simulation, compared with the previous work on path planning.

Authors

Institutions

Publication Details

Journal
IET Control Theory and Applications
Published
2024-12-07
DOI
https://doi.org/10.1049/cth2.12766
Citations
3
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.75

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A game‐theoretic cooperative path planning strategy using hybrid heuristic optimization algorithm

Ye Zhang, Yutong Zhu
3 citations
IET Control Theory and Applications
Robotic Path Planning Algorithms
0.75
article

A game‐theoretic cooperative path planning strategy using hybrid heuristic optimization algorithm

Ye Zhang, Yutong Zhu
article en
3 citations

Abstract

Abstract A novel method based on game theory and LCD‐SCA optimization algorithm is proposed for solving the cooperative path planning challenge for multiple UAVs in a desired formation configuration. The cooperative path planning problem is solved by identifying the optimal strategy for the Stackelberg‐Nash game. The conventional sine‐cosine algorithm method is enhanced by incorporating linear differential decrement, chaos theory, and differential evolution, and the proposed heuristic method is integrated into the path planning problem. An optimal strategy for finding the game by minimising the global cost function via the heuristic method is integrated. Extensive simulation and comparison results are provided to evaluate the performance through simulation, compared with the previous work on path planning.

IET Control Theory and ApplicationsVol. 19(1)
Northwestern Polytechnical University (CN)
Northwestern University, National Natural Science Foundation of China, Northwestern Polytechnical University, Chinese Aeronautical Establishment
Openalex Percentile: Top 26%
Robotic Path Planning Algorithms
0.75
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.

A game‐theoretic cooperative path planning strategy using hybrid heuristic optimization algorithm — Ye Zhang, Yutong Zhu · IET Control Theory and Applications (2024) | TGRS Research Map | TGRS