To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic ...To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.展开更多
The traveling salesman problem （TSP） is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony sys...The traveling salesman problem （TSP） is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.展开更多
It is important to harmonize effectively the behaviors of the agents in the multi-agent system (MAS) to complete the solution process. The co-evolution computing techniques, inspired by natural selection and genetics,...It is important to harmonize effectively the behaviors of the agents in the multi-agent system (MAS) to complete the solution process. The co-evolution computing techniques, inspired by natural selection and genetics, are usually used to solve these problems. Based on learning and evolution mechanisms of the biological systems, an adaptive co-evolution model was proposed in this paper. Inner-population, inter-population, and community learning operators were presented. The adaptive co-evolution algorithm (ACEA) was designed in detail. Some simulation experiments were done to evaluate the performance of the ACEA. The results show that the ACEA is more effective and feasible than the genetic algorithm to solve the optimization problems.展开更多
For the deficiency that the traditional single forecast methods could not forecast electronic equipment states, a combined forecast method based on the hidden Markov model（HMM） and least square support vector machin...For the deficiency that the traditional single forecast methods could not forecast electronic equipment states, a combined forecast method based on the hidden Markov model（HMM） and least square support vector machine（LS-SVM） is presented. The multi-agent genetic algorithm（MAGA） is used to estimate parameters of HMM to overcome the problem that the Baum-Welch algorithm is easy to fall into local optimal solution. The state condition probability is introduced into the HMM modeling process to reduce the effect of uncertain factors. MAGA is used to estimate parameters of LS-SVM. Moreover, pruning algorithms are used to estimate parameters to get the sparse approximation of LS-SVM so as to increase the ranging performance. On the basis of these, the combined forecast model of electronic equipment states is established. The example results show the superiority of the combined forecast model in terms of forecast precision,calculation speed and stability.展开更多
文摘To address the shortcomings of traditional Genetic Algorithm (GA) in multi-agent path planning, such as prolonged planning time, slow convergence, and solution instability, this paper proposes an Asynchronous Genetic Algorithm (AGA) to solve multi-agent path planning problems effectively. To enhance the real-time performance and computational efficiency of Multi-Agent Systems (MAS) in path planning, the AGA incorporates an Equal-Size Clustering Algorithm (ESCA) based on the K-means clustering method. The ESCA divides the primary task evenly into a series of subtasks, thereby reducing the gene length in the subsequent GA process. The algorithm then employs GA to solve each subtask sequentially. To evaluate the effectiveness of the proposed method, a simulation program was designed to perform path planning for 100 trajectories, and the results were compared with those of State-Of-The-Art (SOTA) methods. The simulation results demonstrate that, although the solutions provided by AGA are suboptimal, it exhibits significant advantages in terms of execution speed and solution stability compared to other algorithms.
基金Supported by the National Natural Science Foun-dation of China (69973016)
文摘The traveling salesman problem （TSP） is a classical optimization problem and it is one of a class of NP- Problem. This paper presents a new method named multiagent approach based genetic algorithm and ant colony system to solve the TSP. Three kinds of agents with different function were designed in the multi-agent architecture proposed by this paper. The first kind of agent is ant colony optimization agent and its function is generating the new solution continuously. The second kind of agent is selection agent, crossover agent and mutation agent, their function is optimizing the current solutions group. The third kind of agent is fast local searching agent and its function is optimizing the best solution from the beginning of the trial. At the end of this paper, the experimental results have shown that the proposed hybrid ap proach has good performance with respect to the quality of solution and the speed of computation.
基金Project of Shanghai Committee of Science and Technology, China ( No.08JC1400100, No. QB081404100)Leading Academic Discipline Project of Shanghai Municipal Education Commission, China (No.J51901)
文摘It is important to harmonize effectively the behaviors of the agents in the multi-agent system (MAS) to complete the solution process. The co-evolution computing techniques, inspired by natural selection and genetics, are usually used to solve these problems. Based on learning and evolution mechanisms of the biological systems, an adaptive co-evolution model was proposed in this paper. Inner-population, inter-population, and community learning operators were presented. The adaptive co-evolution algorithm (ACEA) was designed in detail. Some simulation experiments were done to evaluate the performance of the ACEA. The results show that the ACEA is more effective and feasible than the genetic algorithm to solve the optimization problems.
文摘For the deficiency that the traditional single forecast methods could not forecast electronic equipment states, a combined forecast method based on the hidden Markov model（HMM） and least square support vector machine（LS-SVM） is presented. The multi-agent genetic algorithm（MAGA） is used to estimate parameters of HMM to overcome the problem that the Baum-Welch algorithm is easy to fall into local optimal solution. The state condition probability is introduced into the HMM modeling process to reduce the effect of uncertain factors. MAGA is used to estimate parameters of LS-SVM. Moreover, pruning algorithms are used to estimate parameters to get the sparse approximation of LS-SVM so as to increase the ranging performance. On the basis of these, the combined forecast model of electronic equipment states is established. The example results show the superiority of the combined forecast model in terms of forecast precision,calculation speed and stability.
