• 제목/요약/키워드: time constraint

검색결과 1,042건 처리시간 0.026초

New Direct Kinematic Formulation of 6 D.O.F Stewart-Cough Platforms Using the Tetrahedron Approach

  • Song, Se-Kyong;Kwon, Dong-Soo
    • Transactions on Control, Automation and Systems Engineering
    • /
    • 제4권3호
    • /
    • pp.217-223
    • /
    • 2002
  • The paper presents a single constraint equation of the direct kinematic solution of 6-dof (Stewart-Gough) platforms. Many research works have presented a single polynomial of the direct kinematics for several 6-dof platforms. However, the formulation of the polynomial has potential problems such as complicated formulation procedures and discrimination of the actual solution from all roots. This results in heavy computational burden and time-consuming task. Thus, to overcome these problems, we use a new formulation approach, called the Tetrahedron Approach, to easily derive a single constraint equation, not a polynomial one, of the direct kinematics and use two well-known numerical iterative methods to find the solution of the single constraint equation. Their performance and characteristics are investigated through a series of simulation.

State set estimation based MPC for LPV systems with input constraint

  • Jeong, Seung-Cheol;Kim, Sung-Hyun;Park, Poo-Gyeon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2004년도 ICCAS
    • /
    • pp.530-535
    • /
    • 2004
  • This paper considers a state set estimation (SSE) based model predictive control (MPC) for linear parameter- varying (LPV) systems with input constraint. We estimate, at each time instant, a feasible set of all states which are consistent with system model, measurements and a priori information, rather than the state itself. By combining a state-feedback MPC and an SSE, we design an SSE-based MPC algorithm that stabilizes the closed-loop system. The proposed algorithm is solved by semi-de�nite program involving linear matrix inequalities. A numerical example is included to illustrate the performance of the proposed algorithm.

  • PDF

대규모 풍력발전 계통 연계시 주요 송전망 제약예측시스템 개발에 관한 연구 (A Study on the Development of Critical Transmission Operating Constraint Prediction (CTOCP) System With High Wind Power Penetration)

  • 허진
    • 조명전기설비학회논문지
    • /
    • 제29권1호
    • /
    • pp.86-93
    • /
    • 2015
  • Globally, wind power development is experiencing dramatic growth and wind power penetration levels are increasing. Wind generation is highly variable in time and space and it doesn't guarantee the system reliability and secure system operation. As wind power capacity becomes a significant portion of total generation capacity, the reliability assessment for wind power are therefore needed. At present, this operational reliability assessment is focusing on a generation adequacy perspective and does not consider transmission reliability issues. In this paper, we propose the critical transmission operating constraint prediction(CTOCP) system with high wind power penetration to enhance transmission reliability.

건설 프로젝트 공정표 생성을 위한 사례기반 전문가시스템의 설계

  • 김현우;이경전;이재규
    • 한국경영과학회:학술대회논문집
    • /
    • 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
    • /
    • pp.709-712
    • /
    • 1996
  • Generating a project network of a specific construction project is very time consuming and difficult task in the field. To effectiviely automate and support the planning process, we design a case-based project planning expert system inspired by the fact a human expert project planner uses previous cases for planning a new project. A construction project case consist of its specific characteristics and the corresponding project network (i.e. project plan). Using frame based representation. we represent the project features affecting the progress network and the entities composing the project plan such as the buildings, construction methods, WBS (work breakdown structure), activities, and resources. The project planning process runs through most similar case retrieval, case adaptation, and user requirement satisfaction. We represent the construction domain knowledge for each procedure using constraints and rules. We develop the methodology for constraint-based case adaption. Case adaptation process mainly consist of activity generation/deletion and predecence constraint satisfaction, for which we develop the dynamic constraint generation method and connect user-level requirement representation the system-level network modification knowledge. The methodology is being applied to the prototype for apartment construction project planning.

  • PDF

전처리 방식의 복수지역 제약공정 스케줄링 (Preprocessing based Scheduling for Multi-Site Constraint Resources)

  • 홍민선;임석철;노승종
    • 한국경영과학회지
    • /
    • 제33권1호
    • /
    • pp.117-129
    • /
    • 2008
  • Make-to-order manufacturers with multiple plants at multiple sites need to have the ability to quickly determine which plant will produce which customer order to meet the due date and minimize the transportation cost from the plants to the customer. Balancing the work loads and minimizing setups and make-span are also of great concern. Solving such scheduling problems usually takes a long time. We propose a new approach, which we call 'preprocessing', for resolving such complex problems. In preprocessing scheme, a 'good' a priori schedule is prepared and maintained using unconfirmed order information. Upon the confirmation of orders. the preprocessed schedule is quickly modified to obtain the final schedule. We present a preprocessing solution algorithm for multi-site constraint scheduling problem (MSCSP) using genetic algorithm; and conduct computational experiments to evaluate the performance of the algorithm.

