• Journal of Intelligence and Information Systems
• /
• v.11 no.1
• /
• pp.153-167
• /
• 2005

In this paper, we consider the problem of exploring unknown environments with a mobile robot or an autonomous character agent. Traditionally, research efforts to address the space exploration problem havefocused on the graph-based space representations and the graph search algorithms. Recently EXPLORE, one of the most efficient search algorithms, has been discovered. It traverses at most min$min(mn, d^2+m)$ edges where d is the deficiency of a edges and n is the number of edges and n is the number of vertices. In this paper, we propose DFS-RTA* and DFS-PHA*, two real-time graph search algorithms for directing an autonomous agent to explore in an unknown space. These algorithms are all built upon the simple depth-first search (DFS) like EXPLORE. However, they adopt different real-time shortest path-finding methods for fast backtracking to the latest node, RTA* and PHA*, respectively. Through some experiments using Unreal Tournament, a 3D online game environment, and KGBot, an intelligent character agent, we analyze completeness and efficiency of two algorithms.

• KIEE International Transactions on Power Engineering
• /
• v.5A no.2
• /
• pp.177-185
• /
• 2005

This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.10
• /
• pp.565-572
• /
• 2004

This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

• Journal of Korea Multimedia Society
• /
• v.3 no.1
• /
• pp.77-90
• /
• 2000

Real-Time verification is a procedure that verifies the correctness of specification related to requirement in time as well as in logic. One serious problem encountered in the verification task is that the state space grows exponentially owing to the unboundedness of time, which is termed the state space explosion problem. In this paper, we propose a real-time verification technique checking the correctness of specification by showing that a system model described in timed automata is equivalent to the characteristic of system property specified in timed modal-mu calculus. For this, we propose a local model checking method based on the value of the formula in initial state with constructing product graph concerned to only the nodes needed for verification process. Since this method does not search for every state of system model, the state space is reduced drastically so that the proposed method can be applied effectively to real-time system verification.

• Journal of Korea Multimedia Society
• /
• v.23 no.4
• /
• pp.517-524
• /
• 2020

Recently, many researches have been conducted to automatically recognize license plates of vehicles and use the analyzed information to manage stolen vehicles and track the vehicle. However, such a system must eventually be investigated by people through direct monitoring. Therefore, in this paper, the system of tracking a vehicle is implemented by sharing the information analyzed by the vehicle image among cameras registered in the IoT environment to minimize the human intervention. The distance between cameras is indicated by the node and the weight value of the weighted-graph, and the eigenvector centrality is used to select the camera to search. It demonstrates efficiency by comparing the time between analyzing data using weighted graph searching algorithm and analyzing all data stored in databse. Finally, the path of the vehicle is indicated on the map using parsed json data.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.803-806
• /
• 2000

The correspondence problem is known to be difficult to solve because false positives and false negatives almost always exist in real image sequences. In this paper, we propose a robust feature tracking algorithm considering incomplete trajectories such as entering and/or vanishing trajectories. We solve the correspondence problem as the optimal graph search problem, by considering false feature points and by properly reflecting motion characteristics. The proposed algorithm finds a local optimal correspondence so that the effect of false feature points can be minimized in the decision process. The time complexity of the proposed graph search algorithm is given by O(mn) in the best case and O(m$^2$n) in the worst case, where m and n are the number of feature points in two consecutive frames. The proposed algorithm can find trajectories correctly and robustly, which has been shown by experimental results.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.7
• /
• pp.103-111
• /
• 2014

This paper proposes a modified algorithm that improves on Dijkstra's algorithm by applying it to purely two-way traffic paths, given that a road where bi-directional traffic is made possible shall be considered as an undirected graph. Dijkstra's algorithm is the most generally utilized form of shortest-path search mechanism in GPS navigation system. However, it requires a large amount of memory for execution for it selects the shortest path by calculating distance between the starting node and every other node in a given directed graph. Dijkstra's algorithm, therefore, may occasionally fail to provide real-time information on the shortest path. To rectify the aforementioned shortcomings of Dijkstra's algorithm, the proposed algorithm creates conditions favorable to the undirected graph. It firstly selects the shortest path from all path vertices except for the starting and destination vertices. It later chooses all vertex-outgoing edges that coincide with the shortest path setting edges so as to simultaneously explore various vertices. When tested on 9 different undirected graphs, the proposed algorithm has not only successfully found the shortest path in all, but did so by reducing the time by 60% and requiring less memory.

• Korean Journal of Computational Design and Engineering
• /
• v.16 no.1
• /
• pp.21-30
• /
• 2011

Similarity assessment of a CAD model is one of important issues from the aspect of model re-using. In real practice, many new mechanical parts are designed by modifying existing ones. The reuse of part enables to save design time and efforts for the designers. Design time would be further reduced if there were an efficient way to search for existing similar designs. This paper proposes an efficient algorithm of similarity assessment for mechanical part model with design history embedded within the CAD model. Since it is possible to retrieve the design history and detailed-feature information using CAD API, we can obtain an accurate and reliable assessment result. For our purpose, our assessment algorithm can be divided by two: (1) we select suitable parts by comparing MSG (Model Signature Graph) extracted from a base feature of the required model; (2) detailed-features' similarities are assessed with their own attributes and reference structures. In addition, we also propose a indexing method for managing a model database in the last part of this article.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.10
• /
• pp.786-790
• /
• 2009

In this paper, we present a new heuristic search algorithm, HSCP, that can solve conditional/contingent planning problems with nondeterministic actions as well as partial observations. The algorithm repeats its AND-OR search trials until a complete solution graph can be found. However, unlike existing heuristic AND-OR search algorithms such as$AO^*$ and $LAO^*$, the AND-OR search trial conducted by HSCP concentrates on only a single candidate of solution subgraphs to expand it into a complete solution graph. Moreover, unlike real-time dynamic programming algorithms such as RTDP and LRTDP, the AND-OR search trial of HSCP finds a solution immediately when it possible without delaying it until the estimated value of every state converges. Therefore, the HSCP search algorithm has the advantage that it can find a sub-optimal conditional plan very efficiently.

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