• The Journal of Korea Robotics Society
• /
• 제6권3호
• /
• pp.255-262
• /
• 2011

Many intelligent robots have to be given environmental information to perform tasks. In this paper an intelligent robot, that is, a cleaning robot used a sensor fusing method of two sensors: LRF and StarGazer, and then was able to obtain the information. Throughout wall following using laser displacement sensor, LRF, the working area is built during the robot turn one cycle around the area. After the process of wall following, a path planning which is able to execute the work effectively is established using flow network algorithm. This paper describes an algorithm for minimal turning complete coverage path planning for intelligent robots. This algorithm divides the whole working area by cellular decomposition, and then provides the path planning among the cells employing flow networks. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The proposed algorithm is applied to two different working areas, and verified that it is an optimal path planning method.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• 제35C권3호
• /
• pp.1-15
• /
• 1998

In this paper, we propose a partial scan test method which can be applied to large VLSI designs. In this method, it is not necessary to hold neither scanned nor unscanned flip-flops during scan in, test application,or scan out. This test method requires almost identical design for testability modification and test wave form when compared to the full scan test method, and the method is applicable to large VLSI chips. The well known FAN algorithm has been modified to devise to sequential ATPG algorithm which is effective for the proposed test method. In addition, a partial scan algorithm which is effective for the proposed test method. In addition, a partial algorithm determined a maximal set of flip-flops which gives high fault coverage when they are unselected. The experimental resutls show that the proposed method allow as large as 20% flip-flops to remain unscanned without much decrease in the full scan fault coverage.

• Journal of Distribution Science
• /
• 제18권4호
• /
• pp.39-50
• /
• 2020

Purpose: This paper aimed to study the current locations of post offices to analyze service coverage area for parcel delivery in the Eastern Economics Corridor (EEC), which must be considered in the last mile to extend delivery service for e-commerce growth. Thailand Post was the case study in this paper. Research design, data and methodology: To involve solving the delivery service area under the last mile condition, the authors proposed a network analysis to determine service radius by employing a Geographic Information System (GIS). Furthermore, this paper applied Dijkstra's algorithm as a network analysis tool from GIS for analyzing the last mile service coverage area in a new economics zone. At the same time, the authors suggested an approach as a solution to locate last mile delivery center in EEC. Results: The results of the study pointed out that Thailand Post should consider more last mile delivery centers in EEC to support its express service in urban areas as well as improve the efficiency of service coverage for parcel delivery and create more advantages against competitors. Conclusions: This paper proposes a network analysis to extend the last mile service for parcel delivery by following Dijkstra's algorithm from GIS and a solution approach to add more last mile delivery centers. The results of the research will contribute to boosting customer satisfaction for last mile delivery service and enabling easy accessibility to a service center in EEC.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제34권4B호
• /
• pp.338-348
• /
• 2009

The Wireless Sensor Network (WSN) has recently attracted considerable attention due to the low price and ease to deploy it. In particular, in a hostile or harsh regions where sensors cannot be deployed manually, WSNs can be established just by dropping sensors from the air. In this case, however, most likely sensors are not placed at optimal positions, although the location of sensors does have a drastic impact on the WSN performance. Moreover, randomized deployment algorithm can leave holes in terms of coverage in the sensing area. This paper proposes a sensor relocation scheme where mobile sensors move to patch up the holes by appropriate coverage. Simulation results show that the proposed algorithm outperforms prior existing schemes in terms of coverage and lifespan of WSNs.

• Korean Journal of Computational Design and Engineering
• /
• 제19권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 the Korea Society of Computer and Information
• /
• 제21권1호
• /
• pp.73-78
• /
• 2016

In wireless sensor networks, sensors have capabilities of sensing and wireless communication, computing power and collect data such as sound, movement, vibration. Sensors need to communicate wirelessly to send their sensing data to other sensors or the base station and so they are vulnerable to many attacks like garbage packet injection that cannot be prevented by using traditional cryptographic mechanisms. To defend against such attacks, a behavior-based attack detection is used in which some specialized monitoring nodes overhear the communications of their neighbors(normal nodes) to detect illegitimate behaviors. It is desirable that the total sensing area of normal nodes covered by monitoring nodes is as large as possible. The previous researches have focused on selecting the monitoring nodes so as to maximize the number of normal nodes(node coverage), which does not guarantee that the area sensed by the selected normal nodes is maximized. In this study, we have developed an algorithm for selecting the monitoring nodes needed to cover the maximum sensing area. We also have compared experimentally the covered sensing areas computed by our algorithm and the node coverage algorithm.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• 제42권5호
• /
• pp.55-62
• /
• 2005

