An indoor three-dimensional space real-time path navigation method and navigation system
A real-time path and navigation method technology, applied in the field of indoor navigation, can solve the problem of not being able to find the destination correctly and quickly, and achieve the effect of saving time and avoiding congestion
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0061] combine Figure 2-3 , this embodiment describes step S11 in detail, which specifically includes the following steps:
[0062] S111: converting the indoor floor plan into data in a preset format;
[0063] S112: Three-dimensionalize the data to obtain three-dimensional data;
[0064] S113: Establish a three-dimensional grid model according to the three-dimensional data;
[0065] S114: Set connectivity for the 3D mesh model, that is, passable and impassable.
[0066] Among them, step S111 is specifically: using CAD plan drawings, retaining the contour lines of indoor planes, doors, stairs and obstacles (including pillars, walls, furniture and other obstacles), and converting them to the format obtained by geographic information system software (ArcMap): .shp data, and correct the incorrectly converted data by vectorization; then convert the converted data into area features through ArcMap, so as to facilitate the setting of the connectivity of the 3D grid model.
[006...
Embodiment 2
[0072] combine Figure 4-5 , another method of S12 is described in detail in this embodiment, which includes the following steps:
[0073] S1201: Calculate the grid A where the starting point is located according to the location information of the starting point, and store the grid A in the open list;
[0074] S1202: Find reachable grids around grid A, store the reachable grids in the open list, and set the parent grid of the reachable grids as grid A;
[0075] S1203: Delete grid A from the open list, and add grid A to the close list;
[0076] S1204: Select the grid with the lowest objective function value in the open list, delete the selected grid B from the open list, and add it to the closed list; wherein, the objective function is:
[0077] F=(1+a)*G+H
[0078] In the formula, G represents the time-consuming movement from grid A to the designated grid along the generated path; H represents the time-consuming movement from the designated grid to the destination; a repres...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More 


