• Journal of Electrical Engineering and Technology
• /
• v.7 no.6
• /
• pp.1023-1033
• /
• 2012

An underwater planar covering problem is studied where the coverage region consists of polygonal cells, and line sweep motion is used for coverage. In many subsea applications, sidescan sonar has become a common tool, and the sidescan sonar data is meaningful only when the sonar is moving in a straight line. This work studies the optimal line sweep coverage where the sweep paths of the cells consist of straight lines and no turn is allowed inside the cell. An optimal line sweep coverage solution is presented when the line sweep path is parallel to an edge of the cell boundary. The total time to complete the coverage task is minimized. A unique contribution of this work is that the optimal sequence of cell visits is computed in addition to the optimal line sweep paths and the optimal cell decomposition.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.443-452
• /
• 2016

Current low-altitude radar system often fails to detect small unmanned aerial vehicles (UAV) because of their small radar cross section (RCS) compared with larger targets. As a potential alternative, a passive bistatic radar system has been considered. We study an optimal deployment problem for the passive bistatic radar system. We model this problem as a covering problem, and develop an integer programming model. The objective of the model is to maximize coverage of a passive bistatic radar system. Our model takes into account factors specific to a bistatic radar system, including bistatic RCS and transmitter-receiver pair coverage. Considering bistatic RCS instead of constant RCS is important because the slight difference of RCS value for small UAVs could significantly influence the detection probability. The paired radar coverage is defined by using the concept of gradual coverage and cooperative coverage to represent a realistic environment.

• Journal of Biosystems Engineering
• /
• v.38 no.1
• /
• pp.18-24
• /
• 2013

Purpose: This study was conducted to develop an optimal combine scheduling program using Max-Coverage algorithm which derives the maximum efficiency for a specific location in harvest seasons. Methods: The combine scheduling program was operated with information about combine specification and farmland. Four operating types (Max-Coverage algorithm type, Boustrophedon path type, max quality value type, and max area type) were selected to compare quality and working capacity. Result: The working time of Max-Coverage algorithm type was shorter than others, and the total quality value of Max-Coverage algorithm and max quality value type were higher than others. Conclusion: The developed combine scheduling program using Max-Coverage algorithm will provide optimal operation and maximum quality in a limited area and time.

• Korean Journal of Computational Design and Engineering
• /
• v.19 no.1
• /
• pp.12-18
• /
• 2014

Shot-peening is frequently used on various mechanical parts because it can improve the fatigue life of components by generating compressive residual stresses on the surface. This can be done by repeatedly hitting the work-piece surface with small balls and making indentations on it. In fact, finding optimal peening time among various peening parameters is the most important. Under-peening can not improve the fatigue life sufficiently while over-peening causes cracks and reduces fatigue life in contrast. In general, optimal peening time is experimentally determined by measuring arc-height using Almen-strip in accordance with SAE J442 standard. To save the time and efforts spent in carrying out experiments to find optimal peening time, this paper presents a computer simulation algorithm for the estimation of surface coverage made by impeller type shot-peening machines (PMI-0608). Surface coverage is defined as the proportion of the work-piece surface that has been indented in a given time of shot-peening. An example (standard tensile test specimen) is presented to validate the proposed method.

• Journal of Communications and Networks
• /
• v.11 no.1
• /
• pp.57-71
• /
• 2009

Networking together hundreds or thousands of cheap sensor nodes allows users to accurately monitor a remote environment by intelligently combining the data from the individual nodes. As sensor nodes are typically battery operated, it is important to efficiently use the limited energy of the nodes to extend the lifetime of the wireless sensor network (WSN). One of the fundamental issues in WSNs is the coverage problem. In this paper, the border coverage problem in WSNs is rigorously analyzed. Most existing results related to the coverage problem in wireless sensor networks focused on planar networks; however, three dimensional (3D) modeling of the sensor network would reflect more accurately real-life situations. Unlike previous works in this area, we provide distributed algorithms that allow the selection and activation of an optimal border cover for both 2D and 3D regions of interest. We also provide self-healing algorithms as an optimization to our border coverage algorithms which allow the sensor network to adaptively reconfigure and repair itself in order to improve its own performance. Border coverage is crucial for optimizing sensor placement for intrusion detection and a number of other practical applications.

