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

A multi-robot path planning method and device

A path planning, multi-robot technology, applied in instruments, motor vehicles, transportation and packaging, etc., can solve problems such as deadlock, and achieve the effect of avoiding algorithm failure

Active Publication Date: 2022-03-15
ZHEJIANG UNIV
View PDF8 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0004] The purpose of the embodiment of the present application is to provide a multi-robot path planning method and device to solve the problem of deadlock in the related art where multiple robots run in the channel

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 multi-robot path planning method and device
  • A multi-robot path planning method and device
  • A multi-robot path planning method and device

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0033] Reference will now be made in detail to the exemplary embodiments, examples of which are illustrated in the accompanying drawings. When the following description refers to the accompanying drawings, the same numerals in different drawings refer to the same or similar elements unless otherwise indicated. The implementations described in the following exemplary embodiments do not represent all implementations consistent with this application. Rather, they are merely examples of apparatuses and methods consistent with aspects of the present application as recited in the appended claims.

[0034] The terminology used in this application is for the purpose of describing particular embodiments only, and is not intended to limit the application. As used in this application and the appended claims, the singular forms "a", "the", and "the" are intended to include the plural forms as well, unless the context clearly dictates otherwise. It should also be understood that the term...

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

This application discloses a multi-robot path planning method and device, which belong to the technical field of robot path planning. The A* algorithm is used to plan an optimal path for a single robot in the intersection graph environment; according to the optimal path, plan all passages in the intersection graph environment as one-way streets; for the one-way Road, through the heuristic A* algorithm, plan the quadratic optimal path for a single robot in the intersection graph environment; for the quadratic optimal path, rebuild the grid environment to obtain the grid The optimal path in grid environment. Solve the shortcomings of traditional heuristic algorithms that cause deadlock due to robot conflicts in the channel.

Description

technical field [0001] The present application relates to the technical field of robot path planning, in particular to a multi-robot path planning method and device. Background technique [0002] The multi-robot path planning problem is a problem that has been studied for many years, and the high complexity of solving this problem is caused by the conflict between robots. The traditional algorithm models the environment with an integer programming model, and uses the conflict between robots as a constraint to optimize the solution. This is a tedious and tedious process. When the scale of the environment increases, the complexity of solving the integer programming model will be one The process of increasing exponentially will occupy a large amount of computer resources, resulting in a further decrease in computing speed. In recent years, some heuristic algorithms have been proposed to reduce the complexity of solving multi-robot path planning models. The core of these heuri...

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/0217G05D1/0221G05D2201/0217
Inventor 郑荣濠霍嘉熹刘妹琴张森林
Owner ZHEJIANG 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