In this paper, we propose an efficient symbol detection algorithm for space-frequency OFDM (SF-OFDM) transmit diversity scheme and present the implementation results of the SF-OFDM WLAN baseband processor with the proposed algorithm. When the number of sub-carriers in SF-OFDM scheme is small, the interference between adjacent sub-carriers may be generated. The proposed algorithm eliminates this interference in a parallel manner and obtains a considerable performance improvement over the conventional detection algorithm. The bit error rate (BER) performance of the proposed detection algorithm is evaluated by the simulation. In the case of 2 transmit and 2 receive antennas, at $BER=10^{-4}$ the proposed algorithm obtains about 3 dB gain over the conventional detection algorithm. The packet error rate (PER), link throughput, and coverage performance of the SF-OFDM WLAN with the proposed detection algorithm are also estimated. For the target throughput at $80\%$ of the peak data rate, the SF-OFDM WLAN achieves the average SNR gain of about 5.95 dB and the average coverage gain of 3.98 meter. The SF-OFDM WLAN baseband processor with the proposed algorithm was designed in a hardware description language and synthesized to gate-level circuits using 0.18um 1.8V CMOS standard cell library. With the division-free architecture, the total logic gate count for the processor is 945K. The real-time operation is verified and evaluated using a FPGA test system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권8호
• /
• pp.2606-2626
• /
• 2022

In this paper, a unmanned aerial vehicle (UAV) access deployment algorithm is proposed, which is based on an improved virtual force model to solve the poor coverage quality of UAVs caused by limited number of UAVs and random mobility of users in the deployment process of UAV base station. First, the UAV-adapted Harris Hawks optimization (U-AHHO) algorithm is proposed to maximize the coverage of users in a given hotspot. Then, a virtual force improvement model based on user perception (UP-VFIM) is constructed to sense the mobile trend of mobile users. Finally, a UAV motion algorithm based on multi-virtual force sharing (U-MVFS) is proposed to improve the ability of UAVs to perceive the moving trend of user equipments (UEs). The UAV independently controls its movement and provides follow-up services for mobile UEs in the hotspot by computing the virtual force it receives over a specific period. Simulation results show that compared with the greedy-grid algorithm with different spacing, the average service rate of UEs of the U-AHHO algorithm is increased by 2.6% to 35.3% on average. Compared with the baseline scheme, using UP-VFIM and U-MVFS algorithms at the same time increases the average of 34.5% to 67.9% and 9.82% to 43.62% under different UE numbers and moving speeds, respectively.

• Journal of Korean Society of Transportation
• /
• 제26권3호
• /
• pp.145-153
• /
• 2008

This study proposes a facility location model in consideration of spatial coverage and travel cost as an effort to make objective and effective decisions of natural gas filling stations. The proposed model is developed for fixed stations and consists of two stages. The first stage employs a heuristic algorithm to find a set of locations which satisfy the spatial coverage constraints determined by the maximum travel distance between the filling stations and bus depots. In the second stage, the optimal location of filling stations is determined based on the minimum travel cost estimated by using a modified transportation problem as well as the construction and maintenance costs of the filling stations. The applicability of the model is analyzed through finding the optimal location of filling stations for the city of Anyang, a typical medium-sized city in metropolitan Seoul, based on the demand of natural gas buses. This study is expected to help promote the spread of natural gas buses by providing a starting point of a objective and reasonable methodological perspective to address the filling station location problem.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• 제21권10호
• /
• pp.1128-1135
• /
• 2010

The relay based cellular system has been introduced to provide the service to satisfy the user requirement. The main reasons of using relay station are to expand a service coverage and to increase a system throughput with satisfying the service requirement level. This paper proposes a new resource allocation algorithm which supports the users' throughput fairness and service coverage in the Fixed Relay Based Cellular system with OFDMA. The performance of proposed algorithm is compared with the performances of proportional fairness(PF) algorithm. The simulation result shows that the proposed algorithm increases the number of active users in the service coverage while paying small amount of throughput loss.