位置知覺導引系統之設計與排程

Abstract

近年來，隨著具有偵測位置功能的感應器逐漸廣布，以及位置知覺計算日益流行，位置知覺的應用程式已經漸漸融入成為日常生活的一部份。位置知覺的應用程式琳瑯滿目，主要分為幾個領域，包括為醫療目的、緊急事件定位、事物的找尋（例如尋找最近的印表機）、旅遊和博物館導引系統、活動企劃，以及追蹤親友動向和輔助會議討論等應用在社交網路上的程式。在本文中，我們將探討建置在旅遊地區或大型博物館裡的導引系統。通常在一個大型的遊樂園或是博物館中，遊客很容易遇到一個惱人的問題：如何到達想去的地方以及何時前往可以減少等待的時間。 根據每位遊客所在的位置，我們將設計一個導引系統模式，並且提出一個有效率的分散式演算法來解決上述問題。我們的演算法將應用到排隊理論，以及將位置的因素列入考慮。最後，透過系統模擬的方式來驗證我們提出的演算法之效能。實驗結果顯示我們的演算法提高了系統的效率，並且確實減少了遊客等候的時間。

The location-aware computing is now prevalent and the widespread deployment of sensing technologies will make location-aware applications part of everyday life. Location-aware applications are very various and primarily categorized into several fields including thing-finder, tour and museum guides, event planner, buddy tracking and conference aids for people’s social network, and medicine or emergency purposes. In this thesis, we focus on the location-aware applications in tour and museum guides. When visitors come to a place like a large museum or an amusement park, the annoying problem they usually confront is how to know which way to go and when to go, so that they do not have to waste time in waiting or going to the wrong way. Based on the locations where the customers are, we design the scenario of the guide system and purpose a distributed scheduling algorithm which tells the customers the destinations to go and solves the problem stated above. Our algorithm takes queueing theory and location parameter into consideration, and we evaluate its performance via simulations. The results show that our algorithm performs well and efficiently in the location-aware environment and indeed reduces the waiting for the customers.