نتایج جستجو برای: dynamic matrix control

تعداد نتایج: 1996487  

2007
Piotr Gawkowski Maciej Ławryńczuk Piotr Marusak Janusz Sosnowski Piotr Tatjewski

The paper studies dependability of software implementation of the explicit DMC (Dynamic Matrix Control) Model Predictive Control (MPC) algorithm applied for a rectification column. The process with two inputs and two outputs with strong cross-couplings and significant time delays is studied. The algorithm’s control law is calculated off-line. Dependability is evaluated experimentally using soft...

2007
Ji-Woong Lee Pramod P. Khargonekar

The constrained infinite-horizon LQG control problem can be solved via semidefinite programming if the state-control constraints are given by variance-bounds on linear functions of the state and control input. Given a nonzero initial state covariance matrix, each suboptimal dynamic output feedback controller is initially time-varying but reaches time-invariance after a finite number of time ste...

2016
Koray Tahiroğlu Juan Carlos Vasquez Johan Kildal

In this paper we present the new development of a semiautonomous response module for the NOISA system. NOISA is an interactive music system that predicts performer’s engagement levels, learns from the performer, decides what to do and does it at the right moment. As an improvement for the above, we implemented real-time adaptive features that respond to a detailed monitoring of the performer’s ...

Journal: :CoRR 2013
Krishnamurthy Dvijotham Emanuel Todorov Maryam Fazel

We consider the problem of synthesizing optimal linear feedback policies subject to arbitrary convex constraints on the feedback matrix. This is known to be a hard problem in the usual formulations (H2,H∞,LQR) and previous works have focused on characterizing classes of structural constraints that allow efficient solution through convex optimization or dynamic programming techniques. In this pa...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه الزهراء - دانشکده علوم پایه 1391

در این پایان نامه رنگ آمیزی دینامیکی یک گراف را بیان و مطالعه می کنیم. یک –kرنگ آمیزی سره ی رأسی گراف g را رنگ آمیزی دینامیکی می نامند اگر در همسایه های هر رأس v?v(g) با درجه ی حداقل 2، حداقل 2 رنگ متفاوت ظاهر شوند. کوچکترین عدد صحیح k، به طوری که g دارای –kرنگ آمیزی دینامیکی باشد را عدد رنگی دینامیکی g می نامند و آنرا با نماد ?_2 (g) نمایش می دهند. مونت گمری حدس زده است که تمام گراف های منتظم ...

Journal: :Math. Meth. of OR 1999
Tomasz R. Bielecki Daniel Hernández-Hernández Stanley R. Pliska

In this paper we extend standard dynamic programming results for the risk sensitive optimal control of discrete time Markov chains to a new class of models. The state space is only ®nite, but now the assumptions about the Markov transition matrix are much less restrictive. Our results are then applied to the ®nancial problem of managing a portfolio of assets which are a ̈ected by Markovian micro...

1991
R. T. Rockafellar

Optimization problems in discrete time can be modeled more flexibly by extended linearquadratic programming than by traditional linear or quadratic programming, because penalties and other expressions that may substitute for constraints can readily be incorporated and dualized. At the same time, dynamics can be written with state vectors as in dynamic programming and optimal control. This sugge...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید