QR code-based indoor positioning and routing panorama guiding method
An indoor positioning and two-dimensional code technology, which is applied in the field of indoor positioning and routing panoramic guidance based on two-dimensional codes, can solve problems such as excessive traffic costs, inappropriateness, and failure of navigation technology to achieve low traffic consumption and targeted Strong and make up for the effect of positioning inaccuracy
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0023] Such as figure 1 As shown, the present invention provides a two-dimensional code-based indoor positioning and routing panoramic guidance method, the method comprising:
[0024] The present invention includes a navigation interface (that is, an interactive interface) and a transit interface (that is, corresponding to location information, but does not participate in interaction). The user of this method scans the two-dimensional code posted by this service through any application of the two-dimensional code scanner, and then Jump to the transit interface with the location information, and jump to the navigation interface carrying the location information through the transit interface.
[0025] In the navigation interface, use JQuery and CSS technology to design a div container to accommodate the panorama, and it can respond to the drag display function of the panorama. This container is placed in the center of the main interface (that is, the interactive interface). A ...
Embodiment 2
[0030] Core algorithm functions, including:
[0031] 1. Pseudocode of the shortest path algorithm:
[0032]
[0033]
[0034] Concrete technical scheme of the present invention comprises:
[0035] Routing algorithm: The route map of the commercial area can be stored in the form of adjacency matrix, and the d[][] matrix stores the path distance. For example, there is a path with distance w between i and j, then d[i][j]=w. The previous closest node of each path node is stored in the path[][] matrix, for example, k is the closest node to j on the path from i to j, then path[i][j]=k.
[0036] The first half of the present invention is the initialization of d matrix and path matrix, and the second half is the gradual correction of d and path. Between any pair of nodes i and j, if there is a shorter path under the premise of the initialization and the last revised path, then enter the correction: d[i][j]=d[i][k]+d[ k][j]; path[i][j]=path[k][j];. Until the correction is co...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
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