• Journal of the Korean Society of Safety
• /
• v.29 no.1
• /
• pp.59-63
• /
• 2014

Smoke is one of the most critical factor when escaping from the fire since it reduces visibility and interrupts finding emergency exit lights. Therefore, it is recommended that an evacuation simulation program should incorporate the smoke factor. In addition, it is suggested that the program should include not only the unilateral damage by the smoke but also the detour evacuation by risk communication. In this study, MAS (Multi Agent System)-based simulation program which incorporates the reduced walking speed by smoke and adopts the dispersion evacuation logic during escaping from the fire. To make comparison, a commercial evacuation program, Pathfinder was used. It was found that the simulation results of MAS (Multi Agent System)-based program is better than Pathfinder in terms of safe evacuation. It means that evacuation simulation need a additional evaluation categories that include not only quick evacuation time but also safe evacuee number.

• 한국ITS학회:학술대회논문집
• /
• v.2007 no.10
• /
• pp.156-161
• /
• 2007

• Journal of Korean Society of Transportation
• /
• v.25 no.6
• /
• pp.33-42
• /
• 2007

This research proposes strategies about providing detour route information and traffic management for flood disasters. Suggested strategies are based on prevention and preparation concepts including prediction, optimization, and simulation in order to minimize damage. Specifically, this study shows the possibility that average travel speed is increased by proper signal progression during downpours or heavy snowfalls. In addition, in order to protect the drivers and vehicles from dangerous situations, this study proposes a route guidance strategy based on variational inequalities such as flooding. However, other roads can have traffic congestion by the suggested strategies. Thus, this study also shows the possibility to solve traffic congestion of other roads in networks with emergency signal modes.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.21 no.1
• /
• pp.17-34
• /
• 2022

This paper develops a model for dynamic station assignment to optimize the Demand Responsive Transit (DRT) operation. In the process of optimization, we use the bus travel time as a variable for DRT management. In addition, walking time, waiting time, and delay due to detour to take other passengers (detour time) are added as optimization variables and entered for each DRT passenger. Based on a network around Anaheim, California, reserved origins and destinations of passengers are assigned to each demand responsive bus, using K-means clustering. We create a model for selecting the dynamic station and bus route and use Non-dominated Sorting Genetic Algorithm-III to analyze seven scenarios composed combination of the variables. The result of the study concluded that if the DRT operation is optimized for the DRT management, then the bus travel time and waiting time should be considered in the optimization. Moreover, it was concluded that the bus travel time, walking time, and detour time are required for the passenger.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.1
• /
• pp.43-54
• /
• 1996

This paper presents new heuristic search algorithms for searching rectilinear r(L1), link metric, and combined shortest paths in the presence of orthogonal obstacles. The GMD(GuidedMinimum Detour) algorithm combines the best features of maze-running algorithms and line-search algorithms. The SGMD(Line-by-Line GuidedMinimum Detour)algorithm is a modiffication of the GMD algorithm that improves efficiency using line-by-line extensions. Our GMD and LGMD algorithms always find a rectilinear shortest path using the guided A search method without constructing a connection graph that contains a shortest path. The GMD and the LGMD algorithms can be implemented in O(m＋eloge＋NlogN) and O(eloge＋NlogN) time, respectively, and O(e＋N) space, where m is the total number of searched nodes, is the number of boundary sides of obstacles, and N is the total number of searched line segment. Based on the LGMD algorithm, we consider not only the problems of finding a link metric shortest path in terms of the number of bends, but also the combined L1 metric and Link Metric shortest path in terms of the length and the number of bands.

• Proceedings of the KOR-KST Conference
• /
• 2007.11a
• /
• pp.915-922
• /
• 2007

• Journal of Institute of Control, Robotics and Systems
• /
• v.8 no.9
• /
• pp.795-802
• /
• 2002