• Journal of Astronomy and Space Sciences
• /
• v.38 no.4
• /
• pp.217-227
• /
• 2021

In this study, we describe an analytical process for designing a low Earth orbit constellation for discontinuous regional coverage, to be used for a surveillance and reconnaissance space mission. The objective of this study was to configure a satellite constellation that targeted multiple areas near the Korean Peninsula. The constellation design forms part of a discontinuous regional coverage problem with a minimum revisit time. We first introduced an optimal inclination search algorithm to calculate the orbital inclination that maximizes the geometrical coverage of single or multiple ground targets. The common ground track (CGT) constellation pattern with a repeating period of one nodal day was then used to construct the rest of the orbital elements of the constellation. Combining these results, we present an analytical design process that users can directly apply to their own situation. For Seoul, for example, 39.0° was determined as the optimal orbital inclination, and the maximum and average revisit times were 58.1 min and 27.9 min for a 20-satellite constellation, and 42.5 min and 19.7 min for a 30-satellite CGT constellation, respectively. This study also compares the revisit times of the proposed method with those of a traditional Walker-Delta constellation under three inclination conditions: optimal inclination, restricted inclination by launch trajectories from the Korean Peninsula, and inclination for the sun-synchronous orbit. A comparison showed that the CGT constellation had the shortest revisit times with a non-optimal inclination condition. The results of this analysis can serve as a reference for determining the appropriate constellation pattern for a given inclination condition.

• Korean Management Science Review
• /
• v.14 no.1
• /
• pp.53-66
• /
• 1997

Generally, the standard sizes of military combat fatigues should be determined by considering the coverage rate in order to minimize the military personnel who can't put on the ready made military combat fatigues. The coverage rate should be increased by the longer interval of the standard size but the satisfactory rate will be decreased due to the longer interval of size. This study develops a method selecting optimal standard sizes of the military combat fatigues in order to maximize the satisfactory rate that insures the coverage rate to meet a given level for ready made military combat fatigues. This method selects candidate standard sizes at second and finally, establishes a 0-1 inter programming model. The result shows that the method increases both coverage and satisfactory rate more than those of the previous method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.53-53
• /
• 1989

Generally, the standard sizes of military combat fatigues should be determined by considering the coverage rate in order to minimize the military personnel who can't put on the ready made military combat fatigues. The coverage rate should be increased by the longer interval of the standard size but the satisfactory rate will be decreased due to the longer interval of size. This study develops a method selecting optimal standard sizes of the military combat fatigues in order to maximize the satisfactory rate that insures the coverage rate to meet a given level for ready made military combat fatigues. This method selects candidate standard sizes at second and finally, establishes a 0-1 integer programming model. The result shows that the method increases both coverage and satisfactory rate more than those of the previous method.

• The KIPS Transactions:PartA
• /
• v.16A no.1
• /
• pp.35-42
• /
• 2009

This paper proposes a new coverage algorithm for intelligent robot. Many algorithms for improving the performance of coverage have been focused on minimizing the total coverage completion time. However, if one does not have enough time to finish the whole coverage, the optimal path could be different. To tackle this problem, we propose a new coverage algorithm, which we call MaxCoverage algorithm, for covering maximal area within the deadline. The MaxCoverage algorithm decides the navigation flow by greedy algorithm for Set Covering Problem. The experimental results show that the MaxCoverage algorithm performs better than other algorithms for random deadlines.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.10
• /
• pp.4804-4822
• /
• 2017

Coverage problem is a research hot spot in directional sensor networks (DSNs). However, the major problem affecting the performance of the current coverage-enhancing strategies is that they just optimize the coverage of networks, but ignore the maximum number of sleep sensors to save more energy. Aiming to find an approximate optimal method that can cover maximum area with minimum number of active sensors, in this paper, a new scheduling algorithm based on learning automata is proposed to enhance area coverage, and shut off redundant sensors as many as possible. To evaluate the performance of the proposed algorithm, several experiments are conducted. Simulation results indicate that the proposed algorithm have effective performance in terms of coverage enhancement and sleeping sensors compared to the existing algorithms.