检索结果-南通市图书馆

Journal of Modern Power Systems and Clean Energy 2017年第1期5卷 142-149页

作者： Haifeng HONG Zhesheng HU Ruipeng GUO Jun MA Jiong TIAN College of Electrical Engineering Zhejiang UniversityHangzhou 310027China Ningxia Electric Power Company State Grid Corporation of ChinaYinchuan 750001China

We present a directed graph-based method for distribution network reconfiguration considering distributed generation. Two reconfiguration situations are considered: operation mode adjustment with the objective of minimizing active power loss(situation Ⅰ) and service restoration with the objective of maximizing loads restored(situation Ⅱ). These two situations are modeled as a mixed integer quadratic programming problem and a mixed integer linear programming problem, respectively. The properties of the distribution network with distributed generation considered are reflected as the structure model and the constraints described by directed graph. More specifically, the concepts of "in-degree" and "out-degree"are presented to ensure the radial structure of the distribution network, and the concepts of "virtual node" and"virtual demand" are developed to ensure the connectivity of charged nodes in every independent power supply *** validity and effectiveness of the proposed method are verified by test results of an IEEE 33-bus system and a 5-feeder system.

关键词： Distribution network Distributed generation Network reconfiguration directed graph Operation mode adjustment Service restoration

A Fuzzy Fault Diagnosis Method for Large Radar Based on directed graph Model

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of Shanghai Jiaotong university(Science) 2015年第3期20卷 363-369页

作者：白璐杜承烈郭阳明 School of Computer Science Northwestern Polytechnical University

To meet the requirement of the real-time, accuracy and multi-target diagnosis of the large radar system,a new fuzzy fault diagnosis method based on directed graph model is proposed in this paper. In this method, the large complex system model is defined using the directed graph model firstly, in which the nodes observing the fault by the hierarchical reconstruction of the directed graph are located, then the fault dependency matrix between these nodes and the fault sources are established. And then, we utilize the sensors' alarm probabilities under different situations to build the characteristic fault observation matrix in the fault observation space. Finally,the optimized corresponding diagnosis method using a fuzzy function, which describes the similarity between the actual observation vector and the fault's characteristic vector, is designed. The experimental results demonstrate that the proposed method can achieve high diagnosis efficiency and accuracy. It can be widely used in the real radar system.

关键词： fault diagnosis directed graph radar fuzzy function

Observer-based event-triggered control for linear MASs under a directed graph and DoS attacks

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of Control and Decision 2022年第3期9卷 384-396页

作者： Shuo-Qiu Zhang Wei-Wei Che Chao Deng College of the Institute of Complexity Science Shandong Key Laboratory of Industrial Control TechnologyQingdao UniversityQingdaoPeople’s Republic of China Institute of Advanced Technology Nanjing University of Posts and TelecommunicationsNanjingPeople’s Republic of China

In this paper,we investigate the observer-based event-triggered consensus problem for linear multi-agent systems(MASs)under a directed graph and denial-of-service(DoS)attacks.A type of DoS attacks launched by malicious attackers at irregular intervals is considered,which can cause communication channel disruption.A novel event-triggered secure control scheme based on a closed-loop observer is proposed to determine the scheduling of the controller update,and a separation method with less conservativeness is employed to design the controller and observer ***,the frequency and duration of DoS attacks that can be tolerated are analysed for the observer-based secure consensus *** addition,a strictly positive minimal event-triggered time interval for each agent is designed with the help of the proposed eventtriggered condition to eliminate the Zeno ***,a numerical simulation is given to verify the theoretical analysis.

关键词： directed graph DoS attacks event-triggered mechanism consensus control multi-agent systems

Distributed Algorithms for Solving a Linear Equation Under a directed graph

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Distributed Algorithms for Solving a Linear Equation Under a...

第37届中国控制会议

作者： Yu Tang Jie Mei School of Mechanical Engineering and Automation Harbin Institute of Technology

In this paper, we explore to solve the linear equation problem Aθ = b under a directed graph. A "consensus+innovation" type distributed algorithm is proposed. In order to promote the convergence speed, we make the weight of consensus and innovation be different. By using the proposed algorithm, we can solve any linear equation with at least one solution at a geometric rate from arbitrary initializations. We also propose a new "consensus+residual" algorithm which replace the innovation by the residual and can speed up the iterations.

关键词： Multi-agent system "consensus+innovation" "consensus+residual" linear equation directed graph

A Method to Solve Shortest Path Finding in directed graph Based on An Amoeboid Organism

在线全文

cnki会议

学校读者我要写书评

暂无评论

A Method to Solve Shortest Path Finding in Directed Graph Ba...

第24届中国控制与决策会议

作者： Xiaoge Zhang, Yajuan Zhang, Zili Zhang and Yong Deng the School of Computer and Information Sciences, Southwest University,Chongqing, 400715, China

The slime mold Physarum polycephalum has been used to find the shortest path between the source and target point in a given labyrinth. However, the classical algorithm can’t deal with the shortest path problem in directed graphs. In this paper, a modified model is proposed to solve the shortest path problem in directed graphs using the true slime mold Physarum polycephalum. Some numerical examples are illustrated the efficiency of the proposed method.

关键词： Physarum polycephalum directed graph Shortest path finding

Finite-Time Output Consensus for Nonlinear Multi-Agent Systems under directed graph

在线全文

cnki会议

学校读者我要写书评

暂无评论

Finite-Time Output Consensus for Nonlinear Multi-Agent Syste...

第40届中国控制会议

