• Title/Summary/Keyword: Path-finding algorithm

Search Result 279, Processing Time 0.025 seconds

Intelligent evacuation systems for accidents aboard a ship (선박 재난 환경을 고려한 지능형 대피유도 시스템)

  • Kang, Moo-Bin;Joo, Yang-Ick
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.9
    • /
    • pp.824-829
    • /
    • 2016
  • Passenger casualties in the case of ship accidents have increased because of the increase in size and complexity of current ships (such as cruise ships). Therefore, in recent years, emergency evacuation systems are receiving increased interest so as to ensure the safety of passengers. Currently, there are only basic instructions provided, such as announcements regarding the situation, alarms, and exit signs; however, no guidance toward a proper escape route has yet been provided. To solve this problem, several emergency guiding schemes have been proposed. However, these systems ignore some of the realities of ship accidents and are impractical because various risk factors are not considered. Therefore, this paper proposes an optimal route guiding system based on an $A^*$ algorithm for emergency escape during disaster situations. This system takes into account various possible risk factors. Performance evaluation using computer simulations showed that the proposed scheme is effective and leads to safe escape routes.

Weight Adjustment Scheme Based on Hop Count in Q-routing for Software Defined Networks-enabled Wireless Sensor Networks

  • Godfrey, Daniel;Jang, Jinsoo;Kim, Ki-Il
    • Journal of information and communication convergence engineering
    • /
    • v.20 no.1
    • /
    • pp.22-30
    • /
    • 2022
  • The reinforcement learning algorithm has proven its potential in solving sequential decision-making problems under uncertainties, such as finding paths to route data packets in wireless sensor networks. With reinforcement learning, the computation of the optimum path requires careful definition of the so-called reward function, which is defined as a linear function that aggregates multiple objective functions into a single objective to compute a numerical value (reward) to be maximized. In a typical defined linear reward function, the multiple objectives to be optimized are integrated in the form of a weighted sum with fixed weighting factors for all learning agents. This study proposes a reinforcement learning -based routing protocol for wireless sensor network, where different learning agents prioritize different objective goals by assigning weighting factors to the aggregated objectives of the reward function. We assign appropriate weighting factors to the objectives in the reward function of a sensor node according to its hop-count distance to the sink node. We expect this approach to enhance the effectiveness of multi-objective reinforcement learning for wireless sensor networks with a balanced trade-off among competing parameters. Furthermore, we propose SDN (Software Defined Networks) architecture with multiple controllers for constant network monitoring to allow learning agents to adapt according to the dynamics of the network conditions. Simulation results show that our proposed scheme enhances the performance of wireless sensor network under varied conditions, such as the node density and traffic intensity, with a good trade-off among competing performance metrics.

Finding the One-to-One Optimum Path Considering User's Route Perception Characteristics of Origin and Destination (Focused on the Origin-Based Formulation and Algorithm) (출발지와 도착지의 경로인지특성을 반영한 One-to-One 최적경로탐색 (출발지기반 수식 및 알고리즘을 중심으로))

  • Shin, Seong-Il;Sohn, Kee-Min;Cho, Chong-Suk;Cho, Tcheol-Woong;Kim, Won-Keun
    • Journal of Korean Society of Transportation
    • /
    • v.23 no.7 s.85
    • /
    • pp.99-110
    • /
    • 2005
  • Total travel cost of route which connects origin with destination (O-D) is consist of the total sum of link travel cost and route perception cost. If the link perception cost is different according to the origin and destination, optimal route search has limitation to reflect the actual condition by route enumeration problem. The purpose of this study is to propose optimal route searching formulation and algorithm which is enable to reflect different link perception cost by each route, not only avoid the enumeration problem between origin and destination. This method defines minimum unit of route as a link and finally compares routes using link unit costs. The proposed method considers the perception travel cost at both origin and destination in optimal route searching process, while conventional models refect the perception cost only at origin. However this two-way searching algorithm is still not able to guarantee optimum solution. To overcome this problem, this study proposed an orign based optimal route searching method which was developed based on destination based optimal perception route tree. This study investigates whether proposed numerical formulas and algorithms are able to reflect route perception behavior reflected the feature of origin and destination in a real traffic network by the example research including the diversity of route information for the surrounding area and the perception cost for the road hierarchy.

Fast algorithm for incorporating start and goal points into the map represented in a generalized visibility graph (출발점과 목표점을 일반화 가시성그래프로 표현된 맵에 포함하기 위한 빠른 알고리즘)

  • Yu, Kyeon-Ah;Jeon, Hyun-Joo
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.2
    • /
    • pp.31-39
    • /
    • 2006
  • The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

  • PDF

A System with Efficient Managing and Monitoring for Guidance Device (보행안내 기기의 효과적인 관리 및 모니터링을 위한 시스템)

  • Lee, Jin-Hee;Lee, Eun-Seok;Shin, Byeong-Seok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.5 no.4
    • /
    • pp.187-194
    • /
    • 2016
  • When performing experiments in indoor and outdoor environment, we need a system that monitors a volunteer to prevent dangerous situations and efficiently manages the data in real time. We developed a guidance device for visually impaired person that guides the user to walk safely to the destination in the previous study. We set a POI (Point of Interest) of a specific location indoors and outdoors and tracks the user's position and navigate the walking path using artificial markers and ZigBee modules as landmark. In addition, we develop path finding algorithm to be used for navigation in the guidance device. In the test bed, the volunteers are exposed to dangerous situations and can be an accident due to malfunction of the device since they are visually impaired person or normal person wearing a eye patch. Therefore the device requires a system that remotely monitors the volunteer wearing guidance device and manages indoor or outdoor a lot of map data. In this paper, we introduce a managing system that monitors the volunteers remotely and handles map data efficiently. We implement a management system which can monitor the volunteer in order to prevent a hazardous situation and effectively manage large amounts of data. In addition, we verified the effectiveness of the proposed system through various experiments.

