Mobile robot full-coverage path planning method, chip and robot

A mobile robot and path planning technology, applied in the field of intelligent robots, can solve problems such as reducing user experience, affecting work efficiency, and increasing calculation time, so as to improve coverage efficiency, reduce calculation complexity, and reduce the time required for calculation. Effect

Pending Publication Date: 2020-12-11
AMICRO SEMICON CORP
View PDF0 Cites 5 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

When the dimension of the problem increases, the calculation time required to solve the problem will increase sharply, which causes the robot to spend more time on path planning, which affects work efficiency, and it is not so intelligent, reducing the user's efficiency. Experience

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 full-coverage path planning method, chip and robot
  • Mobile robot full-coverage path planning method, chip and robot
  • Mobile robot full-coverage path planning method, chip and robot

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0020] The technical solutions in the embodiments of the present invention will be described in detail below with reference to the drawings in the embodiments of the present invention. It should be understood that the specific embodiments described below are only used to explain the present invention, not to limit the present invention.

[0021] In the following description, specific details are given to provide a thorough understanding of the embodiments. However, one of ordinary skill in the art would understand that the embodiments may be practiced without these specific details. For example, circuits may be shown in block diagrams in order not to obscure the embodiments in unnecessary detail. In other instances, well-known circuits, structures and techniques have not been shown in detail in order not to obscure the embodiments.

[0022] The robot described in the embodiment of the present invention can be an intelligent mobile robot such as a sweeping robot, a lawn mowin...

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 full-coverage path planning method, a chip and a robot, and the method comprises the following steps: S1, the robot detects an obstacle in a cleaning region, generates a map containing obstacle information, and divides the map into a plurality of sub-blocks; S2, the robot plans a cleaning path in the sub-block; and S3, the robot determines the initial sub-blocks and performs cleaning, then calculates the path cost between the sub-blocks, selects the next cleaning sub-block according to the path cost, and cycles the step until cleaning of all the sub-blocks is completed. According to the new full-coverage path planning method, the calculation complexity can be reduced, and the coverage efficiency of the robot is improved.

Description

technical field [0001] The invention relates to the field of intelligent robots, in particular to a mobile robot full-coverage path planning method, chip and robot. Background technique [0002] At present, for full-coverage robots, such as sweepers, lawn mowers, window cleaners, mine-clearing robots, etc., it is necessary to cover all places that the robot can reach with the shortest path. The full coverage method is generally a traveling salesman (NP-hard) problem, which needs to be solved, given a series of cities and the distance between each pair of cities, to solve the shortest circuit that visits each city once and returns to the starting city . When the dimension of the problem increases, the calculation time required to solve the problem will increase sharply, which causes the robot to spend more time on path planning, which affects work efficiency, and it is not so intelligent, reducing the user's efficiency. Use experience. Based on this, it is necessary to dev...

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 Applications(China)
IPC IPC(8): G05D1/02
CPCG05D1/0221G05D1/0276
Inventor 陈卓标周和文孙明黄惠保
Owner AMICRO SEMICON CORP
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

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

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap