Search

To solve the problems of high storage resource consumption and low efficiency of the RRT exploration algorithm in the late stage of exploration, this paper proposes an Improved Artificial Fish Swarm based Optimize Rapidly-exploring Random Trees multi-robot Exploration Algorithm. Firstly, the efficiency of a single robot's exploration of nearby unknown regions is improved by dynamically adjusting the step size of the RRT tree.Secondly, the improved artificial fish swarm algorithm is used to delete the redundant nodes in the RRT tree and optimize the node state in the RRT tree, which reduces the occupation of memory resources and improves the exploration efficiency of the RRT tree in the narrow environment.Results from comparative experiments in simulation environments with different degrees of openness show that the optimized exploration algorithm can save significant storage resources and show better exploration performance in narrow environments compared to the original RRT exploration algorithm. [ABSTRACT FROM AUTHOR]

Transfer learning methods exploit similarities between different datasets to improve the performance of the target task by transferring knowledge from source tasks to the target task. "What to transfer" is a main research issue in transfer learning. The existing transfer learning method generally needs to acquire the shared parameters by integrating human knowledge. However, in many real applications, an understanding of which parameters can be shared is unknown beforehand. Transfer learning model is essentially a special multi-objective optimization problem. Consequently, this paper proposes a novel auto-sharing parameter technique for transfer learning based on multi-objective optimization and solves the optimization problem by using a multi-swarm particle swarm optimizer. Each task objective is simultaneously optimized by a sub-swarm. The current best particle from the sub-swarm of the target task is used to guide the search of particles of the source tasks and vice versa. The target task and source task are jointly solved by sharing the information of the best particle, which works as an inductive bias. Experiments are carried out to evaluate the proposed algorithm on several synthetic data sets and two real-world data sets of a school data set and a landmine data set, which show that the proposed algorithm is effective. [ABSTRACT FROM AUTHOR]

To solve the problem that the K-means algorithm is sensitive to the initial clustering centers and easily falls into local optima, we propose a new hybrid clustering algorithm called the IGWOKHM algorithm. In this paper, we first propose an improved strategy based on a nonlinear convergence factor, an inertial step size, and a dynamic weight to improve the search ability of the traditional grey wolf optimization (GWO) algorithm. Then, the improved GWO (IGWO) algorithm and the K-harmonic means (KHM) algorithm are fused to solve the clustering problem. This fusion clustering algorithm is called IGWOKHM, and it combines the global search ability of IGWO with the local fast optimization ability of KHM to both solve the problem of the K-means algorithm's sensitivity to the initial clustering centers and address the shortcomings of KHM. The experimental results on 8 test functions and 4 University of California Irvine (UCI) datasets show that the IGWO algorithm greatly improves the efficiency of the model while ensuring the stability of the algorithm. The fusion clustering algorithm can effectively overcome the inadequacies of the K-means algorithm and has a good global optimization ability. [ABSTRACT FROM AUTHOR]

Multi-objective particle swarm optimization (MOPSO) algorithms are shown to have enormous potential in solving multi-objective optimization problems (MOPs). However, most MOPSO is difficult to balance the exploration and exploitation, which may cause some problems to find true Pareto fronts when tackling some complex MOPs. A multi-objective decomposition particle swarm optimization based on completion-checking (C-DMOPSO) is improved in this paper. The updating mode of velocity is changed dynamically according to the algorithm's evolutionary process, which balances the exploration and exploitation effectively. In addition, simulated binary crossover and opposition-based learning are adopted to improve the diversity, and the archive set strategy is added to store the optimal solutions. Furthermore, polynomial mutation is performed in archive. The effectiveness of the proposed algorithm is tested by nineteen standard functions, including ZDT, DTLZ and UF, and the experimental results show that C-DMOPSO performs better on most of test problems. [ABSTRACT FROM AUTHOR]

In this work, modified constant modulus algorithm based on bat algorithm is proposed for wireless sensor communications systems. The bat algorithm is a swarm intelligence optimization algorithm, which mainly used to solve optimization problems. The proposed algorithm focused on modified constant modulus algorithm, which is also applicable to the constant modulus algorithm. The error function of blind equalization algorithm is used as the evaluation function of the bat algorithm, and then the initial value of the weight vector is calculated adaptively by the bat algorithm. Theoretical analysis is provided to illustrate that the proposed algorithm has a faster convergence speed than the original one and is suitable for almost all blind channel equalization algorithms. The simulation results support the newly proposed improved algorithm. The proposed algorithm could be applied to some more complex wireless channel environments to improve the reception performance of sensor communication systems. [ABSTRACT FROM AUTHOR]

This paper presents a hierarchical interactive particle swarm optimization (HIPSO) for solving the static multi objective optimal power flow (OPF) considering multi SVC controllers and dynamic economic dispatch (DED). This study introduces a variant of PSO using new mechanism search based dynamic adjustment of PSO parameters coordinated with a hierarchical strategy for reactive power planning stage to improve the performances of the original PSO in terms of solution quality and convergence characteristics. The HIPSO algorithm optimizes a combined control variables such as: active power generations, voltage control of generators, tap transformer and the reactive power of multi SVC Controllers installed at a specified buses to minimize fuel cost, total power loss and voltage deviation while satisfying the generators constraints and power system security. The proposed approach examined and applied to many practical test systems: IEEE 57-Bus, IEEE 118-Bus, 40 generating units and 10 generating units to solving; the static multi objective OPF with quadratic fuel cost function, the economic dispatch considering valve point effects and the dynamic economic dispatch considering both valve point effects and ramp rate limits. Simulation results compared to Matpower, to the standard PSO and others recent metaheuristic methods confirm the effectiveness of the proposed combined approach. [ABSTRACT FROM AUTHOR]