Distributed learning is a well-established method for estimation tasks over extensively distributed datasets.However,non-randomly stored data can introduce bias into local parameter estimates,leading to significant pe...Distributed learning is a well-established method for estimation tasks over extensively distributed datasets.However,non-randomly stored data can introduce bias into local parameter estimates,leading to significant performance degradation in classical distributed algorithms.In this paper,the authors propose a novel Distributed Quasi-Newton Pilot(DQNP)method for distributed learning with non-randomly distributed data.The proposed approach accommodates both randomly and non-randomly distributed data settings and imposes no constraints on the uniformity of local sample sizes.Additionally,it avoids the need to transfer the Hessian matrix or compute its inversion,thereby greatly reducing computational and communication complexity.The authors theoretically demonstrate that the resulting estimator achieves statistical efficiency under mild conditions.Extensive numerical experiments on synthetic and real-world data validate the theoretical findings and illustrate the effectiveness of the proposed method.展开更多
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.展开更多
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.展开更多
The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm...The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm is employed to address the EDP of microgrids in grid-connected mode, while the push-pull algorithm with a fixed step size is introduced for the isolated mode. The proposed algorithm of isolated mode is proven to converge to the optimum when the interaction digraph of microgrids is strongly connected. A unified algorithmic framework is proposed to handle the two modes of operation of microgrids simultaneously, enabling our algorithm to achieve optimal power allocation and maintain the balance between power supply and demand in any mode and any mode switching. Due to the push-pull structure of the algorithm and the use of fixed step size,the proposed algorithm can better handle the case of unbalanced graphs, and the convergence speed is improved. It is documented that when the transmission topology is strongly connected and there is bi-directional communication between the energy router and its neighbors, the proposed algorithm in composite mode achieves economic dispatch even with arbitrary mode switching.Finally, we demonstrate the effectiveness and superiority of our algorithm through numerical simulations.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
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.展开更多
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.展开更多
Given the rapid development of advanced information systems,microgrids(MGs)suffer from more potential attacks that affect their operational performance.Conventional distributed secondary control with a small,fixed sam...Given the rapid development of advanced information systems,microgrids(MGs)suffer from more potential attacks that affect their operational performance.Conventional distributed secondary control with a small,fixed sampling time period inevitably causes the wasteful use of communication resources.This paper proposes a self-triggered secondary control scheme under perturbations from false data injection(FDI)attacks.We designed a linear clock for each DG to trigger its controller at aperiodic and intermittent instants.Sub-sequently,a hash-based defense mechanism(HDM)is designed for detecting and eliminating malicious data infiltrated in the MGs.With the aid of HDM,a self-triggered control scheme achieves the secondary control objectives even in the presence of FDI attacks.Rigorous theoretical analyses and simulation results indicate that the introduced secondary control scheme significantly reduces communication costs and enhances the resilience of MGs under FDI attacks.展开更多
With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research s...With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem.展开更多
Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new...Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new error analysis method for two passive sensor tracking system is presented and the error equations are deduced in detail. Based on the equations, we carry out theoretical computation and Monte Carlo computer simulation. The results show the correctness of our error computation equations. With the error equations, we present multiple 'two station'fusion algorithm using adaptive pseudo measurement equations. This greatly enhances the tracking performance and makes the algorithm convergent very fast and not sensitive to initial conditions.Simulation results prove the correctness of our new algorithm.展开更多
The distribution of shear-wave velocities in the subsurface is generally used to assess the potential forseismic liquefaction and soil amplification effects and to classify seismic sites. Newly developeddistributed ac...The distribution of shear-wave velocities in the subsurface is generally used to assess the potential forseismic liquefaction and soil amplification effects and to classify seismic sites. Newly developeddistributed acoustic sensing (DAS) technology enables estimation of the shear-wave distribution as ahigh-density seismic observation system. This technology is characterized by low maintenance costs,high-resolution outputs, and real-time data transmission capabilities, albeit with the challenge ofmanaging massive data generation. Rapid and efficient interpretation of data is the key to advancingapplication of the DAS technology. In this study, field tests were carried out to record ambient noise overa short period using DAS technology, from which the surface-wave dispersion curves were extracted. Inorder to reduce the influence of directional effects on the results, an unsupervised clustering method isused to select appropriate clusters to extract the Green's function. A combination of a genetic algorithmand Monte Carlo (GA-MC) simulation is proposed to invert the subsurface velocity structure. Thestratigraphic profiles obtained by the GA-MC method are in agreement with the borehole profiles.Compared to other methods, the proposed optimization method not only improves the solution qualitybut also reduces the solution time.展开更多
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.展开更多
The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is th...The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.展开更多
Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualiz...Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualization deployment,the cloud environment is exposed to a wide variety of cyber-attacks and security difficulties.The Intrusion Detection System(IDS)is a specialized security tool that network professionals use for the safety and security of the networks against attacks launched from various sources.DDoS attacks are becoming more frequent and powerful,and their attack pathways are continually changing,which requiring the development of new detection methods.Here the purpose of the study is to improve detection accuracy.Feature Selection(FS)is critical.At the same time,the IDS’s computational problem is limited by focusing on the most relevant elements,and its performance and accuracy increase.In this research work,the suggested Adaptive butterfly optimization algorithm(ABOA)framework is used to assess the effectiveness of a reduced feature subset during the feature selection phase,that was motivated by this motive Candidates.Accurate classification is not compromised by using an ABOA technique.The design of Deep Neural Networks(DNN)has simplified the categorization of network traffic into normal and DDoS threat traffic.DNN’s parameters can be finetuned to detect DDoS attacks better using specially built algorithms.Reduced reconstruction error,no exploding or vanishing gradients,and reduced network are all benefits of the changes outlined in this paper.When it comes to performance criteria like accuracy,precision,recall,and F1-Score are the performance measures that show the suggested architecture outperforms the other existing approaches.Hence the proposed ABOA+DNN is an excellent method for obtaining accurate predictions,with an improved accuracy rate of 99.05%compared to other existing approaches.展开更多
In the era of massive data,the study of distributed data is a significant topic.Model averaging can be effectively applied to distributed data by combining information from all machines.For linear models,the model ave...In the era of massive data,the study of distributed data is a significant topic.Model averaging can be effectively applied to distributed data by combining information from all machines.For linear models,the model averaging approach has been developed in the context of distributed data.However,further investigation is needed for more complex models.In this paper,the authors propose a distributed optimal model averaging approach based on multivariate additive models,which approximates unknown functions using B-splines allowing each machine to have a different smoothing degree.To utilize the information from the covariance matrix of dependent errors in multivariate multiple regressions,the authors use the Mahalanobis distance to construct a Mallows-type weight choice criterion.The criterion can be computed by transmitting information between the local machines and the center machine in two steps.The authors demonstrate the asymptotic optimality of the proposed model averaging estimator when the covariates are subject to uncertainty,and obtain the convergence rate of the weight vector to the theoretically optimal weights.The results remain novel even for additive models with a single response variable.The numerical examples show that the proposed method yields good performance.展开更多
Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting incr...Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.展开更多
With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper...With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper proposes a fault self-healing cooperative strategy for the new energy distribution network based on an improved ant colony-genetic hybrid algorithm.Firstly,the graph theory adjacency matrix is used to characterize the topology of the distribution network,and the dynamic positioning of new energy nodes is realized.Secondly,based on the output model and load characteristic model of wind,photovoltaic,and energy storage,a two-layer cooperative self-healing model of the distribution network is constructed.The upper layer is based on the improved depth-breadth hybrid search(DFS-BFS)to divide the island,with the maximum weight load recovery and the minimum number of switching actions as the goal,combined with the load priority to dynamically restore the key load.The lower layer uses the improved ant colony-genetic hybrid algorithm to solve the fault recovery path with the minimum total power loss load and the minimum network loss as the goal,generate the optimal switching sequence,and verify the power flow constraints.Finally,the simulation results based on the IEEE 33-bus system show that the proposed method can guarantee the power supply of key loads in the distribution network with high-tech energy penetration,restore the power supply of more load nodes with the least switching operation,and effectively reduce the line loss,which verifies the effectiveness and superiority of the method.展开更多
Distributed genetic algorithm can be combined with the adaptive genetic algorithm for mining the interesting and comprehensible classification rules.The paper gives the method to encode for the rules,the fitness funct...Distributed genetic algorithm can be combined with the adaptive genetic algorithm for mining the interesting and comprehensible classification rules.The paper gives the method to encode for the rules,the fitness function,the selecting,crossover,mutation and migration operator for the DAGA at the same time are designed.展开更多
基金supported by the National Natural Science Foundation of China under Grant No.12271034the Open Fund Project of Key Laboratory of Market Regulation under Grant No.2023SYSKF02003。
文摘Distributed learning is a well-established method for estimation tasks over extensively distributed datasets.However,non-randomly stored data can introduce bias into local parameter estimates,leading to significant performance degradation in classical distributed algorithms.In this paper,the authors propose a novel Distributed Quasi-Newton Pilot(DQNP)method for distributed learning with non-randomly distributed data.The proposed approach accommodates both randomly and non-randomly distributed data settings and imposes no constraints on the uniformity of local sample sizes.Additionally,it avoids the need to transfer the Hessian matrix or compute its inversion,thereby greatly reducing computational and communication complexity.The authors theoretically demonstrate that the resulting estimator achieves statistical efficiency under mild conditions.Extensive numerical experiments on synthetic and real-world data validate the theoretical findings and illustrate the effectiveness of the proposed method.
基金co-supported by the National Natural Science Foundation of China(Nos.61273349 and 61175109)the Aeronautical Science Foundation of China(Nos.2014ZA18004 and 2013ZA18001)
文摘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.
文摘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.
基金supported by the National Natural Science Foundation of China(62103203)
文摘The economic dispatch problem(EDP) of microgrids operating in both grid-connected and isolated modes within an energy internet framework is addressed in this paper. The multi-agent leader-following consensus algorithm is employed to address the EDP of microgrids in grid-connected mode, while the push-pull algorithm with a fixed step size is introduced for the isolated mode. The proposed algorithm of isolated mode is proven to converge to the optimum when the interaction digraph of microgrids is strongly connected. A unified algorithmic framework is proposed to handle the two modes of operation of microgrids simultaneously, enabling our algorithm to achieve optimal power allocation and maintain the balance between power supply and demand in any mode and any mode switching. Due to the push-pull structure of the algorithm and the use of fixed step size,the proposed algorithm can better handle the case of unbalanced graphs, and the convergence speed is improved. It is documented that when the transmission topology is strongly connected and there is bi-directional communication between the energy router and its neighbors, the proposed algorithm in composite mode achieves economic dispatch even with arbitrary mode switching.Finally, we demonstrate the effectiveness and superiority of our algorithm through numerical simulations.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
基金supported by the National Natural Science Foundation of China(62373162,U24A20268,624B2055).
文摘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.
基金supported in part by the Fundamental Research Funds for the Central Universities(SWU-XDJH202312)the National Natural Science Foundation of China(62173278)the Chongqing Science Fund for Distinguished Young Scholars(2024NSCQJQX0103).
文摘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.
基金supported by Hainan Provincial Natural Science Foundation of China(No.524RC532)Research Startup Funding from Hainan Institute of Zhejiang University(No.0210-6602-A12202)Project of Sanya Yazhou Bay Science and Technology City(No.SKJC-2022-PTDX-009/010/011).
文摘Given the rapid development of advanced information systems,microgrids(MGs)suffer from more potential attacks that affect their operational performance.Conventional distributed secondary control with a small,fixed sampling time period inevitably causes the wasteful use of communication resources.This paper proposes a self-triggered secondary control scheme under perturbations from false data injection(FDI)attacks.We designed a linear clock for each DG to trigger its controller at aperiodic and intermittent instants.Sub-sequently,a hash-based defense mechanism(HDM)is designed for detecting and eliminating malicious data infiltrated in the MGs.With the aid of HDM,a self-triggered control scheme achieves the secondary control objectives even in the presence of FDI attacks.Rigorous theoretical analyses and simulation results indicate that the introduced secondary control scheme significantly reduces communication costs and enhances the resilience of MGs under FDI attacks.
文摘With the development of economic globalization,distributedmanufacturing is becomingmore andmore prevalent.Recently,integrated scheduling of distributed production and assembly has captured much concern.This research studies a distributed flexible job shop scheduling problem with assembly operations.Firstly,a mixed integer programming model is formulated to minimize the maximum completion time.Secondly,a Q-learning-assisted coevolutionary algorithmis presented to solve themodel:(1)Multiple populations are developed to seek required decisions simultaneously;(2)An encoding and decoding method based on problem features is applied to represent individuals;(3)A hybrid approach of heuristic rules and random methods is employed to acquire a high-quality population;(4)Three evolutionary strategies having crossover and mutation methods are adopted to enhance exploration capabilities;(5)Three neighborhood structures based on problem features are constructed,and a Q-learning-based iterative local search method is devised to improve exploitation abilities.The Q-learning approach is applied to intelligently select better neighborhood structures.Finally,a group of instances is constructed to perform comparison experiments.The effectiveness of the Q-learning approach is verified by comparing the developed algorithm with its variant without the Q-learning method.Three renowned meta-heuristic algorithms are used in comparison with the developed algorithm.The comparison results demonstrate that the designed method exhibits better performance in coping with the formulated problem.
文摘Single passive sensor tracking algorithms have four disadvantages: bad stability, longdynamic time, big bias and sensitive to initial conditions. So the corresponding fusion algorithm results in bad performance. A new error analysis method for two passive sensor tracking system is presented and the error equations are deduced in detail. Based on the equations, we carry out theoretical computation and Monte Carlo computer simulation. The results show the correctness of our error computation equations. With the error equations, we present multiple 'two station'fusion algorithm using adaptive pseudo measurement equations. This greatly enhances the tracking performance and makes the algorithm convergent very fast and not sensitive to initial conditions.Simulation results prove the correctness of our new algorithm.
基金supported by the National Natural Science Foundation of China(Grant Nos.42225702 and 42077235)the Natural Science Foundation of Jiangsu Province(Grant No.BK20211086)the open fund of the Key Laboratory of Earth Fissures Geological Disaster,Ministry of Natural Resources.
文摘The distribution of shear-wave velocities in the subsurface is generally used to assess the potential forseismic liquefaction and soil amplification effects and to classify seismic sites. Newly developeddistributed acoustic sensing (DAS) technology enables estimation of the shear-wave distribution as ahigh-density seismic observation system. This technology is characterized by low maintenance costs,high-resolution outputs, and real-time data transmission capabilities, albeit with the challenge ofmanaging massive data generation. Rapid and efficient interpretation of data is the key to advancingapplication of the DAS technology. In this study, field tests were carried out to record ambient noise overa short period using DAS technology, from which the surface-wave dispersion curves were extracted. Inorder to reduce the influence of directional effects on the results, an unsupervised clustering method isused to select appropriate clusters to extract the Green's function. A combination of a genetic algorithmand Monte Carlo (GA-MC) simulation is proposed to invert the subsurface velocity structure. Thestratigraphic profiles obtained by the GA-MC method are in agreement with the borehole profiles.Compared to other methods, the proposed optimization method not only improves the solution qualitybut also reduces the solution time.
基金supported in part by Sichuan Science and Technology Program under Grant No.2025ZNSFSC151in part by the Strategic Priority Research Program of Chinese Academy of Sciences under Grant No.XDA27030201+1 种基金the Natural Science Foundation of China under Grant No.U21B6001in part by the Natural Science Foundation of Tianjin under Grant No.24JCQNJC01930.
文摘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.
文摘The aim of this paper is to present a distributed algorithm for big data classification, and its application for Magnetic Resonance Images (MRI) segmentation. We choose the well-known classification method which is the c-means method. The proposed method is introduced in order to perform a cognitive program which is assigned to be implemented on a parallel and distributed machine based on mobile agents. The main idea of the proposed algorithm is to execute the c-means classification procedure by the Mobile Classification Agents (Team Workers) on different nodes on their data at the same time and provide the results to their Mobile Host Agent (Team Leader) which computes the global results and orchestrates the classification until the convergence condition is achieved and the output segmented images will be provided from the Mobile Classification Agents. The data in our case are the big data MRI image of size (m × n) which is splitted into (m × n) elementary images one per mobile classification agent to perform the classification procedure. The experimental results show that the use of the distributed architecture improves significantly the big data segmentation efficiency.
文摘Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualization deployment,the cloud environment is exposed to a wide variety of cyber-attacks and security difficulties.The Intrusion Detection System(IDS)is a specialized security tool that network professionals use for the safety and security of the networks against attacks launched from various sources.DDoS attacks are becoming more frequent and powerful,and their attack pathways are continually changing,which requiring the development of new detection methods.Here the purpose of the study is to improve detection accuracy.Feature Selection(FS)is critical.At the same time,the IDS’s computational problem is limited by focusing on the most relevant elements,and its performance and accuracy increase.In this research work,the suggested Adaptive butterfly optimization algorithm(ABOA)framework is used to assess the effectiveness of a reduced feature subset during the feature selection phase,that was motivated by this motive Candidates.Accurate classification is not compromised by using an ABOA technique.The design of Deep Neural Networks(DNN)has simplified the categorization of network traffic into normal and DDoS threat traffic.DNN’s parameters can be finetuned to detect DDoS attacks better using specially built algorithms.Reduced reconstruction error,no exploding or vanishing gradients,and reduced network are all benefits of the changes outlined in this paper.When it comes to performance criteria like accuracy,precision,recall,and F1-Score are the performance measures that show the suggested architecture outperforms the other existing approaches.Hence the proposed ABOA+DNN is an excellent method for obtaining accurate predictions,with an improved accuracy rate of 99.05%compared to other existing approaches.
基金supported by Youth Academic Innocation Team Construction project of Capital University of Economics and Business under Grant No.QNTD202303supported by the Beijing Outstanding Young Scientist Program under Grant No.JWZQ20240101027the National Natural Science Foundation of China under Grant Nos.12031016,12531012 and 12426308。
文摘In the era of massive data,the study of distributed data is a significant topic.Model averaging can be effectively applied to distributed data by combining information from all machines.For linear models,the model averaging approach has been developed in the context of distributed data.However,further investigation is needed for more complex models.In this paper,the authors propose a distributed optimal model averaging approach based on multivariate additive models,which approximates unknown functions using B-splines allowing each machine to have a different smoothing degree.To utilize the information from the covariance matrix of dependent errors in multivariate multiple regressions,the authors use the Mahalanobis distance to construct a Mallows-type weight choice criterion.The criterion can be computed by transmitting information between the local machines and the center machine in two steps.The authors demonstrate the asymptotic optimality of the proposed model averaging estimator when the covariates are subject to uncertainty,and obtain the convergence rate of the weight vector to the theoretically optimal weights.The results remain novel even for additive models with a single response variable.The numerical examples show that the proposed method yields good performance.
基金supported in part by the Ministry of Higher Education Malaysia(MOHE)through Fundamental Research Grant Scheme(FRGS)Ref:FRGS/1/2024/ICT02/UTM/02/10,Vot.No:R.J130000.7828.5F748the Scientific Research Project of Education Department of Hunan Province(Nos.22B1046 and 24A0771).
文摘Engineering optimization problems are often characterized by high dimensionality,constraints,and complex,multimodal landscapes.Traditional deterministic methods frequently struggle under such conditions,prompting increased interest in swarm intelligence algorithms.Among these,the Cuckoo Search(CS)algorithm stands out for its promising global search capabilities.However,it often suffers from premature convergence when tackling complex problems.To address this limitation,this paper proposes a Grouped Dynamic Adaptive CS(GDACS)algorithm.Theenhancements incorporated intoGDACS can be summarized into two key aspects.Firstly,a chaotic map is employed to generate initial solutions,leveraging the inherent randomness of chaotic sequences to ensure a more uniform distribution across the search space and enhance population diversity from the outset.Secondly,Cauchy and Levy strategies replace the standard CS population update.This strategy involves evaluating the fitness of candidate solutions to dynamically group the population based on performance.Different step-size adaptation strategies are then applied to distinct groups,enabling an adaptive search mechanism that balances exploration and exploitation.Experiments were conducted on six benchmark functions and four constrained engineering design problems,and the results indicate that the proposed GDACS achieves good search efficiency and produces more accurate optimization results compared with other state-of-the-art algorithms.
基金supported by the Installation of OCS Distribution Network Program Control 2.0 and Other Functions for Dongguan Power Supply Bureau of Guangdong Power Grid Co.,Ltd.(No.:031900GS62220049).
文摘With the high proportion of new energy access,the traditional fault self-healing mechanism of the distribution network is challenged.Aiming at the demand for fast recovery of new distribution network faults,this paper proposes a fault self-healing cooperative strategy for the new energy distribution network based on an improved ant colony-genetic hybrid algorithm.Firstly,the graph theory adjacency matrix is used to characterize the topology of the distribution network,and the dynamic positioning of new energy nodes is realized.Secondly,based on the output model and load characteristic model of wind,photovoltaic,and energy storage,a two-layer cooperative self-healing model of the distribution network is constructed.The upper layer is based on the improved depth-breadth hybrid search(DFS-BFS)to divide the island,with the maximum weight load recovery and the minimum number of switching actions as the goal,combined with the load priority to dynamically restore the key load.The lower layer uses the improved ant colony-genetic hybrid algorithm to solve the fault recovery path with the minimum total power loss load and the minimum network loss as the goal,generate the optimal switching sequence,and verify the power flow constraints.Finally,the simulation results based on the IEEE 33-bus system show that the proposed method can guarantee the power supply of key loads in the distribution network with high-tech energy penetration,restore the power supply of more load nodes with the least switching operation,and effectively reduce the line loss,which verifies the effectiveness and superiority of the method.
基金National Ethnic Affairs Commission NatureScience Foundation of China(PMZY06004)the Education Science Foundation of Guangxi(2006A-E004)
文摘Distributed genetic algorithm can be combined with the adaptive genetic algorithm for mining the interesting and comprehensible classification rules.The paper gives the method to encode for the rules,the fitness function,the selecting,crossover,mutation and migration operator for the DAGA at the same time are designed.