A Guidance Methodology Using Ubiquitous Sensor Network Information in Large-Sized Underground Facilities in Fire (대형 지하시설물에서 화재발생 시 USN정보를 이용한 피난 유도 방안)

  • Seo, Yonghee;Lee, Changju;Jung, Jumlae;Shin, Seongil
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.28 no.4D
    • /
    • pp.459-467
    • /
    • 2008
  • Because of the insufficiency of ground space, the utilization of underground is getting more and more in these days. Moreover, underground space is being used not only buildings but multipurpose space for movement, storage and shopping. However, ground space has vital weakness for fire compared to ground space. Especially in case of underground shopping center, there are various stuffs to burn and poisonous gas can be exposed on this count when the space is burned. A large number of casualties can be also occurred from conflagration as underground space has closed structures that prevent rapid evacuation and access. Therefore, this research proposes the guidance methodology for evacuation from conflagration in large-sized underground facilities. In addition, suggested methodology uses high technology wireless sensor information from up-to-date ubiquitous sensor networks. Fire information collected by sensors is integrated with existing underground facilities information and this is sent to guidance systems by inducing process. In the end, this information is used for minimum time paths finding algorithm considering the passageway capacity and distance. Also, usefulness and inadequacies of proposed methodology is verified by a case study.

Virtual Source and Flooding-Based QoS Unicast and Multicast Routing in the Next Generation Optical Internet based on IP/DWDM Technology (IP/DWDM 기반 차세대 광 인터넷 망에서 가상 소스와 플러딩에 기초한 QoS 제공 유니캐스트 및 멀티캐스트 라우팅 방법 연구)

  • Kim, Sung-Un;Park, Seon-Yeong
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.1
    • /
    • pp.33-43
    • /
    • 2011
  • Routing technologies considering QoS-based hypermedia services have been seen as a crucial network property in next generation optical Internet (NGOI) networks based on IP/dense-wavelength division multiplexing (DWDM). The huge potential capacity of one single fiber. which is in Tb/s range, can be exploited by applying DWDM technology which transfers multiple data streams (classified and aggregated IP traffics) on multiple wavelengths (classified with QoS-based) simultaneously. So, DWDM-based optical networks have been a favorable approach for the next generation optical backbone networks. Finding a qualified path meeting the multiple constraints is a multi-constraint optimization problem, which has been proven to be NP-complete and cannot be solved by a simple algorithm. The majority of previous works in DWDM networks has viewed heuristic QoS routing algorithms (as an extension of the current Internet routing paradigm) which are very complex and cause the operational and implementation overheads. This aspect will be more pronounced when the network is unstable or when the size of network is large. In this paper, we propose a flooding-based unicast and multicast QoS routing methodologies(YS-QUR and YS-QMR) which incur much lower message overhead yet yields a good connection establishment success rate. The simulation results demonstrate that the YS-QUR and YS-QMR algorithms are superior to the previous routing algorithms.

Creating Cultural Heritage though 'Silkroadpia' - Reconstructing the Routes of the Baekje Restoration Movement ('실크로드피아(Silkroadpia)'의 활용과 문화유산의 창출 - 백제부흥운동의 경로복원을 중심으로)

  • Cho, Daeyoun
    • The Journal of the Convergence on Culture Technology
    • /
    • v.6 no.1
    • /
    • pp.343-350
    • /
    • 2020
  • In this paper, we present the results of research on the reconstruction of ancient routes of ancient civilization exchange that were once present in the North Jeolla region, which was undertaken by adopting a convergent approach to develop 'Silkroadpia', which is an online platform for the curation and sharing of archaeological and historical spatial data, and 'MEPTA(Multiple Evidence Based Path and Territory Finding Algorithm)'. The results of the research make it possible to reconsider the region's historical identity and its important role in facilitating cultural exchange on the Korean Peninsula and in East Asia. The results can also be used to provide the theoretical basis for the government's land planning policies and for the production of cultural contents that can be used for local regeneration. The ancient route associated with the Baekje Restoration Movement, that took place after the fall of Sabi in 660 CE, was the case study examined in this paper, which discusses the academic value of reconstructing the ancient route, as well as its future use in providing cultural contents.

Development and Evaluation of Safe Route Service of Electric Personal Assistive Mobility Devices for the Mobility Impaired People (교통약자를 위한 전동 이동 보조기기 안전 경로 서비스의 개발과 평가)

  • Je-Seung WOO;Sun-Gi HONG;Sang-Kyoung YOO;Hoe Kyoung KIM
    • Journal of the Korean Association of Geographic Information Studies
    • /
    • v.26 no.3
    • /
    • pp.85-96
    • /
    • 2023
  • This study developed and evaluated a safe route guidance service for electric personal assistive mobility device used mainly by the mobility impaired people to improve their mobility. Thirteen underlying factors affecting the mobility of electric personal assistive mobility device have been derived through a survey with the mobility impaired people and employees in related organizations in Busan Metropolitan City. After assigning safety scores to individual factors and identifying the relevant factors along routes of interest with an object detection AI model, the safe route for electric personal assistive mobility device was provided through an optimal path-finding algorithm. As a result of comparing the general route of T-map and the recommended route of this study for the identical routes, the latter had relatively fewer obstacles and the gentler slope than the former, implicating that the recommended route is safer than the general one. As future works, it is necessary to enhance the function of a route guidance service based on the real-time location of users and to conduct spot investigations to evaluate and verify its social acceptability.