作者： Qiang Zeng Haibo Ji Department of Automation University of Science and Technology of China

The finite-time output consensus problem for a class of nonlinear multi-agent systems is investigated over a directed graph. Firstly, a distributed differentiator is proposed such that the leader’s output trajectory and its first-order derivative can be derived by each follower agent. Then, to track the trajectory provided by the distributed differentiator, a continuous finitetime controller is developed based on command-filtered backstepping control. It can be demonstrated that the problem is solved under the distributed controller composed of distributed differentiator and finite-time controller. Finally, the effectiveness of the designed distributed controller is verified by an illustrated example.

关键词： Finite-time output consensus directed graph distributed differentiator command-filtered backstepping

Adaptive Consensus for Second-order Uncertain Multi-agent Systems under a directed graph

在线全文

cnki会议

学校读者我要写书评

暂无评论

Adaptive Consensus for Second-order Uncertain Multi-agent Sy...

第30届中国控制与决策会议

作者： Chunjing Jiang Jie Mei School of Mechanical Engineering and Automation Harbin Institute of Technology

In this paper,we study the consensus problem for second-order multi-agent systems under a directed graph where there exist parametric uncertainties in the agent dynamics.A distributed control algorithm relying on the relative position and velocity measurements is proposed for each *** agents achieve consensus with a common final constant velocity under the condition that the associated graph contains a directed spanning tree and the control gain is above some certain lower bounded,which are the same as the case of double *** consensus convergence is analyzed via Lyapunov stability theory and input-to-state *** results are provided to illustrate the effectiveness of the proposed algorithm.

关键词： Multi-agent Systems directed graph Adaptive Consensus

Zero-Dynamics Attacks for Multi-Agent Systems Without Velocity Measurements

在线全文

cnki会议

学校读者我要写书评

暂无评论

Journal of Systems Science & Complexity 2024年第5期37卷 1809-1831页

作者： GAO Jinming WANG Yijing ZUO Zhiqiang ZHANG Wentao Tianjin Key Laboratory of Intelligent Unmanned Swarm Technology and System School of Electrical and Information Engineering Tianjin University Continental-NTU Corporate Lab School of Electrical and Electronic Engineering Nanyang Technological University

This paper studies the periodic zero-dynamics attacks(ZDAs) in multi-agent systems without velocity measurements under directed graph. Specifically, two types of attack modes are addressed,i.e., infinite number and finite number of zero-dynamics attacks. For the former case, the authors show that the consensus of the considered system cannot be guaranteed. For the latter case, the dynamic evolution of the agents is investigated and it is found that only attacking the rooted agents can destroy the consensus. Then, a sufficient condition which quantifies whether or not the consensus value is destroyed is given, revealing the relationship among parameters of system model, filter and attack ***, simulations are carried out to verify the effectiveness of the theoretical findings.

关键词： Consensus directed graph multi-agent systems zero-dynamics attacks

Energy Economic Dispatch for Photovoltaic-Storage via Distributed Event-Triggered Surplus Algorithm

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Energy Engineering 2024年第9期121卷 2621-2637页

作者： Kaicheng Liu Chen Liang Naiyue Wu Xiaoyang Dong Hui Yu China Electric Power Research Institute Beijing100192China Electric Power Research Institute of State Grid Gansu Electric Power Company Lanzhou730000China State Key Laboratory of Power Grid Safety Beijing100084China

This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy *** method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy roles,and energy supply and demand *** systemmodel is developed by considering energy devices as versatile units capable of fulfilling various functionalities and playing multiple roles *** strike a balance between optimality and feasibility,renewable energy resources are modeled with considerations for forecasting errors,Gaussian distribution,and penalty ***,this study introduces a distributed event-triggered surplus algorithm designed to address the economic dispatch problem by minimizing production *** in surplus theory and finite time projection,the algorithm effectively rectifies network imbalances caused by directed graphs and addresses local inequality *** algorithm greatly reduces the communication burden through event triggering ***,both theoretical proofs and numerical simulations verify the convergence and event-triggered nature of the algorithm.

关键词： Fully distributed algorithm economic dispatch directed graph renewable energy resource

On an Invariant of Tournament Digraphs

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Applied Mathematics and Physics 2024年第7期12卷 2711-2722页

作者： Boris F. Melnikov Bowen Liu Faculty of Computational Mathematics and Cybernetics Shenzhen MSU-BIT University Shenzhen China

To date, it is unknown whether it is possible to construct a complete graph invariant in polynomial time, so fast algorithms for checking non-isomorphism are important, including heuristic algorithms, and for successful implementations of such heuristics, both the tasks of some modification of previously described graph invariants and the description of new invariants remain relevant. Many of the described invariants make it possible to distinguish a larger number of graphs in the real time of a computer program. In this paper, we propose an invariant for a special kind of directed graphs, namely, for tournaments. The last ones, from our point of view, are interesting because when fixing the order of vertices, the number of different tournaments is exactly equal to the number of undirected graphs, also with fixing the order of vertices. In the invariant we are considering, all possible tournaments consisting of a subset of vertices of a given digraph with the same set of arcs are iterated over. For such subset tournaments, the places are calculated in the usual way, which are summed up to obtain the final values of the points of the vertices;these points form the proposed invariant. As we expected, calculations of the new invariant showed that it does not coincide with the most natural invariant for tournaments, in which the number of points is calculated for each participant. So far, we have conducted a small number of computational experiments, and the minimum value of the pair correlation between the sequences representing these two invariants that we found is for dimension 15.

关键词： graph directed graph Tournament ?nvariant