• Journal of the Korea Computer Graphics Society
• /
• v.6 no.4
• /
• pp.23-28
• /
• 2000

We introduce a new method for constructing a dynamic Delaunay triangulation for a set S of n sites in the plane under the $L_{\infty}(L_1)$ metric. We find that the quadrant neighbor graph is contained in the Delaunay triangluation and that at least one edge of each triangle in the Delaunay triangulation is contained in the quadrant neighbor graph. By using these observations and employing a range tree scheme, we present a method that dynamically maintains the $L_{\infty}(L_1)$ Delaunay triangulation under insertions and deletions in $O(log^2n)$ amortized time and O(log n) expected time.

• Journal of Information Processing Systems
• /
• v.14 no.3
• /
• pp.709-726
• /
• 2018

Database classification is an important preprocessing step for the multi-database mining (MDM). In fact, when a multi-branch company needs to explore its distributed data for decision making, it is imperative to classify these multiple databases into similar clusters before analyzing the data. To search for the best classification of a set of n databases, existing algorithms generate from 1 to ($n^2-n$)/2 candidate classifications. Although each candidate classification is included in the next one (i.e., clusters in the current classification are subsets of clusters in the next classification), existing algorithms generate each classification independently, that is, without taking into account the use of clusters from the previous classification. Consequently, existing algorithms are time consuming, especially when the number of candidate classifications increases. To overcome the latter problem, we propose in this paper an efficient approach that represents the problem of classifying the multiple databases as a problem of identifying the connected components of an undirected weighted graph. Theoretical analysis and experiments on public databases confirm the efficiency of our algorithm against existing works and that it overcomes the problem of increase in the execution time.

• The Journal of Korea Robotics Society
• /
• v.17 no.4
• /
• pp.407-416
• /
• 2022

Multiple AMRs have been proved to be effective in improving warehouse productivity by eliminating workers' wasteful walking time. Although Multi-agent Path Finding (MAPF)-based solution is an optimal approach for this task, its deployment in practice is challenging mainly due to its imperfect plan-execution capabilities and insufficient computing resources for high-density environments. In this paper, we present a MAPF-based fleet management system architecture that robustly manages multiple robots by re-computing their paths whenever it is necessary. To achieve this, we defined four events that trigger our MAPF solver framework to generate new paths. These paths are then delivered to each AMR through ROS2 message topic. We also optimized a graph structure that effectively captures spatial information of the warehouse. By using this graph structure we can reduce computational burden while keeping its rescheduling functionality. With proposed MAPF-based fleet management system, we can control AMRs without collision or deadlock. We applied our fleet management system to the real logistics warehouse with 10 AMRs and observed that it works without a problem. We also present the usage statistic of adopting AMRs with proposed fleet management system to the warehouse. We show that it is useful over 25% of daily working time.

• The Korean Journal of Applied Statistics
• /
• v.36 no.1
• /
• pp.1-19
• /
• 2023

The purpose of this study was to find out what attributes are valid for the edge between students through longitudinal network analysis, and the results of TERGM (temporal exponential random graph model) and SAOM (stochastic actor-oriented model) statistical models were compared. The TERGM model interprets the research results based on the edge formation of the entire network, and the SAOM model interprets the research results on the surrounding networks formed by specific actors. The TERGM model expressed the influence of a previous time through a time term, and the SAOM model considered temporal dependence by implementing a network that evolves by an actor's opportunity as a ratio function.

• ETRI Journal
• /
• v.30 no.6
• /
• pp.856-858
• /
• 2008

Odd networks were introduced in the context of graph theory. However, their potential as fault-tolerant multiprocessor networks has been shown. Broadcasting is one of the most important communication primitives used in multiprocessor networks. In this letter, we introduce efficient one-to-all broadcasting schemes of odd networks for one-port and all-port models. We show the broadcasting time of the former is 2d-2 and that of the latter is d-1. The total time steps taken by the proposed algorithms are optimal.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.2
• /
• pp.285-292
• /
• 2001

The authors compute the Ricci curvature of the GRW space-time to obtain two conditions for the conjugate points which appear as the Timelike Convergence Condition(TCG) and the Jacobi inequality. Moreover, under such two conditions, we obtain a lower bound of the length of a unit timelike geodesic for focal points emanating form the immersed spacelike hypersurface, the graph over the fiber in the GRW space-time.

• 제어로봇시스템학회:학술대회논문집
• /
• 1988.10a
• /
• pp.338-342
• /
• 1988

Recently, in sequence control systems, high flexibility and maintenance of control software are required. This is because product life cycles become shorter and control specification must be changed frequently. The authors extend the concept of Safe Petri Net to develop the design and analysis tool for sequence control systems taking the safeness and notation of input/output functions into consideration. Extended Safe Petri Net (S-Net) is proposed as such a new graph model and real time scanning algorithm based on S-Net is developed.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.27 no.6
• /
• pp.533-542
• /
• 2014

In design standards such as AASHTO LRFD and Korea Highway Bridge Design, the dynamic behaviors under the impact loading has not been considered and it recommends of using a static force for designing bridge column against vehicle collisions. Accordingly, in this study, models of vehicle collisions to concrete bridge column were developed with various boundary conditions in order to take into account dynamic behaviour of the column. Cargo trucks of 10tons, 16tons and 38tons were selected and a typical type of concrete bridge pier column along the Kyungbu highway in Korea was selected for this study. Results from this study indicate that the static load specified in the design standards are too small compared to results obtained in this study. It was also found that a consideration of the bridge superstructure allowed smaller damages of concrete bridge pier column under truck impact loadings. Furthermore, a comparison study of direct impact analysis of vehicle to bridge-column with in-direct impact analysis using load-time history functions was performed. The in-direct impact analysis shows that the use of load-time history graph improves the computational cost up to 92% and predict the behaviors of the bridge column under the impact loadings well. The obtained load-time history graph could be easily applied to several existing models.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.2
• /
• pp.25-42
• /
• 2013

We consider a project time-cost tradeoff problem with two milestones, where one of the jobs has an uncertain processing time. Unless each milestone is completed on time, some penalty cost may be imposed. However, the penalty costs can be avoided by compressing the processing times of some jobs, which requires additional resources or costs. The objective is to minimize the expected total costs subject to the constraint on the expected project completion time. We show that the problem can be solved in polynomial time if the precedence graph of a project is a chain.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.923-929
• /
• 2002

We discuss scheduling analysis for a discrete event system with time windows of which firing or holding time delays are subject to random variation within some finite range. To do this, we propose a modified p-lime Petri net, named p+-time Petri net. We develop a condition for which a synchronized transition does not have a dead token, that is, the firing epochs do not violate the time window constraints. We propose a method of computing the feasible range of the token sojourn time at each place based on a time difference graph. We also discuss an application for analyzing wafer residency times within the process chambers for a dual-armed cluster tool for chemical vapor deposition.