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

Path planning method and device, storage medium and equipment

A path planning and routing technology, which is applied in the field of path planning and logistics path planning, can solve the problems that single-machine multi-core computing power cannot meet the needs and insufficient computing power, and achieve the effect of improving algorithm computing power and solving computing bottlenecks

Inactive Publication Date: 2019-06-21
SF TECH
View PDF7 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

In the actual problem of path planning, the single-machine multi-core parallel algorithm architecture has the problem of insufficient computing power; when the number of task sets is greater than about 400, the single-machine multi-core computing power can no longer meet the needs

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
  • Path planning method and device, storage medium and equipment
  • Path planning method and device, storage medium and equipment
  • Path planning method and device, storage medium and equipment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] In order to better understand the technical scheme of the present invention, below in conjunction with the attached Figure 1-2 The present invention is further described.

[0030] Usually, the operating structure of path planning is a single-machine multi-core parallel algorithm architecture, such as figure 1 shown. After the algorithm iterator receives the waybill demand, it uses a large-scale neighborhood search algorithm to obtain a better solution for the route, and the better solution returns to the algorithm iterator for cyclic calculation until the iteration ends. However, due to the huge amount of information and quantity of the waybill, the single-machine multi-core parallel algorithm architecture has a serious defect of insufficient computing power.

[0031] Such as figure 2 As shown, firstly, a first route set is generated according to each waybill. Calculate the set of all waybills to be dispatched through the greedy algorithm. After each waybill gets ...

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 path planning method and device, a storage medium and equipment. The method comprises the steps that first path sets are generated according to waybills; the first route setsare distributed to a plurality of algorithm iterators, and the algorithm iterators carry out destroying and reconstruction on random routes for a plurality of times to obtain second route sets and transmit the second route sets to an algorithm coordinator; and the algorithm coordinator performs self-adaptive processing on each second route set to obtain a third route set, and outputs the third route set as a route planning result. The device, the storage medium and the equipment are used for realizing the method. The algorithm calculation capability is improved, and the calculation bottleneckof the VRP (path planning problem) is solved.

Description

technical field [0001] The invention relates to the field of route planning in logistics, in particular to a route planning method, device, storage medium and equipment. Background technique [0002] In the algorithm in the field of path planning, the single-machine multi-core maximum neighborhood search architecture is usually used. In the actual problem of path planning, the single-machine multi-core parallel algorithm architecture has the problem of insufficient computing power; when the number of task sets is greater than about 400, the single-machine multi-core computing power can no longer meet the needs. Contents of the invention [0003] In order to solve the above technical problems, the present invention proposes a path planning method, device, storage medium and equipment, which improves the calculation capability of the algorithm and solves the calculation bottleneck of the VRP (path planning problem). [0004] In order to achieve the above object, the technic...

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): G01C21/20
Inventor 高磊王宇邝展豪刘志欣杨志伟喻东武胡奉平孔晨
Owner SF 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