Swarm path planning method based on variable dimension ABC algorithm

Abstract

A group path planning method based on the variable dimension ABC algorithm, characterized in that: the path planning problem of the group system is taken as the research object, combined with the ability of the ABC algorithm to solve the multi-variable function global optimization speed, and the path of the group system The characteristics of the planning problem are improved. In the initial stage of the path network, the endpoint heuristic method is used to generate the initial solution set in the feasible path solution space, and then the path network is optimized by the MDABC algorithm. A new ABC model is proposed in the optimization process. , it can adaptively adjust the fitness of the solution according to the dimension change of the solution in the solution space, select the optimal solution through the greedy selection mechanism, and obtain the waypoints of the path network that satisfy the robot motion constraints. The multiple robot obtains a safe path network between the task set by connecting the waypoints. That is, it maintains the strong global search ability of the ABC algorithm, and at the same time solves the problem of the algorithm falling into local optimum and poor robustness when facing the path planning problem of multiple robot clusters with multi-constraints and multi-tasks.

Description

technical field [0001] The invention relates to the technical field of intelligent control, in particular to a group path planning method based on variable dimension ABC algorithm. Background technique [0002] In recent years, with the development of computer technology and communication technology, intelligent robots are playing an increasingly important role in human society. Especially in dangerous environments and difficult environments, intelligent robots can replace humans to perform tasks, which reduces the danger of tasks and greatly increases the probability of successful completion of tasks. Pay attention to. The purpose of path planning is to generate a feasible path that satisfies the motion constraints and specific task constraints of intelligent individuals through their own environmental perception capabilities and search algorithms in known, partially known, or unknown environments. The main work of path planning is to establish the environment model of th...

AI Technical Summary

Problems solved by technology

[0004] Aiming at the deficiencies of the prior art, the present invention proposes a group path planning method based on the variable dimension ABC algorithm on the basis of the existing artificial bee colony algorithm, takes the path planning problem of the group system as the research object, and combines the ABC algorithm to solve multiple The ability of global optimization of variable function is fast, and according to the characteristics of the path planning problem of the group system, the Artificial Bee Colony Algorithm with Modified Dimensionality is proposed, that is, variable dimension ABC, which realizes the rapid optimization process of the path planning problem of the group system

Images