• Title/Summary/Keyword: Overlap Avoidance

Search Result 10, Processing Time 0.024 seconds

Overlap-Avoidance Algorithm for Automation of Drawing Generation (선체 조립도 생성 자동화를 위한 겹침 회피 알고리즘)

  • Ruy, Won-Sun;Yang, Young-Soon;Yun, Yeon-Suk;Ko, Dae-Eun
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.46 no.6
    • /
    • pp.622-630
    • /
    • 2009
  • This paper deals with the automation techniques of ship assembly drawing generation, which help the designer to reduce the man-hour for completing the drawings, and improve the quality of the drawing for the given time. The automation techniques are necessary for the reasons of economical efficiency and improve communication between the designers and shop-makers. The overlap-avoidance algorithm of this paper maximizes the readability of the drawings using the optimization techniques and the heuristic rules, especially for the ship assembly field.

An Energy-Efficient Clustering Mechanism Considering Overlap Avoidance in Wireless Sensor Networks (무선 센서 네트워크에서 중첩 방지를 고려한 효율적인 클러스터링 기법)

  • Choi, Hoon;Jung, Yeon-Su;Baek, Yun-Ju
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.5B
    • /
    • pp.253-259
    • /
    • 2008
  • Because a sensor node in wireless sensor networks is battery operated and energy constrained, reducing energy consumption of each node is one of important issues. The clustering technique can make network topology be hierarchical and reduce energy consumption of each sensor node. In this paper, we propose an efficient clustering mechanism considering overlap avoidance in wireless sensor networks. The proposed method consists of three parts. The first is to elect cluster heads considering each node's energy. Then clusters are formed by using signal strength in the second phase. Finally we can reduce the cluster overlap problem derived from two or more clusters. In addition, this paper includes performance evaluation of our algorithm. Simulation results show that network lifetime was extended up to 75 percents than LEACH and overlapped clusters are decreased down to nearly zero percents.

An Application of Overlap Avoidance to Augment the Production Data in Pipe Installation Drawings (배관설치도 내 생산정보 증강을 위한 겹침 회피 알고리즘의 적용)

  • Hwang, InHyuck;Ruy, WonSun;Park, InHa;Park, JungSeo
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.53 no.5
    • /
    • pp.428-434
    • /
    • 2016
  • A lot of drawings for pipe construction and installation are needed to construct plant process system on the offshore plant structures. Depending on their scale or complexity, the required number of drawings related pipes sometimes amounts to several hundreds of thousands. Most major shipyards, therefore, have their own system which can automatically depict pipes’ geometric, manufacturing, and BOM(Bill of Material) information on the drawings. However, as the complexity and absolute quantity in the isometric region on the drawings is increased, the information extraction from the customized DB and positioning at the typical locations does not get to be enough to avoid the overlap between geometric contours, labels, and symbols. For this reason, the novel methods to arrange additional annotations without overlaps are presented in the paper. This approach is expected to increase the readability and legibility of the drawing and prevent the human error, and finally decrease the time-consuming and tedious jobs which are unnecessarily required to designers.

Multiple Drones Collision Avoidance in Path Segment Using Speed Profile Optimization (다수 드론의 충돌 회피를 위한 경로점 구간 속도 프로파일 최적화)

  • Kim, Tae-Hyoung;Kang, Tae Young;Lee, Jin-Gyu;Kim, Jong-Han;Ryoo, Chang-Kyung
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.11
    • /
    • pp.763-770
    • /
    • 2022
  • In an environment where multiple drones are operated, collisions can occur when path points overlap, and collision avoidance in preparation for this is essential. When multiple drones perform multiple tasks, it is not appropriate to use a method to generate a collision-avoiding path in the path planning phase because the path of the drone is complex and there are too many collision prediction points. In this paper, we generate a path through a commonly used path generation algorithm and propose a collision avoidance method using speed profile optimization from that path segment. The safe distance between drones was considered at the expected point of collision between paths of drones, and it was designed to assign a speed profile to the path segment. The optimization problem was defined by setting the distance between drones as variables in the flight time equation. We constructed the constraints through linearize and convexification, and compared the computation time of SQP and convex optimization method in multiple drone operating environments. Finally, we confirmed whether the results of performing convex optimization in the 20 drone operating environments were suitable for the multiple drone operating system proposed in this study.

