Earticle

초록

영어

As ubiquitous computing technology convergences into many industrial domains, most museums want to apply this technique to their domain. However, most ubiquitous museums merely provide the simplest service giving visitors only static information of artifact. To resolve limitations of the existing ubiquitous museums, we had proposed Visitor Preference based Museum Viewing Search Algorithm that provides the best path for visitors to reflect their preferences. However, since the Visitor Preference based Museum Viewing Search Algorithm did not consider abnormal situations that occur while visitors look at the exhibit.
So when abnormal situations occur, the exhibition may cause congestion problems that may make visitors feel very uncomfortable. In this paper, we propose an efficient congestion avoidance algorithm to solve these problems. This algorithm automatically re-finds proper alternative paths for avoiding congestion resulting from the abnormal ones occurring during the museum viewing. The proposed algorithm improves comfortable museum viewing services by preventing congestion in advance when exceptional conditions occur. For the experiment of the proposed algorithm, we show that the algorithm can provide the best path to reduce the impact of museum sightseeing crowdedness well even in exceptional conditions.

목차

Abstract
 1. Introduction
 2. Related Work
 3. Visitor Preference based Museum Viewing Search Algorithm
 4. Congestion Control Algorithm
 5. Experiments
 6. Conclusion
 References

키워드

저자

• Yoondeuk Seo [ Department of Computer Science, Kyonggi University ]
• Jinho Ahn [ Department of Computer Science, Kyonggi University ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Advanced Science and Technology

• 간기

  월간

• pISSN

  2005-4238

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605