Distribution Network Path Planning Method Based on Fusion Improved A* and Ant Colony Algorithm

The planning of distribution network has a crucial impact on the reliability, economy and stability of the power network. In order to improve the rationality of distribution network path planning., A research method of path planning based on fusion improved A* and ant colony algorithm is proposed. The differential distribution of pheromones accelerated the initial convergence of ant colonies. Three influencing factors are introduced into the heuristic function and the distance bias function is integrated into the transfer probability, so that ants can better search the path towards the target point and improve the search efficiency. At the same time, a special reward and punishment mechanism is used to update pheromone to solve the problem that the algorithm is easy to fall into local optimal. By comparing with the ACO algorithm and the improved ACO algorithm., the effectiveness of the improved algorithm is verified.

Authors

Publication Details

Published
2024-12-27
DOI
https://doi.org/10.1109/auteee62881.2024.10869694
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

Distribution Network Path Planning Method Based on Fusion Improved A* and Ant Colony Algorithm

Yan Runzhen, Rui Su, Wen Jinmei, Yating Wang et al.
Robotic Path Planning Algorithms
article

Distribution Network Path Planning Method Based on Fusion Improved A* and Ant Colony Algorithm

Yan Runzhen, Rui Su, Wen Jinmei, Yating Wang, Lei Hui
article en

Abstract

The planning of distribution network has a crucial impact on the reliability, economy and stability of the power network. In order to improve the rationality of distribution network path planning., A research method of path planning based on fusion improved A* and ant colony algorithm is proposed. The differential distribution of pheromones accelerated the initial convergence of ant colonies. Three influencing factors are introduced into the heuristic function and the distance bias function is integrated into the transfer probability, so that ants can better search the path towards the target point and improve the search efficiency. At the same time, a special reward and punishment mechanism is used to update pheromone to solve the problem that the algorithm is easy to fall into local optimal. By comparing with the ACO algorithm and the improved ACO algorithm., the effectiveness of the improved algorithm is verified.

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.

Distribution Network Path Planning Method Based on Fusion Improved A* and Ant Colony Algorithm — Yan Runzhen, Rui Su, et al. · (2024) | TGRS Research Map | TGRS