• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2022.11a
• /
• pp.168-169
• /
• 2022

In this study, we investigates the auto-berthing problem for the underactuated surface vessel in the presence of constraints of dynamic uncertainties, finite time, transmission load, and environmental disturbance. A novel control scheme is proposed by fusing the finite time control technology and the event-triggered input algorithm. In the algorithm, differential homeomorphism coordinate the transformation is used to solve the problem of underactuation. Then, we apply the finite time technology and event triggered to save the time of the berthing vessel and relieve transmission burden between the controller and the vessel respectively. Moreover, a radial basis function network is used to approximate unknown nonlinear functions, and minimum learning parameters are introduced to lessen the computational complexity. A sufficient effort has been made to verify the stability of the closed-loop system based on the Lyapunov stability theory. Finally, simulation results display the effectiveness of the proposed scheme.

• Journal of Korea Water Resources Association
• /
• v.32 no.5
• /
• pp.557-564
• /
• 1999

Monitoring of groundwater Quality is essential for the preservation of groundwater resources. In practice. however, groundwater monitoring network is designed based on the experience and intuition of experts or on the convenience. This study proposes a simulation-optimization approach for the optimal design of monitoring networks. In it, the predicted three-dimensional concentration data are used as the input of an optimization problem. Various design objectives and constraints are considered and the problem is formulatcu as the 0-1 integer programming. The methodology was applied to a sanitary landfill site. The results show that the monitoring network configuration changes as the monitoring goal, operation time and constraints vary. The proposed method turns out to be an efficient tool for the wide range of groundwater Quality monitoring network design problems.oblems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.3_4
• /
• pp.168-185
• /
• 2003

This paper presents a progressive algorithm that not only can narrow down the search domain in the course of face identification but also can fast reconstruct various 3D objects from a sketch drawing. The sketch drawing, edge-vertex graph without hidden line removal, which serves as input for reconstruction process, is obtained from an inaccurate freehand sketch of a 3D wireframe object. The algorithm is executed in two stages. In the face identification stage, we generate and classify potential faces into implausible, basis, and minimal faces by using geometrical and topological constraints to reduce search space. The proposed algorithm searches the space of minimal faces only to identify actual faces of an object fast. In the object reconstruction stage, we progressively calculate a 3D structure by optimizing the coordinates of vertices of an object according to the sketch order of faces. The progressive method reconstructs the most plausible 3D object quickly by applying 3D constraints that are derived from the relationship between the object and the sketch drawing in the optimization process. Furthermore, it allows the designer to change viewpoint during sketching. The progressive reconstruction algorithm is discussed, and examples from a working implementation are given.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.15-26
• /
• 2002

Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.2
• /
• pp.29-35
• /
• 2001

In general, image-based virtual environment is represented by panoramic images created by image mosaic algorithm. The cylindrical panoramic image supports the fixed-viewpoint navigation due to the constraints of construction. Shum proposed concentric mosaics to allow users to navigate freely within a circular area[10]. It is constructed by a sequence of images which is acquired from a regularly rotating camera. Concentric mosaics technique, proposed by Shum, is considered as 3D plenoptic function which is defined three parameters : distance, height and angle. In this paper, we suggest an effective method for creating concentric mosaics, in which we first align a set of strip images on the cylinder plane and stitch the aligned strips to build a panoramic image. The proposed method has no constraints such as regular panning motion of camera. Furthermore, our proposed method minimizes the use of interpolation image to create a novel view images from the concentric mosaics. It allows the result image on a novel view to have better quality with respect to the number of input images.

• Journal of the military operations research society of Korea
• /
• v.34 no.2
• /
• pp.63-77
• /
• 2008

With the limited frequency spectrum and an increasing demand for cellular communication services, the problem of channel assignment becomes increasingly important. However, finding a conflict free channel assignment with the minimum channel span is NP hard. The innovations are cellular concept, dynamic channel assignment and hierarchical network design. We consider the frequency assignment problem and the base station placement simultaneously. Our model takes the candidate locations emanating from this process and the cost of assigning a frequency, operating and maintaining equipment as an input. Hierarchical network design using genetic algorithm is the first three-tier (Macro, Micro, Pico) model. We increase the reality through applying to Electromagnetic Compatibility Constraints. Computational experiments on 72 problem instances which have $15{\sim}40$ candidate locations demonstrate the computational viability of our procedure. The result of experiments increases the reality and covers 90% of the demand.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.387-395
• /
• 2009

The establishment of security architecture is essential because security vulnerabilities occur such as user's unjustifiable connection for the opened gateway and access to resources without permission in OSGi service platform environment. In this paper, it proposes a authentication technique for an Automatic user authentication which is used the Symmetric Key and the Service bundle authentication to consider the constraints of the hardware in the OSGi service platform environment. Typically, the type of entering a password is used for the user authentication mechanism however OSGi platform environment studies not entering the password but using MAC address and encrypted identifier of the automatic user authentication mechanism because the devices are limited in their input. In this paper, the Symmetric Key is used for bundle authentication mechanism. Therefore operation becomes quick and secure authentication process has been successfully completed by using the time data and a ticket which contains a license. Based on these two different authentication mechanisms, it could eliminate the constraints of resources and improve the convenience of users and administrators. Also it shows an effect from omitting the waiting time to enter a password and reducing operations which need for authentication in the OSGi service platform environment.

• Journal of Astronomy and Space Sciences
• /
• v.13 no.2
• /
• pp.52-66
• /
• 1996

In this paper, we present the design methodology of KASCOM(KAIST satellite computer), the experimental on-board computer system of KITSAT-2. The design of the on-board computer system should consider the following constraints: operational throughput, fault tolerant input-output, low power, size, weight, and radiation hardness. KASCOM is designed to satisfy these constraints. This paper also presents the implementation and testing details of KASCOM. Finally, the in-orbit operational results are presented. The results show that about 2 SEU errors occur for the program memory(1Mbit SRAM) in a day, while 3.7 SEU errors occur for the data memory(4Mbit SRAM). This implies that high-integrated memories are more susceptible to the radiation environment than low-integrated memories.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.37 no.5
• /
• pp.19-28
• /
• 2000

It is not so easy to control the wheeled mobile robot because of some causes like non-holonomic constraints. To overcome these problems, a controller that PD system is combined with fuzzy process is composed of several steps that have each separate algorithm and niche search algorithm and immune algorithm is applied partly. Output term set is changed by search that is performed to get optimal elements and then the rule base is also reformed. The fitness for the altered system is estimated and the surplus elements are removed. After the adjustment of output term set and rule base is finished, input and output membership functions is tuned.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.21 no.6
• /
• pp.737-742
• /
• 2011

Navigation problems include the task of determining the control input under various constraints for systems such as mobile robots subject to uncertain disturbance. Such tasks can be modeled as constrained stochastic control problems. In order to solve these control problems, one may try to utilize the dynamic programming(DP) methods which rely on the concept of optimal value function. However, in most real-world problems, this trial would give us many difficulties; for examples, the exact system model may not be known; the computation of the optimal control policy may be impossible; and/or a huge amount of computing resource may be in need. As a strategy to overcome the difficulties of DP, one can utilize ADP(approximate dynamic programming) methods, which find suboptimal control policies resorting to approximate value functions. In this paper, we apply recently proposed ADP methods to a class of navigation problems having complex constraints, and observe the resultant performance characteristics.