• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.5_6
• /
• pp.195-201
• /
• 2007

A minimum terminal path decomposition of a tree is defined as a partition of the tree into edge-disjoint terminal-to-terminal paths that minimizes the weight of the longest path. In this paper, we present an $O({\mid}V{\mid}^2$time algorithm to find a minimum terminal path decomposition of trees. The algorithm reduces the given optimization problem to the binary search using the corresponding decision problem, the problem to decide whether the cost of a minimum terminal path decomposition is at most l. This decision problem is solved by dynamic programing in a single traversal of the tree.

• Korean Journal of Cognitive Science
• /
• v.18 no.4
• /
• pp.371-398
• /
• 2007

This study examined effects of word frequency and semantic transparency on decomposition processes of compound nouns by semantic priming task and repetition priming task. In Experiment 1, it was investigated that decomposition process depended on word frequency of compound noun. Semantic priming effects were found In the compound noun's associate rendition consistently, and repetition priming effects were found in the whole rendition as well as in the part condition irrespective of word frequency and SOA. These results implied that compound noun was processed through decomposition process path and direct access path. In Experiment 2, Effects of semantic transparency on decomposition processes of compound nouns were examined. Semantic priming effects were found when compound nouns' associates were presented as primes irrespective of semantic transparency and SOA, and results were the same as experiment 1b in repetition priming task. Results of experiment 1 and 2 implies that compound nouns are interpreted by interactive activation processes of attributes activated by decomposition path and direct access path.

• The Journal of Korea Robotics Society
• /
• v.2 no.4
• /
• pp.304-309
• /
• 2007

This paper describes an efficient path generation method for area coverage. Its applications include robots for de-mining, cleaning, painting, and so on. Our method is basically based on a divide and conquer strategy. We developed a novel cell decomposition algorithm that divides a given area into several cells. Each cell is covered by a robot motion that requires minimum time to cover the cell. Using this method, completeness and time efficiency of coverage are easily achieved. For the completeness of coverage in dynamic environments, we also propose a path following method that makes the robot cover missed areas as a result of the presence of unknown obstacles. The effectiveness of the method is verified using computer simulations.

• The Journal of Korea Robotics Society
• /
• v.18 no.1
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.12
• /
• pp.2973-2978
• /
• 2009

The decomposition reaction mechanism of $CH_3CF_2O$ radical formed from hydroflurocarbon, $CH_3CHF_2$ (HFC-152a) in the atmosphere has been investigated using ab-initio quantum mechanical methods. The geometries of the reactant, products and transition states involved in the decomposition pathways have been optimized and characterized at DFT-B3LYP and MP2 levels of theories using 6-311++G(d,p) basis set. Calculations have been carried out to observe the effect of basis sets on the optimized geometries of species involved. Single point energy calculations have been performed at QCISD(T) and CCSD(T) level of theories. Out of the two prominent decomposition channels considered viz., C-C bond scission and F-elimination, C-C bond scission is found to be the dominant path involving a barrier height of 12.3 kcal/mol whereas the F-elimination path involves that of a 28.0 kcal/mol. Using transition-state theory, rate constant for the most dominant decomposition pathway viz., C-C bond scission is calculated at 298 K and found to be 1.3 ${\times}$ 10$^4s{-1}$. Transition states are searched on the potential energy surfaces involving both decomposition channels and each of the transition states are characterized. The existence of transition states on the corresponding potential energy surface are ascertained by performing Intrinsic Reaction Coordinate (IRC) calculation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.7
• /
• pp.73-80
• /
• 2009

This paper describes a path planning algorithm, which is the minimal turning path based on the shape and size of the cell to clean up the whole area with two cleaning robots. Our method divides the whole cleaning area with each cell by cellular decomposition, and then provides some path plans among of the robots to reduce the rate of energy consumption and cleaning time of it. In addition we suggest how to plan between the robots especially when they are cleaning in the same cell. Finally simulation results demonstrate the effectiveness of the algorithm in an unknown area with multiple robots. And then we compare the performance index of two algorithms such as total of turn, total of time.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.1
• /
• pp.48-52
• /
• 2010

In this paper, we introduce a new path planning algorithm which combines the merits of a visibility graph algorithm and an adaptive cell decomposition. We quantize a given map with empty cells, blocked cells, and mixed cells, then find the optimal path on the quantized map using a visibility graph algorithm. For reducing the number of the quantized cells we use the quad-tree technique which is used in an adaptive cell decomposition, and for improving the performance of the visibility checking in making a visibility graph we propose a new visibility checking method which uses the property of the quad-tree instead of the well-known rotational sweep-line algorithm. For the more efficient visibility checking, we propose two additional improvements for our suggested method. Both of them are used for reducing the visited cells in the quad-tree. The experiments for a performance comparison of our algorithm with other well-known algorithms show that our proposed method is superior to others.

• Bulletin of the Korean Chemical Society
• /
• v.10 no.3
• /
• pp.262-269
• /
• 1989

The gas phase thermal decomposition of 1-bromo-3-chloropropane in the presence of radical inhibitor was studied by using the conventional static system. The mechanism of unimolecular elimination channel is shown below. [...] In this scheme, the total molecular dissociation rate constant, ($k_1\;+\;k_2$), for the decomposition of $BrCH_2CH_2CH_2Cl$ was determined by pyrolyzing the $BrCH_2CH_2CH_2Cl$ in the temperature range of $380-420^{\circ}C$ and in the pressure range of 10∼100 torr. To obtain $k_3\;and\;k_4,\;and\;to\;obtain\;k_1\;and\;k_2$ independently, the thermal decompositions of allyl chloride and allyl bromide were also studied. The Arrhenius parameters for each step are as follows; $log\;A_{\infty}\;=\;14.20(sec^{-1}),\;E_a$ = 56.10(kcal/mol) for reaction path 1; $log\;A_{\infty}\;=\;12.54(sec^{-1}),\;E_a$ = 49.75(kcal/mol) for reaction path 2; $log\;A_{\infty}\;=\;13.41(sec^{-1}),\;E_a$ = 50.04(kcal/mol) for reaction path 3; $log\;A_{\infty}\;=\;12.43(sec^{-1}),\;E_a$ = 52.78(kcal/mol) for reaction path 4; Finally, the experimentally observed pressure dependence of the rate constants in each step is compared with the theoretically predicted values that are obtained by the RRKM calculations.

• Journal of the Korea Safety Management & Science
• /
• v.13 no.1
• /
• pp.127-131
• /
• 2011

Even if there are no causing factors such as car crash and road works, traffic congestion come from traffic growth on the road. In this case, estimation of traffic flow helps find the solution of traffic congestion problem. In this paper, we present a optimization model which used on traffic equilibrium problem and studied the problem of inverting shortest path sets for complex traffic system. And we also develop pivotal decomposition algorithm for reliability function of complex traffic system. Several examples are illustrated.