• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2006.11a
• /
• pp.359-362
• /
• 2006

This study develops an automatic berthing control algorithm for ships with a bow thruster and a stern thruster as well as a rudder. A nonlinear mathematical model for low speed maneuvering of ships is used to develop a MIMO(multi-input multi-output) nonlinear control algorithm. The algorithm consists of two parts, which are forward velocity control and heading angle control. The control algorithm is designed based on the longitudinal and yaw dynamic models of ships. The desired heading angle is obtained by the so called "Line of Sight" method. An optimal control force allocation method of the rudder and the thrusters is suggested. The nonlinear control algorithms are tested by numerical simulations using MATLAB, and shows good tracking performances.

• Journal of Ocean Engineering and Technology
• /
• v.22 no.3
• /
• pp.34-40
• /
• 2008

his study discusses the design of an automatic berthing control algorithm for ships with a haw thruster and a stern thruster, as well as a rudder. A nonlinear mathematical model for the law speed maneuvering of ships was used to design a MIMO (multi-input multi-output) nonlinear control algorithm. The algorithm consists of two parts, the forward velocity control and heading angle control. The control algorithm was designed based on the longitudinal and yaw dynamic models of ships. The desired heading angle was obtained by the so-called "Line of Sight" method. An optimal control force allocation method forthe rudder and the thrusters is suggested. The nonlinear control algorithm was tested by numerical simulations using MATLAB, and showed good tracking performance.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.1
• /
• pp.48-54
• /
• 2008

MMORPGs may involve a great number of concurrent players, and those servers usually have to manage hundred, or even thousands of avatars co-existing in the same virtual world. So if failing to send a command or an event message, or sending it too late may cause damages to the avatar evolution(death, injury, loss of resources), and may result in unjustified penalties for the player. Many policies could be defined to realize a ranking evaluation of available servers. Unfortunately, due to the highly dynamic characteristics of server loads and network performances, any optimal allocation would soon become sub-optimal. In order to solve those problems we propose the "time-interval based fairness partitioning method"(TIP). TIP will distribute the avatar to the game server equally with time-interval in order to avoid the problems form the unfairness of game servers load.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.

• The KIPS Transactions:PartA
• /
• v.18A no.3
• /
• pp.115-122
• /
• 2011

It is very hard to obtain a general algorithm for solution of all the constraint satisfaction optimization problems. However, if the whole problem is separated into subproblems by characteristics of decision variables, we can assume that an algorithm to obtain solutions of these subproblems is easier. Under the assumption, we propose a problem classifying rule which subdivide the whole problem, and develop backtracking algorithms fit for these subproblems. One of the methods of finding a quick solution is efficiently arrange for any order of the search tree nodes. We choose the cluster head positioning problem in wireless sensor networks in which static characteristics is dominant and interference minimization problem of RFID readers that has hybrid mixture of static and dynamic characteristics. For these problems, we develop optimal variable ordering algorithms, and compare with the conventional methods. As a result of classifying the problem into subproblems, we can realize a backtracking framework for systematic search. We also have shown that developed backtracking algorithms have good performance in their quality.