• Title/Summary/Keyword: Assignment

Search Result 2,567, Processing Time 0.028 seconds

Partial Pole Assignment via Constant Gain Feedback in Two Classes of Frequency-domain Models

  • Wang, Guo-Sheng;Yang, Guo-Zhen;Duan, Guang-Ren
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.111-116
    • /
    • 2007
  • The design problem of partial pole assignment (PPA) in two classes of frequency-domain MIMO models by constant gain feedback is investigated in this paper. Its aim is to design a constant gain feedback which changes only a subset of the open-loop eigenvalues, while the rest of them are kept unchanged in the closed-loop system. A near general parametric expression for the feedback gain matrix in term of a set of design parameter vectors and the set of the closed-loop poles, and a simple parametric approach for solving the proposed problem are presented. The set of poles do not need to be previously prescribed, and can be set undetermined and treated together with the set of parametric vectors as degrees of design freedom provided by the approach. An illustrative example shows that the proposed parametric method is simple and effective.

Traffic Control Algorithm Using the Hopfield Neural Networks (Hopfield 신경망을 이용한 트래픽 제어 알고리즘)

  • 이정일;김송민
    • Journal of the Institute of Electronics Engineers of Korea TE
    • /
    • v.37 no.2
    • /
    • pp.62-68
    • /
    • 2000
  • The Dynamic Channel Assignment have a detect which satisfy lots of conditions. It makes system efficiency depreciate because the Dynamic Channel Assignment executes computation process of several steps that demands lots of time. In this paper, we have proposed a traffic control algorithm which makes simple computation process for improving the detect.

  • PDF

Spillover Suppression in a Flexible Structure using Eigenstructure Assignment (고유구조지정법을 이용한 유연구조물의 스필오버억제)

  • Park, Un-Sik;Choi, Jae-Weon
    • Proceedings of the KSME Conference
    • /
    • 2000.04a
    • /
    • pp.499-504
    • /
    • 2000
  • Since large space structures(LSS) such as a space station, a solar power station satellite, etc., are theoretically distributed parameter and infinite-dimensional system, they have to be modeled into large finite-dimensional systems for control system design. Besides, there are fundamental problems in active vibration control of the large flexible structures. For example, a modeled large finite-dimensional system must be controlled with a much smaller dimensional controller. This causes the spillover phenomenon which degrades the control performances and reduces the stability margin. Furthermore, it may destabilize the entire feedback control system. In this paper, we proposed a novel control method for spillover suppression in the control of large flexible structures by using eigenstructure assignment. Its effectiveness in spillover suppression is investigated and verified by the numerical experiments using an example of the simply supported flexible beam which is modeled to have four controlled modes and eight uncontrolled modes.

  • PDF

Comparative Study on Performance of Metaheuristics for Weapon-Target Assignment Problem (무기-표적 할당 문제에 대한 메타휴리스틱의 성능 비교)

  • Choi, Yong Ho;Lee, Young Hoon;Kim, Ji Eun
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.20 no.3
    • /
    • pp.441-453
    • /
    • 2017
  • In this paper, a new type of weapon-target assignment(WTA) problem has been suggested that reflects realistic constraints for sharing target with other weapons and shooting double rapid fire. To utilize in rapidly changing actual battle field, the computation time is of great importance. Several metaheuristic methods such as Simulated Annealing, Tabu Search, Genetic Algorithm, Ant Colony Optimization, and Particle Swarm Optimization have been applied to the real-time WTA in order to find a near optimal solution. A case study with a large number of targets in consideration of the practical cases has been analyzed by the objective value of each algorithm.

Robust Pole Assignment Control for Linear Systems with Structured Uncertainty (구조적 불확실성을 갖는 선형계의 강인한 극배치 제어)

  • Kim, Young-Chol
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.41 no.3
    • /
    • pp.300-310
    • /
    • 1992
  • This paper deals with the problem of robust pole-assignment control for linear systems with structured uncertainty. It considers two cases whose colsed-loop characteristic equations are presented as a family of interval polynomial and polytopic polynomial family respectively. We propose a method of finding the pole-placement region in which the fixed gain controller guarantees the required damping ratio and stability margin despite parameter perturbation. Some results of Kharitonov like stability and two kinds of transformations are included. As an illustrative example, we show that the proposed method can apply effectivly to the single magnet levitation system including some uncertainties (mass, inductance etc.).

  • PDF

