• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1299-1302
• /
• 2003

In this paper, we propose new method which can provide user the path to the target place efficiently. It stores the state of roads to target place as the form of Q-table and finds the proper path using Q-table.0-table is updated by the information about real traffic which is reported by users. This method can provides the proper path, using less storage and less computation time than the conventional method which stores entire road traffic information and finds the path by graph search algorithm.

• Proceedings of the KIEE Conference
• /
• 1995.11a
• /
• pp.569-571
• /
• 1995

This paper compares the simulated annealing and the Hopfield neural network method for an optimal routing in a multistage interconnection network(MIN). The MIN provides a multiple number of paths for ATM cells to avoid cell conflict. Exhaustive search always finds the optimal path, but with heavy computation. Although greedy method sets up a path quickly, the path found need not be optimal. The simulated annealing can find an sub optimal path in time comparable with the greedy method.

• Journal of the Korea Society for Simulation
• /
• v.28 no.1
• /
• pp.23-39
• /
• 2019

The use of drone-bots is demanded in times regarding the reduction of military force, the spread of the life-oriented thought, and the use of innovative technology in the defense through the fourth industrial revolution. Especially, the drone's surveillance and reconnaissance are expected to play a big role in the future battlefield. However, there are not many cases in which the concept of operation is studied scientifically. In this study, We propose search algorithms for reconnaissance drone through simulation analysis. In the simulation, the drone and target move linearly in continuous space, and the target is moving adopting the Random-walk concept to reflect the uncertainty of the battlefield. The research investigates the effectiveness of existing search methods such as Parallel and Spiral Search. We analyze the probabilistic analysis for detector radius and the speed on the detection probability. In particular, the new detection algorithms those can be used when an enemy moves toward a specific goal, PS (Probability Search) and HS (Hamiltonian Search), are introduced. The results of this study will have applicability on planning the path for the reconnaissance operations using drone-bots.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38C no.12
• /
• pp.1207-1215
• /
• 2013

This paper proposes the location estimation techniques of distributed targets with the multi-sensor data perceived through IR sensors of the military robots in consideration of obstacles. In order to match up targets with measured azimuths, to add to the depth-first search (DFS) algorithms in free-obstacle environment, we suggest the expanded DFS (EDS) algorithm including bypass path search, partial path search, middle level ending, and the supplementation of decision metric. After matching up targets with azimuths, we estimate the coordinate of each target by obtaining the intersection point of the azimuths with the least square error (LSE) algorithm. The experimental results show the error rate of estimated location, mean number of calculating nodes, and mean distance between real coordinates and estimated coordinates of the proposed algorithms.

• Journal of Korea Multimedia Society
• /
• v.8 no.5
• /
• pp.651-659
• /
• 2005

For segmentation of constrained and handwritten Hangul, a new method, which has been not introduced, was proposed and implemented to use virtual network search system in the space between characters. The proposed system was designed to be used in all cases in unconstrained handwritten Hangul by various writers and to make a number of curved segmentation path using a virtual network to the space between characters. The proposed system prevented Process from generating a path in a wrong position by changing search window upon target block within a search process. From the experimental results, the proposed virtual network search system showed segmentation accuracy of $91.4\%$ from 800 word set including touched and overlapped characters collected from various writers.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.15 no.3
• /
• pp.60-67
• /
• 2016

In cumulative transfer functions, as number of transfer increase, the impact of individual transfer to transfer cost increase linearly or non linearly. This function can effectively explain various passengers's travel behavior who choose their travel routes in integrated transit line networks including bus and railway modes. Using the function, it is possible to simulate general situations such that even though more travel times are expected, less number of transfer routes are preferred. However, because travel cost with cumulative transfer function is known as non additive cost function types in route search algorithms, finding an optimal route in integrated transit networks is confronted by the insolvable enumeration of all routes in many cases. This research proposes a methodology for finding an optimal path considering cumulative transfer function. For this purpose, the reversal phenomenon of optimal path generated in route search process is explained. Also a heuristic methodology for selecting an optimal route among multiple routes predefined by the K path algorithm. The incoming link based entire path deletion method is adopted for finding K ranking path thanks to the merit of security of route optimality condition. Through case studies the proposed methodology is discussed in terms of the applicability of real situations.

• Journal of Korean Society for Quality Management
• /
• v.47 no.4
• /
• pp.701-711
• /
• 2019

Purpose: The problem of optimizing redundancy allocation in multi-level systems is considered when each item in a multi-level system has alternative items with the same function. The number of redundancy of multi-level system is allocated to maximize the reliability of the system under path set and cost limitation constraints. Methods: Based on cost limitation and path set constraints, a mathematical model is established to maximize system reliability. Particle swarm optimization is employed for redundant allocation and verified by numerical experiments. Results: Comparing the particle swarm optimization method and the memetic algorithm for the 3 and 4 level systems, the particle swarm optimization method showed better performance for solution quality and search time. Particularly, the particle swarm optimization showed much less than the memetic algorithm for variation of results. Conclusion: The proposed particle swarm optimization considerably shortens the time to search for a feasible solution in MRAP with path set constraints. PS optimization is expected to reduce search time and propose the better solution for various problems related to MRAP.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.4
• /
• pp.69-74
• /
• 2011

In this paper, we propose a foot-and-mouth disease prevention system using the RTLS technology and $A^*$ algorithm-based optimal path search method to avoid foot-and-mouth disease areas. The main features and contributions of the proposed system are as follows. First, the proposed system is developed based on active-tag for identifying status and location information of livestock. Second, the system is newly designed based on $A^*$ algorithm for supporting optimal path search services. The performance evaluation of the proposed system is performed via simulation. The results of performance evaluation show that the proposed system can efficiently support the optimal path search services.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.4 no.3 s.8
• /
• pp.9-22
• /
• 2005

Route travel cost in transportation networks consists of actual route travel cost and route perception cost. Since the route perception cost is differently perceived according to each origin and each destination, route search has limitation to reflect the note perception cost due to route enumeration problem. Thus, currently employed advanced traveller information systems (ATIS) have considered only actual route travel cost for providing route information. This study proposes an optimal and a K-route searching algorithm which are able to reflect the route perception cost but encompass route enumeration problem. For this purpose, this research defines the minimum nit of route as a link by adopting the link label technique in route searching, therefore the comparison of two adjacent links which can be finally expanded the comparison of two routes. In order to reflect the characteristics of route perception in real situation, an optimal shortest cost path algorithm that both the forward search from the origin and the backward search from the destination can be simultaneously processed is proposed. The proposed algorithm is applied for finding K number of shortest routes with an entire-path-deletion-type of K shortest route algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.12
• /
• pp.5015-5022
• /
• 2010

Most of the existing pattern mining techniques are capable of searching patterns according to the continuous change of the spatial information of an object but there is no constraint on the spatial information that must be included in the extracted pattern. Thus, the existing techniques are not applicable to the optimal path search between specific nodes or path prediction considering the nodes that a moving object is required to round during a unit time. In this paper, the precision of the path search according to the spatial hierarchy is analyzed using the Spatial-Temporal Optimal Moving Pattern(with Frequency & Weight) (STOPM(FW)) algorithm which searches for the optimal moving path by considering the most frequent pattern and other weighted factors such as time and cost. The result of analysis shows that the database retrieval time is minimized through the reduction of retrieval range applying with the spatial constraints. Also, the optimal moving pattern is efficiently obtained by considering whether the moving pattern is included in each hierarchical spatial scope of the spatial hierarchy or not.