• 한국컴퓨터정보학회논문지
• /
• 제15권1호
• /
• pp.61-69
• /
• 2010

로봇이 동작하는 환경을 완벽하게 커버리지 하기 위해서는 전체환경 지도를 가지고 있어야 한다. 그러나 대부분의 기존 커버리지 알고리즘은 로봇이 동작하기 전 사전에 생성된 지도가 있어야 동작 한다. 이런 이유로 기존의 커버리지 알고리즘은 미지의 환경에 바로 적용할 수 없는 문제를 가지고 있다. 미지의 환경에서 로봇이 모든 영역을 커버리지 하기위해서는 로봇스스로 환경 지도를 생성할 수 있어야한다. 본 논문에서는 SLAM 알고리즘을 통합하여 미지의 환경에서 로봇이 환경 지도를 생성하며 생성된 지도를 기반으로 커버리지를 수행하는 DmaxCoverage 알고리즘을 제안한다. 시뮬레이션 실험을 통해서 DmaxCoverage 알고리즘이 기존의 커버리지 알고리즘에 비해서 효율적임을 증명하였다.

• International Journal of Reliability and Applications
• /
• 제4권3호
• /
• pp.131-139
• /
• 2003

There is a new trend of incorporating software coverage metrics into software modelling. This paper proposes and empirically evaluates a software reliability growth model, which relates reliability to coverage. The proposed model is derived by modifying the assumptions on which Veevers and Marshall model is based.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• Communications for Statistical Applications and Methods
• /
• 제15권6호
• /
• pp.875-881
• /
• 2008

This paper first discusses the existing non-homogeneous Poisson process(NHPP) software reliability growth model(SRGM) frameworks with respect to capability of representing software reliability growth phenomenon. As an enhancement of representational capability a new general coverage-based NHPP SRGM framework is developed. Issues associated with application of the new framework are then considered.

• International Journal of Reliability and Applications
• /
• 제8권1호
• /
• pp.53-66
• /
• 2007

This paper proposes a new non-homogeneous Poisson process software reliability growth model based on the coverage information. The new model incorporates the coverage information in the fault detection process by assuming that only the faults in the covered constructs are detectable. Since the coverage growth behavior depends on the testing strategy, the fault detection process is first modeled for the general testing strategy and then realized for the uniform testing. Finally the model for the uniform testing is empirically evaluated by applying it to real data sets.

• 한국의학물리학회지:의학물리
• /
• 제17권1호
• /
• pp.6-16
• /
• 2006

본 연구의 목적은 세기변조 방사선 치료법(IMRT)에 의해 만들어진 DVH를 이용하여 선량의 균등률(homogeneity) 및 덮임률(coverage) 지수를 구하는 간편한 방법을 제시하는 데 있다. 새로 개발된 지수들은 DVH 곡선을 수학적으로 계단 함수에 fitting 함으로써 구해졌다. 새로 제안된 지수 l는 종양에 대한 선량의 덮임률을 잘 나타내고 있으며 이 지수가 작으면 작을수록 더 좋은 덮임률을 보여주고 있다. 또한 종양의 균등률 지수로 제안된 n 지수는 기존에 사용되고 있는 균등률 지수들보다 좀 더 정확하게 선량의 균등성을 나태내고 있음을 확인하였다. 이들 지수를 이용하여 치료계획에 바탕이 되는 토대를 제시하였으며 여기에서 제안된 지수들이 선량의 균등성과 덮임성에 대해 매우 효과적인 방법이 될 수 있음을 보여주고 있다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권2호
• /
• pp.326-354
• /
• 2014

In this paper, a new green clustering algorithm is proposed to be as a first approach in the framework of an energy efficient strategy for centralized enterprise high-density WLANs. Traditionally, in order to maintain the network coverage, all the APs within the WLAN have to be powered-on. Nevertheless, the new algorithm can power-off a large proportion of APs while the coverage is maintained as its always-on counterpart. The two main components of the new approach are the faster procedure based on K-means and the more accurate procedure based on Evolutionary Algorithm (EA), respectively. The two procedures are processes in parallel for different designed requirements and there is information interaction in between. In order to implement the new algorithm, EA is applied to handle the optimization of multiple objectives. Moreover, we adapt the method for selection and recombination, and then introduce a new operator for mutation. This paper also presents simulations in scenarios modeled with ray-tracing method and FDTD technique, and the results show that about 67% to 90% of energy consumption can be saved while it is able to maintain the original network coverage during periods when few users are online or the traffic load is low.

• 한국통신학회논문지
• /
• 제35권3B호
• /
• pp.453-461
• /
• 2010

무선 센서 네트워크의 센서 노드들은 한정된 자원을 가지고 있으며 배터리의 교체가 어렵다는 특성을 가지고 있기 때문에 제한된 에너지를 효율적으로 사용하는 기법은 매우 중요하다. 지금까지 이러한 센서 노드의 에너지 소모를 최소화하기 위하여 다양한 스케줄링 문제 및 해결 방안에 관한 연구들이 진행되어 왔다. 특히 CTC(Connected Target Coverage) 문제는 타겟 커버리지와 연결성을 동시에 고려하여 센서 노드들의 효율적인 상태 전이 시점을 결정하는 대표적인 스케줄링 문제로 간주된다. 본 논문에서는 중복되어 센싱되는 타겟을 고려한 보다 올바른 센서 에너지 소비 모델을 제안하고 센서 네트워크의 수명을 더욱 연장 할 수 있는 CMTC(Connected Multiple-Target Coverage) 문제를 제시한다. 또한, 이 문제를 해결하기 위한 SPT(Shortest Path based on Targets) Greedy 알고리즘을 제안하고 시뮬레이션을 통하여 제안기법이 기존기법보다 센서 네트워크의 수명을 더욱 연장하는 기법임을 보인다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.252-254
• /
• 2005

Completer coverage path planning requires the robot path to cover every part of the workspace, which is an essential issue in cleaning robots and many other robotic applications such as vacuum robots and painter robots. In this paper, a novel Water Flowing Algorithm (WFA) is proposed for cleaning robots to complete coverage path planning in unknown environment without obstacles. The robot covers the whole workspace just like that water fills up a container. First the robot goes to the lowest point in the workspace just like water flows to the bottom of the container. At last the robot will come to highest point in the workspace just like water overflows from the container and simultaneously the robot has covered the whole workspace. The computer simulation results show that the proposed algorithm enable the robot to plan complete coverage paths.

• 환경영향평가
• /
• 제13권5호
• /
• pp.263-276
• /
• 2004

This research is primarily intended to propose a new concept for aggregate control of impervious coverage using remote sensing and GIS. An empirical study for a case study site was conducted to demonstrate how a standard remote sensing and GIS technology can be used to assist in implementing the aggregate control for impervious coverage as intermediary between decision makers and scientists. Guidelines for a replicable methodology are presented to provide a strong theoretical basis for the standardization of factors involved in the aggregate control; the meaningful definition of land mosaic in terms of pervious areas, classification of pervious intensity, change detection for pervious areas. Detailed visual maps (e.g. estimation of impervious surface allowable) can be generated over large areas quickly and easily to increase the scientific and objective decision-making for the aggregate control. It is anticipated that this research output could be used as a valuable reference to confirm the potential of remote sensing and GIS in the aggregate control for impervious coverage.