A Two-Stage Planning Method for Rural Photovoltaic Inspection Path Planning Based on the Crested Porcupine Algorithm
Photovoltaic (PV) energy has become a pillar of clean energy in rural areas. However, its extensive deployment in regions with geographically dispersed locations and limited road conditions has made efficient inspection a significant challenge. To address these issues, this study proposes a multi-re...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Energies |
| Subjects: | |
| Online Access: | https://www.mdpi.com/1996-1073/18/11/2909 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Photovoltaic (PV) energy has become a pillar of clean energy in rural areas. However, its extensive deployment in regions with geographically dispersed locations and limited road conditions has made efficient inspection a significant challenge. To address these issues, this study proposes a multi-regional PV inspection path planning method based on the crested porcupine optimization (CPO) algorithm. This method first employs a hybrid optimization framework combining a genetic algorithm, Simulated Annealing, and Fuzzy C-Means Clustering (GASA-FCM) to divide PV power stations into multiple regions, adapting to their dispersed distribution characteristics. Subsequently, the CPO algorithm is used to calculate obstacle-avoidance paths, replacing the Euclidean distance in the traditional Traveling Salesman Problem (TSP) with adaptive rural road constraint conditions to better cope with the geographical complexity in real-world scenarios. The simulation results verify the advantages of this method, achieving significantly shorter path lengths, higher computational efficiency, and stronger stability compared to the traditional solutions, thereby improving the efficiency of rural PV inspection. Moreover, the proposed framework not only provides a practical inspection strategy for rural PV systems but also offers a solution to the Multiple-Depot Multiple Traveling Salesmen Problem (MDMTSP) under constrained conditions, expanding its application scope in similar scenarios. |
|---|---|
| ISSN: | 1996-1073 |