Spectrum Reuse Schemes with Power Control for Device-to-Device Communication in LTE-Advanced Cellular Network

  • Chhorn, Sok;Yoon, Seok-Ho;Seo, Si-O;Kim, Seung-Yeon;Cho, Choong-Ho
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.12
    • /
    • pp.4819-4834
    • /
    • 2015
  • The spectral efficiency of cellular networks can be improved when proximate users engage in device-to-device (D2D) communications to communicate directly without going through a base station. However, D2D communications that are not properly designed may generate interference with existing cellular networks. In this paper, we study resource allocation and power control to minimize the probability of an outage and maximize the overall network throughput. We investigate three power control-based schemes: the Partial Co-channel based Overlap Resource Power Control (PC.OVER), Fractional Frequency Reuse based Overlap Resource Power Control (FFR.OVER) and Fractional Frequency Reuse based Adaptive Power Control (FFR.APC) and also compare their performance. In PC.OVER, a certain portion of the total bandwidth is dedicated to the D2D. The FFR.OVER and FFR.APC schemes combine the FFR techniques and the power control mechanism. In FFR, the entire frequency band is partitioned into two parts, including a central and edge sub-bands. Macrocell users (mUEs) transmit using uniform power in the inner and outer regions of the cell, and in all three schemes, the D2D receivers (D2DRs) transmit with low power when more than one D2DRs share a resource block (RB) with the macrocells. For PC.OVER and FFR.OVER, the power of the D2DRs is reduced to its minimum, and for the FFR.APC scheme, the transmission power of the D2DRs is iteratively adjusted to satisfy the signal to interference ratio (SIR) threshold. The three schemes exhibit a significant improvement in the overall system capacity as well as in the probability of a user outage when compared to a conventional scheme.

A Schematic Map Generation System Using Centroidal Voronoi Tessellation and Icon-Label Replacement Algorithm (중심 보로노이 조각화와 아이콘 및 레이블 배치 알고리즘을 이용한 도식화된 지도 생성 시스템)

  • Ryu Dong-Sung;Uh Yoon;Park Dong-Gyu
    • Journal of Korea Multimedia Society
    • /
    • v.9 no.2
    • /
    • pp.139-150
    • /
    • 2006
  • A schematic map is a special purpose map which is generated to recognize it's objects easily and conveniently via simplifying and highlighting logical geometric information of a map. To manufacture the schematic map with road, label and icon, we must generate simplified route map and replace many geometric objects. Performing a give task, however, there are an amount of overlap areas between geometric objects whenever we process the replacement of geometry objects. Therefore we need replacing geometric objects without overlap. But this work requires much computational resources, because of the high complexity of the original geometry map. We propose the schematic map generation system whose map consists of icons and label. The proposed system has following steps: 1) eliminating kinks that are least relevant to the shape of polygonal curve using DCE(Discrete Curve Evolution) method. 2) making an evenly distributed route using CVT(Centroidal Voronoi Tessellation) and Grid snapping method. Therefore we can keep the structural information of the route map from CVT method. 3) replacing an icon and label information with collision avoidance algorithm. As a result, we can replace the vertices with a uniform distance and guarantee the available spaces for the replacement of icons and labels. We can also minimize the overlap between icons and labels and obtain more schematized map.

  • PDF

Algorithmic Proposal of Optimal Loading Pattern and Obstacle-Avoidance Trajectory Generation for Robot Palletizing Simulator (로봇 팔레타이징 시뮬레이터를 위한 적재 패턴 생성 및 시변 장애물 회피 알고리즘의 제안)

  • Yu, Seung-Nam;Lim, Sung-Jin;Kim, Sung-Rak;Han, Chang-Soo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.13 no.11
    • /
    • pp.1137-1145
    • /
    • 2007
  • Palletizing tasks are necessary to promote efficient storage and shipping of boxed products. These tasks, however, involve some of the most monotonous and physically demanding labor in the factory. Thus, many types of robot palletizing systems have been developed, although many robot motion commands still depend on the teach pendant. That is, the operator inputs the motion command lines one by one. This is very troublesome and, most importantly, the user must know how to type the code. We propose a new GUI(Graphic User Interface) for the palletizing system that is more convenient. To do this, we used the PLP "Fast Algorithm" and 3-D auto-patterning visualization. The 3-D patterning process includes the following steps. First, an operator can identify the results of the task and edit them. Second, the operator passes the position values of objects to a robot simulator. Using those positions, a palletizing operation can be simulated. We chose a widely used industrial model and analyzed the kinematics and dynamics to create a robot simulator. In this paper we propose a 3-D patterning algorithm, 3-D robot-palletizing simulator, and modified trajectory generation algorithm, an "overlapped method" to reduce the computing load.

