• Journal of the Society of Disaster Information
• /
• v.12 no.2
• /
• pp.130-135
• /
• 2016

In this paper, the trend of evacuation path providing or guidance systems for safety on disaster situation is analyzed. For trend analysis, 31 papers of domestic and international, 29 patents of domestic, and the finished 9 national funded projects, which have been performed for recent 15 years are analysed. As the results of analysis, the previous researches were performed in the view of the guidance systems, but there is no study that can be used for peoples in dangerous situation until now. Also it has technical limitations in using indoor positioning technology for peoples. In this paper, therefore, we propose to use the indoor positioning technology for developing a novel evacuation guidance system for peoples in dangerous situation. It can be utilized to develop a novel evacuation guidance system which is considered indoor disaster situations.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2003.09a
• /
• pp.191-194
• /
• 2003

Location-allocation problem is known as one of the important problem faced in Industrial Engineering and Operations Research fielde. There are many variations on this problem for different applications, however, most of them consider no obstacle existing. Since the location-allocation problem with obstacles is very complex and with many infeasible solutions, no direct method is effective to solve it. In this paper we propose a hybrid Genetic Algorithm (hGA) method for solving this problem. The proposed hGA is based on Lagrangian relaxation method and Dijkstra's shortest path algorithm. To enhance the proposed hGA, a Fuzzy Logic Controller (FLC) approach is also adopted to auto-tune the GA parameters.

• Journal of applied mathematics & informatics
• /
• v.31 no.5_6
• /
• pp.595-608
• /
• 2013

Let G = (V, E) be a simple connected graph. The sets of vertices and edges of G are denoted by V = V (G) and E = E(G), respectively. In such a simple molecular graph, vertices represent atoms and edges represent bonds. The distance between the vertices $u$ and $v$ in V (G) of graph G is the number of edges in a shortest path connecting them, we denote by $d(u,v)$. In graph theory, we have many invariant polynomials for a graph G. In this paper, we focus on the Schultz polynomial, Modified Schultz polynomial, Hosoya polynomial and their topological indices of a molecular graph circumcoronene series of benzenoid $H_k$ and specially third member from this family. $H_3$ is a basic member from the circumcoronene series of benzenoid and its conclusions are base calculations for the Schultz polynomial and Hosoya polynomial of the circumcoronene series of benzenoid $H_k$ ($k{\geq}3$).

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.04a
• /
• pp.336-339
• /
• 2009

본 논문에서는 최단 경로 탐색 및 거리 계산의 필요성을 가지고 근사 인덱싱 방법의 후처리 부분을 제안한다. 근사 인덱싱 방법이란 오프라인에서 네트워크 공간상의 객체들을 유클리드 공간 상의 절대 좌표로 사상하여 인덱싱한 후, k-최근접 이웃 질의를 처리하는 방법이다. 그러나 기존 연구는 질의 점으로부터 각 정적 객체까지의 경로를 탐색해주지 않을 뿐만 아니라 착오 기각이 발생한다. 따라서 본 논문에서는 질의 점으로부터 k개의 정적 객체까지의 경로를 효과적으로 탐색할 수 있는 방법을 제안한다. 또한, 이 방법을 통하여 착오 기각 역시 완화시킬 수 있는 방법을 제안한다. 실험을 통하여 제안하는 방법이 기존 경로 탐색 기법들에 비해 노드 탐색 횟수 및 실행 성능이 크게 향상시킨 것으로 나타났다.

• Journal of the Korean Society of Hazard Mitigation
• /
• v.11 no.3
• /
• pp.49-56
• /
• 2011

This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.243-253
• /
• 2019

First steps of Planetary exploration are usually conducted with the use of autonomous rovers. These rovers are capable of finding its own path and perform experiments about the planet's surface. This paper makes a proposal for a multi-agent system which effectively take the advantage of a blackboard system for share knowledge and effort of each agent. Agents use Reactive Model with the combination of Belief Desire Intension (BDI) Model and also use a Path Finding Algorithm for calculate shortest distance and a path for travel on the planet's surface. This approach can perform a surface exploration on a given terrain within a short period of time. Information which are gathered on the blackboard are used to make an output with detailed surface soil variance results. The developed Multi-Agent system performed well with different terrain sizes.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.3
• /
• pp.444-452
• /
• 2005

A new scheme for a mobile robot to track and capture a moving object using camera images is proposed. The moving object is assumed to be a point-object and is projected onto an image plane to form a geometrical constraint equation that provides the position data of the object based on the kinematics of the active camera. Uncertainties in position estimation caused by the point-object assumption are compensated for using the Kalman filter. To generate the shortest time path to capture the moving object, the linear and angular velocities are estimated and utilized. In this paper, the experimental results of the tracking and capturing of a target object with the mobile robot are presented.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1645-1654
• /
• 2007

In this paper, we study the problem of load balancing routing in clustered-based wireless mesh network in order to enhance the overall network throughput. We first address the problems of cluster allocation in wireless mesh network to achieve load-balancing state. Due to the complexity of the problem, we proposed a simplified algorithm using gradient load-balancing model. This method searches for a localized optimal solution of cluster allocation instead of solving the optimal solution for overall network. To support for load-balancing algorithm and reduce complexity of topology control, we also introduce limited broadcasting between two clusters. This mechanism maintain shortest path between two nodes in adjacent clusters while minimizing the topology broadcasting complexity. The simulation experiments demonstrate that our proposed model achieve performance improvement in terms of network throughput in comparison with other clustering methods.

• Proceedings of the Korea Contents Association Conference
• /
• 2015.05a
• /
• pp.31-32
• /
• 2015

본 논문에서는 컴퓨터 망에서 동적라우팅 프로토콜로 다중영역을 지원하는 OSPF (Open Shortest Path First)를 중심으로 망 축약(summary), 타 프로톨과의 연동을 위한 재분배(redistribution), Virtual Link 등 복잡한 설정 기법을 연구하고 이를 신라대학교 LAN 구성에 적용한다. 시스코의 망 시뮬레이터 장비인 패킷트레이서를 활용하여 라우터와 스위치는 각각 2620XM Router, 2950T-24 Switch를 사용하고, 라우팅 프로토콜은 OSPF, EIGRP(Enhanced Interior Gateway Routing Protocol)를, 또한 이들 간의 연결을 위해서는 재분배를 이용하고, 다중 영역 중 백본 area에 인접하지 않는 area에 대한 연결을 위해서는 Virtual Link 등 여러 설정 기법을 사용한다. 전체 망 구성 연결 후에는 이들 설정에 대한 통신상태를 확인한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2008.06d
• /
• pp.291-296
• /
• 2008

Wireless network technologies are becoming more widely used in industrial environment. The industrial communication system requires a real-time delivery of messages. The sensors periodically senses the physical environment and wants to deliver the data in real-time to the sink. This paper proposes a real-time protocol for periodic messages on wireless sensor and actor networks to be used in industrial communications. The proposed protocol delivers the data message using the shortest path from the source and the nearest actor. The protocol considers the energy consumption by reducing the number of broadcast messages during flooding. We have evaluated the performance of the proposed protocol using QualNet simulator. The simulation results show that the data messages have been delivered in real-time and the number of broadcast messages is reduced from 90% to 35% compared the existing protocols.