Reducing Search Area in Indoor Localization Applications

Research on the Car Searching System in the Multi-Storey Garage with the RSSI Indoor Locating Based on Neural Network

“…The multi-story parking lot of a large-and medium-sized underground garage was selected as a subject to study the intelligent reverse car searching methods. The key technologies to be solved include parking location detection [27], license plate image location [28,29], license plate recognition [30], indoor location [31][32][33][34], indoor mapping simulation [35], path planning [36], etc.…”

“…The inaccessible point is defined as whether there is an inaccessible buildin other non-passable road, that divides the rectangular area into at least two parts target point and the current node as the vertices, and the target point and the point belonging to different areas, as shown in Figure 15. In Figure 15, in the process of searching from the starting point (22,5) to th point (13,32), the neighborhood passing point (17,11) of a certain point in the rec area formed by the neighborhood passing point and the target point, there is a b wall, (13,19) to (17,19), to divide the rectangular area into left and right parts. Th borhood pass points (17,11) and the target points (13,32) are divided into two unco areas in the rectangular area, then the spatial accessibility of the pass points in the gular area is updated and marked as unreachable, that is, the light green nodes in In Figure 14, the green invalid search area in the invalid search space is ca semi-closed structure space.…”

“…In Figure 15, in the process of searching from the starting point (22,5) to th point (13,32), the neighborhood passing point (17,11) of a certain point in the rec area formed by the neighborhood passing point and the target point, there is a b wall, (13,19) to (17,19), to divide the rectangular area into left and right parts. Th borhood pass points (17,11) and the target points (13,32) are divided into two unco areas in the rectangular area, then the spatial accessibility of the pass points in the gular area is updated and marked as unreachable, that is, the light green nodes in In Figure 14, the green invalid search area in the invalid search space is ca semi-closed structure space. When there is a semi-closed interface in the two-dime space formed by the point and the end point of the search neighborhood, the nod semi-closed structure are marked as unreachable points.…”

“…The process, after introducing unreachable nodes into the A* algorithm, is s Figure 16. In Figure 15, in the process of searching from the starting point (22,5) to the target point (13,32), the neighborhood passing point (17,11) of a certain point in the rectangular area formed by the neighborhood passing point and the target point, there is a building wall, (13,19) to (17,19), to divide the rectangular area into left and right parts. The neighborhood pass points (17,11) and the target points (13,32) are divided into two unconnected areas in the rectangular area, then the spatial accessibility of the pass points in the rectangular area is updated and marked as unreachable, that is, the light green nodes in Figure 15.…”