• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.4
• /
• pp.721-726
• /
• 2012

In this paper, we proposed an efficient algorithm based on SPFA(shortest path faster algorithm), which is an improved the Bellman-Ford algorithm. The Bellman-Ford algorithm can be used on graphs with negative edge weights unlike Dijkstra's algorithm. And SPFA algorithm used a queue to store the nodes, to avoid redundancy, though the Bellman-Ford algorithm takes a long time to update the nodes table. In this improved algorithm, an adjacency list is also used to store each vertex of the graph, applying dynamic optimal approach. And a queue is used to store the data. The improved algorithm can find the optimal path by continuous relaxation operation to the new node. Simulations to compare the efficiencies for Dijkstra's algorithm, SPFA algorithm and improved Bellman-Ford were taken. The result shows that Dijkstra's algorithm, SPFA algorithm have almost same efficiency on the random graphs, the improved algorithm, although the improved algorithm is not desirable, on grid maps the proposed algorithm is very efficient. The proposed algorithm has reduced two-third times processing time than SPFA algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.11
• /
• pp.1104-1111
• /
• 2009

In the low altitude, mission of the aircraft is restricted by a variety of threats such as anti-air missiles and terrain obstacles. Especially, aircraft have always a risk of ground collision near terrain. In this study, to effectively solve this problem, we developed the flight path generation algorithm that is considered the terrain avoidance. In this flight path generation algorithm, waypoints that should be passed by the UAV are selected first. The waypoints are located in the middle of the terrain obstacles. Then, physically meaningful waypoints sets are classified by Dijkstra algorithm. The optimal waypoint guidance law based on the optimal control theory is applied to produce trajectory candidates. And finally the minimum control energy trajectory is determined.

• Journal of Korean Society of Transportation
• /
• v.21 no.2
• /
• pp.71-82
• /
• 2003

The shortest path problems(SPP) are critical issues in the military logistics such as the simulation of the War-Game. However, the existing SPP has two major drawbacks, one is its accuracy of solution and the other is for only one solution with focused on just link cost in the military transportation planning models. In addition, very few previous studies have been examined for the multi-shortest path problems without considering link capacity reflecting the military characteristics. In order to overcome these drawbacks, it is necessary to apply the multi-shortest paths algorithm reflecting un-expected military incidents. This study examines the multi-shortest paths in the real networks using Shier algorithm. The network contains both military link capacity and time-based cost. Also, the modes are defined as a platoon(group) rather than unit which is used in most of previous studies in the military logistics. To verify the algorithm applied in this study. the comparative analysis was performed with various sizes and routes of network which compares with Dijkstra algorithm. The major findings of this study are as follows ; 1) Regarding the unique characteristics of the military transportation plan, Shier algorithm, which is applied to this study, is more realistic than Dijkstra algorithm. Also, the time based concept is more applicable than the distance based model in the military logistics. 2) Based on the results from the various simulations of this study the capacity-constraint sections appeared in each scenarios. As a consequence, the alternatives are necessary such as measures for vulnerable area, improvement of vehicle(mode), and reflection of separated-marching column in the military manuals. Finally. the limits and future research directions are discussed : 1) It is very hard to compare the results found in this study. which is used in the real network and the previous studies which is used in arbitrary network. 2) In order to reflect the real military situations such as heavy tanks and heavy equipment vehicles. the other constraints such as the safety load of bridges and/or the height of tunnels should be considered for the future studies.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.05a
• /
• pp.1164-1169
• /
• 2006

본 논문은 차량운행경로문제(Vehicle Routing Problem)의 기본적인 정보가 되는 Origin-Destination (OD) Matrix 의 생성에 관한 문제를 다룬다. OD Matrix 를 만들기 위해서는 몇 개의 지점으로부터 몇 개의 지점(some-to-some)까지의 최단 거리를 계산해야 한다. 이를 위해 Dijkstra 알고리듬과 같은 one-to-all 알고리듬을 반복하여 사용할 수 있고 Floyd-Washall 알고리듬과 같은 all-to-all 알고리듬을 사용할 수 있으며 some-to-some 을 위해 고안된 알고리듬을 사용할 수 있다. 본 연구에서는 이러한 알고리듬들이 실제 도로 네트워크의 OD Matrix 를 생성할 때 어떤 성능을 보이는지 비교 분석한다.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.26 no.1D
• /
• pp.195-202
• /
• 2006

