• Proceedings of the Korea Information Processing Society Conference
• /
• 2013.05a
• /
• pp.867-868
• /
• 2013

본 논문은 물류창고와 같은 실내 공간에서 RFID와 초음파 센서등을 이용하여 이동로봇이 자율적으로 자신의 위치를 파악하고 관리자가 지정한 목표 물체를 인식하여 간단한 업무를 보조할 수 있는 기법을 제안한다. 실내공간엔 RFID를 지면과 목표물체에 설치하고 로봇은 RFID의 리더기와 물체 접근시 활용이 가능한 추가적 센서를 갖춤으로써 이동시 자기 위치를 실시간으로 파악하고 물체로부터도 고유정보를 얻는다. 초음파 센서 신호의 귀환시간을 활용하여 근접한 물체와의 상대 거리를 추출하고 바닥의 RFID로부터 이미 획득한 자기 위치를 조합하여 목표 물체의 절대 위치를 구한다. 이는 이동 로봇을 중심으로 한 경로지도를 실시간으로 작성하며 동시에 실내의 이동 가능 구조 및 목표 물체의 파악이 가능하여 이동로봇의 자율적 탐색을 위한 최적 경로 계획 수립에 활용 가능하다.

• Journal of Korean Society for Geospatial Information Science
• /
• v.15 no.3
• /
• pp.27-32
• /
• 2007

3D based information is demanded increasingly as cities grow three dimensionally and buildings become large and complex. The use of 3D GIS is also getting attention as fundamental data for ubiquitous computing applications such as location-based guidance, path finding and emergency escaping. However, most 3D modeling techniques are focused on the visualization of buildings or terrains and do not have topological structures required in spatial analyses. In this paper, we introduce a method to incorporate topological relationship into 3D models by combining 2D GIS layers and 3D model. We divide indoor spaces of a 3D model into discrete objects and then define the relationship with corresponding features in 2D GIS layers through database records. We also show how to construct hallways network in the 2D-3D integrated building model. Finally, we test different cases of route finding situations inside a building such as normal origin-destination path finding and emergency evacuation.

• Journal of Internet Computing and Services
• /
• v.3 no.6
• /
• pp.35-41
• /
• 2002

The Car Navigation System(CNS) requires lots of memory and calculating time because it works on the large and complex digital map. And the traffic circumstances vary time by time, so the traffic informations should be processed if we want to get mere realistic result. This paper proposes an effective path searching algorithm which uses less memories and calculating time by applying directional information between the starting place and destination place and by using realtime traffic informations.

• Spatial Information Research
• /
• v.17 no.3
• /
• pp.361-370
• /
• 2009

As the increasing interests of spatial information for different application area such as disaster management, there are many researches and development of indoor spatial data models and real-time evacuation management systems. The application requires to determine and optical paths in emergency situation, to support evacuees and rescuers. The optimal path in this study is defined to guide rescuers, So, the path is from entrance to the disaster site (room), not from rooms to entrances in the building. In this study, we propose a time-dependent optimal routing algorithm to develop real-time evacuation systems. The network data that represents navigable spaces in building is used for routing the optimal path. Associated information about environment (for example, number of evacuees or rescuers, capacity of hallways and rooms, type of rooms and so on) is assigned to nodes and edges in the network. The time-dependent optimal path is defined after concerning environmental information on the positions of evacuees (for avoiding places jammed with evacuees) and rescuer at each time slot. To detect the positions of human beings in a building per time period, we use the results of evacuation simulation system to identify the movement patterns of human beings in the emergency situation. We use the simulation data of five or ten seconds time interval, to determine the optimal route for rescuers.

• Journal of Korea Multimedia Society
• /
• v.5 no.1
• /
• pp.114-119
• /
• 2002

