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

A Pathfinding Algorithm for Generating Paths from Indoor Floor Plans

A technology of floor plan and path, applied in the field of indoor navigation, to achieve the effect of strong versatility, optimized path, and wide application

Active Publication Date: 2022-02-18
JIANGSU JINGE NETWORK TECH
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

But at the same time, indoor navigation technology is still in the development stage

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 Pathfinding Algorithm for Generating Paths from Indoor Floor Plans
  • A Pathfinding Algorithm for Generating Paths from Indoor Floor Plans
  • A Pathfinding Algorithm for Generating Paths from Indoor Floor Plans

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0038] Embodiment 1, a pathfinding algorithm for generating a path from a planar graph, the steps are as follows:

[0039] 1) Digitize the plan to obtain the coordinate set of the obstacle package;

[0040] 1-1) Establish a scale and grid the plan.

[0041] 1-2) Identify the boundary of the obstacle through image processing, and calculate the coordinate points inside the obstacle.

[0042] 2) Obtain coordinate points that can be used as paths;

[0043] 2-1) Eliminate the coordinate points located inside the obstacle from all the coordinate points in the plan view, and obtain the coordinate point set {A} that can be used as a path.

[0044] 3) Determine whether there is a convenient path between the current point and the end point;

[0045] 3-1) Calculate the horizontal and vertical rays for the current point and the end point respectively;

[0046] 3-2) Determine whether the ray at the current point intersects with the ray at the end point. Otherwise, do another ray for e...

Embodiment 2

[0058] Embodiment 2, with reference to Figure 1-7 , the operation experiment carried out with the path-finding algorithm of generating path by planar graph of the present invention, comprises the following steps:

[0059] Step 101, digitize the floor plan to obtain the coordinate set of obstacle parcels, refer to figure 2 , including the following steps:

[0060] Step 201, establishing a scale;

[0061] Step 202, gridding the plan view;

[0062] Step 203, judging whether the coordinate point is an obstacle boundary, if yes, proceed to step 204, otherwise proceed to step 205;

[0063] Step 204, count the points into the set;

[0064] Step 205, judging whether the traversal is complete, if yes, proceed to step 206, otherwise proceed to step 203;

[0065] Step 206, calculate the coordinate points contained in the obstacle, and include them in the set {B}.

[0066] Step 102, obtain the coordinate points that can be used as the path. refer to image 3 , including the foll...

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 generation algorithm based on a planar graph, which belongs to the field of indoor navigation. The present invention first digitizes the plan to obtain the coordinate set wrapped by obstacles; secondly obtains the coordinate points that can be used as paths; then judges whether there is a convenient path between the current point and the end point; then advances to the next best point and repeats the calculation to reach the end point So far; and then optimize the generated path to remove redundant parts. Finally, the optimized path is displayed on the plan view. The pathfinding algorithm of the present invention for generating paths from planar graphs can be widely applied to different indoor structures and has strong versatility. This technology can automatically generate a more optimized path.

Description

technical field [0001] The invention belongs to the field of indoor navigation, and in particular relates to a path-finding algorithm for generating a path from an indoor plan view. Background technique [0002] With the popularity and intelligence of mobile terminals, the outdoor navigation technology on mobile terminals has become very mature. But at the same time, indoor navigation technology is still in the development stage. With the construction of various large-scale commercial centers, trade centers, and office buildings, the demand for indoor navigation is increasing day by day. In order to provide technical support for indoor navigation, a pathfinding algorithm that generates paths from indoor floor plans was developed. The path-finding algorithm that generates the path from the indoor floor plan can efficiently calculate the optimal path from the starting point to the destination. [0003] A pathfinding algorithm for generating paths from indoor floor plans can...

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): G01C21/20
CPCG01C21/206
Inventor 陈永江陈宗华
Owner JIANGSU JINGE NETWORK TECH