【作者】 周鹏；

【导师】 张骏；

【作者基本信息】 西北工业大学 ， 控制理论与控制工程， 2005， 硕士

【摘要】 本文主要目标是将高精度电子地图与即将成为未来手机标准的Java手机结合,为移动用户提供最短路径信息,实现个人不论是在固定场所还是在运动过程中,不论何时、何地,随时都可获最短路径信息服务。 为了实现此目标,本课题以Java手机和电子地图为基础,以得到最短路径为中心,重点讨论了地图方式最短路径的动态生成。围绕着如何提高服务器响应性能,如何提高最短路径的搜索速度,如何使得电子地图能用于路径寻优,以及怎样实现带有必经结点和避开结点约束条件的路径寻优展开了详细研究。具体工作如下: 1 设计了实现面向Java手机路径诱导业务的三层体系结构,探讨了每层需要实现的功能,分析了每层重点和难点。 2 实现了在手机上显示文本方式的最短路径和地图方式的最短路径,提供了保存最短路径,缩放、平移地图方式的最短路径的功能,完成了删除所有记录、删除选择的记录的功能,增加了下载进度显示和取消下载功能。 3 详细讨论了地图方式最短路径的动态生成,使用共享池技术研究了如何提高服务器响应性能。 4 使用人工智能中的启发函数思想对Dijkstra算法进行了改进研究;分析了电子地图不能直接用来路径寻优的原因,设计了合并路段算法与分解路段算法对电子地图中的路层进行了预处理:基于电子地图设计了映射算法来完成起点与终点到路网图的映射;研究了一类带必经结点和避开结点约束条件的路径寻优问题。更多还原

【Abstract】 The dissertation aims at providing shortest-path information for mobile user by combinating high accurate electronic map with Java mobile phone which is becoming the technology standard of mobile phone. So user can enjoy the shortest-path serve anytime and anywhere either at home or in the move.In order to achieve this, based on Java mobile phone and electronic map, with focusing on obtaining shortest-path, how to build a map containing shortest-path is discussed. Then some key problems are studied in detail, for example, how to improve the performance of server, how to decrease the search time of getting shortest-path, how to process electronic map to make it feasible for searching shortest-path and how to implement one kind of especial shortest-path with necessary locations and avoided locations. The following four finish the task above:1 Design a three-layer architecture to implement the road guidance service for Java mobile phone. Some functions need to be implemented in each layer are explored. Many emphasis and difficulties in each layer are analyzed.2 Finish displaying shortest-path with text format or map format in mobile phone. Some extra functions are provided: save shortest-path; pan and zoom map; delete all records and delete selected record; the progress to display downloading and cancel downloading.3 How to obtain a map containing shortest-path is discussed in detail. How to improve the performance of server with share-pool technology is studied.4 A kind of heuristic function in artificial intelligence is applied to make improvement on Dijkstra’s algorithm. The reason why electronic map unable to search shortest-path is analyzed, then an algorithm of connecting road and an algorithm of decomposing road are designed to process electronic map. Finish mapping starting point and end point to road network Based on electronic map. At last, one kind of special shortest path search algorithm is studied, that is some locations should go and some locations should be avoid are considered.更多还原