Please use this identifier to cite or link to this item:
|Title:||Museum Route Planner|
|Authors:||Chong, Shuk Kwan|
|Department:||Department of Computer Science|
|Supervisor:||Supervisor: Dr. Li, Minming; First Reader: Dr. Wong, Duncan Shek; Second Reader: Dr. Lee, Chan Hee|
|Abstract:||Many people prepare the schedules when they are going to travel as they can visit the spots which they are hyped up and save the time on planning routines. Different computerized planners are implemented in the navigation systems and the online applications in order to help travelers to design their own journeys. However, there are less programs specified on the museums. Lots of museums in the world are roomy as spacious shopping malls. These museums collect the exhibits from distinct regions, diverse cultures and different eras. If travelers go to an exhibition with aimless heart, great number of precious objects will be missed. Therefore, travelers will sort the details about the collections which they expect to watch and allocate the time spent in the museums. However, gathering materials is time consuming and calculation manually is increasing the chance to get wrong. The preparation will be wasted if travelers have accidents. As a result, an automatic Museum Route Planner program is developed in this project. This convenient application can use in anywhere with instant responses. Furthermore, Dijkstra's algorithm, greedy algorithm and BFS will be applied in this newly constructed system so as to help the travelers to mediate a journey in museums. That is to say travelers can get more precise information about the exhibitions. A digital map is also provided to let the travelers located their positions and minimize the opportunity of getting lost in the museums. The following sections will mention the detailed design of the system and the information of the program implementation.|
|Appears in Collections:||Computer Science - Undergraduate Final Year Projects |
Items in Digital CityU Collections are protected by copyright, with all rights reserved, unless otherwise indicated.