The infiltration route analysis is a military application using geospatial information technology. The result of the analysis would present vulnerable routes for potential enemy infiltration. In order to find the susceptible routes, optimal path search algorithms (Dijkstra's and $A^*$) were used to minimize the cost function, summation of detection probability. The cost function was produced by capability of TOD (Thermal Observation Device), results of viewshed analysis using DEM (Digital Elevation Model) and two related geospatial information coverages (obstacle and vegetation) extracted from VITD (Vector product Interim Terrain Data). With respect to 50m by 50m cells, the individual cost was computed and recorded, and then the optimal infiltration routes was found while minimizing summation of the costs on the routes. The proposed algorithm was experimented in Daejeon region in South Korea. The test results show that Dijkstra's and $A^*$ algorithms do not present significant differences, but A* algorithm shows a better efficiency. This application can be used for both infiltration and surveillance. Using simulation of moving TOD, the most vulnerable routes can be detected for infiltration purpose. On the other hands, it can be inversely used for selection of the best locations of TOD. This is an example of powerful geospatial solution for military application.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.107-118
• /
• 2006

In this paper, several network algorithms were tested to find an optimal one for telecommunication network design. Algorithms such as Dijkstra's shortest path algorithm, Ford-Bellman's shortest path algorithm, Prim's minimum spanning tree algorithm, and Kruscal's minimum spanning tree algorithm were reviewed and compared in terms of feasibility and resulted network construction cost. Then an optimal algorithm that is most suitable for telecommunication network design was selected. For more specific and quantitative analysis of the selected algorithm, it was implemented to a real telecommunication network construction site. The analyzed results showed that the suggested design method when compared with the conventional one, reduced the network construction cost considerably. The total network length estimated by the conventional method were 5267 meters while the suggested method resulted in 4807 meters. Thus the new method reduced the total network length by 8.7 percent which is equivalent to 97,469,000 Won of construction cost. Considering the frequent telecommunication network constructions, due to new urban developments in the nation, the economic benefit of the suggested telecommunication network design method will be significant. In addition to the construction cost savings, the suggested telecommunication network design procedure possesses several other economic benefits. Since the design procedure can be standardized and automatized, it can reduce the design cost itself and the skill acquirement periods required for new or inapt design crews. Further, due to the standardized and automatized design procedure, any telecommunication network design results can accessed more objectively.

• 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.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.2
• /
• pp.12-21
• /
• 2013

This study developed searching network reduction algorithm for reduce shortest path searching time. Developed algorithm is searching nodes that have the including possibility of less weights path than temporal path that consists minimum number of nodes and minimum sum of the straight line distances. The node that has the including possibility of shortest path is the node that the sum of straight line distance from start node and straight line distance to target node is less than the value that temporary path's weights divided by minimum weights units. If searching network reconstitutes only these nodes, the time of shortest path searching will be reduced. This developed algorithm has much effectiveness that start node and target node is close in large network.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.34 no.3
• /
• pp.273-282
• /
• 2016

There has been growing social interest recently in the movement rights of people with reduced mobility. However, it simply eliminates the temporary inconvenience of walking of people with reduced mobility because it focuses only on supply of institutional facilities. Therefore, we look forward to improving movement welfare by proposing an optimized path finding algorithm for people with reduced mobility that takes into consideration physical elements affecting their movement, such as slope, steps etc. We selected Walking barrier factor by analyzing previous studies and calculated the relative importance of Walking barrier factors using an Analytic Hierarchy Process(AHP). Next, through the fuzzy system, the Walking disturbance level of link, which integrates the weights of Walking barrier factors and the attributes of each link, is derived. Then, Walking path cost that takes into consideration the ‘length’ factors is calculated and an optimized path for people with reduced mobility is searched using Dijkstra’s Algorithm. Nineteen different paths were searched and we confirmed that the derived paths are meaningful in terms of improving the mobility of people with reduced mobility by conducting a field test. We look forward to improving movement welfare by providing a navigation service using the path finding algorithm proposed in this study.