• Journal of Positioning, Navigation, and Timing
• /
• v.11 no.2
• /
• pp.99-107
• /
• 2022

Urban Air Mobility (UAM) such as a drone taxi is one of the future transportations that have recently been attracting attention. Along with the construction of an urban terminal, an accurate landing system for UAM is also essential. However, in urban environments, reliable Global Navigation Satellite Systems (GNSS) signals cannot be received due to obstacles such as high-rise buildings which causes multipath and non-line of sight signal. Thus, the positioning result in urban environments from the GNSS signal is unreliable. Consequently, we propose the Ultra-Wideband (UWB) network to assist the soft landing of UAM on a vertiport. Since the positioning performance of UWB network depends on the layout of UWB anchors, it is necessary to optimize the layout of UWB anchors. In this paper, we propose a two-steps genetic algorithm that consists of binary genetic algorithm involved multi objectives fitness function and integer genetic algorithm involved robust solution searching fitness function in order to optimize taking into account Fresnel hole effects.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.117-124
• /
• 2001

At NOW (Networks Of Workstations), the load sharing is very important role for improving the performance. The known load sharing strategy is fixed-granularity, variable-granularity and adaptive-granularity. The variable-granularity algorithm is sensitive to the various parameters. But Send algorithm, which implements the fixed-granularity strategy, is robust to task granularity. And the performance difference between Send and variable-granularity algorithm is not substantial. But, in Send algorithm, the computing time and the communication time are not overlapped. Therefore, long latency time at the network has influence on the execution time of the parallel program. In this paper, we propose the preSend algorithm. In the preSend algorithm, the master node can send the data to the slave nodes in advance without the waiting for partial results from the slaves. As the master node sent the next data to the slaves in advance, the slave nodes can process the data without the idle time. As stated above, the preSend algorithm can overlap the computing time and the communication time. Therefore we reduce the influence of the long latency time at the network and the execution time of the parallel program on the NOW. To compare the execution time of two algorithms, we use the $320{\times}320$ matrix multiplication. The comparison results of execution times show that the preSend algorithm has the shorter execution time than the Send algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.95.6-95
• /
• 2002

1. Introduction 2. Basic Concepts 2.1 Signal Model 2.2. Least-Mean-Square Adaptation Algorithm 3. Minimum Mean-Square Error 4. Bayesian Beamformer References

• Journal of Mechanical Science and Technology
• /
• v.15 no.9
• /
• pp.1207-1216
• /
• 2001

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.89-99
• /
• 2000

To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.

• Structural Engineering and Mechanics
• /
• v.54 no.2
• /
• pp.305-317
• /
• 2015

Optimal sensor placement (OSP) is an integral component in the design of an effective structural health monitoring (SHM) system. This paper describes the implementation of a novel collaborative-climb monkey algorithm (CMA), which combines the artificial fish swarm algorithm (AFSA) with the monkey algorithm (MA), as a strategy for the optimal placement of a predefined number of sensors. Different from the original MA, the dual-structure coding method is adopted for the representation of design variables. The collaborative-climb process that can make the full use of the monkeys' experiences to guide the movement is proposed and incorporated in the CMA to speed up the search efficiency of the algorithm. The effectiveness of the proposed algorithm is demonstrated by a numerical example with a high-rise structure. The results show that the proposed CMA algorithm can provide a robust design for sensor networks, which exhibits superior convergence characteristics when compared to the original MA using the dual-structure coding method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.10
• /
• pp.1823-1831
• /
• 2010

This paper proposes an automatic tracking control algorithm for efficiency improvement of photovoltaic generation. Increasing the power of PV systems should improve the efficiency of solar cells or the power condition system. The normal alignment of the PV module always have to run perpendicular to the sun's rays. The solar tracking system, able to improve the efficiency of the PV system, was initiated by applying that to the PV power plant. The tracking system of conventional PV power plant has been studied with regard to the tracking accuracy of the solar cells. Power generation efficiency were increased by aligning the cells for maximum exposure to the sun's rays. Using a perpendicular position facilitated optimum condition. However, there is a problem about the reliability of tracking systems unable to not track the sun correctly during environmental variations. Therefore, a novel control algorithm needs to improve the generation efficiency of the PV systems and reduce the loss of generation. This control algorithm is the proposed automatic tracking algorithm in this paper. Automatic tracking control is combined the sensor and program method for robust control in environment changing condition. This tracking system includes the insolation, rain sensor and anemometer for climate environment changing. Proposed algorithm in this paper, is compared to performance of conventional tracking control algorithm in variative insolation condition. And prove the validity of proposed algorithm through the experimental data.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.4
• /
• pp.35-40
• /
• 2010

Skyline extraction in mountainous images which has been used for navigation of vehicles or micro unmanned air vehicles is very hard to implement because of the complexity of skyline shapes, occlusions by environments, dfficulties to detect precise edges and noises in an image. In spite of these difficulties, skyline extraction is avery important theme that can be applied to the various fields of unmanned vehicles applications. In this paper, we developed a robust skyline extraction algorithm using two-scale canny edge images, topological information and location of the skyline in an image. Two-scale canny edge images are composed of High Scale Canny edge image that satisfies good localization criterion and Low Scale Canny edge image that satisfies good detection criterion. By applying each image to the proper steps of the algorithm, we could obtain good performance to extract skyline in images under complex environments. The performance of the proposed algorithm is proved by experimental results using various images and compared with an existing method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.9
• /
• pp.3782-3796
• /
• 2020

A three-dimensional (3D) reconstruction is an important research area in computer vision. The ability to detect and match features across multiple views of a scene is a critical initial step. The tracking matrix W obtained from a 3D reconstruction can be applied to structure from motion (SFM) algorithms for 3D modeling. We often fail to generate an acceptable number of features when processing face or medical images because such images typically contain large homogeneous regions with minimal variation in intensity. In this study, we seek to locate sufficient matching points not only in general images but also in face and medical images, where it is difficult to determine the feature points. The algorithm is implemented on an adaptive threshold value, a scale invariant feature transform (SIFT), affine SIFT, speeded up robust features (SURF), and affine SURF. By applying the algorithm to face and general images and studying the geometric errors, we can achieve quasi-dense matching points that satisfy well-functioning geometric constraints. We also demonstrate a 3D reconstruction with a respectable performance by applying a column space fitting algorithm, which is an SFM algorithm.

• The Journal of the Acoustical Society of Korea
• /
• v.39 no.1
• /
• pp.8-15
• /
• 2020

In this paper, we propose a frame synchronization algorithm for robust to the combined effects of large Doppler fluctuations and extended, time-varying multipath in the underwater acoustic communication. From the algorithm, we can recover a high timing error which is occurred from an acoustic propagation delay and uncertainty of oscillator between transmitter and receiver. In order to verify the performance of the synchronization algorithm, the lake trial results are used. The lake experiments are performed in a Gyeongcheonho located in Mungyeong-si, Gyeongsangbuk-do. We can see that the start position of frame is adjusted after the frame synchronization while the receiver moving.