Path programming method and apparatus

A path planning and path technology, applied in the field of navigation, can solve the problems of a large number of search nodes, high search efficiency, and low search efficiency.
CN106556402AInactive Publication Date: 2017-04-05ALIBABA (CHINA) CO LTD

Patent Information

Authority / Receiving Office
CN Β· China
Current Assignee / Owner
ALIBABA (CHINA) CO LTD
Publication Date
2017-04-05
Estimated Expiration
Not applicable Β· inactive patent

Smart Images

  • Figure 1
    Figure 1
  • Figure 2
    Figure 2
  • Figure 3
    Figure 3
Patent Text Reader

Abstract

The invention discloses a path programming method and apparatus. The method comprises the following steps: rising a current map layer if a distance between a current search position and a path end point position is greater than or equal to a first distance threshold, and searching a path from the current search position to the path end point position according to navigation data corresponding to the risen map layer; searching a path from the current search position to the path end point position according to navigation data corresponding to the current map layer if a distance between the current search position and the path end point position is less than the first distance threshold and is greater than or equal to a second distance threshold; and lowering the current map layer if a distance between the current search position and the path end point position is less than the second distance threshold, searching a path from the current search position to the path end point position according to navigation data corresponding to the lowered map layer if the lowered map layer is a lowest map layer, and searching a path from the current search position to the path end point position according to the navigation data corresponding to the lowered map layer if the lowered map layer is not the lowest map layer.
Need to check novelty before this filing date? Find Prior Art

Description

technical field

[0001] The invention relates to the technical field of navigation, in particular to a path planning method and device. Background technique

[0002] The general path planning method in the field of navigation is the A* algorithm, which is the most effective method for solving the shortest path in the static road network.

[0003] The A* algorithm formula is expressed as: f(n)=g(n)+h(n), where f(n) is the evaluation function from the initial node to the target node via n nodes, and g(n) is the value in the state space The actual cost from the initial node to n nodes in h(n) is the estimated cost of the best path from n nodes to the target node. The key to ensure the condition of finding the shortest path (optimal solution) lies in the selection of the evaluation function f(n). Since g(n) in the evaluation function f(n) is fixed, the key actually lies in the selection of h(n) :

[0004] If the estimated distance value h(n) is less than or equal to the actual...

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