• Title/Summary/Keyword: Dijkstra Algorithm

Search Result 163, Processing Time 0.029 seconds

A Study on Changing Estimation Weights of A* Algorithm's Heuristic Function (A* 알고리즘 평가함수의 추정 부하량 변경에 관한 연구)

  • Jung, Byung-Doo;Ryu, Yeong-Geun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.14 no.3
    • /
    • pp.1-8
    • /
    • 2015
  • In transportation networks, searching speed and result accuracy are becoming more critical on searching minimum path algorithm. Current $A^*$ algorithm has a big advantage of high searching speed. However, it has disadvantage of complicated searching network and low accuracy rate of finding the minimum path algorithm. Therefore, this study developed $A^*$ algorithm's heuristic function and focused on improving it's disadvantages. Newly developed function in this study contains the area concept, not the line concept. During the progress, this study adopts the idea of a heavier node that remains lighter to the target node is better that the lighter node that becomes heavier when it is connected to the other. Lastly, newly developed algorithm has the feedback function, which allows the larger accuracy value of heuristic than before. This developed algorithm tested on real network, and proved that developed algorithm is useful.

[$L_1$] Shortest Paths with Isothetic Roads (축에 평행한 도로들이 놓여 있을 때의 $L_1$ 최단 경로)

  • Bae Sang Won;Kim Jae-Hoon;Chwa Kyung-Yong
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11a
    • /
    • pp.976-978
    • /
    • 2005
  • We present a nearly optimal ($O(\nu\;min(\nu,\;n)n\;log\;n)$ time and O(n) srace) algorithm that constructs a shortest path map with n isothetic roads of speed $\nu$ under the $L_1$ metric. The algorithm uses the continuous Dijkstra method and its efficiency is based on a new geometric insight; the minimum in-degree of any nearest neighbor graph for points with roads of speed $\nu$ is $\Theta(\nu\;min(\nu,\;n))$, which is first shown in this paper. Also, this algorithm naturally extends to the multi-source case so that the Voronoi diagram for m sites can be computed in $O(\nu\;min(\nu,\;n)(n+m)log(n+m))$ time and O(n+m) space, which is also nearly optimal.

  • PDF

Decision Support Method in Dynamic Car Navigation Systems by Q-Learning

  • Hong, Soo-Jung;Hong, Eon-Joo;Oh, Kyung-Whan
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.12 no.4
    • /
    • pp.361-365
    • /
    • 2002
  • 오랜 세월동안 위대한 이동수단을 만들어내고자 하는 인간의 꿈은 오늘날 눈부신 각종 운송기구를 만들어 내는 결실을 얻고 있다. 자동차 네비게이션 시스템도 그러한 결실중의 한 예라고 할 수 있을 것이다. 지능적으로 판단하고 정보를 처리할 수 있는 자동차 네비게이션 시스템을 부착함으로써 한 단계 발전한 운송수단으로 진화할 수 있을 것이다. 이러한 자동차 네비게이션 시스템의 단점이라면 한정된 리소스만으로 여러 가지 작업을 수행해야만 하는 어려움이다. 그래서 네비게이션 시스템의 주요 작업중의 하나인 경로를 추출하는 경로추출(Route Planning) 작업은 한정된 리소스에서도 최적의 경로를 찾을 수 있는 지능적인 방법이어야만 한다. 이러한 경로를 추출하는 작업을 하는데 기존에 일반적으로 쓰였던 두 가지 방법에는 Dijkstra s algorithm과 A*algorithm이 있다. 이 두 방법은 최적의 경로를 찾아낸다는 점은 있지만 경로를 찾기 위해서 알고리즘의 특성상 각각, 넓은 영역에 대하여 탐색작업을 해야 하고 또한 수행시간이 많이 걸린다는 단점과 또한 경로를 계산하기 위해서 Heuristic function을 추가적인 정보로 계산을 해야 한다는 단점이 있다. 본 논문에서는 적은 탐색 영역을 가지면서 또한 최적의 경로를 추출하는데 드는 수행시간은 작으며 나아가 동적인 교통환경에서도 최적의 경로를 추출할 수 있는 최적 경로 추출방법을 강화학습의 일종인 Q- Learning을 이용하여 구현해 보고자 한다.

An Energy Efficient Intelligent Method for Sensor Node Selection to Improve the Data Reliability in Internet of Things Networks

  • Remesh Babu, KR;Preetha, KG;Saritha, S;Rinil, KR
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.9
    • /
    • pp.3151-3168
    • /
    • 2021
  • Internet of Things (IoT) connects several objects with embedded sensors and they are capable of exchanging information between devices to create a smart environment. IoT smart devices have limited resources, such as batteries, computing power, and bandwidth, but comprehensive sensing causes severe energy restrictions, lowering data quality. The main objective of the proposal is to build a hybrid protocol which provides high data quality and reduced energy consumption in IoT sensor network. The hybrid protocol gives a flexible and complete solution for sensor selection problem. It selects a subset of active sensor nodes in the network which will increase the data quality and optimize the energy consumption. Since the unused sensor nodes switch off during the sensing phase, the energy consumption is greatly reduced. The hybrid protocol uses Dijkstra's algorithm for determining the shortest path for sensing data and Ant colony inspired variable path selection algorithm for selecting active nodes in the network. The missing data due to inactive sensor nodes is reconstructed using enhanced belief propagation algorithm. The proposed hybrid method is evaluated using real sensor data and the demonstrated results show significant improvement in energy consumption, data utility and data reconstruction rate compared to other existing methods.

A study on ITZ percolation threshold in mortar with ellipsoidal aggregate particles

  • Pan, Zichao;Wang, Dalei;Ma, Rujin;Chen, Airong
    • Computers and Concrete
    • /
    • v.22 no.6
    • /
    • pp.551-561
    • /
    • 2018
  • The percolation of interfacial transition zone (ITZ) in cementitious materials is of great importance to the transport properties and durability issues. This paper presents numerical simulation research on the ITZ percolation threshold of mortar specimens at meso-scale. To simulate the meso-scale model of mortar as realistically as possible, the aggregates are simplified as ellipsoids with arbitrary orientations. Major and minor aspect ratios are defined to represent the global shape characteristics of aggregates. Some algorithms such as the burning algorithm, Dijkstra's algorithm and Connected-Component Labeling (CCL) algorithm are adopted for identification of connected ITZ clusters and percolation detection. The effects of gradation and aspect ratios of aggregates on ITZ percolation threshold are quantitatively studied. The results show that (1) the ITZ percolation threshold is mainly affected by the specific surface area (SSA) of aggregates and shows a global decreasing tendency with an increasing SSA; (2) elongated ellipsoidal particles can effectively bridge isolated ITZ clusters and thus lower the ITZ percolation threshold; (3) as ITZ volume fraction increases, the bridging effect of elongated particles will be less significant, and has only a minor effect on ITZ percolation threshold; (4) it is the ITZ connectivity that is essentially responsible for ITZ percolation threshold, while other factors such as SSA and ITZ volume fraction are only the superficial reasons.

RFID-based Shortest Time Algorithm Line Tracer (RFID 기반 최단시간 알고리즘 라인트레이서)

  • Cheol-Min, Kim;Hee-Young, Cho;Tae-Sung, Yun;Ho-Jun, Shin;Hyoung-Keun, Park
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.6
    • /
    • pp.1221-1228
    • /
    • 2022
  • With the development of modern technology, the use of unmanned automation equipment that can replace humans in logistics and industrial sites is increasing. The technology of one such automation facility, the Unmanned Carrier (AGV), includes Line Tracing, which allows you to recognize a line through infrared sensors and drive a predetermined route. In this paper, the shortest time algorithm using Arduino is configured in the line tracing technology to enable efficient driving. It is also designed to collect location and time information using RFID tags.

Optimal path planning and analysis for the maximization of multi UAVs survivability for missions involving multiple threats and locations (다수의 위협과 복수의 목적지가 존재하는 임무에서 복수 무인기의 생존율 극대화를 위한 최적 경로 계획 및 분석)

  • Jeong, Seongsik;Jang, Dae-Sung;Park, Hyunjin;Seong, Taehyun;Ahn, Jaemyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.43 no.6
    • /
    • pp.488-496
    • /
    • 2015
  • This paper proposes a framework to determine the routes of multiple unmanned aerial vehicles (UAVs) to conduct multiple tasks in different locations considering the survivability of the vehicles. The routing problem can be formulated as the vehicle routing problem (VRP) with different cost matrices representing the trade-off between the safety of the UAVs and the mission completion time. The threat level for a UAV at a certain location was modeled considering the detection probability and the shoot-down probability. The minimal-cost path connecting two locations considering the threat level and the flight distance was obtained using the Dijkstra algorithm in hexagonal cells. A case study for determining the optimal routes for a persistent multi-UAVs surveillance and reconnaissance missions given multiple enemy bases was conducted and its results were discussed.

