• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.3
• /
• pp.226-231
• /
• 2008

In this paper, we propose novel eigenstructure assignment method in full-state feedback for linear time-invariant MIMO system such that directions of some left eigenvectors are exactly assigned to the desired directions. It is required to consider the direction of left eigenvector in designing eigenstructure of closed-loop system, because the direction of left eigenvector has influence over excitation by associated input variables in time-domain response. Exact direction of a left eigenvector can be achieved by assigning proper right eigenvector set satisfying the conditions of the presented theorem based on Moore's theorem and the orthogonality of left and right eigenvector. The right eigenvector should reside in the subspace given by the desired eigenvalue, which restrict a number of designable left eigenvector. For the two cases in which desired eigenvalues are all real and contain complex number, design freedom of designable left eigenvector are given.

• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.40-50
• /
• 2008

The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.11 no.17
• /
• pp.39-46
• /
• 1988

This Paper is concerned with a man-multi machine assignment problem to minimize idle time. Assuming different types of semi-automatic machines with deterministic service-processing time, the problem approaches by sequential dependent one operator can handle several machines, where determine optimal range the cost of idle labor and machine time is to be minimized in preparing a work schedule. The Procedure, to establish man-machine assignment model, and it's results are: (1) Objective function to minimize opportunity loss cost, which is happened by idle time, is verified recursive process through heuristic method. (2) The algorithm, is programmed by BASIC language for personal computer, and a numerical example is given to illustrate the heuristic algorithm. This study will be helpful to enhance productivity of Shopflooras a result of increasing the efficiencies of both operator and machine.

• Proceedings of the KIEE Conference
• /
• 1993.07a
• /
• pp.293-295
• /
• 1993

Most control system design problems involve finding state feedback gain for good response by the pole or characteristic polynomial assignment. In this paper, the characteristic polynomial assignment using PID controller for discrete 2-dimensional system descrived by the Fornasini-Marchesini's 2nd model (F-MM II) is considered. This method it not only available to F-MM II but also to Rosser's model.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.11
• /
• pp.108-120
• /
• 1998

In this paper, a new control system design algorithm, which has the advantages of the existing LQR and eigenstrcture assignment methods, is proposed. The method of the transformation matrix via block controller is utilized to develop the scheme. Using the proposed algorithm, LQR weighting matrices q and R, which satisfy the desired closed-loop eigenvalues and eigenvectors, can be achieved using only simple matrix computations. The usefulness of the proposed scheme is verified by applying to a numerical example and an automotive active suspension control system design.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.3
• /
• pp.210-220
• /
• 2003

This work presents a method of point to surface assignment fur 3D metrology of solder pastes on PCB. A bounding box enclosing the solder paste tightly on all sides is introduced to avoid incorrect assignment. The shape of bounding box fur solder paste brick is variable according to geometry of measured points. The surface geometry of bounding box is obtained by using five peaks selected in the histogram of normalized gradient vectors. By using the bounding box enclosing the solder pastes, the task of point-to-surface assignment has been successfully conducted, then geometrical features are obtained through the task of surface fitting.

• Journal of the Korean Society for Precision Engineering
• /
• v.16 no.11
• /
• pp.81-88
• /
• 1999

A conventional quarter-car suspension system is a single input system with one actuator. Thus, the performance enhancement for ride quality could be limited. In this paper, we propose a novel automotive suspension system for a quarter-car with two independent actuators to improve the control performance. The left eigenstructure assignment method for multi-variable systems has been applied to the proposed novel quarter-car model.

• Journal of the Korean Institute of Navigation
• /
• v.13 no.3
• /
• pp.37-44
• /
• 1989

Recently recognize the labor productivity of port physical distribution system in the port and shipping areas, Much Efforts for evaluating this productivity has been made continuously. BUt still there is little study, so far, on a systematic research for the management of port labor gangs, and even those were mainly depended on a rule of thumb. Especially the object of this study is to introduce the method of optimal allocation and assignment for the labor gangs per pier unit in the multiple ships berthed at an arbitary pier or port. In case the multiple ships have a homogeneous cargoes or do not have sufficient labor gangs to be assigned. The problem of optimal allocation and assignment of the labor gangs to be i) formalized with multi-state decision process in form of difference equation as the pattern which converted the independent multiple ships into a single ship with the intra-multiple ships, and ii) the optimal size of labor gangs could be obtained through the simple mathematical method instead of complicated dynamic programming, and iii) In case of shortage of labor gangs available the evaluation function considering the labor gangs available and total shift times was introduced, and iv) the optimal allocation and assignment of labor gangs was dealt at the point of minimizing the summation of the total shift times and at the point of minimizing the total cost charged for the extra waiting time except PHI time during port times for the multiple ships combinations.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.3
• /
• pp.465-470
• /
• 2013

Dempster-Shafer Evidence Theory is available for multi-sensor data fusion. Basic Probability Assignment is essential for multi-sensor data fusion using Dempster-Shafer Theory. In this paper, we proposed a novel method of BPA calculation with signal assessment. We took notice of the signal that reported from the sensor mote at the time slot. We assessed the variation rate of the reported signal from the terminal. The trend of variation implies significant component of the context. We calculated the variation rate of signal for reveal the relation of the variation and the context. We could reach context inference with BPA that calculated with the variation rate of signal.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.747-752
• /
• 2004

Researches about scheduling of the distributed real-time systems have been proposed. However, they have some weak points, not scheduling both sporadic and periodic tasks and messages or being unable to guaranteeing the end-to-end constraints due to omitting precedence relations between sporadic tasks. So this paper proposes a new scheduling method for distributed real-time systems consisting of sporadic and periodic tasks with precedence relations and sporadic and periodic messages, guaranteeing end-to-end constraints. The proposed method is based on a binary search-based period assignment algorithm, an end-to-end laxity-based priority assignment algorithm, and three kinds of schedulability analysis, node, network, and end-to-end schedulability analysis. In addition, this paper describes the application model of sporadic tasks with precedence constraints in a distributed real-time system, shows that existing scheduling methods such as Rate Monotonic (RM) scheduling are not proper to be applied to the system having sporadic tasks with precedence constraints, and proposes an end-to-end laxity-based priority assignment algorithm.