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

Mobile robot path planning method based on binary quanta particle swarm optimization

A quantum particle swarm and mobile robot technology, applied in the field of mobile robot path planning, can solve problems such as uncertain mobile robot path planning, and achieve the effect of simple process, good robustness, and easy realization

Inactive Publication Date: 2009-03-18
JIANGNAN UNIV
View PDF0 Cites 34 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the present invention is to overcome the deficiencies in the prior art, to provide a mobile robot that can solve the problem of generating obstacle avoidance paths in real time, can solve the path planning of mobile robots in uncertain environments, and can realize navigation and avoidance of mobile robots. Path planning method of mobile robot based on binary quantum particle swarm algorithm for obstacle problem

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
  • Mobile robot path planning method based on binary quanta particle swarm optimization
  • Mobile robot path planning method based on binary quanta particle swarm optimization
  • Mobile robot path planning method based on binary quanta particle swarm optimization

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0035] Embodiment 1: the mobile robot path planning method based on the binary quantum particle swarm algorithm of the present invention comprises the following steps:

[0036] 1. Simplify the robot into a point that can move in two-dimensional space. It can perceive its current posture and the position of obstacles through the visual system; and the obstacles that the robot can perceive are processed into two-dimensional space. Convex polygon.

[0037] 2. The person who determines the grid granularity according to the size of the robot itself is small, and uses the grid method to establish the environment model of the robot, that is, the discrete state space. The established style is as follows figure 1 ;

[0038] 3. Determine the encoding method of the eight directions in the discrete space, that is, use binary encoding, such as figure 2 ;

[0039] 4. Determine the objective function of the problem, that is, define the length of the path from the starting point to the ta...

Embodiment 2

[0052] Such as Figure 7 , 8 As shown, the working area of ​​the robot is a 16×16 moving space with obstacles, the starting point of the path is (1, 1), and the end point is (16, 16). In the algorithm, the particle population is set to 30, 4×4×16= 256, α is set to 0.6.

Embodiment 3

[0054] Such as Figure 9 , 10 As shown, the working area of ​​the robot is a 16×16 moving space with obstacles, the starting point of the path is (4, 12), the end point is (16, 16), and the particle population is set to 30 in the algorithm, 4×4×16= 256, α is set to 0.6.

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 mobile robot path planning method based on the binary quantum particle swarm optimization, which is characterized by comprising steps of 1, simplifying a robot into a point moving in a two-dimensional space, and then sensing the present position of the robot and the present positions of obstacles via the visual system, 2, processing all the obstacles sensed by the visual system of the robot into convex polygons, 3, discretizing the two-dimensional space into series grids, and performing binary encoding for eight probable motion directions of the robot at each grid, 4, defining the distance of the path between the starting point and the destination point as a target function required to be solved by the method, and 5, overall optimizing the target function in the step 4 by utilizing the binary quantum particle swarm optimization aiming to the discrete characteristics of robot path planning problems to obtain the optimum mobile robot path. The invention has the advantages of simple process, easy realizing, good robustness, high solving efficiency and the like.

Description

technical field [0001] The invention discloses a mobile robot path planning method based on binary quantum particle swarm algorithm. Background technique [0002] Path planning refers to finding a safe and collision-free path for the robot from the starting point to the target point, which is an important topic in the field of robotics. According to the understanding of environmental knowledge, it can be divided into path planning in known environment and unknown environment. Regardless of which category the robot path planning belongs to and which planning algorithm is used, the following steps must basically be followed: 1) Establish an environmental model, that is, abstract the real world where the robot lives and then establish a related model; 2) Search for a collision-free path , which is a search algorithm for finding qualified paths in the space of a certain model. For global path planning with known environmental information, there are many solutions, such as arti...

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
IPC IPC(8): G05D1/12G06N1/00G06N99/00
Inventor 孙俊方伟须文波奚茂龙蔡宇杰丁彦蕊陈磊
Owner JIANGNAN UNIV
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