An Optimized Dijkstra Algorithm Based On Mobile GIS And Applied Research

GIS is a spatial data-based information management system, it plays an importantrole in urban planning, geological exploration, vehicle navigation, etc. In recent years,with the rapid development and popularization of smart mobile devices, theintegration research of GIS+GPS+wireless network, which is mobile GIS (MobileGIS), has become a popular and important research direction of GIS field, it addressesthe problem of using the mobile terminal to get space information services.Spatial information analysis Mobile GIS is an important step in spatialinformation operations and process, the optimal path problem is the key of theanalysis, which has important application values in many ways. Therefore, it isnecessary to deeply study the optimal path algorithm. This thesis makes a deepresearch and analysis on the currently more mature Dijkstra algorithm, optimizes itsinsufficiency of time complexity too high, which is applied in the combination ofMobile Widget and Mobile Map widget of Google Maps API. In this thesis, the mainwork and innovations are as follows:1. Deeply study the related concept and storage structure of computer algorithms,based on this, make research and analysis on the common optimal algorithm anddo a comparative analysis.2. Research on Mobile GIS technology, which is the theoretical basis for this study.3. Research on Mobile widget technology, which is the form and structure basis ofthe designed mobile GIS applications.4. Research on Google Maps JavaScript API, add your own business logic,customize their visit and browse the Google Map rules without building their ownmap server.5. Come up with an optimal scheme for the blindness of the Dijkstra algorithm in the search process, leaving only the optimal path from the source to the end, and toimprove during the search process.6. Establish the minimum cost path search model and apply the model to the MobileMap Widget.The optimal scheme studied in this thesis has been proved to bepractical to reduce the time complexity of algorithm through the comparisonbetween the optimized Dijkstra algorithm and the traditional Dijkstra algorithm,which confirms the reasonability and feasibility of this research and proves thepotential applications in the field of mobile GIS.