This paper aims to address the problem of multi-UAV cooperative search for multiple targets in a mountainous environment,considering the constraints of UAV dynamics and prior environmental information.Firstly,using th...This paper aims to address the problem of multi-UAV cooperative search for multiple targets in a mountainous environment,considering the constraints of UAV dynamics and prior environmental information.Firstly,using the target probability distribution map,two strategies of information fusion and information diffusion are employed to solve the problem of environmental information inconsistency caused by different UAVs searching different areas,thereby improving the coordination of UAV groups.Secondly,the task region is decomposed into several high-value sub-regions by using data clustering method.Based on this,a hierarchical search strategy is proposed,which allows precise or rough search in different probability areas by adjusting the altitude of the aircraft,thereby improving the search efficiency.Third,the Elite Dung Beetle Optimization Algorithm(EDBOA)is proposed based on bionics by accurately simulating the social behavior of dung beetles to plan paths that satisfy the UAV dynamics constraints and adapt to the mountainous terrain,where the mountain is considered as an obstacle to be avoided.Finally,the objective function for path optimization is formulated by considering factors such as coverage within the task region,smoothness of the search path,and path length.The effectiveness and superiority of the proposed schemes are verified by the simulation.展开更多
With the rapid development of renewable energy,the Microgrid Coalition(MGC)has become an important approach to improving energy utilization efficiency and economic performance.To address the operational optimization p...With the rapid development of renewable energy,the Microgrid Coalition(MGC)has become an important approach to improving energy utilization efficiency and economic performance.To address the operational optimization problem inmulti-microgrid cooperation,a cooperative game strategy based on the Nash bargainingmodel is proposed,aiming to enable collaboration among microgrids to maximize overall benefits while considering energy trading and cost optimization.First,each microgrid is regarded as a game participant,and a multi-microgrid cooperative game model based on Nash bargaining theory is constructed,targeting the minimization of total operational cost under constraints such as power balance and energy storage limits.Second,the Nash bargaining solution is introduced as the benefit allocation scheme to ensure individual rationality and coalition stability.Finally,theAlternating Direction Method of Multipliers(ADMM)is employed to decompose the centralized optimization problem into distributed subproblems for iterative solution,thereby reducing communication burden and protecting privacy.Case studies reveal that the operational costs of the threemicrogrids are reduced by 26.28%,19.00%,and 17.19%,respectively,and the overall renewable energy consumption rate is improved by approximately 66.11%.展开更多
Prediction of the age of each individual is possible using the changing pattern of DNA methylation with age.In this paper an age prediction approach to work out multivariate regression problems using DNA methylation d...Prediction of the age of each individual is possible using the changing pattern of DNA methylation with age.In this paper an age prediction approach to work out multivariate regression problems using DNA methylation data is developed.In this research study a convolutional neural network(CNN)-based model optimised by the genetic algorithm(GA)is addressed.This paper contributes to enhancing age prediction as a regression problem using a union of two CNNs and exchanging knowledge be-tween them.This specifically re-starts the training process from a possibly higher-quality point in different iterations and,consequently,causes potentially yeilds better results at each iteration.The method proposed,which is called cooperative deep neural network(Co-DeepNet),is tested on two types of age prediction problems.Sixteen datasets containing 1899 healthy blood samples and nine datasets containing 2395 diseased blood samples are employed to examine the method's efficiency.As a result,the mean absolute deviation(MAD)is 1.49 and 3.61 years for training and testing data,respectively,when the healthy data is tested.The diseased blood data show MAD results of 3.81 and 5.43 years for training and testing data,respectively.The results of the Co-DeepNet are compared with six other methods proposed in previous studies and a single CNN using four prediction accuracy measurements(R^(2),MAD,MSE and RMSE).The effectiveness of the Co-DeepNet and superiority of its results is proved through the statistical analysis.展开更多
Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in...Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in accuracy and efficiency.To address these challenges,we propose an adaptive multi-learning cooperation search algorithm(AMLCSA)for efficient identification of unknown parameters in PV models.AMLCSA is a novel algorithm inspired by teamwork behaviors in modern enterprises.It enhances the original cooperation search algorithm in two key aspects:(i)an adaptive multi-learning strategy that dynamically adjusts search ranges using adaptive weights,allowing better individuals to focus on local exploitation while guiding poorer individuals toward global exploration;and(ii)a chaotic grouping reflection strategy that introduces chaotic sequences to enhance population diversity and improve search performance.The effectiveness of AMLCSA is demonstrated on single-diode,double-diode,and three PV-module models.Simulation results show that AMLCSA offers significant advantages in convergence,accuracy,and stability compared to existing state-of-the-art algorithms.展开更多
The integration of eco-driving and cooperative adaptive cruise control(CACC)with platoon cooperative control(eco-CACC)has emerged as a pivotal approach for improving vehicle energy efficiency.Nonetheless,the prevailin...The integration of eco-driving and cooperative adaptive cruise control(CACC)with platoon cooperative control(eco-CACC)has emerged as a pivotal approach for improving vehicle energy efficiency.Nonetheless,the prevailing eco-CACC implementations still exhibit limitations in fully harnessing the potential energy savings.This can be attributed to the intricate nature of the problem,characterized by its high nonlinearity and non-convexity,making it challenging for conventional solving methods to find solutions.In this paper,a novel strategy based on a decentralized model predictive control(MPC)framework,called predictive ecological cooperative control(PECC),is proposed for vehicle platoon control on hilly roads,aiming to maximize the overall energy efficiency of the platoon.Unlike most existing literature that focuses on suboptimal coordination under predefined leading vehicle trajectories,this strategy employs an approach based on the combination of a long short-term memory network(LSTM)and genetic algorithm(GA)optimization(GA-LSTM)to predict the future speed of the leading vehicle.Notably,a function named the NotchFilter function(NF(?))is introduced to transform the hard state constraints in the eco-CACC problem,thereby alleviating the burden of problem-solving.Finally,through simulation comparisons between PECC and a strategy based on the common eco-CACC modifications,the effectiveness of PECC in improving platoon energy efficiency is demonstrated.展开更多
In the RSSI-based positioning algorithm,regarding the problem of a great conflict between precision and cost,a low-power and low-cost synergic localization algorithm is proposed,where effective methods are adopted in ...In the RSSI-based positioning algorithm,regarding the problem of a great conflict between precision and cost,a low-power and low-cost synergic localization algorithm is proposed,where effective methods are adopted in each phase of the localization process and fully use the detective information in the network to improve the positioning precision and robustness.In the ranging period,the power attenuation factor is obtained through the wireless channel modeling,and the RSSI value is transformed into distance.In the positioning period,the preferred reference nodes are used to calculate coordinates.In the position optimization period,Taylor expansion and least-squared iterative update algorithms are used to further improve the location precision.In the positioning,the notion of cooperative localization is introduced,in which the located node satisfying certain demands will be upgraded to a reference node so that it can participate in the positioning of other nodes,and improve the coverage and positioning precision.The results show that on the same network conditions,the proposed algorithm in this paper is similar to the Taylor series expansion algorithm based on the actual coordinates,but much higher than the basic least square algorithm,and the positioning precision is improved rapidly with the reduce of the range error.展开更多
This paper proposes novel multiple-mobile-robot collision avoidance path planning based on cooperative co-evolution,which can be executed fully distributed and in parallel. A real valued co-evolutionary algorithm is d...This paper proposes novel multiple-mobile-robot collision avoidance path planning based on cooperative co-evolution,which can be executed fully distributed and in parallel. A real valued co-evolutionary algorithm is developed to coordinate the movement of multiple robots in 2D world, avoiding C-space or grid net searching. The collision avoidance is achieved by cooperatively co-evolving segments of paths and the time interval to pass them. Methods for constraint handling, which are developed for evolutionary algorithm, make the path planning easier. The effectiveness of the algorithm is demonstrated on a number of 2Dpath planning problems.展开更多
The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different oper...The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.展开更多
Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can ...Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.展开更多
Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propo...Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propose a rendezvous control strategy,which divides the rendezvous process into two parts:The loose formation rendezvous and the close formation rendezvous.In the first stage,UAVs are supposed to reach the specific target locations simultaneously and form a loose formation.A distributed control strategy based on first-order consensus algorithm is presented to achieve this goal.Then the second stage is designed based on the second-order consensus algorithm to complete the transition from the loose formation to the close formation.This process needs the speeds and heading angles of UAVs to reach an agreement.Besides,control algorithms with a virtual leader are proposed,by which the formation states can reach a specific value.Finally,simulation results show that the control algorithms are capable of realizing the mission rendezvous of multi-UAV and the consistence of UAVs′final states,which verify the effectiveness and feasibility of the designed control strategy.展开更多
A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. ...A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.展开更多
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.展开更多
Among the bio-inspired techniques,PSO-based clustering algorithms have received special attention. An improved method named Particle Swarm Optimization (PSO) clustering algorithm based on cooperative evolution with mu...Among the bio-inspired techniques,PSO-based clustering algorithms have received special attention. An improved method named Particle Swarm Optimization (PSO) clustering algorithm based on cooperative evolution with multi-populations was presented. It adopts cooperative evolutionary strategy with multi-populations to change the mode of traditional searching optimum solutions. It searches the local optimum and updates the whole best position (gBest) and local best position (pBest) ceaselessly. The gBest will be passed in all sub-populations. When the gBest meets the precision,the evolution will terminate. The whole clustering process is divided into two stages. The first stage uses the cooperative evolutionary PSO algorithm to search the initial clustering centers. The second stage uses the K-means algorithm. The experiment results demonstrate that this method can extract the correct number of clusters with good clustering quality compared with the results obtained from other clustering algorithms.展开更多
As to the safety threats faced by sensor networks （SN）, nodes limitations of computation, memory and communication, a secure location algorithm （node cooperative secure localization, NCSL） is presented in this pap...As to the safety threats faced by sensor networks （SN）, nodes limitations of computation, memory and communication, a secure location algorithm （node cooperative secure localization, NCSL） is presented in this paper. The algorithm takes the improvements of SN location information security as its design targets, utilizing nodes＇ cooperation to build virtual antennae array to communicate and localize, and gains arraying antenna advantage for SN without extra hardware cost, such as reducing multi-path effects, increasing receivers＇ signal to noise ratio and system capa- bility, reducing transmitting power, and so on. Simulations show that the algorithm based on virtual antennae array has good localization ability with a at high accuracy in direction-of-arrival （DOA） estimation, and makes SN capable to resist common malicious attacks, especially wormhole attack, by using the judgment rules for malicious attacks.展开更多
We study evolutionary prisoner＇s dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategie...We study evolutionary prisoner＇s dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategies either rewire the link between them with probability p or update their strategies with probability 1 - p depending on their payoffs. Numerical simulation shows that the final network is either split into some disconnected communities whose players share the same strategy within each community or forms a single connected network in which all nodes are in the same strategy. Interestingly, the density of cooperators in the final state can be maximised in an intermediate range of p via the competition between time scale of the network dynamics and that of the node dynamics. Finally, the mean-field analysis helps to understand the results of numerical simulation. Our results may provide some insight into understanding the emergence of cooperation in the real situation where the individuals＇ behaviour and their relationship adaptively co-evolve.展开更多
To improve the detection performance of sensing users for primary users in the cognitive radio, an optimal cooperative detection algorithm for many sensing users is proposed. In this paper, optimal decision thresholds...To improve the detection performance of sensing users for primary users in the cognitive radio, an optimal cooperative detection algorithm for many sensing users is proposed. In this paper, optimal decision thresholds of each sensing user are discussed. Theoretical analysis and simulation results indicate that the detection probability of optimal decision threshold rules is better than that of determined threshold rules when the false alarm of the fusion center is constant. The proposed optimal cooperative detection algorithm improves the detection performance of primary users as the attendees grow. The 2 dB gain of detection probability can be obtained when a new sensing user joins in, and there is a 17 dB improvement when the accumulation number increases from 1 to 50.展开更多
Accurate and timely monthly rainfall forecasting is a major challenge for the scientific community in hydrological research such as river management project and design of flood warning systems. Support Vector Regressi...Accurate and timely monthly rainfall forecasting is a major challenge for the scientific community in hydrological research such as river management project and design of flood warning systems. Support Vector Regression (SVR) is a very useful precipitation prediction model. In this paper, a novel parallel co-evolution algorithm is presented to determine the appropriate parameters of the SVR in rainfall prediction based on parallel co-evolution by hybrid Genetic Algorithm and Particle Swarm Optimization algorithm, namely SVRGAPSO, for monthly rainfall prediction. The framework of the parallel co-evolutionary algorithm is to iterate two GA and PSO populations simultaneously, which is a mechanism for information exchange between GA and PSO populations to overcome premature local optimum. Our methodology adopts a hybrid PSO and GA for the optimal parameters of SVR by parallel co-evolving. The proposed technique is applied over rainfall forecasting to test its generalization capability as well as to make comparative evaluations with the several competing techniques, such as the other alternative methods, namely SVRPSO (SVR with PSO), SVRGA (SVR with GA), and SVR model. The empirical results indicate that the SVRGAPSO results have a superior generalization capability with the lowest prediction error values in rainfall forecasting. The SVRGAPSO can significantly improve the rainfall forecasting accuracy. Therefore, the SVRGAPSO model is a promising alternative for rainfall forecasting.展开更多
In this research,a novel dynamic and heterogeneous identity based cooperative co-evolutionary algorithm(DHICCA)is proposed for addressing the distributed lot-streaming flowshop scheduling problem(DLSFSP)with the objec...In this research,a novel dynamic and heterogeneous identity based cooperative co-evolutionary algorithm(DHICCA)is proposed for addressing the distributed lot-streaming flowshop scheduling problem(DLSFSP)with the objective to minimize the makespan.A two-layer-vector representation is devised to bridge the solution space of DLSFSP and the search space of DHICCA.In the evolution of DHICCA,population individuals are endowed with heterogeneous identities according to their quality,including superior individuals,ordinary individuals,and inferior individuals,which serve local exploitation,global exploration,and diversified restart,respectively.Because individuals with different identities require different evolutionary mechanisms to fully unleash their respective potentials,identity-specific evolutionary operators are devised to evolve them in a cooperative co-evolutionary way.This is important to use limited population resources to solve complex optimization problems.Specifically,exploitation is carried out on superior individuals by devising three exploitative operators with different intensities based on techniques of variable neighborhood,destruction-construction,and gene targeting.Exploration is executed on ordinary individuals by a newly constructed discrete Jaya algorithm and a probability crossover strategy.In addition,restart is performed on inferior individuals to introduce new evolutionary individuals to the population.After the cooperative co-evolution,all individuals with different identities are merged as a population again,and their identities are dynamically adjusted by new evaluation.The influence of parameters on the algorithm is investigated based on design-of-experiment and comprehensive computational experiments are used to evaluate the performance of all algorithms.The results validate the effectiveness of special designs and show that DHICCA performs more efficient than the existing state-of-the-art algorithms in solving the DLSFSP.展开更多
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.展开更多
基金supported by the Natural Science Foundation of China(62273068)the Fundamental Research Funds for the Central Universities(3132023512)Dalian Science and Technology Innovation Fund(2019J12GX040).
文摘This paper aims to address the problem of multi-UAV cooperative search for multiple targets in a mountainous environment,considering the constraints of UAV dynamics and prior environmental information.Firstly,using the target probability distribution map,two strategies of information fusion and information diffusion are employed to solve the problem of environmental information inconsistency caused by different UAVs searching different areas,thereby improving the coordination of UAV groups.Secondly,the task region is decomposed into several high-value sub-regions by using data clustering method.Based on this,a hierarchical search strategy is proposed,which allows precise or rough search in different probability areas by adjusting the altitude of the aircraft,thereby improving the search efficiency.Third,the Elite Dung Beetle Optimization Algorithm(EDBOA)is proposed based on bionics by accurately simulating the social behavior of dung beetles to plan paths that satisfy the UAV dynamics constraints and adapt to the mountainous terrain,where the mountain is considered as an obstacle to be avoided.Finally,the objective function for path optimization is formulated by considering factors such as coverage within the task region,smoothness of the search path,and path length.The effectiveness and superiority of the proposed schemes are verified by the simulation.
基金funded by StateGrid Beijing Electric PowerCompany Technology Project,grant number 520210230004.
文摘With the rapid development of renewable energy,the Microgrid Coalition(MGC)has become an important approach to improving energy utilization efficiency and economic performance.To address the operational optimization problem inmulti-microgrid cooperation,a cooperative game strategy based on the Nash bargainingmodel is proposed,aiming to enable collaboration among microgrids to maximize overall benefits while considering energy trading and cost optimization.First,each microgrid is regarded as a game participant,and a multi-microgrid cooperative game model based on Nash bargaining theory is constructed,targeting the minimization of total operational cost under constraints such as power balance and energy storage limits.Second,the Nash bargaining solution is introduced as the benefit allocation scheme to ensure individual rationality and coalition stability.Finally,theAlternating Direction Method of Multipliers(ADMM)is employed to decompose the centralized optimization problem into distributed subproblems for iterative solution,thereby reducing communication burden and protecting privacy.Case studies reveal that the operational costs of the threemicrogrids are reduced by 26.28%,19.00%,and 17.19%,respectively,and the overall renewable energy consumption rate is improved by approximately 66.11%.
基金supported by the Universiti Kebangsaan Malaysia(DIP-2016-024).
文摘Prediction of the age of each individual is possible using the changing pattern of DNA methylation with age.In this paper an age prediction approach to work out multivariate regression problems using DNA methylation data is developed.In this research study a convolutional neural network(CNN)-based model optimised by the genetic algorithm(GA)is addressed.This paper contributes to enhancing age prediction as a regression problem using a union of two CNNs and exchanging knowledge be-tween them.This specifically re-starts the training process from a possibly higher-quality point in different iterations and,consequently,causes potentially yeilds better results at each iteration.The method proposed,which is called cooperative deep neural network(Co-DeepNet),is tested on two types of age prediction problems.Sixteen datasets containing 1899 healthy blood samples and nine datasets containing 2395 diseased blood samples are employed to examine the method's efficiency.As a result,the mean absolute deviation(MAD)is 1.49 and 3.61 years for training and testing data,respectively,when the healthy data is tested.The diseased blood data show MAD results of 3.81 and 5.43 years for training and testing data,respectively.The results of the Co-DeepNet are compared with six other methods proposed in previous studies and a single CNN using four prediction accuracy measurements(R^(2),MAD,MSE and RMSE).The effectiveness of the Co-DeepNet and superiority of its results is proved through the statistical analysis.
基金supported by the National Natural Science Foundation of China(Grant Nos.62303197,62273214)the Natural Science Foundation of Shandong Province(ZR2024MFO18).
文摘Accurate and reliable photovoltaic(PV)modeling is crucial for the performance evaluation,control,and optimization of PV systems.However,existing methods for PV parameter identification often suffer from limitations in accuracy and efficiency.To address these challenges,we propose an adaptive multi-learning cooperation search algorithm(AMLCSA)for efficient identification of unknown parameters in PV models.AMLCSA is a novel algorithm inspired by teamwork behaviors in modern enterprises.It enhances the original cooperation search algorithm in two key aspects:(i)an adaptive multi-learning strategy that dynamically adjusts search ranges using adaptive weights,allowing better individuals to focus on local exploitation while guiding poorer individuals toward global exploration;and(ii)a chaotic grouping reflection strategy that introduces chaotic sequences to enhance population diversity and improve search performance.The effectiveness of AMLCSA is demonstrated on single-diode,double-diode,and three PV-module models.Simulation results show that AMLCSA offers significant advantages in convergence,accuracy,and stability compared to existing state-of-the-art algorithms.
基金Supported by National Natural Science Foundation of China(Grant Nos.52172383,51805081)Jiangsu Provincial Postgraduate Research&Practice Innovation Program(Grant No.KYCX22_0196)。
文摘The integration of eco-driving and cooperative adaptive cruise control(CACC)with platoon cooperative control(eco-CACC)has emerged as a pivotal approach for improving vehicle energy efficiency.Nonetheless,the prevailing eco-CACC implementations still exhibit limitations in fully harnessing the potential energy savings.This can be attributed to the intricate nature of the problem,characterized by its high nonlinearity and non-convexity,making it challenging for conventional solving methods to find solutions.In this paper,a novel strategy based on a decentralized model predictive control(MPC)framework,called predictive ecological cooperative control(PECC),is proposed for vehicle platoon control on hilly roads,aiming to maximize the overall energy efficiency of the platoon.Unlike most existing literature that focuses on suboptimal coordination under predefined leading vehicle trajectories,this strategy employs an approach based on the combination of a long short-term memory network(LSTM)and genetic algorithm(GA)optimization(GA-LSTM)to predict the future speed of the leading vehicle.Notably,a function named the NotchFilter function(NF(?))is introduced to transform the hard state constraints in the eco-CACC problem,thereby alleviating the burden of problem-solving.Finally,through simulation comparisons between PECC and a strategy based on the common eco-CACC modifications,the effectiveness of PECC in improving platoon energy efficiency is demonstrated.
基金National Natural Science Foundation of China,grant number 62205120,funded this research.
文摘In the RSSI-based positioning algorithm,regarding the problem of a great conflict between precision and cost,a low-power and low-cost synergic localization algorithm is proposed,where effective methods are adopted in each phase of the localization process and fully use the detective information in the network to improve the positioning precision and robustness.In the ranging period,the power attenuation factor is obtained through the wireless channel modeling,and the RSSI value is transformed into distance.In the positioning period,the preferred reference nodes are used to calculate coordinates.In the position optimization period,Taylor expansion and least-squared iterative update algorithms are used to further improve the location precision.In the positioning,the notion of cooperative localization is introduced,in which the located node satisfying certain demands will be upgraded to a reference node so that it can participate in the positioning of other nodes,and improve the coverage and positioning precision.The results show that on the same network conditions,the proposed algorithm in this paper is similar to the Taylor series expansion algorithm based on the actual coordinates,but much higher than the basic least square algorithm,and the positioning precision is improved rapidly with the reduce of the range error.
基金Project (No.2002CB312200) supported by the National Basic Research Program (973) of China
文摘This paper proposes novel multiple-mobile-robot collision avoidance path planning based on cooperative co-evolution,which can be executed fully distributed and in parallel. A real valued co-evolutionary algorithm is developed to coordinate the movement of multiple robots in 2D world, avoiding C-space or grid net searching. The collision avoidance is achieved by cooperatively co-evolving segments of paths and the time interval to pass them. Methods for constraint handling, which are developed for evolutionary algorithm, make the path planning easier. The effectiveness of the algorithm is demonstrated on a number of 2Dpath planning problems.
文摘The task assignment problem of multiple heterogeneous unmanned aerial vehicles （UAVs）, concerned with cooperative decision making and control, is studied in this paper. The heterogeneous vehicles have different operational capabilities and kinematic constraints, and carry limited resources （e.g., weapons） onboard. They are designated to perform multiple consecutive tasks cooperatively on multiple ground targets. The problem becomes much more complicated because of these terms of heterogeneity. In order to tackle the challenge, we modify the former genetic algorithm with multi-type genes to stochastically search a best solution. Genes of chromo- somes are different, and they are assorted into several types according to the tasks that must be performed on targets. Different types of genes are processed specifically in the improved genetic operators including initialization, crossover, and mutation. We also present a mirror representation of vehicles to deal with the limited resource constraint. Feasible chromosomes that vehicles could perform tasks using their limited resources under the assignment are created and evolved by genetic operators. The effect of the proposed algorithm is demonstrated in numerical simulations. The results show that it effectively provides good feasible solutions and finds an optimal one.
基金This project was supported by the Fund of College Doctor Degree (20020699009)
文摘Target distribution in cooperative combat is a difficult and emphases. We build up the optimization model according to the rule of fire distribution. We have researched on the optimization model with BOA. The BOA can estimate the joint probability distribution of the variables with Bayesian network, and the new candidate solutions also can be generated by the joint distribution. The simulation example verified that the method could be used to solve the complex question, the operation was quickly and the solution was best.
基金jointly granted by the Science and Technology on Avionics Integration Laboratorythe Aeronautical Science Foundation(2016ZC15008)
文摘Multiple unmanned aerial vehicles(UAVs)cooperative operation is the main form for UAVs fighting in battlefield,and multi-UAV mission rendezvous is the premise of cooperative reconnaissance and attack missions.We propose a rendezvous control strategy,which divides the rendezvous process into two parts:The loose formation rendezvous and the close formation rendezvous.In the first stage,UAVs are supposed to reach the specific target locations simultaneously and form a loose formation.A distributed control strategy based on first-order consensus algorithm is presented to achieve this goal.Then the second stage is designed based on the second-order consensus algorithm to complete the transition from the loose formation to the close formation.This process needs the speeds and heading angles of UAVs to reach an agreement.Besides,control algorithms with a virtual leader are proposed,by which the formation states can reach a specific value.Finally,simulation results show that the control algorithms are capable of realizing the mission rendezvous of multi-UAV and the consistence of UAVs′final states,which verify the effectiveness and feasibility of the designed control strategy.
基金The National Natural Science Foundation of China(No.61201143)Innovation Foundations of CAST(ITS)(No.F-WYY-2013-016)the Fundamental Research Funds for the Central Universities(No.HIT.IBRSEM.201309)
文摘A bandwidth-exchange cooperation algorithm based on the Nash bargaining solution （NBS） is proposed to encourage the selfish users to participate with more cooperation so as to improve the users＇ energy efficiency. As a result, two key problems, i.e. , when to cooperate and how to cooperate, are solved. For the first problem, a proposed cooperation condition that can decide when to cooperate and guarantee users＇ energy efficiency achieved through cooperation is not lower than that achieved without cooperation. For the second problem, the cooperation bandwidth allocations （CBAs） based on the NBS solve the problem how to cooperate when cooperation takes place. Simulation results show that, as the modulation order of quadrature amplitude modulation （QAM） increases, the cooperation between both users only occurs with a large signal-to-noise ratio （SNR）. Meanwhile, the energy efficiency decreases as the modulation order increases. Despite all this, the proposed algorithm can obviously improve the energy efficiency measured in bits-per-Joule compared with non-cooperation.
基金Supported by National High Technology Research and Development Program of China （863 Program） （2007AA809502C） National Natural Science Foundation of China （50979093） Program for New Century Excellent Talents in University （NCET-06-0877）
基金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.
基金National Natural Science Foundation of China ( No.60873058)Science and Technology Project of Shandong Province of China (No.2009GG10001008)Soft Science Research Project, China (No.2009RKA285)
文摘Among the bio-inspired techniques,PSO-based clustering algorithms have received special attention. An improved method named Particle Swarm Optimization (PSO) clustering algorithm based on cooperative evolution with multi-populations was presented. It adopts cooperative evolutionary strategy with multi-populations to change the mode of traditional searching optimum solutions. It searches the local optimum and updates the whole best position (gBest) and local best position (pBest) ceaselessly. The gBest will be passed in all sub-populations. When the gBest meets the precision,the evolution will terminate. The whole clustering process is divided into two stages. The first stage uses the cooperative evolutionary PSO algorithm to search the initial clustering centers. The second stage uses the K-means algorithm. The experiment results demonstrate that this method can extract the correct number of clusters with good clustering quality compared with the results obtained from other clustering algorithms.
基金the National Natural Science Foundation of China (60272014)the National High Technology Research and Develop-ment Program of China (2005AA121520)
文摘As to the safety threats faced by sensor networks （SN）, nodes limitations of computation, memory and communication, a secure location algorithm （node cooperative secure localization, NCSL） is presented in this paper. The algorithm takes the improvements of SN location information security as its design targets, utilizing nodes＇ cooperation to build virtual antennae array to communicate and localize, and gains arraying antenna advantage for SN without extra hardware cost, such as reducing multi-path effects, increasing receivers＇ signal to noise ratio and system capa- bility, reducing transmitting power, and so on. Simulations show that the algorithm based on virtual antennae array has good localization ability with a at high accuracy in direction-of-arrival （DOA） estimation, and makes SN capable to resist common malicious attacks, especially wormhole attack, by using the judgment rules for malicious attacks.
基金Project supported by the National Natural Science Foundation of China (Grant No. 20873130)the Graduate Innovation Fund of USTC
文摘We study evolutionary prisoner＇s dilemma game on adaptive networks where a population of players co-evolves with their interaction networks. During the co-evolution process, interacted players with opposite strategies either rewire the link between them with probability p or update their strategies with probability 1 - p depending on their payoffs. Numerical simulation shows that the final network is either split into some disconnected communities whose players share the same strategy within each community or forms a single connected network in which all nodes are in the same strategy. Interestingly, the density of cooperators in the final state can be maximised in an intermediate range of p via the competition between time scale of the network dynamics and that of the node dynamics. Finally, the mean-field analysis helps to understand the results of numerical simulation. Our results may provide some insight into understanding the emergence of cooperation in the real situation where the individuals＇ behaviour and their relationship adaptively co-evolve.
基金Sponsored by the National Basic Research Program of China(973 Program)(Grant No.2007CB310601)
文摘To improve the detection performance of sensing users for primary users in the cognitive radio, an optimal cooperative detection algorithm for many sensing users is proposed. In this paper, optimal decision thresholds of each sensing user are discussed. Theoretical analysis and simulation results indicate that the detection probability of optimal decision threshold rules is better than that of determined threshold rules when the false alarm of the fusion center is constant. The proposed optimal cooperative detection algorithm improves the detection performance of primary users as the attendees grow. The 2 dB gain of detection probability can be obtained when a new sensing user joins in, and there is a 17 dB improvement when the accumulation number increases from 1 to 50.
文摘Accurate and timely monthly rainfall forecasting is a major challenge for the scientific community in hydrological research such as river management project and design of flood warning systems. Support Vector Regression (SVR) is a very useful precipitation prediction model. In this paper, a novel parallel co-evolution algorithm is presented to determine the appropriate parameters of the SVR in rainfall prediction based on parallel co-evolution by hybrid Genetic Algorithm and Particle Swarm Optimization algorithm, namely SVRGAPSO, for monthly rainfall prediction. The framework of the parallel co-evolutionary algorithm is to iterate two GA and PSO populations simultaneously, which is a mechanism for information exchange between GA and PSO populations to overcome premature local optimum. Our methodology adopts a hybrid PSO and GA for the optimal parameters of SVR by parallel co-evolving. The proposed technique is applied over rainfall forecasting to test its generalization capability as well as to make comparative evaluations with the several competing techniques, such as the other alternative methods, namely SVRPSO (SVR with PSO), SVRGA (SVR with GA), and SVR model. The empirical results indicate that the SVRGAPSO results have a superior generalization capability with the lowest prediction error values in rainfall forecasting. The SVRGAPSO can significantly improve the rainfall forecasting accuracy. Therefore, the SVRGAPSO model is a promising alternative for rainfall forecasting.
基金supported by the National Natural Science Foundation of China(No.62003258)Natural Science Foundation of Hebei Province(No.F2024204007)Projection of State Key Laboratory for Manufacturing Systems Engineering of Xi’an Jiaotong University(No.sklms 2023002).
文摘In this research,a novel dynamic and heterogeneous identity based cooperative co-evolutionary algorithm(DHICCA)is proposed for addressing the distributed lot-streaming flowshop scheduling problem(DLSFSP)with the objective to minimize the makespan.A two-layer-vector representation is devised to bridge the solution space of DLSFSP and the search space of DHICCA.In the evolution of DHICCA,population individuals are endowed with heterogeneous identities according to their quality,including superior individuals,ordinary individuals,and inferior individuals,which serve local exploitation,global exploration,and diversified restart,respectively.Because individuals with different identities require different evolutionary mechanisms to fully unleash their respective potentials,identity-specific evolutionary operators are devised to evolve them in a cooperative co-evolutionary way.This is important to use limited population resources to solve complex optimization problems.Specifically,exploitation is carried out on superior individuals by devising three exploitative operators with different intensities based on techniques of variable neighborhood,destruction-construction,and gene targeting.Exploration is executed on ordinary individuals by a newly constructed discrete Jaya algorithm and a probability crossover strategy.In addition,restart is performed on inferior individuals to introduce new evolutionary individuals to the population.After the cooperative co-evolution,all individuals with different identities are merged as a population again,and their identities are dynamically adjusted by new evaluation.The influence of parameters on the algorithm is investigated based on design-of-experiment and comprehensive computational experiments are used to evaluate the performance of all algorithms.The results validate the effectiveness of special designs and show that DHICCA performs more efficient than the existing state-of-the-art algorithms in solving the DLSFSP.
基金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.
