• Title/Summary/Keyword: path cover

Search Result 106, Processing Time 0.029 seconds

One-to-One Disjoint Path Covers in Recursive Circulants (재귀원형군의 일대일 서로소인 경로 커버)

  • 박정흠
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.12
    • /
    • pp.691-698
    • /
    • 2003
  • In this paper, we propose a problem, called one-to-one disjoint path cover problem, whether or not there exist k disjoint paths joining a pair of vertices which pass through all the vertices other than the two exactly once. A graph which for an arbitrary k, has a one-to-one disjoint path cover between an arbitrary pair of vertices has a hamiltonian property stronger than hamiltonian-connectedness. We investigate this problem on recursive circulants and prove that for an arbitrary k $k(1{\leq}k{\leq}m)$$ G(2^m,4)$,$m{\geq}3$, has a one-to-one disjoint path cover consisting of k paths between an arbitrary pair of vortices.

Efficient Coverage Path Planning and Path Following in Dynamic Environments (효율적 커버리지 경로 계획 및 동적 환경에서의 경로 주행)

  • Kim, Si-Jong;Kang, Jung-Won;Chung, Myung-Jin
    • 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.

  • PDF

A Strategy for Multi-target Paths Coverage by Improving Individual Information Sharing

  • Qian, Zhongsheng;Hong, Dafei;Zhao, Chang;Zhu, Jie;Zhu, Zhanggeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.13 no.11
    • /
    • pp.5464-5488
    • /
    • 2019
  • The multi-population genetic algorithm in multi-target paths coverage has become a top choice for many test engineers. Also, information sharing strategy can improve the efficiency of multi-population genetic algorithm to generate multi-target test data; however, there is still space for some improvements in several aspects, which will affect the effectiveness of covering the target path set. Therefore, a multi-target paths coverage strategy is proposed by improving multi-population genetic algorithm based on individual information sharing among populations. It primarily contains three aspects. Firstly, the behavior of the sub-population covering corresponding target path is improved, so that it can continue to try to cover other sub-paths after covering the current target path, so as to take full advantage of population resources; Secondly, the populations initialized are prioritized according to the matching process, so that those sub-populations with better path coverage rate are executed firstly. Thirdly, for difficultly-covered paths, the individual chromosome features which can cover the difficultly-covered paths are extracted by utilizing the data generated, so as to screen those individuals who can cover the difficultly-covered paths. In the experiments, several benchmark programs were employed to verify the accuracy of the method from different aspects and also compare with similar methods. The experimental results show that it takes less time to cover target paths by our approach than the similar ones, and achieves more efficient test case generation process. Finally, a plug-in prototype is given to implement the approach proposed.

A Study on the Cooling Block Design for a Large Touch Screen Panel (TSP) Cover Glass Molding System (대형 Touch Screen Panel(TSP) 덮개유리 성형기의 냉각 블록 설계에 관한 연구)

  • Lee, Jun Kyoung
    • Journal of the Korean Society of Manufacturing Process Engineers
    • /
    • v.19 no.6
    • /
    • pp.36-42
    • /
    • 2020
  • Nowadays, the touch screen panel (TSP) cover glass for mobile smart devices is being developed with a curved glass shape due to different design requirements. Because the sizes of mobile smart devices continue to increase, there has also been a great increase in the demand for large-area curved glass greater than 20 inches. In this study, heat and fluid flow analysis using CFD was performed to optimize the heating surface temperature distribution of the large curved glass formation system. Five cooling water flow paths in the cooling block were designed and analyzed for each case. A function that can quantitatively calculate the temperature uniformity of the heating surface was proposed and these values were obtained for the five models. The temperature distributions of the heating surface and the energy consumption of the heating system were also compared and comprehensively analyzed. Based on the analysis results of the five different cooling channel path models, the optimal path design could be presented.

Generalization of Disjoint Path Covers (서로소인 경로 커버의 일반화)

  • Park, Jung-Heum
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06b
    • /
    • pp.487-492
    • /
    • 2010
  • 그래프에서 k-서로소인 경로 커버는 정점 집합을 커버하면서 정점이 서로소인 .개의 경로들의 집합으로 정의하고, 이때 각 경로는 주어진 소스와 싱크를 잇는다. 각 소스와 싱크에 요구(demand)라고 부르는 양의 정수가 주어질 때, 요구가 d인 각 소스나 싱크가 d개의 경로에 포함되는 일반-요구 k-서로소인 경로 커버(general-demand k-disjoint path cover)를 정의할 수 있다. 이것은 일대일, 일대다, 그리고 비쌍형 다대다 서로소인 경로 커버를 일반화한 것이다. 이 논문에서는 일반-요구 k-서로소인 경로 커버 문제가 비쌍형 k-서로소인 경로 커버 문제로 변환될 수 있음을 보인다. 더구나 소스가 하나인 경우를 단일-소스 k-서로소인 경로 커버(single-source k-disjoint path cover)라고 부르는데, 이것은 일대다 k-서로소인 경로 커버 문제로 변환된다.

  • PDF

