Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

A robot path planning method based on spider colony algorithm

A path planning and robotics technology, applied in instruments, two-dimensional position/channel control, vehicle position/route/altitude control, etc., it can solve the problems of poor convergence speed and poor search ability of SSO algorithm, so as to improve the convergence speed and The effect of search accuracy, stable convergence results, and reduced execution time

Active Publication Date: 2021-11-09
黎建军
View PDF5 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

The convergence speed and search ability of the current SSO algorithm are not good

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • A robot path planning method based on spider colony algorithm
  • A robot path planning method based on spider colony algorithm
  • A robot path planning method based on spider colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0046] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0047] Such as figure 1Shown, the robot path planning method of a kind of spider colony algorithm of the present invention comprises the following steps:

[0048] Step 1: Use the grid method to model the map environment, and set the starting node, target node, and obstacles;

[0049] Step 2: Initialize the basic parameters of the spider colony algorithm, including the population number N, the mating radius r, the maximum number of iterations T, and the minimum fitness value;

[0050] Step 3: randomly assign the initial spider population, and determine the current fitness value of each spider according to the fitness function;

[0051] Step 4: The spider population completes the cooperation process according to the learning strategy of the spider colony algorithm, generates new spider individuals, selects the better individuals in the new and old spide...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a robot path planning method for a spider swarming algorithm, which includes modeling the map environment by using a grid method, initializing the basic parameters of the spider swarming algorithm, randomly assigning the initial spider population, and completing the spider population according to the learning strategy of the spider swarming algorithm Cooperative process, output fitness value, judge whether the fitness value is less than the set minimum fitness value, output the shortest path and length. The present invention optimizes the neighborhood search and the global search by introducing the inertia weight and the learning factor, and increases the interaction between the inertia weight and the learning factor to balance the global search and local development capabilities of the method, and the convergence result of the improved method is more stable , improve the convergence speed and search accuracy, and realize the excellent shortest path planned.

Description

technical field [0001] The invention relates to a robot path planning method, in particular to a robot path planning method based on a spider colony algorithm. Background technique [0002] Path planning is one of the important fields of mobile robot research, and its advantages and disadvantages directly affect the interaction ability between the robot and the surrounding environment during the course of action. Generally speaking, the path planning problem can be described as: Given an environment with obstacles, the robot can autonomously find a path from the starting point to the goal point, which can avoid all obstacles safely and without collision. The shortest length. Since path planning can be regarded as an optimization problem in essence, intelligent optimization algorithms such as genetic algorithm, particle swarm optimization, artificial immunity, and ant colony algorithm with global optimization capabilities and implicit parallel computing characteristics play ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Patents(China)
IPC IPC(8): G05D1/02
CPCG05D1/0221G05D1/0223G05D1/0276
Inventor 黎建军李保保
Owner 黎建军
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com