Unlock instant, AI-driven research and patent intelligence for your innovation.

Method and system for vehicle path planning

A vehicle routing and planning system technology, applied in the computer field, can solve the problems that it is difficult to avoid vehicle path crossing and collision, low efficiency, waiting for each other, etc.

Active Publication Date: 2017-05-10
BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD
View PDF5 Cites 6 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Dijkstra's algorithm can get the optimal solution of the shortest path, but because it traverses a lot of nodes, the efficiency is low
[0004] In the case of a large number of vehicles, due to the deterministic and widespread distribution of orders, although the solution is to solve the shortest path for vehicles to walk, it is difficult to avoid excessive intersections and collisions in the vehicle path
Too many vehicle intersections lead to the need to wait for each other, which is inefficient

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
  • Method and system for vehicle path planning
  • Method and system for vehicle path planning
  • Method and system for vehicle path planning

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0015] Other aspects, advantages and salient features of the present invention will become apparent to those skilled in the art from the following detailed description of exemplary embodiments of the present invention when taken in conjunction with the accompanying drawings.

[0016] In the present invention, the terms "include" and "comprising" and their derivatives mean to include but not limit; the term "or" is inclusive, meaning and / or.

[0017] In this specification, the following illustrations of various embodiments are used to describe the principles of the present invention and should not be construed as limiting the scope of the invention in any way. The following description with reference to the accompanying drawings is provided to assist in a comprehensive understanding of exemplary embodiments of the present invention as defined by the claims and their equivalents. The following description includes numerous specific details to aid in understanding, but these shou...

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 method for vehicle path planning. The method comprises the following steps: dividing a vehicle driving area into at least one subarea and setting an end point in each subarea; calculating a vehicle driving path in each subarea, so that a vehicle distributed to each subarea only moves in the subarea and finally reaches a subarea end point.

Description

technical field [0001] The invention relates to the field of computers, in particular to a method and system for vehicle path planning. Background technique [0002] At present, the automatic guided vehicle (AGV) has been widely used as a method of goods-to-person application. Amazon's kiva system is a classic case in this regard. However, in a large number of AGV applications, traffic scheduling has always been a very complicated problem, and how to efficiently improve scheduling efficiency has always been a problem of continuous optimization. [0003] At present, for the method of AGV path planning, most of them adopt the method of the shortest path. It mainly expands outward layer by layer with the starting point as the center until it reaches the end point. Dijkstra's algorithm can get the optimal solution of the shortest path, but it is inefficient because it traverses and calculates a lot of nodes. [0004] In the case of a large number of vehicles, due to the certa...

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): G01C21/34
CPCG01C21/3446
Inventor 汤敬仁秦恒乐
Owner BEIJING JINGDONG QIANSHITECHNOLOGY CO LTD