Traffic network redundant link simplification system and method based on voting mechanism

Abstract

The present disclosure provides a system and method for simplifying redundant links in a traffic network based on a voting mechanism, including: a construction module, a first processing module, a second processing module and a third processing module; wherein the construction module is used to construct a distributed discrete-time model switching topology structure to constitute a subsystem; the first processing module obtains a redundant link set according to a second minimum eigenvalue; the second processing module determines the initial voting ability of any node; and obtains the voting ratio of the node and its neighbors; and determines the node with the greatest influence in the subsystem through the voting score of the node; the third processing module determines whether the edge formed by the most influential node and its neighbors is in the redundant link set, and if so, deletes the edge formed by the most influential node and its neighbors in the distributed discrete-time model switching topology structure, and outputs a simplified topology graph.

Description

Technical Field

[0001] The present invention relates to the technical field of traffic control, and in particular to a system and method for simplifying redundant links of a traffic network based on a voting mechanism. Background Art

[0002] A traffic control system is a system used to manage and guide the operation of vehicles (such as aircraft, drones, vehicles, etc.) to ensure the safety, efficiency and orderliness of traffic. It coordinates the paths, speeds and positions of vehicles through real-time monitoring, data processing and decision support to avoid collisions, optimize routes and improve overall traffic efficiency. In the field of air traffic, traffic control systems include automatic landing equipment, collision avoidance systems, etc., which are used to process flight data, provide navigation support and ensure the safe landing or flight of aircraft. In the field of drones, traffic control systems can also be used for tasks such as path planning, inspection and collaborative operations.

[0003] As an innovative distributed control system, the traffic control system has shown significant advantages in many aspects. The system is fully functional and powerful, with excellent real-time and dynamic response. It can collect and analyze data in real time, dynamically adjust timing and route planning, etc., significantly improving efficiency. At the same time, the system has high reliability. Even if some traffic nodes fail, other nodes can continue to work to ensure the overall stable operation of the system; it has high flexibility and can quickly and flexibly adjust strategies according to different working conditions; it also has strong robustness. In the face of external interference and uncertain factors, it can still maintain stable performance and ensure the continuous normal operation of the system.

[0004] In existing transportation systems, the existence of redundant links poses a significant obstacle to system efficiency. Redundant links require nodes to process communication information from non-essential neighbors, thereby increasing the communication cost of the system. In addition, in the process of simplifying the topology, the system may have new redundant links for a variable topology.

[0005] Therefore, a transportation network link simplification method that combines redundant link deletion and voting mechanism is particularly needed. Summary of the invention

[0006] The purpose of the present disclosure is to provide a system and method for simplifying redundant links in a traffic network based on a voting mechanism, so as to at least solve one technical problem in the prior art.

[0007] The technical solution disclosed in the present invention is:

[0008] A traffic network redundant link simplification system based on voting mechanism, comprising:

[0009] A building module is used to construct a distributed discrete-time model switching topology, which considers the traffic units to be processed as nodes and enables any node to scan all neighbors within a two-hop range and form a subsystem;

[0010] A first processing module, which performs data interaction with the construction module, is used to obtain the second smallest eigenvalue of the subsystem, that is, the algebraic connectivity, by using the node, and obtain a redundant link set according to the second smallest eigenvalue;

[0011] A second processing module, which interacts with the first processing module for data, is used to determine the initial voting capacity of any node according to the degree of the node and the degree of the node's neighbors; obtain the voting ratio of the node and its neighbors; and determine the node with the greatest influence in the subsystem according to the voting score of the node;

[0012] The third processing module interacts with the second processing module for data, and is used to determine whether the edge formed by the most influential node and its neighbors is in the redundant link set. If so, the edge formed by the most influential node and its neighbors is deleted in the distributed discrete-time model switching topology structure, and a simplified topology graph is output.

[0013] The node obtains the second smallest eigenvalue of the subsystem, and obtains a redundant link set according to the second smallest eigenvalue, including:

[0014] Set the second smallest eigenvalue of node i in the subsystem C to , and obtain the edge between node i and its neighbor j in the subsystem C ;

[0015] In the subsystem C, obtain the edge between node i and its neighbor j The second smallest eigenvalue after ;

[0016] If satisfied , then the edge Add to the redundant link set until the continued expansion of elements in the redundant link set will reduce the second smallest eigenvalue of the subsystem , the final redundant link set is obtained.

[0017] The determining the initial voting capability of any node according to the degree of the node and the degree of the node's neighbor includes:

[0018] Initialize the voting ability of node v, as follows:

[0019] ;

[0020] In the formula, is the degree of node v; is the maximum h value of all nodes in the network.

[0021] The obtaining of the voting ratio of the node and its neighbors includes:

[0022] Through the nodes within the two-hop range of node i, we can obtain the degree of node i's neighbors, and based on the self-voting and h value, define the voting ratio of node u to neighbor v, which is recorded as , the formula is as follows:

[0023] ;

[0024] Among them, w is the neighbor of node u, is the set of nodes that includes node u and all its one-hop neighbors; is the degree of node v.

[0025] The determining the initial voting capability of any node according to the degree of the node and the degree of the node's neighbor includes:

[0026] Given a node v, its voting score is as follows:

[0027]

[0028] in, is the number of votes v gets from u; is the set of nodes that includes node u and all its one-hop neighbors.

[0029] The multi-node system composed of at least two of the nodes is a state-dependent topological structure, and the position information of the node represents its state information;

[0030] The next position of the node is determined by the positions of its neighbors, and its consistency protocol can be expressed as:

[0031] ;

[0032] in, represents the state of node i at time k; Represents the control variable input of node i at time k.

[0033] The definition of node i and its neighbors is expressed as:

[0034] For nodes i and j, if - , r is the communication radius of the node, that is, when the Euclidean distance between two nodes is less than or equal to r, then node i and node j are neighbors; x i is node i; x j is node j.

[0035] The state information of node i is updated according to the state information of its neighbors. All nodes achieve aggregation based on the state information of their neighbors. The aggregation protocol is:

[0036] ;

[0037] in, is the adjustment factor; is the element in the mth row and sth column of the adjacency matrix, represents the neighbor set of node i at time k.

[0038] The condition for the nodes to reach aggregation is that for node i and node j, if the condition is met , the gathering task is completed.

[0039] A multi-node redundant link simplification method based on a voting mechanism, based on the multi-node redundant link simplification system, comprises:

[0040] Construct a distributed discrete-time model switching topology, treat the traffic units to be processed as nodes, and make any node scan all neighbors within the two-hop range and form a subsystem;

[0041] Using the node to obtain a second minimum eigenvalue of the subsystem, and obtaining a redundant link set according to the second minimum eigenvalue;

[0042] Determining the initial voting capacity of any node according to the degree of the node and the degree of the node's neighbors;

[0043] Obtaining the voting ratio of the node and its neighbors;

[0044] Determine the node with the greatest influence in the subsystem according to the voting scores of the nodes;

[0045] Determine whether the edge formed by the most influential node and its neighbors is in the redundant link set. If so, delete the edge formed by the most influential node and its neighbors in the distributed discrete-time model switching topology structure, and output a simplified topology graph.

[0046] The beneficial effects of the present disclosure include at least:

[0047] The system disclosed in the present invention first constructs a local subsystem in a traffic control system and simplifies the topological structure through the mathematical characteristics of the subsystem; furthermore, it identifies the key nodes in the subsystem through an improved voting mechanism to determine the important components of the system, so that the method described in the present invention can not only delete redundant links, but also significantly speed up the information processing speed of the traffic control system, showing excellent performance in improving the efficiency of the traffic control system and reducing the system operation cost to a certain extent. BRIEF DESCRIPTION OF THE DRAWINGS

[0048] Figure 1 is a system block diagram of the system described in the present disclosure;

[0049] Figure 2 is a flow chart of the method described in the present disclosure. DETAILED DESCRIPTION

[0050] The present disclosure is further described below in conjunction with the accompanying drawings. Specific embodiment 1:

[0052] The present disclosure provides an embodiment:

[0053] like Figure 1 A traffic network redundant link simplification system based on voting mechanism, comprising: a construction module 100, a first processing module 200, a second processing module 300 and a third processing module 400; wherein the construction module 100 is used to construct a distributed discrete time model switching topology structure, regards the traffic unit to be processed as a node, and enables any node to scan all neighbors within a two-hop range and form a subsystem; the first processing module 200 interacts with the construction module 100 for data acquisition of the second smallest eigenvalue of the subsystem using the node, and acquires a redundant link set according to the second smallest eigenvalue; the second processing module 300 interacts with the third processing module 400 for data acquisition of the redundant link set using the node; A processing module 200 performs data interaction, and is used to determine the initial voting ability of any node according to the degree of the node and the degree of the node's neighbors; and obtain the voting ratio of the node and its neighbors; and determine the node with the greatest influence in the subsystem through the voting score of the node; a third processing module 400 performs data interaction with the second processing module 300, and is used to determine whether the edge formed by the most influential node and its neighbors is in the redundant link set. If so, the edge formed by the most influential node and its neighbors is deleted in the distributed discrete time model switching topology structure, and a simplified topology graph is output.

[0054] In this embodiment, the topological structure of the network is time-varying, and the topological structure is represented by an adjacency matrix D. Under the switching topological structure, D is represented by D(k).

[0055] The traffic control system is a state-dependent topological structure. The location information of the node represents its state information. Only the two-dimensional coordinate information of the node is considered. The position of the node at the next moment is determined by the positions of its neighbors. Its state information at the next moment can be expressed as:

[0056] ;

[0057] The definition of the neighbors of a node can be expressed as follows: For any node i and node j, if - , r is the communication radius of the node, then node i and node j are neighbors; according to the information consistency protocol, the state information of node i is to be updated according to the state information of its neighbors, and all nodes achieve the purpose of aggregation based on the state information of their neighbors. The aggregation protocol is:

[0058] ;

[0059] in, is the adjustment factor, which is a number greater than 0 and less than 1. is the element in the i-th row and j-th column of the adjacency matrix. If nodes i and j are neighbors, it is 1, otherwise it is 0. The condition for nodes to be clustered is that for any node i and node j, if the condition is satisfied , then the system is considered to have reached consistency, that is, the aggregation task has been completed.

[0060] The purpose of the present invention is to overcome the problem that the existing redundant link scenario cannot be applied to a traffic control system under a certain scale, such as Figure 1 , provides a traffic network redundant link simplification system based on voting mechanism, simplifies the traffic network and confirms important components, reduces communication costs and improves convergence speed; specifically includes the following steps:

[0061] Step 1: Under the distributed discrete-time model switching topology, at time k, node i scans all neighbors within the two-hop range and forms subsystem C;

[0062] Step 2: Node i calculates the second smallest eigenvalue of C , and then calculate the subsystems in turn to remove the edge between it and its neighbor j The second smallest eigenvalue after , if satisfied , then add the edge to the redundant link set;

[0063] Step 3: Determine whether each edge can be added to the redundant link set in turn until the continued expansion of the set elements will reduce the second smallest eigenvalue of the subsystem ;

[0064] Step 4: Determine the initial number of votes for each node based on the degree of node i and the degrees of its neighbors ;

[0065] Step 5: For node i, determine its voting ratio for neighbor j ;

[0066] Step 6: By integrating the voting scores of each node i To determine the most influential node in the subsystem.

[0067] In the specific work, the subsystem C is selected for the two-hop neighbors in the multi-node system, and the eigenvalue of the matrix is ​​calculated by constructing the adjacency matrix in C. , then try to delete each edge {i,j} in the subsystem, that is, if it satisfies , the edge can be simplified. Next, in order to obtain the most influential node, the following three steps are required. First, the voting power value of each node needs to be initialized. In this method, the voting power of node v is initialized as follows:

[0068] ;

[0069] Where h v is the H-index value of node v, is the maximum H-index value of all nodes in the network. In order to calculate the h-value of node v, this embodiment not only considers the degree of v, but also the degree of its neighbors. In order for the voting mechanism to proceed smoothly, it is necessary to obtain the degree of the node and the degree of the node's neighbors, so the nodes within the two-hop range are taken to obtain the degree of the node's neighbors. Then, based on self-voting and h-index, the voting ratio of node u to neighbor v is defined, denoted as p uv , the formula is as follows:

[0070] ;

[0071] in, is the set of nodes that includes u and all its one-hop neighbors. Here, the h-index value of the node is used to measure the importance of the node. Finally, the voting score is calculated by integrating these votes. The voting score of the node can be calculated. Formally, given a node v, its voting score is calculated as follows:

[0072] ;

[0073] in, is the number of votes v gets from u, which takes into account the number of votes v gets and the number of v’s neighbors.

[0074] Preferably, the specific input and output are as follows:

[0075] Algorithm RVA

[0076] Input: traffic network topology graph G;

[0077] For each node in G, obtain the node and its neighbors to form a subsystem C, according to the second smallest eigenvalue Calculate the set ERS of redundant links of C;

[0078] 2) For each node of C:

[0079] Initialize voting capabilities ;

[0080] Calculate the voting ratio based on the number of neighbors of node i ;

[0081] Calculate voting scores for each section ;

[0082] calculate The node with the largest value, maxnode;

[0083] 3) For links in ERS:

[0084] Determine whether {i,j} is redundant and linked to maxnode. If so, delete the link G =G-{i,j}, otherwise skip it;

[0085] Output: New topology graph G' of the transportation network.

[0086] Compared with the existing research algorithms, the advantages of the present invention are that the redundant link identification, which was originally only applicable to a small number of nodes, is applied to traffic control systems of a certain scale, and the effectiveness of the method is guaranteed by a voting mechanism; moreover, the method steps are concise, the topological structure is simplified, the communication cost of the system is reduced, and the convergence speed is improved. Specific embodiment 2:

[0088] The present disclosure provides an embodiment:

[0089] like Figure 2, a multi-node redundant link simplification method based on a voting mechanism, based on the multi-node redundant link simplification system described in specific embodiment 1, including: constructing a distributed discrete-time model switching topology structure, treating the traffic unit to be processed as a node, and allowing any node to scan all neighbors within a two-hop range to form a subsystem; using the node to obtain the second smallest eigenvalue of the subsystem, and obtaining a redundant link set based on the second smallest eigenvalue; determining the initial voting ability of any node based on the degree of the node and the degree of the node's neighbor; obtaining the voting ratio of the node and its neighbors; determining the most influential node in the subsystem through the voting score of the node; judging whether the edge formed by the most influential node and its neighbors is in the redundant link set, if so, deleting the edge formed by the most influential node and its neighbors in the distributed discrete-time model switching topology structure, outputting a simplified topology graph, and simplifying the topology graph of the drone. Specific embodiment 3:

[0091] The present disclosure also provides an embodiment:

[0092] An electronic device comprises: a storage medium and a processing unit; wherein the storage medium is used to store a computer program, and the processing unit exchanges data with the storage medium, and is used to execute the computer program through the processing unit when generating vehicle trajectory data, and perform the steps of the method for simplifying redundant links in a traffic network based on a voting mechanism as described in specific embodiment 2. Specific embodiment 3:

[0094] A computer-readable storage medium having a computer program stored therein; when the computer program is run, the computer program executes the steps of the method for simplifying redundant links in a transportation network based on a voting mechanism as described in Specific Embodiment 2.

[0095] In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, apparatus, or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, which carries a computer-readable program code. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the above. A computer-readable signal medium may also be any computer-readable medium other than a computer-readable storage medium, which may send, propagate, or transmit a program for use by or in combination with an instruction execution system, apparatus, or device. The program code contained on the computer-readable medium may be transmitted using any suitable medium, including but not limited to: wireless, wire, optical cable, etc., or any suitable combination of the above.

[0096] The above disclosures are only several specific implementation scenarios of the present disclosure, but the present disclosure is not limited thereto, and any changes that can be thought of by a person skilled in the art should fall within the protection scope of the present disclosure. The above disclosure serial numbers are only for description and do not represent the advantages and disadvantages of the implementation scenarios.

Claims

1. A transportation network redundant link simplification system based on voting mechanism, characterized in that: include: A building module is used to construct a distributed discrete-time model switching topology, which considers the traffic units to be processed as nodes and enables any node to scan all neighbors within a two-hop range and form a subsystem; a first processing module, which performs data interaction with the construction module, and is used to obtain a second minimum eigenvalue of the subsystem by using the node, and obtain a redundant link set according to the second minimum eigenvalue; The second processing module performs data interaction with the first processing module, and is used to determine the initial voting ability of any node according to the degree of the node and the degree of the node's neighbors; and obtain the voting ratio of the node and its neighbors; and determine the node with the greatest influence in the subsystem according to the voting score of the node; The third processing module interacts with the second processing module for data, and is used to determine whether the edge formed by the most influential node and its neighbors is in the redundant link set. If so, the edge formed by the most influential node and its neighbors is deleted in the distributed discrete-time model switching topology structure, and a simplified topology graph is output.

2. The system for simplifying redundant links in a transportation network based on a voting mechanism according to claim 1, characterized in that: The node obtains the second smallest eigenvalue of the subsystem, and obtains a redundant link set according to the second smallest eigenvalue, including: Set the second smallest eigenvalue of node i in the subsystem C to λ2(G), and obtain the edge {i, j} between node i and its neighbor j in the subsystem C; In the subsystem C, the second smallest eigenvalue λ2(G-{i, j}) after removing the edge {i, j} between the node i and its neighbor j is obtained; If λ2(G)>λ2(G-{ij}), the edge {i, j} is added to the redundant link set until further expansion of elements in the redundant link set reduces the second smallest eigenvalue λ2(G) of the subsystem, and the final redundant link set is obtained.

3. The traffic network redundant link simplification system based on voting mechanism according to claim 1 is characterized in that: The determining the initial voting ability of any node according to the degree of the node and the degree of the node's neighbor includes: Initialize the voting ability of node v, as follows: In the formula, h v is the H-index value of node v; h max is the maximum H-index value of all nodes in the network.

4. The system for simplifying redundant links in a transportation network based on a voting mechanism according to claim 1, characterized in that: The obtaining of the voting ratio of the node and its neighbors includes: Through the nodes within the two-hop range of node i, to obtain the degree of node i's neighbors, and based on self-voting and h-index h w , define the voting ratio of node u to neighbor v, denoted as p uv , the formula is as follows: Among them, Γ u is the set of nodes that includes node u and all its one-hop neighbors; h v is the H-index value of node v.

5. The voting mechanism-based transportation network redundant link simplification system according to claim 1, characterized in that: The determining the initial voting ability of any node according to the degree of the node and the degree of the node's neighbor includes: Given a node v, its voting score is as follows: Among them, p uv ·va u is the number of votes that node v gets from node u; Γ u is the set of nodes that includes node u and all its one-hop neighbors.

6. The system for simplifying redundant links in a transportation network based on a voting mechanism according to claim 1, characterized in that: The multi-node system composed of at least two of the nodes is a state-dependent topological structure, and the position information of the node represents its state information; The next position of the node is determined by the positions of its neighbors, and its consistency protocol can be expressed as: x i (k+1)=x i (k)+u i (k); Among them, x i (k) represents the state of node i at time k; u i (k) represents the control variable input of node i at time k.

7. The system for simplifying redundant links in a transportation network based on a voting mechanism according to claim 1, characterized in that: The definition of node i and its neighbors is expressed as: For nodes i and j, if ||x i -x j ||≤r, r is the communication radius of the node, then node i and node j are neighbors; where x i is the physical location of node i in the network; x j is the physical location of node j in the network.

8. The system for simplifying redundant links in a transportation network based on a voting mechanism according to claim 6, characterized in that: The state information of node i is updated according to the state information of its neighbors. All nodes achieve aggregation based on the state information of their neighbors. The aggregation protocol is: Among them, α is the adjustment factor; a ms is the element in the mth row and sth column of the adjacency matrix.

9. The system for simplifying redundant links in a transportation network based on a voting mechanism according to claim 8, characterized in that: The condition for the nodes to reach aggregation is that for nodes i and j, if the condition lim is satisfied x→∞ ‖x i -x j ‖=0, the aggregation task is completed.

10. A multi-node redundant link simplification method based on a voting mechanism, based on the multi-node redundant link simplification system according to any one of claims 1 to 9, characterized in that: include: Construct a distributed discrete-time model switching topology, treat the traffic units to be processed as nodes, and make any node scan all neighbors within the two-hop range and form a subsystem; Using the node to obtain a second minimum eigenvalue of the subsystem, and obtaining a redundant link set according to the second minimum eigenvalue; Determining the initial voting capacity of any node according to the degree of the node and the degree of the node's neighbors; Obtaining the voting ratio of the node and its neighbors; Determine the node with the greatest influence in the subsystem according to the voting scores of the nodes; Determine whether the edge formed by the most influential node and its neighbors is in the redundant link set. If so, delete the edge formed by the most influential node and its neighbors in the distributed discrete-time model switching topology structure, and output a simplified topology graph.

Images