期刊文献+
任意字段
题名或关键词
题名
关键词
摘要
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息
共找到124篇文章
< 1 2 … 7 >
每页显示 20 50 100
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
显示方式：
A Survey of Distributed Algorithms for Aggregative Games 认领 引用 被引量：1
1
作者 Huaqing Li Jun Li +2 位作者 Liang Ran Lifeng Zheng Tingwen Huang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第5期859-871,共13页
Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individua... Game theory-based models and design tools have gained substantial prominence for controlling and optimizing behavior within distributed engineering systems due to the inherent distribution of decisions among individuals.In non-cooperative settings,aggregative games serve as a mathematical framework model for the interdependent optimal decision-making problem among a group of non-cooperative players.In such scenarios,each player's decision is influenced by an aggregation of all players'decisions.Nash equilibrium(NE)seeking in aggregative games has emerged as a vibrant topic driven by applications that harness the aggregation property.This paper presents a comprehensive overview of the current research on aggregative games with a focus on communication topology.A systematic classification is conducted on distributed algorithm research based on communication topologies such as undirected networks,directed networks,and time-varying networks.Furthermore,it sorts out the challenges and compares the algorithms'convergence performance.It also delves into real-world applications of distributed optimization techniques grounded in aggregative games.Finally,it proposes several challenges that can guide future research directions. 展开更多
关键词 Aggregative game distributed algorithm Nash equilibrium(NE) networked control
暂未订购 下载PDF
Spatial Grasp Model for Distributed Management and Its Comparison With Traditional Algorithms 认领 引用 被引量：3
2
作者 Peter Simon Sapaty 《International Relations and Diplomacy》 2025年第3期164-179,共16页
The word“spatial”fundamentally relates to human existence,evolution,and activity in terrestrial and even celestial spaces.After reviewing the spatial features of many areas,the paper describes basics of high level m... The word“spatial”fundamentally relates to human existence,evolution,and activity in terrestrial and even celestial spaces.After reviewing the spatial features of many areas,the paper describes basics of high level model and technology called Spatial Grasp for dealing with large distributed systems,which can provide spatial vision,awareness,management,control,and even consciousness.The technology description includes its key Spatial Grasp Language(SGL),self-evolution of recursive SGL scenarios,and implementation of SGL interpreter converting distributed networked systems into powerful spatial engines.Examples of typical spatial scenarios in SGL include finding shortest path tree and shortest path between network nodes,collecting proper information throughout the whole world,elimination of multiple targets by intelligent teams of chasers,and withstanding cyber attacks in distributed networked systems.Also this paper compares Spatial Grasp model with traditional algorithms,confirming universality of the former for any spatial systems,while the latter just tools for concrete applications. 展开更多
关键词 spatial awareness spatial control spatial consciousness Spatial Grasp Technology Spatial Grasp Language spatial scenarios cyber attacks distributed algorithms mobile agents
暂未订购 下载PDF
Continuous-time distributed optimization with strictly pseudo-convex objective functions via unbalanced digraphs 认领 引用
3
作者 Tailong Gong Xiaoxi Yan +1 位作者 Hang Xu Kaihong Lu 《Control Theory and Technology》 EI CSCD 2026年第3期474-484,共11页
In this paper,the problem of distributed optimization subject to a convex set is investigated by employing a continuous-time multi-agent system.In the problem,each agent only has access to its own objective function a... In this paper,the problem of distributed optimization subject to a convex set is investigated by employing a continuous-time multi-agent system.In the problem,each agent only has access to its own objective function and its own state information,and can only communicate with its neighbors through an unbalanced digraph.Different from most existing works on distributed optimization,we focus on the case where the objective functions are strictly pseudo-convex.To handle this challenge,a continuous-time distributed algorithm is proposed based on the projection operator and the gradient rule.In the proposed algorithm,two consensus strategies are employed.One is used to facilitate the consensus of agents,and the other one is used to estimate the left eigenvector associated with zero eigenvalue of the Laplacian matrix of the unbalanced digraph.Under mild assumptions on the objective functions,we prove that the multi-agent system asymptotically achieves consensus and the consensus state is the solution to the optimization problem.Finally,a simulation example is presented to verify the effectiveness of the theoretical results. 展开更多
关键词 Multi-agent systems Strictly pseudo-convex Unbalanced digraph Continuous-time distributed algorithm
Distributed auction-based adaptive task assignment and re-assignment for multi-UAV suppressive jamming 认领 引用
4
作者 Ruiqing Han Tianxian Zhang +1 位作者 Baozhu Hu Caipin Li 《Defence Technology（防务技术）》 SCIE EI CAS CSCD 2026年第5期176-187,共12页
Task assignment is critical for multiple unmanned aerial vehicles(UAVs)to perform suppressive jamming against radar network.However,under abrupt state changes of enemy radars,centralized methods often incur high compu... Task assignment is critical for multiple unmanned aerial vehicles(UAVs)to perform suppressive jamming against radar network.However,under abrupt state changes of enemy radars,centralized methods often incur high computational complexity and exhibit limited robustness,rendering them unsuitable for rapid task re-assignment.To address these challenges,an adaptive multi-UAV task assignment and re-assignment scheme for suppressive jamming against intermittent radar network is proposed.Specifically,the system is comprehensively modeled by integrating a motion model describing high-value target trajectory,a reconnaissance model detecting radar state transitions,and a suppressive jamming model characterizing the matching relationships between UAVs and radars.The problem is formulated as a dynamic integer program with time-varying constraints.To solve this,a distributed auction-based task assignment and re-assignment algorithm is proposed,enabling task assignment and re-assignment triggered by sudden radar activations or deactivations.Simulation results demonstrate that the proposed approach achieves jamming performance comparable to centralized methods,outperforms traditional fixed and random strategies,and enables re-assignment in response to abrupt radar state changes. 展开更多
关键词 UAVs Suppressive jamming Task assignment and re-assignment Distributed auction algorithm
暂未订购 下载PDF
Collision-Free Satellite Constellations:A Comprehensive Review on Autonomous and Collaborative Algorithms 认领 引用
5
作者 Ghulam E Mustafa Abro Altaf Mugheri Zain Anwar Ali 《Revue Internationale de Géomatique》 2025年第1期301-331,共31页
Swarm intelligence,derived from the collective behaviour of biological entities,is a novel methodology for overseeing satellite constellations within decentralized control systems.Conventional centralized control syst... Swarm intelligence,derived from the collective behaviour of biological entities,is a novel methodology for overseeing satellite constellations within decentralized control systems.Conventional centralized control systems in satellite constellations encounter constraints in scalability,resilience,and fault tolerance,particularly in extensive constellations.This research examines the use of swarm-based multi-agent systems and distributed algorithms for efficient communication,collision avoidance,and collaborative task execution in satellite constellations.We provide a comprehensive study of current swarm control algorithms,their relevance to satellite systems,and identify areas requiring further research.Principal subjects encompass decentralized decision-making,self-organization,adaptive communication protocols,and collision-free trajectory planning.The review article examines implementation obstacles,contrasts swarm algorithms with traditional approaches,and delineates potential research avenues to improve the autonomy and efficiency of satellite constellations.The detailed Literature and comparative analysis within this manuscript demonstrate the prospective advantages of swarm intelligence in satellite systems,providing insights for academic researchers and industry personnel alike. 展开更多
关键词 Swarm intelligence satellite constellations decentralized control systems multi-agent systems distributed algorithms
暂未订购 下载PDF
Distributed Robust Predefined-Time Algorithm for Seeking Nash Equilibrium in MASs 认领 引用 被引量：1
6
作者 Jing-Zhe Xu Zhi-Wei Liu +2 位作者 Ming-Feng Ge Yan-Wu Wang Dingxin He 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第5期1053-1055,共3页
Dear Editor,This letter presents a solution to the problem of seeking Nash equilibrium(NE)in a class of non-cooperative games of multi-agent systems(MASs)subject to the input disturbance and the networked communicatio... Dear Editor,This letter presents a solution to the problem of seeking Nash equilibrium(NE)in a class of non-cooperative games of multi-agent systems(MASs)subject to the input disturbance and the networked communication.To this end,a novel distributed robust predefined-time algorithm is proposed,which ensures the precise convergence of agent states to the NE within a settling time that can be directly determined by adjusting one or more parameters.The proposed algorithm employs an integral sliding mode strategy to effectively reject disturbances.Additionally,a consensus-based estimator is designed to overcome the challenge of limited information availability,where each agent can only access information from its directly connected neighbors,which conflicts with the computation of the cost function that requires information from all agents.Finally,a numerical example is provided to demonstrate the algorithm's effectiveness and performance. 展开更多
关键词 seeking nash convergence agent states multi agent systems integral sliding mode strateg non cooperative games Nash equilibrium distributed algorithm robust control
暂未订购 下载PDF
Distributed Event-Triggered Nash Equilibrium Seeking for Aggregative Game With Second-Order Dynamics 认领 引用 被引量：1
7
作者 Yi Huang Jian Sun Qing Fei 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2025年第7期1519-1521,共3页
Dear Editor,This letter studies the distributed Nash equilibrium seeking problem of aggregative game,in which the decision of each player obeys second-order dynamics and is constrained by nonidentical convex sets.To s... Dear Editor,This letter studies the distributed Nash equilibrium seeking problem of aggregative game,in which the decision of each player obeys second-order dynamics and is constrained by nonidentical convex sets.To seek the generalized Nash equilibrium(GNE),a projectionbased distributed algorithm via constant step-sizes is developed with linear convergence.In particular,a variable tracking technique is incorporated to estimate the aggregative function,and an event-triggered mechanism is designed to reduce the communication cost.Finally,a numerical example demonstrates the theoretical results. 展开更多
关键词 generalized nash equilibrium gne estimate aggregative functionand linear convergencein aggregative gamein distributed event triggered control reduce th distributed nash equilibrium seeking projectionbased distributed algorithm
暂未订购 下载PDF
Distributed Algorithms for Event Reporting in Mobile-Sink WSNs for Internet of Things 认领 引用 被引量：6
8
作者 Catalina Aranzazu-Suescun Mihaela Cardei 《Tsinghua Science and Technology》 SCIE EI CAS CSCD 2017年第4期413-426,共14页
Wireless Sensor Networks（WSNs） have many applications, such as climate monitoring systems, fire detection, smart homes, and smart cities. It is expected that WSNs will be integrated into the Internet of Things（IoT... Wireless Sensor Networks（WSNs） have many applications, such as climate monitoring systems, fire detection, smart homes, and smart cities. It is expected that WSNs will be integrated into the Internet of Things（IoT）and participate in various tasks. WSNs play an important role monitoring and reporting environment information and collecting surrounding context. In this paper we consider a WSN deployed for an application such as environment monitoring, and a mobile sink which acts as the gateway between the Internet and the WSN. Data gathering is a challenging problem in WSNs and in the IoT because the information has to be available quickly and effectively without delays and redundancies. In this paper we propose several distributed algorithms for composite event detection and reporting to a mobile sink. Once data is collected by the sink, it can be shared using the IoT infrastructure. We analyze the performance of our algorithms using WSNet simulator, which is specially designed for event-based WSNs. We measure various metrics such as average residual energy, percentage of composite events processed successfully at the sink, and the average number of hops to reach the sink. 展开更多
关键词 composite events distributed algorithm energy efficiency event-based clustering Internet of Things mobile sink wireless sensor networks
暂未订购 下载PDF
Design and Application of a New Distributed Dynamic Spatio-Temporal Privacy Preserving Mechanisms 认领 引用
9
作者 Jiacheng Xiong Xingshu Chen +1 位作者 Xiao Lan Liangguo Chen 《Computers, Materials & Continua》 SCIE EI 2025年第8期2273-2303,共31页
In the era of big data,the growing number of real-time data streams often contains a lot of sensitive privacy information.Releasing or sharing this data directly without processing will lead to serious privacy informa... In the era of big data,the growing number of real-time data streams often contains a lot of sensitive privacy information.Releasing or sharing this data directly without processing will lead to serious privacy information leakage.This poses a great challenge to conventional privacy protection mechanisms(CPPM).The existing data partitioning methods ignore the number of data replications and information exchanges,resulting in complex distance calculations and inefficient indexing for high-dimensional data.Therefore,CPPM often fails to meet the stringent requirements of efficiency and reliability,especially in dynamic spatiotemporal environments.Addressing this concern,we proposed the Principal Component Enhanced Vantage-point tree(PEV-Tree),which is an enhanced data structure based on the idea of dimension reduction,and constructed a Distributed Spatio-Temporal Privacy Preservation Mechanism(DST-PPM)on it.In this work,principal component analysis and the vantage tree are used to establish the PEV-Tree.In addition,we designed three distributed anonymization algorithms for data streams.These algorithms are named CK-AA,CL-DA,and CT-CA,fulfill the anonymization rules of K-Anonymity,L-Diversity,and T-Closeness,respectively,which have different computational complexities and reliabilities.The higher the complexity,the lower the risk of privacy leakage.DST-PPM can reduce the dimension of high-dimensional information while preserving data characteristics and dividing the data space into vantage points based on distance.It effectively enhances the data processing workflow and increases algorithmefficiency.To verify the validity of the method in this paper,we conducted empirical tests of CK-AA,CL-DA,and CT-CA on conventional datasets and the PEV-Tree,respectively.Based on the big data background of the Internet of Vehicles,we conducted experiments using artificial simulated on-board network data.The results demonstrated that the operational efficiency of the CK-AA,CL-DA,and CT-CA is enhanced by 15.12%,24.55%,and 52.74%,respectively,when deployed on the PEV-Tree.Simultaneously,during homogeneity attacks,the probabilities of information leakage were reduced by 2.31%,1.76%,and 0.19%,respectively.Furthermore,these algorithms showcased superior utility(scalability)when executed across PEV-Trees of varying scales in comparison to their performance on conventional data structures.It indicates that DST-PPM offers marked advantages over CPPM in terms of efficiency,reliability,and scalability. 展开更多
关键词 Privacy preserving distributed anonymization algorithm VP-Tree data stream internet of vehicles
暂未订购 下载PDF
Stability analysis of distributed Kalman filtering algorithm for stochastic regression model 认领 引用
10
作者 Siyu Xie Die Gan Zhixin Liu 《Control Theory and Technology》 EI CSCD 2025年第2期161-175,共15页
The work proposes a distributed Kalman filtering(KF)algorithm to track a time-varying unknown signal process for a stochastic regression model over network systems in a cooperative way.We provide the stability analysi... The work proposes a distributed Kalman filtering(KF)algorithm to track a time-varying unknown signal process for a stochastic regression model over network systems in a cooperative way.We provide the stability analysis of the proposed distributed KF algorithm without independent and stationary signal assumptions,which implies that the theoretical results are able to be applied to stochastic feedback systems.Note that the main difficulty of stability analysis lies in analyzing the properties of the product of non-independent and non-stationary random matrices involved in the error equation.We employ analysis techniques such as stochastic Lyapunov function,stability theory of stochastic systems,and algebraic graph theory to deal with the above issue.The stochastic spatio-temporal cooperative information condition shows the cooperative property of multiple sensors that even though any local sensor cannot track the time-varying unknown signal,the distributed KF algorithm can be utilized to finish the filtering task in a cooperative way.At last,we illustrate the property of the proposed distributed KF algorithm by a simulation example. 展开更多
关键词 Distributed Kalman filtering algorithm Stochastic cooperative information condition Sensor networks (Lp)-exponential stability Stochastic regression model
Obstacle avoidance for multi-missile network via distributed coordination algorithm 认领 引用 被引量：17
11
作者 Zhao Jiang Zhou Rui 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2016年第2期441-447,共7页
A distributed coordination algorithm is proposed to enhance the engagement of the multi-missile network in consideration of obstacle avoidance. To achieve a cooperative interception, the guidance law is developed in a... A distributed coordination algorithm is proposed to enhance the engagement of the multi-missile network in consideration of obstacle avoidance. To achieve a cooperative interception, the guidance law is developed in a simple form that consists of three individual components for tar- get capture, time coordination and obstacle avoidance. The distributed coordination algorithm enables a group of interceptor missiles to reach the target simultaneously, even if some member in the multi-missile network can only collect the information from nearest neighbors. The simula- tion results show that the guidance strategy provides a feasible tool to implement obstacle avoid- ance for the multi-missile network with satisfactory accuracy of target capture. The effects of the gain parameters are also discussed to evaluate the proposed approach. 展开更多
关键词 Cooperative guidance Distributed algorithms Impact time Missile guidance Multiple missiles Obstacle avoidance Proportional navigation
暂未订购 下载PDF
Distributed three-dimensional cooperative guidance via receding horizon control 认领 引用 被引量：15
12
作者 Zhao Jiang Zhou Rui 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2016年第4期972-983,共12页
The paper presents a new three-dimensional (3D) cooperative guidance approach by the receding horizon control (RHC) technique. The objective is to coordinate the impact time of a group of interceptor missiles against ... The paper presents a new three-dimensional (3D) cooperative guidance approach by the receding horizon control (RHC) technique. The objective is to coordinate the impact time of a group of interceptor missiles against the stationary target. The framework of a distributed RHC scheme is developed, in which each interceptor missile is assigned its own finite-horizon optimal control problem (FHOCP) and only shares the information with its neighbors. The solution of the local FHOCP is obtained by the constrained particle swarm optimization (PSO) method that is integrated into the distributed RHC framework with enhanced equality and inequality constraints. The numerical simulations show that the proposed guidance approach is feasible to implement the cooperative engagement with satisfied accuracy of target capture. Finally, the computation efficiency of the distributed RHC scheme is discussed in consideration of the PSO parameters, control update period and prediction horizon. (C) 2016 Chinese Society of Aeronautics and Astronautics. Production and hosting by Elsevier Ltd. This is an open access article under the CC BY-NC-ND license. 展开更多
关键词 Distributed algorithms Impact time Missile guidance Multiple missiles Particle swarm optimization (PSO) Receding horizon control (RHC) Three-dimensional (3D)
暂未订购 下载PDF
Distributed best response dynamics for Nash equilibrium seeking in potential games 认领 引用 被引量：2
13
作者 Shijie HUANG Peng YI 《Control Theory and Technology》 EI CSCD 2020年第3期324-332,共9页
In this paper,we consider distributed Nash equilibrium(NE)seeking in potential games over a multi-agent network,where each agent can not observe the actions of all its rivals.Based on the best response dynamics,we des... In this paper,we consider distributed Nash equilibrium(NE)seeking in potential games over a multi-agent network,where each agent can not observe the actions of all its rivals.Based on the best response dynamics,we design a distributed NE seeking algorithm by incorporating the non-smooth finite-time average tracking dynamics,where each agent only needs to know its own action and exchange information with its neighbours through a communication graph.We give a sufficient condition for the Lipschitz continuity of the best response mapping for potential games,and then prove the convergence of the proposed algorithm based on the Lyapunov theory.Numerical simulations are given to verify the resultandillustrate the effectiveness of the algorithm. 展开更多
关键词 Distributed algorithms Nash equilibrium seeking best response dynamics non-smooth finite-time tracking dynamics potential games
Distributed Optimal Variational GNE Seeking in Merely Monotone Games 认领 引用 被引量：1
14
作者 Wangli He Yanzhen Wang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第7期1621-1630,共10页
In this paper, the optimal variational generalized Nash equilibrium(v-GNE) seeking problem in merely monotone games with linearly coupled cost functions is investigated, in which the feasible strategy domain of each a... In this paper, the optimal variational generalized Nash equilibrium(v-GNE) seeking problem in merely monotone games with linearly coupled cost functions is investigated, in which the feasible strategy domain of each agent is coupled through an affine constraint. A distributed algorithm based on the hybrid steepest descent method is first proposed to seek the optimal v-GNE. Then, an accelerated algorithm with relaxation is proposed and analyzed, which has the potential to further improve the convergence speed to the optimal v-GNE. Some sufficient conditions in both algorithms are obtained to ensure the global convergence towards the optimal v-GNE. To illustrate the performance of the algorithms, numerical simulation is conducted based on a networked Nash-Cournot game with bounded market capacities. 展开更多
关键词 Distributed algorithms equilibria selection generalized Nash equilibrium(GNE) merely monotone games
暂未订购 下载PDF
Distributed dynamic task allocation for unmanned aerial vehicle swarm systems:A networked evolutionary game-theoretic approach 认领 引用 被引量：13
15
作者 Zhe ZHANG Ju JIANG +1 位作者 Haiyan XU Wen-An ZHANG 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2024年第6期182-204,共23页
Task allocation is a key aspect of Unmanned Aerial Vehicle(UAV)swarm collaborative operations.With an continuous increase of UAVs’scale and the complexity and uncertainty of tasks,existing methods have poor performan... Task allocation is a key aspect of Unmanned Aerial Vehicle(UAV)swarm collaborative operations.With an continuous increase of UAVs’scale and the complexity and uncertainty of tasks,existing methods have poor performance in computing efficiency,robustness,and realtime allocation,and there is a lack of theoretical analysis on the convergence and optimality of the solution.This paper presents a novel intelligent framework for distributed decision-making based on the evolutionary game theory to address task allocation for a UAV swarm system in uncertain scenarios.A task allocation model is designed with the local utility of an individual and the global utility of the system.Then,the paper analytically derives a potential function in the networked evolutionary potential game and proves that the optimal solution of the task allocation problem is a pure strategy Nash equilibrium of a finite strategy game.Additionally,a PayOff-based Time-Variant Log-linear Learning Algorithm(POTVLLA)is proposed,which includes a novel learning strategy based on payoffs for an individual and a time-dependent Boltzmann parameter.The former aims to reduce the system’s computational burden and enhance the individual’s effectiveness,while the latter can ensure that the POTVLLA converges to the optimal Nash equilibrium with a probability of one.Numerical simulation results show that the approach is optimal,robust,scalable,and fast adaptable to environmental changes,even in some realistic situations where some UAVs or tasks are likely to be lost and increased,further validating the effectiveness and superiority of the proposed framework and algorithm. 展开更多
关键词 Task allocation Unmanned Aerial Vehicles(UAV) Game theory Log-linear learning Distributed optimization algorithm
暂未订购 下载PDF
Distributed collaborative complete coverage path planning based on hybrid strategy 认领 引用 被引量：5
16
作者 ZHANG Jia DU Xin +1 位作者 DONG Qichen XIN Bin 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第2期463-472,共10页
Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm ... Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably. 展开更多
关键词 multi-agent cooperation unmanned aerial vehicles(UAV) distributed algorithm complete coverage path planning(CCPP)
暂未订购 下载PDF
Distributed localization for anchor-free sensor networks 认领 引用 被引量：8
17
作者 Cui Xunxue Shan Zhiguan Liu Jianjun 《Journal of Systems Engineering and Electronics》 SCIE EI 2008年第3期405-418,共14页
Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their c... Geographic location of nodes is very useful in a sensor network. Previous localization algorithms assume that there exist some anchor nodes in this kind of network, and then other nodes are estimated to create their coordinates. Once there are not anchors to be deployed, those localization algorithms will be invalidated. Many papers in this field focus on anchor-based solutions. The use of anchors introduces many limitations, since anchors require external equipments such as global position system, cause additional power consumption. A novel positioning algorithm is proposed to use a virtual coordinate system based on a new concept--virtual anchor. It is executed in a distributed fashion according to the connectivity of a node and the measured distances to its neighbors. Both the adjacent member information and the ranging distance result are combined to generate the estimated position of a network, one of which is independently adopted for localization previously. At the position refinement stage the intermediate estimation of a node begins to be evaluated on its reliability for position mutation; thus the positioning optimization process of the whole network is avoided falling into a local optimal solution. Simulation results prove that the algorithm can resolve the distributed localization problem for anchor-free sensor networks, and is superior to previous methods in terms of its positioning capability under a variety of circumstances. 展开更多
关键词 anchor-free localization distributed algorithm position estimation sensor networks.
暂未订购 下载PDF
Distributed multi-agent temporal-difference learning with full neighbor information 认领 引用 被引量：2
18
作者 Zhinan Peng Jiangping Hu +1 位作者 Rui Luo Bijoy K.Ghosh 《Control Theory and Technology》 EI CSCD 2020年第4期379-389,共11页
This paper presents a novel distributed multi-agent temporal-difference learning framework for value function approximation,which alows agents using all the neighbor information instead of the information from only on... This paper presents a novel distributed multi-agent temporal-difference learning framework for value function approximation,which alows agents using all the neighbor information instead of the information from only one neighbor.With full neighbor information,the proposed framework(1)has a faster convergence rate,and(2)is more robust compared to the state of-the art approaches.Then we propose a distributed multi-agent discounted temporal dfferene algorithm and a distributed muli-agent average cost temporal diference leaming algorithm based on th framework.Moreover,the two proposed algorthms'theoretical convergence proofs are provided.Numerical simulation resuts show that our proposed algorihms are superior to the gossip-based algorithm in convergence speed,robustness to noise and time-varying network topology. 展开更多
关键词 Distributed algorithm Reinforcement learning Temprel-lifferene learning Multi-agent systems
Energy Economic Dispatch for Photovoltaic-Storage via Distributed Event-Triggered Surplus Algorithm 认领 引用 被引量：2
19
作者 Kaicheng Liu Chen Liang +2 位作者 Naiyue Wu Xiaoyang Dong Hui Yu 《Energy Engineering》 EI 2024年第9期2621-2637,共17页
This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy devices.This method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy rol... This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy devices.This method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy roles,and energy supply and demand dynamics.The systemmodel is developed by considering energy devices as versatile units capable of fulfilling various functionalities and playing multiple roles simultaneously.To strike a balance between optimality and feasibility,renewable energy resources are modeled with considerations for forecasting errors,Gaussian distribution,and penalty factors.Furthermore,this study introduces a distributed event-triggered surplus algorithm designed to address the economic dispatch problem by minimizing production costs.Rooted in surplus theory and finite time projection,the algorithm effectively rectifies network imbalances caused by directed graphs and addresses local inequality constraints.The algorithm greatly reduces the communication burden through event triggering mechanism.Finally,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
暂未订购 下载PDF
Combinations of Estimation of Distribution Algorithms and Other Techniques 认领 引用 被引量：4
20
作者 Qingfu Zhang Jianyong Sun Edward Tsang 《International Journal of Automation and computing》 2007年第3期273-280,共8页
This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in w... This paper summaries our recent work on combining estimation of distribution algorithms （EDA） and other techniques for solving hard search and optimization problems： a） guided mutation, an offspring generator in which the ideas from EDAs and genetic algorithms are combined together, we have shown that an evolutionary algorithm with guided mutation outperforms the best GA for the maximum clique problem, b） evolutionary algorithms refining a heuristic, we advocate a strategy for solving a hard optimization problem with complicated data structure, and c） combination of two different local search techniques and EDA for numerical global optimization problems, its basic idea is that not all the new generated points are needed to be improved by an expensive local search. 展开更多
关键词 Estimation distribution algorithm guided mutation memetic algorithms global optimization.
暂未订购 下载PDF
已选0条
引用分析
参考文献
引证文献
 统计分析
检索结果
已选文献
上一页 1 2 … 7 下一页 到第 页
在线咨询 使用帮助 返回顶部 意见反馈