Computing and visualizing the shortest path between moving objects on road networks
- 所属单位：计算机科学与技术学院/人工智能学院/软件学院
- 发表刊物：Proc. IEEE Int. Conf. Mobile Data Manage.
- 摘要：Shortest path queries between two points on road networks are fundamental operators for many applications. In spite of extensive research having been conducted on processing two static points, little attention has been paid to deal with two moving objects on road networks. This is a challenging issue because the shortest path varies when the locations of objects change. To solve the problem, we develop a system with the functionality that efficiently returns a group of shortest paths at different time intervals. We aim to continuously report the shortest path between two moving objects. The variable paths are visualized in the user interface such that one can be clearly noticed how the path changes over time. Real datasets Nanjing roads are used in the demonstration. The technique can be used for analyzing historical movements of objects. © 2019 IEEE.
- ISSN号：1551-6245
- 是否译文：否
- 合写作者：Chen, Siyu,Zhang, Hengcai
- 通讯作者：许建秋
- 发表时间：2019-06-01