• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.40 no.3
• /
• pp.99-108
• /
• 2003

This paper is concerned with the problem of designing a guaranteed cost state feedback controller for singular systems with time-varying delays. The sufficient condition for the existence of guaranteed cost controller, the controller design method, and the optimization problem to get the upper bound of guaranteed cost function are proposed by LMI(linear matrix inequality), singular value decomposition, Schur complements, and change of variables. Since the obtained sufficient conditions can be changed to LMI form, all solutions including controller gain and the upper bound of guaranteed cost function can be obtained simultaneously. Moreover, the proposed controller design method can be extended to the problem of robust guaranteed cost controller design method for singular systems with parameter uncertainties and time-varying delays. The validity of the proposed design algorithm is investigated through a numerical example.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.4
• /
• pp.475-484
• /
• 2004

In this paper, we present a dynamic output-feedback receding horizon $H_{\infty}$controller for linear discrete-time systems with disturbance. The controller is obtained numerically from the finite horizon output-feedback $H_{\infty}$optimization problem, which is, in fact, hardly solved analytically. Under a matrix inequality condition on the terminal weighting matrix, the monotonic decreasing property of the cost is shown. This property guarantees both the closed-loop stability and the $H_{\infty}$norm bound. Then, we extend the proposed design method to a reference tracking problem and a problem for time-varying systems. Numerical examples are given to illustrate the performance of the proposed controller.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.4
• /
• pp.402-409
• /
• 1999

Variable structure control law is well known to be a robust control algorithm and evolution strategy is used as an effective search algorithm in optimization problems. In this paper, we propose a variable structure controller with time-varying switching surface. We calculate the maximum value of seitching surface gradient that is of the 3rd order polynomial form. Evolution strategy is used to optimize the parameters of the switching surface gradient. Finally, the proposed method is applied to position tracking control for BLDC motor. Experimental results show that the proposed method is more useful than the conventional variable structure controller.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.8
• /
• pp.1491-1497
• /
• 2007

This paper considers robust and non-fragile guaranteed cost controller design method for descriptor systems with parameter uncertainties and time delay, and static state feedback controller with gain variations. The existence condition of controller, the design method of controller, the upper bound to minimize guaranteed cost function, and the measure of non-fragility in controller are proposed using linear matrix inequality (LMI) technique, which can be solved efficiently by convex optimization. Therefore, the presented robust and non-fragile guaranteed cost controller guarantees the asymptotic stability and non-fragility of the closed loop systems in spite of parameter uncertainties, time delay, and controller fragility.

• Journal of the Korean Institute of Navigation
• /
• v.14 no.4
• /
• pp.1-15
• /
• 1990

With increasing ship's speed turnround and port time becomes a large percentage of total roundtrip time and this causes to accelerate the introduction of the various kind of modern handling equipment, the standardization of cargoes, and the improvement of the ship. However, it is still a drag on efficient operation of ship. Similarly, the turnround time at the container port is very important as a measure for the decision of the efficiency of port. To decrease operating coasts, the minimization of the time need to cargo handling at the ports of call must be achieved. Thus the optimization of the time need to cargo handling at the ports of call must be achieved. Thus the optimized Container Loading Plan is necessary, especially under the rapid speed of container operations. For the container loading plan, in this thesis, we use the hungarian method and the branch and bound method to get the initial disposition of both maximization of ship's GM and minimization of shift number to the obstructive container in a yard area. We apply the dynamic programming algorithm to get the final disposition for minimizing total turnroudn time and finally we analyzed the results to check whether the initial disposition is proper or not.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.7
• /
• pp.19-26
• /
• 2010

In this paper, we suggest a efficient handwritten character verification method in on-line environments which automatically analyses two input character string and computes their similarity degrees. The proposed algorithm first applies the circular projection method to input handwritten strings and extracts their representative features including shape, directions, etc. It then calculates the similarity between two character strings by using an improved dynamic time warping (DTW) algorithm. We improved the conventional DTW algorithm efficiently through adopting the branch-and-bound policy to the existing DTW algorithm which is well-known to produce good results in the various optimization problems. The experimental results to verify the performance of the proposed system show that the suggested handwritten character verification method operates more efficiently than the existing DTW and DDTW algorithms in terms of the speed.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.7
• /
• pp.3412-3432
• /
• 2019