Channel Assignment, Link Scheduling, Routing, and Rate Control for Multi-Channel Wireless Mesh Networks with Directional Antennas

  • Roh, Hee-Tae;Lee, Jang-Won
    • Journal of Communications and Networks
    • /
    • v.18 no.6
    • /
    • pp.884-891
    • /
    • 2016
  • The wireless mesh network (WMN) has attracted significant interests as a broadband wireless network to provide ubiquitous wireless access for broadband services. Especially with incorporating multiple orthogonal channels and multiple directional antennas into the WMN, each node can communicate with its neighbor nodes simultaneously without interference between them. However, as we allow more freedom, we need a more sophisticated algorithm to fully utilize it and developing such an algorithm is not easy in general. In this paper, we study a joint channel assignment, link scheduling, routing, and rate control problem for the WMN with multiple orthogonal channels and multiple directional antennas. This problem is inherently hard to solve, since the problem is formulated as a mixed integer nonlinear problem (MINLP). However, despite of its inherent difficulty, we develop an algorithm to solve the problem by using the generalized Benders decomposition approach [2]. The simulation results show the proposed algorithm provides the optimal solution to maximize the network utility, which is defined as the sum of utilities of all sessions.

Development of a decision support system for the yard assignment planning of the import and export containers (수출입 컨테이너 장치장 배정을 위한 소프트웨어의 개발)

  • 김갑환;김홍배;홍봉희;김기영;배종욱;최진오;김두열;이영기;박영만
    • Korean Management Science Review
    • /
    • v.12 no.3
    • /
    • pp.1-15
    • /
    • 1995
  • The Pusan Container Terminal faces a rapid increase in berthing time of container ships as well as in waiting time of external trucks, which is due to an absolute lack of yard space. This research is focused on the development of a decision support system for the planning of the container terminal yard assignment so that the yard space would be utilized most effectively. Efforts should be given to the reasonable assignment of the yard storage and the dynamic adaptation to the ever changing environment. The software introduced here is based on the know-how of the field exports and its framework takes the approach of the hierarchical decision making.

  • PDF

Storage Assignment Policies in Automated Storage/Retrieval Systems

  • Kim, Jeongseob
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.3
    • /
    • pp.91-108
    • /
    • 1998
  • Automated Storage and Retrieval Systems (AS/RSs) are an important facility for modern material management. The expected benefits of these capital-intensive facilities are gained when their control policies and their physical design parameters are determined simultaneously. In this paper we present several analytical models that capture the impact of the storage assignment policy and of the rack design on the expected storage and retrieval times. Sequential and interleaved service modes are considered for sequencing the storage and retrieval requests. We further investigate the impact of the rack structure on the relative performance of the following storage assignment policies : closest open location (random), full turnover-based policy, and class-based. Our analysis clearly indicates that significant savings in crane travel time are realized when implementing full turnover-based policy, rather than random. These savings become more and more pronounced as the profile of the storage racks approaches the square-in-time shape. Furthermore, it is shown that a class-based policy, with a small number of storage classes, will capture most of these savings and be easier to manage in practice.

  • PDF

A study on the routing and wavelength assignment in WDM ring (WDM 링에서의 루팅 및 파장할당에 관한 연구)

  • 김후곤;백천현;정용주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.27 no.4
    • /
    • pp.1-10
    • /
    • 2002
  • The ring routing and wavelength assignment problem arose in the planning of optical communication networks which use WDM rings. Traffic demands are given for each pair of nodes in an ring : each demand must be routed one of the two possible connections round the ring and the wavelength assignments must be made so that there are no conflicts : that is. no two connections whose routes share a link can be assigned the same wavelength along that link. The objective is to minimize the number of used wavelengths. We propose the local optimal routing for the problem and show that there always exists an optimal solution satisfying it. Furthermore we suggest a new lower bound for the problem and show that it is very efficient for the worst case example.

A Study on the Method of CAN Identifier assignment for Real-Time Network (실시간 네트워크를 위한 CAN 식별자 지정 방법에 관한 고찰)

  • 정의헌;이홍희
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.34-34
    • /
    • 2000
  • One of the basic goals, when considering networks for communication in industrial control applications, is the reduction of complexity of related wiring harnesses. In addition, the networking offers the advantages for industrial control applications, such as ease of cabling, ease of changes in the cabling, ease of adding controller modules, etc. CAN (Controller Area Network) is generally applied in car networking in order to reduce the complexity of the related wiring harnesses. These traditional CAN application techniques are modified to achieve the real time communication for the industrial control applications. In this paper, we propose the method of CAN Identifier assignment for Real-Time network system. This method is can be used to scheduling messages on CAN for Real-Time network system. And also, the real-time network system is developed and the proposed moth(Ids are verified experimentally.

  • PDF