| The development of economic has promoted the the improvement of people’s living standards and the car in the cities are becoming more and more, which spawned many large-scale shopping malls, airports, theaters, etc, and the scale of its related parking lot has grown a lot. The parking lot whose quantity and scale are huge has solved the parking problem, but bring people another problem:it’s hard to find the car. Therefore the demand of finding the car in a parking lot has reversed,. Many company has done a lot to try and brought a variety of solutions such as credit card based searching, video based searching etc. They all have advantages and disadvantages. Some of them are low accuracy, and some of them have higher implementation costs, thus they are not perfectly effective solutions to this problem.First of all, describes the background and significants of reversed car searching in a underground parking lot, and analyzes the research status and trend in the field of reversed car searching in order to give the need of reversed car searching system. Introduces the basics of data structure especially the theory about the map, and gives the detailed description of principles and steps of Dijkstra algorithm and it’s implementation with Java code. The theories are the basic of reversed car searching.Secondly analyzes the characteristics of underground parking lot briefly, and presents a new map design for underground parking lot, and also details the design. The design can be abstracted into the graphical model so the graphical theory can be used. Introduces the tmx map format and how to use the Tile Map Editor to get the tmx map. Introduces how to convert the tmx map to the map presented in this paper.Finally based on the proposed map design, the paper gives a convertion algorithms about the map presented in this paper. Gives the-design and implementation of reversed car searching system which includes the server side and the client side and then introduces the functions of parts of the system. |