An Optimal Path Planning Strategy for Low-Voltage Extension in Digital Outdoor Surveying

In the context of digital technology driving the transformation of the electricity industry, the urgency of digitalizing low-voltage extension services has become increasingly prominent. Traditional wiring planning processes, relying on manual on-site surveys, face challenges such as low efficiency in path selection, high costs, and insufficient accuracy. To address the issues of high survey complexity and difficulty in optimizing multiple routing options in low-voltage extension projects, this paper proposes a digital outdoor survey optimal routing strategy based on Geographic Information Systems (GIS). This strategy utilizes trajectory coordinates obtained from GIS devices, applying noise reduction algorithms to eliminate interference points, and combines with Ram-Douglas-Peucker simplified algorithm to compress redundant coordinate information, and constructs a path trajectory model based on Dijkstra's algorithm. On this basis, the strategy integrates wiring logic to generate a low-voltage extension wiring plan with the minimum wiring cost path. Numerical studies indicate that this method can significantly improve the efficiency and accuracy of routing path planning, reduce reliance on manual surveys, and provide a reference for the digital transformation of low-voltage extension in power companies.

Authors

Institutions

Publication Details

Published
2025-04-18
DOI
https://doi.org/10.1109/iseae64934.2025.11041916
Primary Topic
Robotics and Sensor-Based Localization
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An Optimal Path Planning Strategy for Low-Voltage Extension in Digital Outdoor Surveying

Liang Zhou, Xiangang Peng, Bin Chen, Yuhang Liu et al.
Robotics and Sensor-Based Localization
article

An Optimal Path Planning Strategy for Low-Voltage Extension in Digital Outdoor Surveying

Liang Zhou, Xiangang Peng, Bin Chen, Yuhang Liu, Jiajie Wang, Mingjie He, Fei Xu
article en

Abstract

In the context of digital technology driving the transformation of the electricity industry, the urgency of digitalizing low-voltage extension services has become increasingly prominent. Traditional wiring planning processes, relying on manual on-site surveys, face challenges such as low efficiency in path selection, high costs, and insufficient accuracy. To address the issues of high survey complexity and difficulty in optimizing multiple routing options in low-voltage extension projects, this paper proposes a digital outdoor survey optimal routing strategy based on Geographic Information Systems (GIS). This strategy utilizes trajectory coordinates obtained from GIS devices, applying noise reduction algorithms to eliminate interference points, and combines with Ram-Douglas-Peucker simplified algorithm to compress redundant coordinate information, and constructs a path trajectory model based on Dijkstra's algorithm. On this basis, the strategy integrates wiring logic to generate a low-voltage extension wiring plan with the minimum wiring cost path. Numerical studies indicate that this method can significantly improve the efficiency and accuracy of routing path planning, reduce reliance on manual surveys, and provide a reference for the digital transformation of low-voltage extension in power companies.

Guangdong University of Technology (CN), China Southern Power Grid (China) (CN)
Sustainable cities and communities
Openalex Percentile: Top 81%
Robotics and Sensor-Based Localization
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.