We present a new dynamic routing scheme for multiple autonomous guided vehicles (AGVs) systems. There have been so many results concerned with scheduling and routing of multiple AGV systems; however, most of them are only applicable to systems with a small number of AGVs under a low degree of concurrency. With an increased number of AGVs in recent applications, these AGV systems are faced with another problem that has never been occurred in a system with a small number AGVs. This is the stop propagation problem. That is, if a leading AGV stops then all the following AGVs must stop to avoid any collision. In order to resolve this problem, we propose a nonstop preferential detour (NPD) algorithm which is a new dynamic routing scheme employing an election algorithm. For real time computation, we introduce two stage control scheme and propose a new path searching scheme, k-via shortest path scheme for an efficient dynamic routing algorithm. Finally, the proposed new dynamic routing scheme is illustrated by an example.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.60-66
• /
• 2006

This paper presents a new algorithm for the K shortest path problem in a directed network. After a shortest path is produced with Dijkstra algorithm, detouring paths through inward arcs to every vertex of the shortest path are generated. A length of a detouring path is the sum of both the length of the inward arc and the difference between the shortest distance from the origin to the head vertex and that to the tail vertex. K-1 shorter paths are selected among the detouring paths and put into the set of K paths. Then detouring paths through inward arcs to every vertex of the second shortest path are generated. If there is a shorter path than the current Kth path in the set, this path is placed in the set and the Kth path is removed from the set, and the paths in the set is rearranged in the ascending order of lengths. This procedure of generating the detouring paths and rearranging the set is repeated for the K-1 st path of the set. This algorithm can be applied to a problem of generating the detouring paths in the navigation system for ITS and also for vehicle routing problems.

• Journal of the Korean housing association
• /
• v.20 no.5
• /
• pp.9-21
• /
• 2009

This study classified visual perception types of access space at 17 five-star hotels in Jejudo and examined their cognitive characteristics and image formation structures in an effort to provide basic information important for designing the elevation and the access spaces of a hotel. The results of this study are as follows. Access space image of experimental hotels showed more negative evaluations at both city hotels and resort hotels, viewing angle (upward angle) was also positively evaluated between $10^{\circ}{\sim}12^{\circ}$ and $18^{\circ}$ and central type in arrangement type and detour access and straight access types in access circulation type were positively evaluated. When viewed from an upward angle of $10^{\circ}$ to $12^{\circ}$, the most important factors were as plasticity, decorativeness, and creativity; from $18^{\circ}$ it was such factors as harmony and peculiarity; and at $45^{\circ}$ it was factors like decorativeness and stability. In considering the various access types, the most important factors in a straight access type were peculiarity and harmony; for one-time curved access type it was by decorativeness, creativity, Peculiarity, and stability; and for detour access types it was decorativeness, stability, and peculiarity. Influential of factors affecting image formation and plasticity and harmony factors and the form had more influences on image formation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.10a
• /
• pp.517-518
• /
• 2013

모바일 에드 혹 네트워크(Mobile Ad hoc Network)는 이동성을 가진 노드로 구성된 네트워크로서, 통신기반 시설의 지원이 없어도 스스로 통신망을 구축하여 통신한다. 하지만 노드의 이동성으로 인한 토폴로지의 변화가 빈번하여, 라우팅 경로 재설정으로 인한 오버헤드가 생성된다. 오버헤드 생성을 줄이기 위하여 클러스터링을 이용한 연구가 진행되어 왔다. 클러스터가 형성된 MANET에서 클러스터 헤드 노드가 이동함에 따라 클러스터 영역을 벗어나게 되었을 경우, 클러스터 그룹에 속하는 멤버 노드들은 패킷을 보내지 못하며, 클러스터 헤드노드를 선출하지 못하여 사용할 수 없는 노드가 된다. 본 논문에서는 클러스터 헤드 노드가 클러스터 영역을 벗어날 경우, 클러스터 멤버노드의 상황인자 속성 벡터 정보가 유사한 클러스터 헤드노드를 이웃한 주변 클러스터 헤드로부터 검색 및 선택하여, 우회경로를 제공하는 알고리즘을 제안한다. 제안된 알고리즘에서 각 노드는 상황정보 매트릭스를 가지고 있어, 전송 커버리지 영역이 2홉 이내 반경에 있는 노드의 벡터 정보를 저장하게 된다. 클러스터 헤드 노드와의 연결이 끊어 졌을 경우, 클러스터 멤버 노드는 상황정보 매트릭스를 이용하여, 벡터정보가 유사한 클러스터 헤드 노드를 선택하여, 노드 간의 연결성 및 패킷의 전달성이 향상 된다.