Optimal deployment of the online monitoring equipment at the edges of substations considering spatial constraint

To realize the optimal deployment of online monitoring equipment at the edges of substations under the cloud-edge collaboration framework, an optimal deployment model of edges considering spatial constraints is proposed. In the model, the constraints including edge deployment point, line of sight, a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Advances in mechanical engineering Ročník 16; číslo 5
Hlavní autoři: Xu, Wenxiang, Tong, Shaocong, Xu, Shimin, Du, Baigang, Liu, Dezheng, Qin, Tao
Médium: Journal Article
Jazyk:angličtina
Vydáno: London, England SAGE Publications 01.05.2024
Sage Publications Ltd
SAGE Publishing
Témata:
Algorithms
Archives & records
Clustering
Greedy algorithms
Markov analysis
Markov chains
Monitoring
Monitoring systems
Polynomials
Simulated annealing
Substations
Online monitoring equipment
edges of substations
optimal deployment
improved trending Markov chain
multi-objective simulated annealing algorithm
ISSN:1687-8132, 1687-8140
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:To realize the optimal deployment of online monitoring equipment at the edges of substations under the cloud-edge collaboration framework, an optimal deployment model of edges considering spatial constraints is proposed. In the model, the constraints including edge deployment point, line of sight, as well as device pose, etc. are taken into account. To achieve the one-to-many collection of the deployed equipment, a mathematical model is constructed with the objectives of minimizing the shooting distance and the number of edge equipments. And an archive based multi-objective simulated annealing algorithm based on improved trending Markov chain (IAMOSA) is proposed to solve the problem. This algorithm utilizes greedy clustering to initialize deployment points, and the improved disturbance step length with tendency is used to search the neighborhood space. Besides, polynomial fitting Pareto front is also used to select and guide the Markov chain and archive population. Finally, the feasibility and effectiveness of the proposed model and algorithm are verified through an experiment of optimal deployment of the edge equipments in a certain substation.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1687-8132
1687-8140
DOI:10.1177/16878132241255406