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

A Path Planning Method for Mobile Robots Fusing Membrane Computing and RRT

A mobile robot and path planning technology, applied in navigation computing tools, instruments, non-electric variable control, etc., can solve the problems of poor planning path rationality, purposeless search, single expansion node, etc., to avoid unreasonable path planning and Poor real-time performance, reasonable path, and increased search range

Active Publication Date: 2022-04-19
ANHUI UNIV OF SCI & TECH
View PDF0 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

However, the traditional RRT algorithm has a single expansion node, the node expansion rules are too random, and the search is not purposeful. In a complex environment, the algorithm has a large amount of calculation, and the rationality of the planned path is poor.

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 Path Planning Method for Mobile Robots Fusing Membrane Computing and RRT
  • A Path Planning Method for Mobile Robots Fusing Membrane Computing and RRT

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The present invention will be further explained below in conjunction with the accompanying drawings.

[0030] Such as figure 1 As shown, a mobile robot path planning method that fuses membrane computing and RRT includes the following steps:

[0031] Step 1: Initialize the starting waypoint X init , target waypoint X goal , the robot expands the step size ρ and the environment information;

[0032] Step 2: Initialize the membrane structure in membrane calculation as [[] 1 ,[] 2 ,[] 3 ,[] 4 ] 0 ;

[0033] Step 3: Take the starting point X init As the parent node, randomly generate four sampling points, and start from X init Take ρ as the expansion step to expand to each sampling point to form four new effective waypoints X new ;

[0034] Step 4: Combine the four valid waypoints i=1, 2, 3, 4, Indicates the first effective waypoint in the i-th basic membrane; it is evenly distributed among the four basic membranes, and the be regarded as the first waypoint...

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 relates to a mobile robot path planning method for fusion membrane calculation and RRT. Based on the original RRT algorithm, the method uses membrane calculation to optimize it, sets the membrane calculation structure, expands the random tree in each basic membrane, and increases the number of sampling points when the random tree expands in each basic membrane; The communication rules between membranes are used to update the corresponding relationship between the sampling points output by each basic membrane and its parent node, and the updated results are returned to the corresponding basic membrane to continue to expand the random tree. The random tree in the whole membrane system continues to expand iteratively until a random tree in a basic membrane reaches the end point and stops expanding. By increasing the number of sampling points and setting the exchange rules between the basic membranes, the method makes the expansion of the random tree in the membrane more directional, thereby increasing the real-time and rationality of the mobile robot's path planning.

Description

technical field [0001] The invention relates to the field of path planning for mobile robots, in particular to a path planning method for mobile robots that combines membrane calculation and RRT. Background technique [0002] With the continuous improvement of the intelligence of social production and life, the research and development and application of intelligent mobile robots have gradually been valued by people. Autonomous navigation technology is the core of mobile robot technology research. Good path planning is the key to realizing autonomous navigation of mobile robots. Intelligent and efficient path planning algorithms can enable mobile robots to navigate autonomously more accurately and reasonably. [0003] The main task of path planning is to plan a reasonable, collision-free path from the start point to the end point based on known environmental data. With the increase of mobile robot application scenarios, the environment becomes more and more complex, mobile ...

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/02G01C21/20
CPCG05D1/0223G05D1/0221G05D1/0276G01C21/20
Inventor 兰世豪黄友锐韩涛徐善永唐超礼
Owner ANHUI UNIV OF SCI & TECH
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