On-the-fly Fastest Path Computation in Event Dependent Network

• Main Authors: Jyun-NanLiu, 劉俊男
• Other Authors: Da-Wei Chang
• Format: Others
• Language: en_US
• Published: 2012
• Online Access: http://ndltd.ncl.edu.tw/handle/67652999193015037371

碩士 === 國立成功大學 === 資訊工程學系碩博士班 === 100 === In recent years, the fastest path algorithms were applied on the navigation. However, existing algorithms have two disadvantages. One is repeated computation, and the other is long response time or inaccurate results on large networks. Hence, they are not suitable for emergency related systems. But, the problems can be solved by pre-computation if the network is predictable. Unfortunately, the networks are unpredictable in an emergency condition. To address this, real-time re-computation is performed when the network is changed. The contributions of this study are to propose the event-dependent network model and to reduce the response time of computing the accurate fastest path. The response delay is re-computation time because we cannot provide the correct fastest paths on the process of re-computation. For reducing the re-computation time, our method focuses on reducing the input size by critical region finding and re-computing. Besides, a method is proposed to avoid long response time due to a large critical region. The results show that, the proposed methods improve the response time by 20-70times.