CN109242337B - Substation inspection robot resource allocation method for provincial power grid - Google Patents

Substation inspection robot resource allocation method for provincial power grid Download PDF

Info

Publication number
CN109242337B
CN109242337B CN201811140884.5A CN201811140884A CN109242337B CN 109242337 B CN109242337 B CN 109242337B CN 201811140884 A CN201811140884 A CN 201811140884A CN 109242337 B CN109242337 B CN 109242337B
Authority
CN
China
Prior art keywords
inspection
distance
substation
agents
inspected
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201811140884.5A
Other languages
Chinese (zh)
Other versions
CN109242337A (en
Inventor
张炜
邬蓉蓉
朱时阳
黎新
宾冬梅
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Electric Power Research Institute of Guangxi Power Grid Co Ltd
Original Assignee
Electric Power Research Institute of Guangxi Power Grid Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Electric Power Research Institute of Guangxi Power Grid Co Ltd filed Critical Electric Power Research Institute of Guangxi Power Grid Co Ltd
Priority to CN201811140884.5A priority Critical patent/CN109242337B/en
Publication of CN109242337A publication Critical patent/CN109242337A/en
Application granted granted Critical
Publication of CN109242337B publication Critical patent/CN109242337B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06312Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06313Resource planning in a project environment
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06Energy or water supply

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Marketing (AREA)
  • General Business, Economics & Management (AREA)
  • Tourism & Hospitality (AREA)
  • Development Economics (AREA)
  • Educational Administration (AREA)
  • Health & Medical Sciences (AREA)
  • Game Theory and Decision Science (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Primary Health Care (AREA)
  • General Health & Medical Sciences (AREA)
  • Water Supply & Treatment (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Biodiversity & Conservation Biology (AREA)
  • Public Health (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention relates to the technical field of dispatching of transformer substation inspection robots, in particular to a transformer substation inspection robot resource dispatching method for a provincial power grid, which can effectively avoid the waste of manpower, material resources and time cost when an inspection robot is transported and used among different inspection centers and transformer substations, and greatly improve the use efficiency of the inspection robot; the cross-regional allocation of the inspection robot resources among different inspection centers is realized, the outstanding contradiction between the increasing growth of transformer substations and the shortage of inspection personnel is overcome, and the method has a large-range engineering application value; the inspection robot based on the multi-agent system is provided with an efficient and economic use scheme, the outstanding contradictions of high price, limited quantity and numerous quantities of substations to be inspected of the inspection robot are overcome, and the utilization value of the inspection robot is remarkably improved.

Description

Substation inspection robot resource allocation method for provincial power grid
Technical Field
The invention relates to the technical field of dispatching of transformer substation inspection robots, in particular to a transformer substation inspection robot resource dispatching method for a provincial power grid.
Background
The transformer substation is a core junction of a power grid, and routine inspection of equipment in the substation is a basic means for ensuring safe operation of the power grid. Along with the requirement of power system stability constantly improves, there are shortcomings such as intensity of labour big, the equipment dispersion of examining, bad weather interference influence in the manual inspection mode, and manual inspection also shows its objectively not enough gradually and the sign that is not suitable for smart power grids development trend.
For the above situation, in 2002, the project of "substation equipment inspection robot" is listed as the national 863 plan; in 2013, the transformer substation inspection robot starts to be put into inspection application of national power grid companies comprehensively; in 2016, a power grid company in south duly puts forward new requirements for pushing machine patrol and people patrol and exploring application intelligent operation, and aims to realize all-weather uninterrupted monitoring on power transmission and transformation equipment by researching an intelligent robot flexibly carrying various high-performance and high-precision sensors, push conversion and upgrade to equipment intellectualization and intelligent operation, solve the outstanding contradiction of structural shortage, and improve production and operation quality and equipment health level.
In a power grid enterprise, the number of substations and inspection robots governed by each power supply bureau and each inspection center is different, the substation inspection robots are exposed in the practical application for decentralized management, the robot resources are not uniformly managed, and cross-regional allocation and use are not performed according to inspection task requirements, so that the sustainable working characteristics are difficult to fully exert; in addition, the current transformer substation inspection robot has high investment cost, and the input-output ratio of the transformer substation inspection robot is bound to be reduced when the transformer substation inspection robot is fixed in a certain transformer substation. In view of this, it is necessary to implement cross-regional (maintenance center) allocation and use of the inspection robot between the power supply bureau and the maintenance center under the provincial power grid.
An agent is the key research content in the field of artificial intelligence, and the agent refers to software or hardware capable of autonomous activity and an entity capable of interacting with the environment. A multi-agent system (MAS) is a collection of multiple agents with the goal of building large and complex systems into small, easily managed distributed systems that communicate and coordinate with each other.
On the one hand, although the optimized transformer substation inspection robot transfer path can reduce the labor and physical costs, the research for developing the transfer mode and the optimization algorithm is very limited, and the transfer work efficiency is low. On the other hand, multi-agent technology has been successfully applied. In view of this, it is necessary to research a substation inspection robot resource allocation method for a provincial power grid based on a multi-agent technology, so that the substation inspection robot can be efficiently transported and used among different substations, the substation inspection robot can break the outstanding contradiction of structural shortage of workers, and the quality level of production and operation is ensured to be improved.
Disclosure of Invention
The invention aims to solve the outstanding contradiction between the small number of the inspection robots and the large number of the transformer substations. The invention provides a substation inspection robot resource allocation method based on MAS (Multi-agent System), which is characterized in that inspection robots distributed in substations of a provincial power grid are regarded as intelligent body prototypes, an intelligent body adaptation technical model and a layered control framework of the inspection robots are established, the unified transfer of cross-regions (a power supply bureau and an inspection and maintenance center) is realized aiming at the intelligent bodies, and technical support is provided for establishing a provincial power grid production monitoring command center. In order to achieve the purpose, the specific technical scheme is as follows:
a transformer substation inspection robot resource allocation method for a provincial power grid comprises the following steps:
(1) inputting the number of the transformer substation and the inspection center, setting the iteration number to be N and the maximum value of the iteration number to be Nmax(ii) a Wherein the number of the inspection centers is A;
(2) uniformly configuring A different inspection centers for m intelligent agents at random, and initializing substation site set C inspected by intelligent agent kkAnd a set of sites to be inspected
Figure BDA0001815774800000021
Initially setting the number l of agents which finish the routing inspection task to be 0;
(3) when the current electric quantity of the intelligent agent k at least meets the requirement of polling one target substation, the intelligent agent k is transferred to a target substation j, and a substation site set C polled by the intelligent agent k is updatedkAnd a set of sites to be inspected
Figure BDA0001815774800000022
(4) If the station set to be inspected
Figure BDA0001815774800000023
If the task quantity of at least one station to be inspected meets the current electric quantity of the intelligent agent k, turning to the step (3); otherwise, turning to the step (5);
(5) if the station set to be inspected
Figure BDA0001815774800000024
If the current electric quantity of the intelligent agent k does not meet the task quantity of the remaining to-be-inspected station, charging the current station to recover sufficient electric quantity, and turning to the step (3); otherwise, turning to the step (6);
(6) if the station set to be inspected
Figure BDA0001815774800000025
If the current last remaining patrol station of the agent k is not the station of the patrol and maintenance center department, returning the agent k to the nearest patrol and maintenance center; if the number of the agents completing the routing inspection task is less than the total number of the agents, namely l is less than m, turning to the step (3); otherwise, turning to the step (7);
(7) after all the agents complete the set inspection task, updating the information elements;
(8) collecting C by the inspected substation siteskObtaining a set of paths L ═ { L ═ L of m agents1,L2,…,LmCalculating and recording an optimal path set obtained by the iteration according to the steps (3) to (6), and updating a global optimal solution;
(9) iterative computation, if the same optimal solution continuously appears m times, turning to the step 10, otherwise, turning to the step 11;
(10) changing the content of the information elements of the transfer path scheme, and outputting the schemes to m intelligent agents respectively;
(11) if the number of iterations reaches NmaxIf the optimal solution does not occur m times continuously, the iterative counting is stoppedAnd (4) calculating and sending manual configuration suggestions to an administrator.
Preferably, the step (2) further comprises setting a maximum value A of the number of maintenance centersmaxSetting a minimum value m of the total number of agentsminWherein, each patrol and maintain center is configured with 1-3 agents, namely mmin≥Amax
Preferably, m intelligent agents in the step (3) randomly select a transformer substation as a starting point, an intelligent agent k starts from a transformer substation node i to a next target transformer substation node j, and the intelligent agent k has a transfer probability
Figure BDA0001815774800000026
Selecting a transfer path; the transit probability is calculated as follows:
Figure BDA0001815774800000031
wherein,
Figure BDA0001815774800000032
the method is characterized in that the method refers to a substation site set which can be patrolled by an intelligent agent; tau isijThe distance length of the routing inspection path with the side (i, j); etaijRefers to the tour path distance length visibility with edge (i, j), generally expressed as the inverse of the path length; mu.sijRefers to the round-trip time saving value with the edge (i, j), i.e. uij=hib+hbj-hij,hibThe distance from a node a of the inspection and maintenance center to a node i of the transformer substation is measured; h isbjIs the distance h from the node a of the inspection center to the node j of the transformer substationijThe distance between a transformer substation node i and a transformer substation node j is defined, and a belongs to a maintenance center set A; the larger the numerical value for saving the road distance is, the larger the numerical value is, the larger the greater the distance is, the larger the numerical value is, the greater the numerical value is, the greater the numerical value is, the greater the distance is, the greater the distance is, the greater the distance is, the distance is, the greater the numerical value is, the greater the numerical value is, the greater the distance is, the greater the distance is, the greater the distance is, the; alpha, beta and gamma are respectively tauij、ηij、μijThe specific numerical value of the priority level is an integer between 1 and 10, and the power supply bureau operation and maintenance personnel make a decision according to specific conditions.
Preferably, the update information element of step (7) is specifically as follows:
after all agents complete one iteration of the repeated transfer calculation, the information element strength on each edge is updated by the following formula:
τij=(1-ρ)τij+Δτij
Figure BDA0001815774800000033
Figure BDA0001815774800000034
where ρ is a volatilization factor in the information element, Δ τijRefers to the amount of change in information elements on edge (i, j); delta tauij kRefers to the amount of information elements released by the kth agent on edge (i, j); q is the total amount of information elements released by the agent to finish one transfer; l iskIs the distance of the path traversed by the agent.
The invention has the beneficial effects that: the invention can effectively avoid the waste of manpower, material resources and time cost when the inspection robot is transported and used among different inspection centers and transformer substations, and greatly improves the use efficiency of the inspection robot; the cross-regional allocation of the inspection robot resources among different inspection centers is realized, the outstanding contradiction between the increasing growth of transformer substations and the shortage of inspection personnel is overcome, and the method has a large-range engineering application value; the MAS-based single inspection robot efficient and economic use scheme is provided, the outstanding contradictions of high price, limited number and numerous transformer substations to be inspected of the inspection robot are overcome, and the utilization value of the inspection robot is remarkably improved.
Drawings
FIG. 1 is a schematic flow chart of the present invention.
Detailed Description
For a better understanding of the present invention, reference is made to the following detailed description taken in conjunction with the accompanying drawings in which:
the problem of the resource centralized transfer process of the substation inspection robot facing the provincial power grid can be described as follows: the m inspection robots respectively go to the transformer substation inspection equipment from the inspection center where the inspection robots are located, and return to the inspection center under the conditions that the transformer substation is not repeatedly inspected, the working time (charging, inspection, on-way data transmission and data return) is not wasted, and the way is minimum. The data of the customer site, the position coordinates of the distribution center, and the demand are shown in table 1.
Table 1 details of the specific elements of the maintenance patrol centre and the substation site
Node numbering Position coordinates Inspection time window
B1 (19,0) [74,244]
B2 (46,23) [58,228]
B3 (44,86) [15,228]
B4 (75,27) [96,266]
B5 (71,64) [17,217]
B6 (86,67) [85,255]
B7 (10,69) [21,191]
B8 (10,52) [9,179]
B9 (46,67) [37,207]
B10 (35,53) [21,221]
B11 (0,73) [74,274]
B12 (2,24) [58,258]
B13 (16,24) [15,225]
B14 (40,97) [56,256]
B15 (70,18) [87,287]
B16 (16,90) [0,200]
B17 (58,43) [10,210]
B18 (59,74) [30,230]
B19 (77,80) [21,221]
B20 (77,80) [74,274]
B21 (25,16) [58,258]
B22 (0,50) [15,225]
B23 (29,64) [56,256]
B24 (61,0) [87,287]
A1 (33,77)
A2 (26,30)
A3 (79,39)
B1-B24 are set as substation node codes, and A1-A3 are set as patrol center node codes. The transformer substations comprise 220 KV transformer substations and 110 KV transformer substations, 3 inspection centers can be used for allocating 7 inspection robots at present, and transfer vehicles are sufficient. Working time t for loading and fixing robot for transfer vehicle in transformer substation0Not exceeding 20 minutes. The cruising time of the robot after being fully charged is not less than 8 hours. Specific elements of inspection center and substation site and inspection working time window of substation nodei,ui]As shown in table 1:
suppose the patrol inspection working time window of the substation station i is [ l ]i,ui]The timeliness of the time window for early or late arrival must be calculated, with the timeliness time window in the effective time range being l'i,u′i]When the vehicle exceeds the limited interval and reaches the substation station i according to the set performance coefficient, namely if the patrol intelligent agent k reaches the substation station i earlier than the timeliness time window, the system must wait until the earliest service starting time li' routing inspection can be performed; if patrol agent k arrives at substation site i later than the timeliness time window, it must begin to wear at the latestService time ui' before arrival to patrol. A transformer substation inspection robot resource allocation method for a provincial power grid comprises the following steps: (1) inputting the number of the transformer substation and the inspection center, setting the iteration number to be N and the maximum value of the iteration number to be Nmax(ii) a Wherein the number of the inspection centers is A; maximum number of iterations Nmax550; the maximum iteration number is determined according to the number of 110-220 KV substations which need to transfer the application agent.
(2) Uniformly configuring A different inspection centers for m intelligent agents at random, and initializing substation site set C inspected by intelligent agent kkAnd a set of sites to be inspected
Figure BDA0001815774800000051
Initially setting the number l of agents which finish the routing inspection task to be 0; setting the maximum value A of the inspection center numbermaxSetting a minimum value m of the total number of agentsminWherein, each patrol and maintain center is configured with 1-3 agents, namely mmin≥Amax. For example, AmaxM which is 79, namely 79 is the actual maximum value of the patrol center, can be setminIs 79.
(3) When the current electric quantity of the intelligent agent k at least meets the requirement of polling one target substation, the intelligent agent k is transferred to a target substation j, and a substation site set C polled by the intelligent agent k is updatedkAnd a set of sites to be inspected
Figure BDA0001815774800000052
m intelligent agents randomly select a transformer substation as a starting point, an intelligent agent k starts from a transformer substation node i to a next target transformer substation node j, and the intelligent agent k has a transfer probability
Figure BDA0001815774800000053
Selecting a transfer path; the transit probability is calculated as follows:
Figure BDA0001815774800000054
wherein,
Figure BDA0001815774800000055
the method is characterized in that the method refers to a substation site set which can be patrolled by an intelligent agent; tau isijThe distance length of the routing inspection path with the side (i, j); etaijRefers to the tour path distance length visibility with edge (i, j), generally expressed as the inverse of the path length; mu.sijRefers to the round-trip time saving value with the edge (i, j), i.e. uij=hib+hbj-hij,hibThe distance from a node a of the inspection and maintenance center to a node i of the transformer substation is measured; h isbjIs the distance h from the node a of the inspection center to the node j of the transformer substationijThe distance between a transformer substation node i and a transformer substation node j is defined, and a belongs to a maintenance center set A; the larger the numerical value for saving the road distance is, the larger the numerical value is, the larger the greater the distance is, the larger the numerical value is, the greater the numerical value is, the greater the numerical value is, the greater the distance is, the greater the distance is, the greater the distance is, the distance is, the greater the numerical value is, the greater the numerical value is, the greater the distance is, the greater the distance is, the greater the distance is, the; alpha, beta and gamma are respectively tauij、ηij、μijThe specific numerical value of the priority level of (1) is an integer between 1 and 10, and is determined by operation and maintenance personnel according to specific conditions.
(4) If the station set to be inspected
Figure BDA0001815774800000061
If the task quantity of at least one station to be inspected meets the current electric quantity of the intelligent agent k, turning to the step (3); otherwise, turning to the step (5); in the formula,
Figure BDA0001815774800000062
represents an empty set, i.e. refers to a set that does not already contain any elements.
(5) If the station set to be inspected
Figure BDA0001815774800000063
If the current electric quantity of the intelligent agent k does not meet the task quantity of the remaining to-be-inspected station, charging the current station to recover sufficient electric quantity, and turning to the step (3); otherwise, go to step (6).
(6) If the station set to be inspected
Figure BDA0001815774800000064
If the current last remaining patrol station of the agent k is not the station of the patrol and maintenance center department, returning the agent k to the nearest patrol and maintenance center; if the number of the agents completing the routing inspection task is less than the total number of the agents, namely l is less than m, turning to the step (3); otherwise, go to step (7).
(7) After all agents complete the established polling task, the information elements are updated as follows:
after all agents complete one-time repeated transfer calculation iteration, the information element strength on each edge is updated by the following formula:
τij=(1-ρ)τij+Δτij; (2)
Figure BDA0001815774800000065
Figure BDA0001815774800000066
where ρ is a volatilization factor in the information element, Δ τijRefers to the amount of change in information elements on edge (i, j); delta tauij kRefers to the amount of information elements released by the kth agent on edge (i, j); q is the total amount of information elements released by the agent to finish one transfer; l iskIs the distance of the path traversed by the agent.
(8) Collecting C by the inspected substation siteskObtaining a set of paths L ═ { L ═ L of m agents1,L2,…,LmAnd (4) calculating and recording the optimal path set obtained by the iteration according to the steps (3) to (6), and updating the global optimal solution.
(9) And (5) performing iterative calculation, and if the same optimal solution continuously occurs m times, turning to the step 10, otherwise, turning to the step 11.
(10) And changing the content of the information elements of the transfer path scheme, and outputting the schemes to the m intelligent agents respectively.
(11) If the number of iterations reaches NmaxBut still not continuously outAnd stopping iterative calculation and sending a manual configuration suggestion to an administrator when the optimal solution is obtained for m times.
According to the above information requirement, the calculated optimal solution of the transfer route is as follows,
agent 1: a1 → B16 → B11 → B8 → B22 → B7 → A1;
the intelligent agent 2: a1 → B14 → B3 → B18 → B23 → A1;
agent 3: a1 → B9 → B5 → A1;
the agent 4: a3 → B20 → B6 → B19 → A3;
and the intelligent agent 5: a3 → B4 → B15 → B24 → B17 → A3:
and the intelligent agent 6: a3 → B2 → B10 → B21 → A2;
the agent 7: a2 → B13 → B12 → B1 → A2
Aiming at the problems, the invention can solve the optimal scheme that the inspection robot finishes the inspection of each substation site in a cross-region mode (inspection center), and achieves the aim of minimizing the cost (manpower, material resources and time cost) of the inspection process.
The present invention is not limited to the above-described embodiments, which are merely preferred embodiments of the present invention, and the present invention is not limited thereto, and any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.

Claims (2)

1. A transformer substation inspection robot resource allocation method for a provincial power grid is characterized by comprising the following steps: the method comprises the following steps:
(1) inputting the number of the transformer substation and the inspection center, setting the iteration number to be N and the maximum value of the iteration number to be Nmax(ii) a Wherein the number of the inspection centers is A;
(2) uniformly configuring A different inspection centers for m intelligent agents at random, and initializing substation site set C inspected by intelligent agent kkAnd a set of sites to be inspected
Figure FDA0003212775900000011
Initially setting completed polling taskThe number of agents l is 0;
(3) when the current electric quantity of the intelligent agent k at least meets the requirement of polling one target substation, the intelligent agent k is transferred to a target substation j, and a substation site set C polled by the intelligent agent k is updatedkAnd a set of sites to be inspected
Figure FDA0003212775900000012
m intelligent agents randomly select a transformer substation as a starting point, an intelligent agent k starts from a transformer substation node i to a next target transformer substation node j, and the intelligent agent k has a transfer probability
Figure FDA0003212775900000013
Selecting a transfer path; the transit probability is calculated as follows:
Figure FDA0003212775900000014
wherein,
Figure FDA0003212775900000015
the method is characterized in that the method refers to a substation site set which can be patrolled by an intelligent agent; tau isijThe distance length of the routing inspection path with the side (i, j); etaijRefers to the tour path distance length visibility with edge (i, j), expressed as the inverse of the path length; mu.sijRefers to the round-trip time saving value with the edge (i, j), i.e. uij=hib+hbj-hij,hibThe distance from a node a of the inspection and maintenance center to a node i of the transformer substation is measured; h isbjIs the distance h from the node a of the inspection center to the node j of the transformer substationijThe distance between a transformer substation node i and a transformer substation node j is defined, and a belongs to a maintenance center set A; the larger the numerical value for saving the road distance is, the larger the numerical value is, the larger the greater the distance is, the larger the numerical value is, the greater the numerical value is, the greater the numerical value is, the greater the distance is, the greater the distance is, the greater the distance is, the distance is, the greater the numerical value is, the greater the numerical value is, the greater the distance is, the greater the distance is, the greater the distance is, the; alpha, beta and gamma are respectively tauij、ηij、μijThe specific numerical value of the priority level of (1) is an integer between 1 and 10;
(4) if the station set to be inspected
Figure FDA0003212775900000016
If the task quantity of at least one station to be inspected meets the current electric quantity of the intelligent agent k, turning to the step (3); otherwise, turning to the step (5);
(5) if the station set to be inspected
Figure FDA0003212775900000017
If the current electric quantity of the intelligent agent k does not meet the task quantity of the remaining to-be-inspected station, charging the current station to recover sufficient electric quantity, and turning to the step (3); otherwise, turning to the step (6);
(6) if the station set to be inspected
Figure FDA0003212775900000018
If the current last remaining patrol station of the agent k is not the station of the patrol and maintenance center department, returning the agent k to the nearest patrol and maintenance center; if the number of the agents completing the routing inspection task is less than the total number of the agents, namely l is less than m, turning to the step (3); otherwise, turning to the step (7);
(7) after all the agents complete the set inspection task, updating the information elements; the update information elements are specifically as follows:
after all agents complete one iteration of the repeated transfer calculation, the information element strength on each edge is updated by the following formula:
τij=(1-ρ)τij+Δτij;(2)
Figure FDA0003212775900000021
Figure FDA0003212775900000022
where ρ is a volatilization factor in the information element, Δ τijRefers to the amount of change in information elements on edge (i, j); delta tauij kMeaning that the kth agent is on the side (i,j) amount of information elements released; q is the total amount of information elements released by the agent to finish one transfer; l iskThe distance of the path traversed by the agent;
(8) collecting C by the inspected substation siteskObtaining a set of paths L ═ { L ═ L of m agents1,L2,…,LmCalculating and recording an optimal path set obtained by the iteration according to the steps (3) to (6), and updating a global optimal solution;
(9) iterative computation, if the same optimal solution continuously appears m times, turning to the step 10, otherwise, turning to the step 11;
(10) changing the content of the information elements of the transfer path scheme, and outputting the schemes to m intelligent agents respectively;
(11) if the number of iterations reaches NmaxBut the optimal solution does not continuously appear m times, the iterative calculation is stopped, and manual configuration suggestions are sent to an administrator.
2. The provincial power grid-oriented substation inspection robot resource allocation method according to claim 1, wherein the provincial power grid-oriented substation inspection robot resource allocation method comprises the following steps: the step (2) further comprises the step of setting the maximum value A of the number of the maintenance centersmaxSetting a minimum value m of the total number of agentsminWherein, each patrol and maintain center is configured with 1-3 agents, namely mmin≥Amax
CN201811140884.5A 2018-09-28 2018-09-28 Substation inspection robot resource allocation method for provincial power grid Active CN109242337B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811140884.5A CN109242337B (en) 2018-09-28 2018-09-28 Substation inspection robot resource allocation method for provincial power grid

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811140884.5A CN109242337B (en) 2018-09-28 2018-09-28 Substation inspection robot resource allocation method for provincial power grid

Publications (2)

Publication Number Publication Date
CN109242337A CN109242337A (en) 2019-01-18
CN109242337B true CN109242337B (en) 2021-12-07

Family

ID=65056339

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811140884.5A Active CN109242337B (en) 2018-09-28 2018-09-28 Substation inspection robot resource allocation method for provincial power grid

Country Status (1)

Country Link
CN (1) CN109242337B (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112002123B (en) * 2020-07-14 2022-06-03 国网山东省电力公司乳山市供电公司 Power line inspection vehicle scheduling method
CN112418532B (en) * 2020-11-25 2024-06-28 杭州凯达电力建设有限公司 Method, device, equipment and storage medium for planning inspection path of power transmission line
CN113997819B (en) * 2021-10-21 2024-04-05 深圳市保国特卫安保技术服务有限公司 Battery management method, controller and system

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103473600A (en) * 2013-03-28 2013-12-25 国家电网公司 Intelligent robot system for power transformation operation and maintenance integrated simulation
CN103701117A (en) * 2013-12-19 2014-04-02 浙江大学 Active distribution network dynamic topology reconstitution method based on mixed artificial intelligence
CN104020768A (en) * 2014-06-13 2014-09-03 广西电网公司崇左供电局 Infrared temperature measurement track inspection robot
CN108045531A (en) * 2017-12-04 2018-05-18 国网山东省电力公司电力科学研究院 For the underwater robot control system and method for submarine cable inspection

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7277876B2 (en) * 2004-01-23 2007-10-02 Solomon Research Llc Dynamic adaptive distributed computer system
WO2014121194A1 (en) * 2013-02-01 2014-08-07 Introspective Power, Inc. Generic distributed processing for multi-agent systems

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103473600A (en) * 2013-03-28 2013-12-25 国家电网公司 Intelligent robot system for power transformation operation and maintenance integrated simulation
CN103701117A (en) * 2013-12-19 2014-04-02 浙江大学 Active distribution network dynamic topology reconstitution method based on mixed artificial intelligence
CN104020768A (en) * 2014-06-13 2014-09-03 广西电网公司崇左供电局 Infrared temperature measurement track inspection robot
CN108045531A (en) * 2017-12-04 2018-05-18 国网山东省电力公司电力科学研究院 For the underwater robot control system and method for submarine cable inspection

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Decision-Making Under Uncertainty in Multi-Agent and Multi-Robot Systems:Planning and Learning;Christopher Amato;《Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI-18)》;20180713;第5662-5666页 *
基于多智能体系统的微电网分散协调控制策略;窦春霞等;《电工技术学报》;20150405;第30卷(第7期);第125-134页 *
基于资源动态调配的智能巡检平台设计与实现;高明;《中国优秀硕士学位论文全文数据库 信息科技辑》;20180415(第4期);I138-1324 *

Also Published As

Publication number Publication date
CN109242337A (en) 2019-01-18

Similar Documents

Publication Publication Date Title
CN109242337B (en) Substation inspection robot resource allocation method for provincial power grid
CN103491190B (en) A kind of charger monitor data processing method towards extensive Real-time and Concurrent
CN109103878B (en) Electric automobile group ordered charging method and power utilization optimization method for power distribution network
Pal et al. Planning of EV charging station with distribution network expansion considering traffic congestion and uncertainties
CN108183869B (en) Electric quantity data acquisition system based on distributed message queue
CN103840549B (en) Charging electric vehicle load space dispatching patcher and method
WO2017066790A1 (en) Adaptive charging algorithms for a network of electric vehicles
CN109636008B (en) Electric bus rapid charging station service fee pricing acquisition method
CN109117486A (en) A kind of electric automobile charging station optimum programming method
CN109242338B (en) Transformer substation inspection robot cross-region allocation algorithm under centralized control
CN105139096A (en) Two-stage optimization-based locating and sizing method for electric vehicle charging station
CN112966882A (en) Power distribution network scheduling method based on space-time global matching
CN107423890B (en) Rapid distributed processing method for power grid regulation and control system and power distribution automation system
CN105303452A (en) Power-grid regulation and control real-time data distributed processing method and system
CN113799640B (en) Energy management method suitable for micro-grid containing electric vehicle charging piles
Nguyen et al. Smart charging and discharging of electric vehicles to support grid with high penetration of renewable energy
CN104899689A (en) Distribution network fault recovery method based on DBCC optimization algorithm and entropy weight theory
Wu et al. On optimal charging scheduling for electric vehicles with wind power generation
CN105139094A (en) Power grid icing quantified and long-term forecasting method based on discrete particle swarm algorithm and least square method
CN117369522A (en) Unmanned aerial vehicle nest remote control method and system
CN108694512A (en) A kind of power grid analysis of prices data in-depth processing system and method
CN102510073B (en) Data exchanging system of large power consumption interaction system/ distribution automation master station system
CN109190778B (en) Transformer substation inspection robot centralized transferring method for inspection center
CN205231848U (en) Distribution network automated management system
CN114285033A (en) Building energy optimization scheduling method considering uncertainty of charging load of electric vehicle

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant