Minimum driving node identification method based on complex network based on complex network strict target controllability

A technology for driving nodes and complex networks, applied in complex mathematical operations, control/regulation systems, program control, etc., to achieve the effect of expanding the scope of application

Inactive Publication Date: 2020-07-10
东北大学秦皇岛分校
View PDF0 Cites 2 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Although these methods can solve most target control tasks, it should be noted that the k-walk method is only suitable for single-input directed tree-structured networks
Since these methods are essentially based on structural controllability theory, they have limitations for undirected networks

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Minimum driving node identification method based on complex network based on complex network strict target controllability
  • Minimum driving node identification method based on complex network based on complex network strict target controllability
  • Minimum driving node identification method based on complex network based on complex network strict target controllability

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0031] The present invention will be further described below in conjunction with the accompanying drawings and specific embodiments.

[0032] A least-driven node identification method based on strict target controllability of complex networks. First, we abstract the complex network into a graph topology G(V,E) composed of nodes and edges, where V is the set of nodes, E is the set of edges, and the edge Indicates the coupling relationship between nodes. Nodes that are directly controlled are called driver nodes. We call the matrix representing the coupling relationship of nodes in the network an adjacency matrix.

[0033] PBH rank criterion: the necessary and sufficient condition for the complete controllability of the linear time-invariant system described in formula (1) is

[0034] rank(sI-A,B)=N, or rank(λ i I-A,B)=N, i=1,2,...,N;

[0035] in, is the field of complex numbers, λ i (i=1,2,...,N) is the characteristic value of the system.

[0036] Kalman rank criterio...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention provides a minimum driving node identification method based on complex network strict target controllability, relates to the technical field of complex network controllability, and provides a brand-new method for identifying minimum driving nodes required by complex network strict target control. According to the method, a PBH rank criterion and a Kalman rank criterion in a control theory are utilized; the upper bound and the lower bound of the number of the driving nodes are respectively estimated when the strict target of the complex network is controllable; a method for identifying the position of the driving node in the first method is provided; on the basis, a method for quickly identifying the number and positions of upper bound driving nodes is provided. According to the invention, the method has the advantages of simple operation and wide application range, can be applied to the fields of regulation and control of a biological network, flow control of a traffic network, information propagation of a social network, safety protection of an intelligent power grid, optimal scheduling of the Internet of Vehicles and the like, can further promote the development ofthe fields of machine learning and artificial intelligence, and has important economic and social values.

Description

technical field [0001] The invention relates to the technical field of controllability of complex networks, in particular to a method for identifying least-driven nodes based on strict target controllability of complex networks. Background technique [0002] For a dynamical system, if there is an admissible control input that can make the state of the system reach any desired state from any initial state within a finite time, then the system is said to be controllable. In the past decade, the controllability of complex networks has received extensive attention and has become a hot issue in network science research. For complex engineering systems such as the autopilot system of aircraft and the trajectory control of satellites, it is very important to be fully controllable. But many biological, technological, and social systems are enormous in size and complexity, and controlling entire networks is neither feasible nor necessary. On the contrary, it is more realistic and n...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F16/901G06F17/16G06Q10/04G06Q10/06G05B19/418
CPCG05B19/41865G06F17/16G06Q10/047G06Q10/0633G06F16/9024Y02P90/02Y02D10/00
Inventor 项林英朱佳伟陈飞黄伯敏武艳芝
Owner 东北大学秦皇岛分校
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products