Recent advances in radio frequency (RF) power transfer provide a promising technology to power sensor nodes. Adoption of mobile chargers to replenish the nodes' energy has recently attracted a lot of attention and the mobility assisted energy replenishment provides predictable and sustained power service. In this paper, we study the joint optimization of mobile charging and data gathering in sensor networks. A wireless multi-functional vehicle (WMV) is employed and periodically moves along specified trajectories, charge the sensors and gather the sensed data via one-hop communication. The objective of this paper is to maximize the uplink throughput by optimally allocating the time for the downlink wireless energy transfer by the WMV and the uplink transmissions of different sensors. We consider two scenarios where the WMV moves in a straight line and around a circle. By time discretization, the optimization problem is formulated as a 0-1 programming problem. We obtain the upper and lower bounds of the problem by converting the original 0-1 programming problem into a linear programming problem and then obtain the optimal solution by using branch and bound algorithm. We further prove that the network throughput is independent of the WMV's velocity under certain conditions. Performance of our proposed algorithm is evaluated through extensive simulations. The results validate the correctness of our proposed theorems and demonstrate that our algorithm outperforms two baseline algorithms in achieved throughput under different settings.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.2
• /
• pp.13-29
• /
• 1997

This paper considers a new routing problem, successive max-min connection ratio problem (SMCRP), arised in circuit telecommunication networks such as SONET and WDM optical transport network. An optimization model for SMCRP is established based on link-flow formulation. It's first optimization process is an integral version of maximum concurrent flow problem. Integer condition does not give the same connection-ratio of each node-pair at an optimal solution any more. It is also an integral multi-commodity flow problem with fairness restriction. In order to guarantee fairness to every node-pair the minimum of connection ratios to demand is maximized. NP- hardness of SMCRP is proved and a heuristic algorithm with polynomial-time bound is developed for the problem. Augmenting path and rerouting flow are used for the algorithm. The heuristic algorithm is implemented and tested for networks of different sizes. The results are compared with those given by GAMS/OSL, a popular commercial solver for integer programming problem.n among ferrite-pearlite matrix, the increase in spheroidal ratio with increasing fatigue limitation, 90% had the highest, 14.3% increasing more then 70%, distribution range of fatigue.
ife was small in same stress level. (2) $\sqrt{area}_{max}$ of graphite can be used to predict fatigue limit of Ductile Cast Iron. The Statistical distribution of extreme values of $\sqrt{area}_{max}$ may be used as a guideline for the control of inclusion size in the steelmaking.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.193-214
• /
• 2017

In this paper, we study the problem of network utility maximization in a CSMA based multi-hop wireless network. Existing work in this aspect typically adopted continuous time Markov model for performance modelling, which fails to consider the channel conflict impact in actual CSMA networks. To maximize the utility of a CSMA based wireless network with channel conflict, in this paper, we first model its weighted network capacity (i.e., network capacity weighted by link queue length) and then propose a distributed link scheduling algorithm, called CSMA based Maximal-Weight Scheduling (C-MWS), to maximize the weighted network capacity. We derive the upper and lower bounds of network utility based on C-MWS. The derived bounds can help us to tune the C-MWS parameters for C-MWS to work in a distributed wireless network. Simulation results show that the joint optimization based on C-MWS can achieve near-optimal network utility when appropriate algorithm parameters are chosen and also show that the derived utility upper bound is very tight.

• Journal of Communications and Networks
• /
• v.11 no.4
• /
• pp.390-405
• /
• 2009

Wireless sensor networks (WSNs) are envisioned to facilitate information gathering for various applications and depending on the application types they may require certain quality of service (QoS) guarantee for successful and guaranteed event perception. Therefore, QoS in WSNs is an important issue and two most important parameters that hinder the goal of guaranteed event perception are time-sensitive and reliable delivery of gathered information, while a minimum energy consumption is desired. In this paper, we propose an energy-aware, multi-constrained and multipath QoS provisioning mechanism for WSNs based on optimization approach. Hence, a detailed analytical analysis of reliability, delay and energy consumption is presented to formulate the optimization problem in an analytical way. A greedy algorithm is proposed to achieve the desired QoS guarantee while keeping the energy consumption minimum. Also, a simple but efficient retransmission mechanism is proposed to enhance the reliability further, while keeping the delay within delay bound. Simulation results demonstrate the effectiveness of our scheme.