A New Low-Skew Clock Network Design Method (새로운 낮은 스큐의 클락 분배망 설계 방법)

  • 이성철;신현철
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.5
    • /
    • pp.43-50
    • /
    • 2004
  • The clock skew is one of the major constraints for high-speed operation of synchronous integrated circuits. In this paper, we propose a hierarchical partitioning based clock network design algorithm called Advanced Clock Tree Generation (ACTG). Especially new effective partitioning and refinement techniques have been developed in which the capacitance and edge length to each sink are considered from the early stage of clock design. Hierarchical structures obtained by parhtioning and refinement are utilized for balanced clock routing. We use zero skew routing in which Elmore delay model is used to estimate the delay. An overlap avoidance routing algorithm for clock tree generation is proposed. Experimental results show significant improvement over conventional methods.

Data Overlap Avoidance Algorithm Based on Traffic Scheduling (트래픽 스케줄링 기반 데이터 중복 회피 알고리즘)

  • Choi, Myeong Soo;Kim, Beom-Mu;Lee, Seong Ro
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.9
    • /
    • pp.841-851
    • /
    • 2014
  • Wireless technologies sharing the same frequency band and operating in the same environment often interfere with each other, causing severe decrease in performance. In this paper, we propose a algorithm based on traffic scheduling techniques that mitigate interference between different wireless systems operating in the 2.4-GHz industrial, medical, and scientific band. In particular, we consider IEEE 802.11 wireless local area networks (WLANs) and Bluetooth data transfer, showing that the proposed algorithms can work when the two systems are able to exchange information as well as when they operate independently of one another. Results indicate that the proposed algorithm remarkably mitigate the interference between the WLAN and Bluetooth technologies at the expense of a small additional delay in the data transfer.

Dietary composition of two coexisting bat species, Myotis ikonnikovi and Plecotus ognevi, in the Mt. Jumbong forests, South Korea

  • Sungbae Joo;Injung An;Sun-Sook Kim
    • Journal of Ecology and Environment
    • /
    • v.47 no.4
    • /
    • pp.168-176
    • /
    • 2023
  • Background: Many insectivorous bats have flexible diets, and the difference in prey item consumption among species is one of the key mechanisms that allows for the avoidance of interspecies competition and promotes coexistence within a microhabitat. In Korea, of the 24 bat species that are known to be distributed, eight insectivorous bats use forest areas as both roosting and foraging sites. Here, we aimed to understand the resource partitioning and coexistence strategies between two bat species, Myotis ikonnikovi and Plecotus ognevi, cohabiting the Mt. Jumbong forests, by comparing the differences in dietary consumption based on habitat utilization. Results: Upon examining their dietary composition using the DNA meta-barcoding approach, we identified 403 prey items (amplicon sequence variants). A greater prey diversity including Lepidoptera, Diptera, Coleoptera, and Ephemeroptera, was detected from M. ikonnikovi, whereas most prey items identified from P. ognevi belonged to Lepidoptera. The diversity index of prey items was higher for M. ikonnikovi (H': 5.67, D: 0.995) than that for P. ognevi (H': 4.31, D: 0.985). Pianka's index value was 0.207, indicating little overlap in the dietary composition of these bat species. Our results suggest that M. ikonnikovi has a wider diet composition than P. ognevi. Conclusions: Based on the dietary analysis results, our results suggests the possibility of differences in foraging site preferences or microhabitat utilization between two bat species cohabiting the Mt. Jumbong. In addition, these differences may represent one of the important mechanism in reducing interspecific competition and enabling coexistence between the two bat species. We expected that our results will be valuable for understanding resource partitioning and the coexistence of bats inhabiting the Korean forests.