Mechanism for Vertical Welding for a Combination of Circular and Linear Paths (수직 원호 용접을 위한 메커니즘 구현에 관한 연구)

  • Noh, Tae-Yang;Jang, Won-Tek;Kim, Jae-Kwon;Park, Jong-Yoen
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.35 no.11
    • /
    • pp.1491-1497
    • /
    • 2011
  • One of the primary concerns in the design of welding devices is how to reduce the distance error between the welding path and the torch, especially when the path has a combination of circular and linear parts. This study investigated a mechanism for reducing the tracking error in the tangent area of a circular and linear path. A portable welding device, called a carriage, has been designed for a specific welding path by considering the distance error deviation. This welding carriage for vertical cover plate welding consists of a rail, a welding torch and the carriage body itself.

Path Planning for Cleaning Robots: A Graph Model Approach

  • Yun, Sang-Hoon;Park, Se-Hun;Park, Byung-Jun;Lee, Yun-Jung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.120.3-120
    • /
    • 2001
  • We propose a new method of path planning for cleaning robots. Path planning problem for cleaning robots is different from conventional path planning problems in which finding a collision-free trajectory from a start point to a goal point is focused. In the case of cleaning robots, however, a planned path should cover all area to be cleaned. To resolve this problem in a systematic way, we propose a method based on a graph model as follows: at first, partition a given map into proper regions, then transform a divided region to a vertex and a connectivity between regions to an edge of a graph. Finally, a region is divided into sub-regions so that the graph has a unary tree which is the simplest Hamilton path. The effectiveness of the proposed method is shown by computer simulation results.

  • PDF

A Study of Fiber Reinforce Ceramic Composite for Protecting Antenna Cover of Ultrafast Aircraft (초고속 비행체 안테나 보호용 섬유강화 세라믹 복합체 특성 연구)

  • Jung Yeong-Chul;Lee Kyung-Won;Yook Jong-Gwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.17 no.3 s.106
    • /
    • pp.295-306
    • /
    • 2006
  • In this paper, we proposed and implemented a novel antenna cover mounted over a microstrip path antenna for ultrafast aircraft. A protective antenna cover prevents alteration in the electrical characteristics of the antenna due to environmental conditions. The permittivity of the cover materials should be practically invariable at all operating frequencies. We evaluated the characteristics of the antenna with both simulation and experiment. The experimental results show that the proposed antenna cover can be useful for ultrafast aircraft.

A Study on the Interference between CDMA Base Station and Analog FM Mobile Station in the Mobile Communication (이동통신의 CDMA 기지국과 Analog FM 이동국의 상호간섭에 관한 연구)

  • Kim, In-Hwan;Park, Chang-Gyun
    • The Journal of the Acoustical Society of Korea
    • /
    • v.14 no.3
    • /
    • pp.105-113
    • /
    • 1995
  • For the case of using analog FM system and CDMA system together in the mobile communications, we experimentally calculate the appropriate frequency offset to improve the frequency efficiency by analizing the interference between both systems. As the results of the analysis, we obtained that frequency offset is 840KHz(Path Loss : 80dB) and 720KHz(Path Loss : 120dB) for the Path Loss when a output of CDMA Base Station is 0.91 W ERP. Therefore, to minimize the frequency offset, a output of Base Station will be controlled corresponding to Cover Area.

  • PDF

Linear Time Algorithm for Network Reliability Problem

  • Lee, Sang-Un
    • Journal of the Korea Society of Computer and Information
    • /
    • v.21 no.5
    • /
    • pp.73-77
    • /
    • 2016
  • This paper deals with the network reliability problem that decides the communication line between main two districts while the k districts were destroyed in military communication network that the n communication lines are connected in m districts. For this problem, there is only in used the mathematical approach as linear programming (LP) software package and has been unknown the polynomial time algorithm. In this paper we suggest the heuristic algorithm with O(n) linear time complexity to solve the optimal solution for this problem. This paper suggests the flow path algorithm (FPA) and level path algorithm (LPA). The FPA is to search the maximum number of distinct paths between two districts. The LPA is to construct the levels and delete the unnecessary nodes and edges. The proposed algorithm can be get the same optimal solution as LP for experimental data.