Realtime assignment of railways is an important component in the railway control systems. To solve this problem, we must exactly represent the track topology. Graph is a proper data structure for representing general network topologies, but not Proper for track topologies. In this paper, we define a new data structure, railway graph, which can exactly represent topologies of railway networks. And we describe a path search algorithm in the defined railway graph, and a top-down approach for designing railway network by the Proposed graph.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2012.04a
• /
• pp.421-424
• /
• 2012

본 논문은 실내 공간에서 RFID와 센서를 이용하여 이동로봇이 자기 위치를 파악하고 목표물체를 인식할 수 있는 기법을 제안한다. RFID를 지면과 목표물체에 설치하고 로봇은 리더기와 다양한 센서를 갖춤으로써 이동시 자기 위치를 파악하고 물체로부터도 고유정보를 얻을 수 있게 구성하였다. 초음파 센서 신호의 귀환시간을 활용하여 전방 물체의 거리를 추출하며 바닥의 RFID로부터 이미 획득한 자기 위치를 활용하여 물체의 절대 위치를 구한다. 이는 로봇을 중심으로한 경로지도를 실시간으로 작성하는 것이 가능하며, 실내의 구조 및 목표 물체의 위치등을 포함한 전체적인 지도를 작성할 수 있다. 최종적으로는 최적의 경로계획을 세워 로봇이 목표 위치로 이동하거나 자율적 탐색이 가능하도록 한다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.249-252
• /
• 2011

본 논문은 실내 공간에서 RFID와 센서를 이용하여 이동로봇이 자기 위치를 파악하고 목표 물체를 인식할 수 있는 기법을 제안한다. RFID를 지면과 목표물체에 설치하고 로봇은 리더기와 다양한 센서를 갖춤으로써 이동시 자기 위치를 파악하고 물체로부터도 고유정보를 얻을 수 있게 구성하였다. 초음파 센서 신호의 귀환시간을 활용하여 전방 물체의 거리를 추출하며 바닥의 RFID로부터 이미 획득한 자기 위치를 활용하여 물체의 절대 위치를 구한다. 이는 로봇을 중심으로한 경로지도를 실시간으로 작성하는 것이 가능하며, 실내의 구조 및 목표 물체의 위치등을 포함한 전체적인 지도를 작성할 수 있다. 최종적으로는 최적의 경로 계획을 세워 로봇이 목표 위치로 이동하거나 자율적 탐색이 가능하도록 한다.

• Journal of Advanced Navigation Technology
• /
• v.13 no.5
• /
• pp.646-655
• /
• 2009

This paper presents a new search strategy based on models of evolution in order to solve the problem of collision-free robotic path planning. We designed the robot path planning method with genetic algorithm which has become a well-known technique for optimization, intelligent search. Considering the path points as genes in a chromosome will provide a number of possible solutions on a given map. In this case, path distances that each chromosome creates can be regarded as a fitness measure for the corresponding chromosome. The effectiveness of the proposed genetic algorithm in the path planning was demonstrated by simulation. The proposed search strategy is able to use multiple and static obstacles.

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

Recently unstable weather condition has been going on then the damage by heavy rains, typhoons and stream flooding has been increasing continuously. In particular, the urban damage by flooding of rivers or roads has been occurred frequently. It could block all the transportation facilities within cities for restricting traffic. In this study, we suggest the method of utilization of the information about event and accident on roads through the real-time traffic information to cope with dangerous situation of roads.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.2
• /
• pp.268-275
• /
• 2011

This paper proposes two optimal path planning methods of a mobile robot using uDEAS (univariate Dynamic Encoding Algorithm for Searches). Before start of autonomous traveling, a self-controlled mobile robot must generate an optimal global path as soon as possible. To this end, numerical optimization method is applied to real time path generation of a mobile robot with an obstacle avoidance scheme and the basic path generation method based on the concept of knot and node points between start and goal points. The first improvement in the present work is to generate diagonal paths using three node points in the basic path. The second innovation is to make a smooth path plotted with the blending polynomial using uDEAS. Effectiveness of the proposed schemes are validated for several environments through simulation.