Design And Implementation For Indoor Path Planning Algorithm In Complex Environment

As a new emerging technology, indoor path planning gains profits from the research of indoor vector map and the development of GIS technology. It can bring a new location service experience to the user, offer a service of path planning in a complex indoor environment. This thesis investigates indoor geographic features and proposes an indoor path planning algorithm based on the features.The main job of this thesis is 1) to analyze the features of indoor data by comparing with the data of outside environment;2) to design a store file format which can be adapted to the found data features;3) to propose an framework of indoor path planning based on the dividing of the whole path planning task;4) to development an Least Space Change Based Shortest Path Planning algorithm(LBSP) and finally;5) to run the simulation experiments and analyze the experiment results.Three contributions can be summarized:1) This thesis designs an ind file format which can store the information of indoor object and present the structure of indoor environment. An ind file is an xml file and the nodes in such kind file can be treated as a tree so it is convenent to search in the file.2) This thesis improves an indoor model by using it in a solo indoor object which can make it more adaptive to the indoor environment. This model can provide data for path planning in indoor environment.3) This thesis proposes a framework of indoor path planning and design an LBSP algorithm. The LBSP algorithm’s cost is low and can get a good result because it can use the indoor data’s feature to do the planning work, so LBSP is useful in indoor environment.