Local Path Planning with Multiple Constraints for USV Based on Improved Bacterial Foraging Optimization Algorithm

نویسندگان

چکیده

The quality of unmanned surface vehicle (USV) local path planning directly affects its safety and autonomy performance. USV might easily be trapped into optima. swarm intelligence optimization algorithm is a novel effective method to solve the path-planning problem. Aiming address this problem, hybrid bacterial foraging with simulated annealing mechanism proposed. proposed preserves three-layer nested structure, incorporated outermost dispersal operator. can effectively escape Convention on International Regulations for Preventing Collisions at Sea (COLREGs) rules dynamic obstacles are considered as constraints design different obstacle avoidance strategies USVs. coastal port selected working environment in visual test platform. experimental results show successfully avoid various port, efficiently plan collision-free paths.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Sub-transmission sub-station expansion planning based on bacterial foraging optimization algorithm

In recent years, significant research efforts have been devoted to the optimal planning of power systems. Substation Expansion Planning (SEP) as a sub-system of power system planning consists of finding the most economical solution with the optimal location and size of future substations and/or feeders to meet the future load demand. The large number of design variables and combination of discr...

متن کامل

PSO-Based Path Planning Algorithm for Humanoid Robots Considering Safety

In this paper we introduce an improvement in the path planning algorithm for the humanoid soccer playing robot which uses Ferguson splines and PSO (Particle Swarm Optimization). The objective of the algorithm is to find a path through other playing robots to the ball, which should be as short as possible and also safe enough. Ferguson splines create preliminary paths using random generated para...

متن کامل

A Novel Image Segmentation Method Based on An Improved Bacterial Foraging Optimization Algorithm

When some bionic optimization algorithms are used for image segmentation, we find that the search speeds of these algorithms are slow and the local searching abilities of these algorithms need be improved. In order to solve these problems, this paper proposed a new image segmentation method based on the improved bacterial foraging optimization algorithm. Firstly, a dynamic step size is used to ...

متن کامل

Optimization Planning based on Improved Ant Colony Algorithm for Robot

As the ant colony algorithm has the defects in robot optimization path planning such as that low convergence cause local optimum, an improved ant colony algorithm is proposed to apply to the planning of path finding for robot. This algorithm uses the search way of exhumation ant to realize the complementation of advantages and accelerate the convergence of algorithm. The experimental result sho...

متن کامل

Continuous Path Planning with Multiple Constraints ∗

We examine the problem of planning a path through a low dimensional continuous state space subject to upper bounds on several additive cost metrics. For the single cost case, previously published research has proposed constructing the paths by gradient descent on a local minima free value function. This value function is the solution of the Eikonal partial differential equation, and efficient a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Marine Science and Engineering

سال: 2023

ISSN: ['2077-1312']

DOI: https://doi.org/10.3390/jmse11030489