Research On Indoor Location And Navigation Technology Based On Ibeacon Equipment

With the pace of urban modernization faster and faster,in the city,high-rise buildings,one after another erected on the ground,and the structure and design of these buildings are more and more complex.Not only that,with the pace of modern life faster and faster,the city population in the room to stay more and more time.In this way,people's enthusiasm for understanding the interior environment becomes high.Outdoor navigation has long been the development of mature,you can basically meet the vast majority of navigation requests,but the indoor navigation is a very new area.Although there are already many companies in the development of indoor navigation technology,but after all,this is a newly developed area,indoor navigation technology is still a lot of shortcomings.3-circle positioning and centroid positioning algorithm is more commonly used in the indoor positioning algorithm,but because the wireless signal in the process of indoor transmission will have a certain attenuation,so these positioning algorithms will be some error.In this paper,we first improve the positioning error by filtering out the error information,and then propose the improved multi-circle localization algorithm on the basis of 3-circle positioning.At the same time,we add the weighted centroid algorithm to the improved localization algorithm.Effectively improve the positioning accuracy.Compared with the traditional positioning algorithm,the improved positioning algorithm can limit the positioning error within 4 meters.Compared to the traditional positioning algorithm,this algorithm is more stable.Indoor positioning is ultimately prepared for indoor navigation.In the indoor navigation,the most used algorithm on the number of Dijkstra algorithm and A * algorithm friends.Compared with the Dijkstra algorithm,the A * algorithm adds the evaluation function.The evaluation function makes the A * algorithm not to extend the surrounding nodes all the way,just to evaluate the surrounding nodes,and then find the node with the smallest evaluation value as the Dijkstra algorithm Extended.This results in a significant reduction in the number of nodes that are extended to improve efficiency.However,after analyzing the idea of the A * algorithm,it was found that the time wasted in the A * algorithm was primarily used to find the smallest point of the evaluation and to handle a very large grid map.Based on this,the paper first proposes a strategy to increase the direction control on the basis of the A * algorithm,so the algorithm will reduce the number of access nodes and improve the efficiency of the algorithm.In addition,the paper applies the A * algorithm commonly used in the grid map to the undirected graph,which can greatly reduce the complexity of the map by using the undirected graph to abstract the specific position of the map into the node in the undirected graph.In addition,taking into account the indoor path is generally regional(that is,the regional block in the node and the road is relatively dense,but between the region and the region is relatively sparse.),So the paper also proposed map hierarchical strategy.If the start node and the termination node are in different area blocks,then the use of map hierarchical and hard-coded policies can greatly speed up the pathfinder process.