On Solving the Tree-Topology Design Problem for Wireless Cellular Networks

  • Pomerleau Yanick;Chamberland Steven;Pesant Gilles
    • Journal of Communications and Networks
    • /
    • 제8권1호
    • /
    • pp.85-92
    • /
    • 2006
  • In this paper, we study a wireless cellular network design problem. It consists of selecting the location of the base station controllers and mobile service switching centres, selecting their types, designing the network into a tree-topology, and selecting the link types, while considering the location and the demand of base transceiver stations. We propose a constraint programming model and develop a heuristic combining local search and constraint programming techniques to find very good solutions in a reasonable amount of time for this category of problem. Numerical results show that our approach, on average, improves the results from the literature.

충돌 자세각 제한조건을 갖는 종단 유도를 위한 시변 편향 비례항법 (Time-varying biased proportional navigation for terminal guidance with impact attitude angle constraint)

  • 김병수;이보형;이장규;김삼수;조현진
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
    • /
    • pp.355-358
    • /
    • 1996
  • The primary objective of guidance system is to generate suitable commands so that the pursuer comes closer to its target. It is necessary, however, in the guidance of a certain pursuer that the attitude angle at impact should be within a prescribed range in addition to specification on the miss distance. These guidance requirements can not be satisfied by the general guidance laws developed for miss distance minimization. Compared with the demand in many applications, the guidance laws dealing with impact attitude angle constraint are not easily found. In this paper, biased PNG laws are proposed to obtain the guidance purposes. By Lyapunov method, it is shown that the pursuer can intercept the target with a prescribed attitude angle under the assumption that the pursuer is sufficiently fast and the target maneuver is negligible. The simulation results are presented to demonstrate the performance of the suggested guidance laws.

  • PDF

MRP와 JIT에 부합하는 DBR 제약일정계획문제 해법 (Solution of the Drum-Buffer-Rope Constraint Scheduling Problems incorporated by MRP/JIT -)

  • 김진규
    • 산업경영시스템학회지
    • /
    • 제23권59호
    • /
    • pp.21-36
    • /
    • 2000
  • The drum-buffer-rope(DBR) system is a finite scheduling mechanism that balances the flow of the production system. DBR controls the flow of materials through the plant in order to produce products in accordance with market demand, with a minimum of manufacturing lead time, inventory, and operating expenses. This paper integrates the best of MRP push system and JIT pull system with DBR system, efficiently adapts these logics to capacity constraint resources, and contributes to the evolution of synchronous manufacturing. The purpose of this paper is, thus, threefold. The first objective is to identify the frame of theory of constraints(TOC) and the logic of DBR scheduling. The second objective is to formulate the DBR constraint scheduling problems(DBRCSP) in a job shop environments. Finally, the paper is to suggest the solution procedure of DBRCSP for embedding TOC into MRP/JIT along with an numerical expression. In addition, illustrative numerical example is given.

  • PDF

A controller design using modal decomposition of matrix pencil

  • Shibasato, Koki;Shiotsuki, Tetsuo;Kawaji, Shigeyasu
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2000년도 제15차 학술회의논문집
    • /
    • pp.492-492
    • /
    • 2000
  • This paper proposes LQ optimal controller design method based on the modal decomposition. Here, the design problem of linear time-invariant systems is considered by using pencil model. The mathematical model based on matrix pencil is one of the most general representation of the system. By adding some conditions the model can be reduced to traditional system models. In pencil model, the state feedback is considered as an algebraic constraint between the state variable and the control input variable. The algebraic constraint on pencil model is called purely static mode, and is included in infinite mode. Therefore, the information of the constant gain controller is included in the purely static mode of the augmented system which consists of the plant and the control conditions. We pay attention to the coordinate transformation matrix, and LQ optimal controller is derived from the algebraic constraint of the internal variable. The proposed method is applied to the numerical examples, and the results are verified.

  • PDF

Stability of Slotted Aloha with Selfish Users under Delay Constraint

  • Chin, Chang-Ho;Kim, Jeong-Geun;Lee, Deok-Joo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제5권3호
    • /
    • pp.542-559
    • /
    • 2011
  • Most game-theoretic works of Aloha have emphasized investigating Nash equilibria according to the system state represented by the number of network users and their decisions. In contrast, we focus on the possible change of nodes' utility state represented by delay constraint and decreasing utility over time. These foregone changes of nodes' state are more likely to instigate selfish behaviors in networking environments. For such environment, in this paper, we propose a repeated Bayesian slotted Aloha game model to analyze the selfish behavior of impatient users. We prove the existence of Nash equilibrium mathematically and empirically. The proposed model enables any type of transmission probability sequence to achieve Nash equilibrium without degrading its optimal throughput. Those Nash equilibria can be used as a solution concept to thwart the selfish behaviors of nodes and ensure the system stability.