Seamline Determination from Images and Digital Maps for Image Mosaicking (모자이크 영상 생성을 위한 영상과 수치지도로부터 접합선 결정)

  • Kim, Dong Han;Oh, Chae-Young;Lee, Dae Geon;Lee, Dong-Cheon
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.36 no.6
    • /
    • pp.483-497
    • /
    • 2018
  • Image mosaicking, which combines several images into one image, is effective for analyzing images and important in various fields of spatial information such as a continuous image map. The crucial processes of the image mosaicking are optimal seamline determination and color correction of mosaicked images. In this study, the overlap regions were determined by SURF (Speeded Up Robust Features) for image matching. Based on the characteristics of the edges extracted by Canny filter, seamline candidates were selected from classified edges with their characteristics, and the edges were connected by using Dijkstra algorithm. In particular, anisotropic filter and image pyramid were applied to extract reliable seamlines. In addition, it was possible to determine seamlines effectively and efficiently by utilizing building and road layers from digital maps. Finally, histogram matching and seamline feathering were performed to improve visual quality of the mosaicked images.

3D Adjacency Spatial Query using 3D Topological Network Data Model (3차원 네트워크 기반 위상학적 데이터 모델을 이용한 3차원 인접성 공간질의)

  • Lee, Seok-Ho;Park, Se-Ho;Lee, Ji-Yeong
    • Spatial Information Research
    • /
    • v.18 no.5
    • /
    • pp.93-105
    • /
    • 2010
  • Spatial neighborhoods are spaces which are relate to target space. A 3D spatial query which is a function for searching spatial neighborhoods is a significant function in spatial analysis. Various methodologies have been proposed in related these studies, this study suggests an adjacent based methodology. The methodology of this paper implements topological data for represent a adjacency via using network based topological data model, then apply modifiable Dijkstra's algorithm to each topological data. Results of ordering analysis about an adjacent space from a target space were visualized and considered ways to take advantage of. Object of this paper is to implement a 3D spatial query for searching a target space with a adjacent relationship in 3D space. And purposes of this study are to 1)generate adjacency based 3D network data via network based topological data model and to 2)implement a 3D spatial query for searching spatial neighborhoods by applying Dijkstra's algorithms to these data.

A Simulation of Vehicle Parking Distribution System for Local Cultural Festival with Queuing Theory and Q-Learning Algorithm (대기행렬이론과 Q-러닝 알고리즘을 적용한 지역문화축제 진입차량 주차분산 시뮬레이션 시스템)

  • Cho, Youngho;Seo, Yeong Geon;Jeong, Dae-Yul
    • The Journal of Information Systems
    • /
    • v.29 no.2
    • /
    • pp.131-147
    • /
    • 2020
  • Purpose The purpose of this study is to develop intelligent vehicle parking distribution system based on LoRa network at the circumstance of traffic congestion during cultural festival in a local city. This paper proposes a parking dispatch and distribution system using a Q-learning algorithm to rapidly disperse traffics that increases suddenly because of in-bound traffics from the outside of a city in the real-time base as well as to increase parking probability in a parking lot which is widely located in a city. Design/methodology/approach The system get information on realtime-base from the sensor network of IoT (LoRa network). It will contribute to solve the sudden increase in traffic and parking bottlenecks during local cultural festival. We applied the simulation system with Queuing model to the Yudeung Festival in Jinju, Korea. We proposed a Q-learning algorithm that could change the learning policy by setting the acceptability value of each parking lot as a threshold from the Jinju highway IC (Interchange) to the 7 parking lots. LoRa Network platform supports to browse parking resource information to each vehicle in realtime. The system updates Q-table periodically using Q-learning algorithm as soon as get information from parking lots. The Queuing Theory with Poisson arrival distribution is used to get probability distribution function. The Dijkstra algorithm is used to find the shortest distance. Findings This paper suggest a simulation test to verify the efficiency of Q-learning algorithm at the circumstance of high traffic jam in a city during local festival. As a result of the simulation, the proposed algorithm performed well even when each parking lot was somewhat saturated. When an intelligent learning system such as an O-learning algorithm is applied, it is possible to more effectively distribute the vehicle to a lot with a high parking probability when the vehicle inflow from the outside rapidly increases at a specific time, such as a local city cultural festival.