<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://onlinelibrary.wiley.com/rss/journal/10.1002/(ISSN)1099-1514" xmlns="http://purl.org/rss/1.0/"><title>Optimal Control Applications and Methods</title><description> Wiley Online Library : Optimal Control Applications and Methods</description><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2F%28ISSN%291099-1514</link><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc</dc:publisher><dc:language xmlns:dc="http://purl.org/dc/elements/1.1/">en</dc:language><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/">© John Wiley &amp; Sons, Ltd.</dc:rights><prism:issn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">0143-2087</prism:issn><prism:eIssn xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">1099-1514</prism:eIssn><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-01T00:00:00-05:00</dc:date><prism:coverDisplayDate xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">May/June 2013</prism:coverDisplayDate><prism:volume xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">34</prism:volume><prism:number xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">3</prism:number><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">253</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">378</prism:endingPage><image rdf:resource="http://onlinelibrary.wiley.com/store/10.1002/oca.v34.3/asset/cover.gif?v=1&amp;s=3b155ea57c802f658c469a3bf7f2721fa9b3892a"/><items><rdf:Seq><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2072"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2071"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2069"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2066"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2065"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2067"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2068"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2063"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2064"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2062"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2061"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2060"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2059"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2058"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2051"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2057"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2055"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2056"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2054"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2053"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2052"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2050"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2049"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2048"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2047"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2045"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2046"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2044"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2043"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2038"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2034"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2042"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2040"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2039"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2035"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2041"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2036"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2037"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2033"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2032"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2031"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2025"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2029"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2027"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2026"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2019"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2020"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2021"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2022"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2023"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2028"/><rdf:li rdf:resource="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2030"/></rdf:Seq></items></channel><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2072" xmlns="http://purl.org/rss/1.0/"><title>Minimizing control energy in a class of bounded-control linear-quadratic regulator problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2072</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Minimizing control energy in a class of bounded-control linear-quadratic regulator problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">V. Costanza, P. S. Rivadeneira, A. H. González</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-17T23:06:45.31972-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2072</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2072</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2072</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2072-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>Minimal-control-energy strategies are substantiated and illustrated for linear-quadratic problems with penalized endpoints and no state-trajectory cost, when bounds in control values are imposed. The optimal solution for a given process with restricted controls, starting at a known initial state, is shown to coincide with the saturated solution to the unrestricted problem that has the same coefficients but starts at a generally different initial state. This result reduces the searching span for the solution: from the infinite-dimensional set of admissible control trajectories to the finite-dimensional Euclidean space of initial conditions. An efficient real-time scheme is proposed here to approximate (eventually to find) the optimal control strategy, based on the detection of the appropriate initial state while avoiding as much as possible the generation and evaluation of state and control trajectories. Numerical (including model predictive control) simulations are provided, compared, and checked against the analytical solution to ‘the cheapest stop of a train’ problem in its pure-upper-bounded brake, flexible-endpoint setting.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
Minimal-control-energy strategies are substantiated and illustrated for linear-quadratic problems with penalized endpoints and no state-trajectory cost, when bounds in control values are imposed. The optimal solution for a given process with restricted controls, starting at a known initial state, is shown to coincide with the saturated solution to the unrestricted problem that has the same coefficients but starts at a generally different initial state. This result reduces the searching span for the solution: from the infinite-dimensional set of admissible control trajectories to the finite-dimensional Euclidean space of initial conditions. An efficient real-time scheme is proposed here to approximate (eventually to find) the optimal control strategy, based on the detection of the appropriate initial state while avoiding as much as possible the generation and evaluation of state and control trajectories. Numerical (including model predictive control) simulations are provided, compared, and checked against the analytical solution to ‘the cheapest stop of a train’ problem in its pure-upper-bounded brake, flexible-endpoint setting.Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2071" xmlns="http://purl.org/rss/1.0/"><title>Min–max control problems via occupational measures</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2071</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Min–max control problems via occupational measures</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Dan Goreac, Oana-Silvia Serea</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-05-15T23:57:03.004647-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2071</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2071</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2071</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2071-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>We propose a linearized formulation for min–max control problems with separated dynamics. First, we investigate the existence of the value function and saddle points for semicontinuous costs. Second, we obtain dual formulations and dynamic programming principles.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
We propose a linearized formulation for min–max control problems with separated dynamics. First, we investigate the existence of the value function and saddle points for semicontinuous costs. Second, we obtain dual formulations and dynamic programming principles.Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2069" xmlns="http://purl.org/rss/1.0/"><title>Improving integral square error performance with implementable fractional-order PI controllers</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2069</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Improving integral square error performance with implementable fractional-order PI controllers</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mohammad Amin Rahimian, Mohammad Saleh Tavazoei</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-04-09T23:20:30.45661-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2069</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2069</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2069</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2069-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, an algebraic rule for tuning the integer realizations of fractional-order <em>PI</em> controllers is developed, with an integral square error performance index, which outperforms that of an optimal ordinary PI controller. To this end, the <em>PI</em><sup><em>λ</em></sup> control structure is used in conjunction with a third-order integer approximating filter to provide a three parameter fixed-structure extension of the ordinary PI controller. Next, the extra degree of freedom in setting the order of integration <em>λ</em> is leveraged to introduce a steepest descent direction in the extended controller parameter space. It is then stated that shifting the parameters of an ordinary PI controller along the proposed descent direction will result in a fractional-based three parameter controller with a performance index, which is superior to that of the original PI controller. The stability of the controller parameters derived in this manner is then analyzed, and examples and simulation results are offered to verify the theoretical expectations and analyses.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
In this paper, an algebraic rule for tuning the integer realizations of fractional-order PI controllers is developed, with an integral square error performance index, which outperforms that of an optimal ordinary PI controller. To this end, the PIλ control structure is used in conjunction with a third-order integer approximating filter to provide a three parameter fixed-structure extension of the ordinary PI controller. Next, the extra degree of freedom in setting the order of integration λ is leveraged to introduce a steepest descent direction in the extended controller parameter space. It is then stated that shifting the parameters of an ordinary PI controller along the proposed descent direction will result in a fractional-based three parameter controller with a performance index, which is superior to that of the original PI controller. The stability of the controller parameters derived in this manner is then analyzed, and examples and simulation results are offered to verify the theoretical expectations and analyses.Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2066" xmlns="http://purl.org/rss/1.0/"><title>Feedback controller design for linear and a class of nonlinear optimal control problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2066</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Feedback controller design for linear and a class of nonlinear optimal control problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mohammad Shirazian, Sohrab Effati</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-20T00:37:53.51231-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2066</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2066</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2066</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2066-para-0002" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a feedback controller designing approach for a large class of finite-time optimal control problems. This approach involves a piecewise truncated variational iteration method (PTVIM) for solving the nonlinear Hamilton–Jacobi–Bellman equation. By using the finite iterations of PTVIM, an analytic approximate solution for value function and suboptimal feedback control law is obtained. Some illustrative examples are employed to demonstrate the accuracy and efficiency of the proposed approach. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
This paper presents a feedback controller designing approach for a large class of finite-time optimal control problems. This approach involves a piecewise truncated variational iteration method (PTVIM) for solving the nonlinear Hamilton–Jacobi–Bellman equation. By using the finite iterations of PTVIM, an analytic approximate solution for value function and suboptimal feedback control law is obtained. Some illustrative examples are employed to demonstrate the accuracy and efficiency of the proposed approach. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2065" xmlns="http://purl.org/rss/1.0/"><title>On the use of gradual dense–sparse discretizations in receding horizon control</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2065</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">On the use of gradual dense–sparse discretizations in receding horizon control</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">John W.C. Robinson, Petter Ögren</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-20T00:25:46.735588-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2065</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2065</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2065</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2065-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>A key factor to success in implementations of real time optimal control, such as receding horizon control (RHC), is making efficient use of computational resources. The main trade-off is then between efficiency and accuracy of each RHC iteration, and the resulting overall optimality properties of the concatenated iterations, that is, how closely this represents a solution to the underlying infinite time optimal control problem (OCP). Both these issues can be addressed by adapting the RHC solution strategy to the expected form of the solution. Using gradual dense–sparse (GDS) node distributions in direct transcription formulations of the finite time OCP solved in each RHC iteration is a way of adapting the node distribution of this OCP to the fact that it is actually part of an RHC scheme. We have previously argued that this is reasonable, because the near future plan must be implemented now, but the far future plan can and will be revised later. In this paper, we investigate RHC applications where the asymptotic qualitative behavior of the OCP solution can be analyzed in advance. For some classes of systems, explicit exponential convergence rates of the solutions can be computed. We establish such convergence rates for a class of control affine nonlinear systems with a locally quadratic cost and propose to use versions of GDS node distributions for such systems because they will (eventually) be better adapted to the form of the solution. The advantages of the GDS approach in such settings is illustrated with simulations. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
A key factor to success in implementations of real time optimal control, such as receding horizon control (RHC), is making efficient use of computational resources. The main trade-off is then between efficiency and accuracy of each RHC iteration, and the resulting overall optimality properties of the concatenated iterations, that is, how closely this represents a solution to the underlying infinite time optimal control problem (OCP). Both these issues can be addressed by adapting the RHC solution strategy to the expected form of the solution. Using gradual dense–sparse (GDS) node distributions in direct transcription formulations of the finite time OCP solved in each RHC iteration is a way of adapting the node distribution of this OCP to the fact that it is actually part of an RHC scheme. We have previously argued that this is reasonable, because the near future plan must be implemented now, but the far future plan can and will be revised later. In this paper, we investigate RHC applications where the asymptotic qualitative behavior of the OCP solution can be analyzed in advance. For some classes of systems, explicit exponential convergence rates of the solutions can be computed. We establish such convergence rates for a class of control affine nonlinear systems with a locally quadratic cost and propose to use versions of GDS node distributions for such systems because they will (eventually) be better adapted to the form of the solution. The advantages of the GDS approach in such settings is illustrated with simulations. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2067" xmlns="http://purl.org/rss/1.0/"><title>Necessary and sufficient conditions of optimality for an optimal control problem with non-local boundary conditions and quadratic functional</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2067</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Necessary and sufficient conditions of optimality for an optimal control problem with non-local boundary conditions and quadratic functional</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">F. Criado-Aldeanueva, F. Criado, N. Odisehlidze, J. M. Sanchez</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-12T03:59:37.614008-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2067</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2067</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2067</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2067-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, the optimal control problem with a quadratic functional for Helmholtz equation with non-local boundary conditions is considered. Necessary and sufficient conditions of optimality are obtained on the basis of which the existence and uniqueness of a solution to the optimal problem are proved. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
In this paper, the optimal control problem with a quadratic functional for Helmholtz equation with non-local boundary conditions is considered. Necessary and sufficient conditions of optimality are obtained on the basis of which the existence and uniqueness of a solution to the optimal problem are proved. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2068" xmlns="http://purl.org/rss/1.0/"><title>A new analytical method for solving a class of nonlinear optimal control problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2068</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A new analytical method for solving a class of nonlinear optimal control problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">M. Matinfar, M. Saeidy</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-03-12T03:58:33.817176-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2068</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2068</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2068</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2068-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we introduce a new analytic technique for a class of nonlinear optimal control problems and present a theorem of convergence of the method. In this scheme, first, the original optimal control problem is transformed into a nonlinear two-point boundary value problem via the Pontryagin's maximum principle, and then, we apply a new method for solving two-point boundary value problem. The proposed modification is made by introducing He's polynomials in the correction functional. The suggested algorithm is quite efficient and is practically well suited for using in these problems. The proposed iterative scheme finds the solution without any discretization, linearization, or restrictive assumptions.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
In this paper, we introduce a new analytic technique for a class of nonlinear optimal control problems and present a theorem of convergence of the method. In this scheme, first, the original optimal control problem is transformed into a nonlinear two-point boundary value problem via the Pontryagin's maximum principle, and then, we apply a new method for solving two-point boundary value problem. The proposed modification is made by introducing He's polynomials in the correction functional. The suggested algorithm is quite efficient and is practically well suited for using in these problems. The proposed iterative scheme finds the solution without any discretization, linearization, or restrictive assumptions.Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2063" xmlns="http://purl.org/rss/1.0/"><title>A constrained sub-optimal controller for glucose regulation in type 1 diabetes mellitus</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2063</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A constrained sub-optimal controller for glucose regulation in type 1 diabetes mellitus</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Subhojit Ghosh, S. Maka</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-15T06:33:33.071649-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2063</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2063</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2063</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2063-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>Patients with type 1 diabetes mellitus require exogenous insulin infusion to avoid chronic complications related to elevated glucose levels. With diabetes reaching epidemic proportions, recent times have witnessed an increased attention in the field of optimal glucose management by closed-loop insulin delivery system. A proper glucose management scheme, in addition of maintaining the glucose level within the normal range of 80–120 mg/dL, should avoid excessive insulin delivery leading to hypoglycemia. By considering the glucose regulation as a linear quadratic problem, a constrained novel sub-optimal controller is proposed in the present work, for the maintenance of normal glucose level in type 1 diabetic subjects. The observer free state feedback controller is based on the feedback of only physiological variables (plasma glucose and plasma insulin). Constraining the feedback elements corresponding to the non-physiological variables avoids the use of an observer while maintaining the advantages of state feedback control. The implementation of the proposed scheme requires simple measurement protocol with no online computation. The closed-loop performance of the controller is evaluated on a physiologically relevant model for a meal disturbance and continuous glucose infusion.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
Patients with type 1 diabetes mellitus require exogenous insulin infusion to avoid chronic complications related to elevated glucose levels. With diabetes reaching epidemic proportions, recent times have witnessed an increased attention in the field of optimal glucose management by closed-loop insulin delivery system. A proper glucose management scheme, in addition of maintaining the glucose level within the normal range of 80–120 mg/dL, should avoid excessive insulin delivery leading to hypoglycemia. By considering the glucose regulation as a linear quadratic problem, a constrained novel sub-optimal controller is proposed in the present work, for the maintenance of normal glucose level in type 1 diabetic subjects. The observer free state feedback controller is based on the feedback of only physiological variables (plasma glucose and plasma insulin). Constraining the feedback elements corresponding to the non-physiological variables avoids the use of an observer while maintaining the advantages of state feedback control. The implementation of the proposed scheme requires simple measurement protocol with no online computation. The closed-loop performance of the controller is evaluated on a physiologically relevant model for a meal disturbance and continuous glucose infusion.Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2064" xmlns="http://purl.org/rss/1.0/"><title>Parallel indirect solution of optimal control problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2064</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Parallel indirect solution of optimal control problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Brian C. Fabien</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-02-15T05:59:22.776191-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2064</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2064</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2064</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2064-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents an algorithm for the indirect solution of optimal control problems that contain mixed state and control variable inequality constraints. The necessary conditions for optimality lead to an inequality constrained two-point BVP with index-1 differential-algebraic equations (BVP-DAEs). These BVP-DAEs are solved using a multiple shooting method where the DAEs are approximated using a single-step linearly implicit Runge–Kutta (Rosenbrock–Wanner) method. An interior-point Newton method is used to solve the residual equations associated with the multiple shooting discretization. The elements of the residual equations, and the Jacobian of the residual equations, are constructed in parallel. The search direction for the interior-point method is computed by solving a sparse bordered almost block diagonal (BABD) linear system. Here, a parallel-structured orthogonal factorization algorithm is used to solve the BABD system. Examples are presented to illustrate the efficiency of the parallel algorithm. It is shown that an American National Standards Institute C implementation of the parallel algorithm achieves significant speedup with the increase in the number of processors used.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
This paper presents an algorithm for the indirect solution of optimal control problems that contain mixed state and control variable inequality constraints. The necessary conditions for optimality lead to an inequality constrained two-point BVP with index-1 differential-algebraic equations (BVP-DAEs). These BVP-DAEs are solved using a multiple shooting method where the DAEs are approximated using a single-step linearly implicit Runge–Kutta (Rosenbrock–Wanner) method. An interior-point Newton method is used to solve the residual equations associated with the multiple shooting discretization. The elements of the residual equations, and the Jacobian of the residual equations, are constructed in parallel. The search direction for the interior-point method is computed by solving a sparse bordered almost block diagonal (BABD) linear system. Here, a parallel-structured orthogonal factorization algorithm is used to solve the BABD system. Examples are presented to illustrate the efficiency of the parallel algorithm. It is shown that an American National Standards Institute C implementation of the parallel algorithm achieves significant speedup with the increase in the number of processors used.Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2062" xmlns="http://purl.org/rss/1.0/"><title>Inverse optimal control for discrete-time nonlinear systems via passivation</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2062</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Inverse optimal control for discrete-time nonlinear systems via passivation</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Fernando Ornelas-Tellez, Edgar N. Sanchez, Alexander G. Loukianov</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-01-24T21:36:01.454094-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2062</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2062</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2062</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2062-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents an inverse optimal control approach for stabilization and trajectory tracking of discrete-time nonlinear systems, avoiding to solve the associated Hamilton–Jacobi–Bellman equation, and minimizing a meaningful cost functional. The proposed controller is based on a discrete-time control Lyapunov function and passivity theory; its applicability is illustrated via simulations for an unstable nonlinear system and a planar robot. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
This paper presents an inverse optimal control approach for stabilization and trajectory tracking of discrete-time nonlinear systems, avoiding to solve the associated Hamilton–Jacobi–Bellman equation, and minimizing a meaningful cost functional. The proposed controller is based on a discrete-time control Lyapunov function and passivity theory; its applicability is illustrated via simulations for an unstable nonlinear system and a planar robot. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2061" xmlns="http://purl.org/rss/1.0/"><title>Value at risk for confidence level quantifications in robust engineering optimization</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2061</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Value at risk for confidence level quantifications in robust engineering optimization</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bijan Mohammadi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-01-13T22:31:19.873922-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2061</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2061</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2061</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2061-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>We show how to introduce the Value at Risk (VaR) concept in optimization algorithms with emphasis in calculation complexity issues. To do so, we assume known the PDF of the uncertainties. Our aim is to quantify our confidence on the optimal solution at low complexity without sampling of the control space. The notion of over-solving appears naturally where it becomes useless to solve accurately near an optimum when the variations in control parameters fall below the uncertainties. Examples show the behavior of this VaR-based correction and link the approach to momentum-based optimization where the mean and variance of a functional are considered. The approach is then applied to an inverse problem with fluids with uncertainties in the definition of the injection devices. It is shown that an optimization problem with an admissible solution in the control space in the deterministic case can lose its solution in the presence of uncertainties on the control parameters, which suggests that the control space itself should be redefined in such a situation to recover an admissible problem. This permits to evaluate the cost of making reliable a system that has been deterministically designed but has uncertain parameters. A shape optimization problem closes the paper showing the importance of including VaR information during the design iterations and not only at the end of the procedure.Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>
]]></content:encoded><description>

We show how to introduce the Value at Risk (VaR) concept in optimization algorithms with emphasis in calculation complexity issues. To do so, we assume known the PDF of the uncertainties. Our aim is to quantify our confidence on the optimal solution at low complexity without sampling of the control space. The notion of over-solving appears naturally where it becomes useless to solve accurately near an optimum when the variations in control parameters fall below the uncertainties. Examples show the behavior of this VaR-based correction and link the approach to momentum-based optimization where the mean and variance of a functional are considered. The approach is then applied to an inverse problem with fluids with uncertainties in the definition of the injection devices. It is shown that an optimization problem with an admissible solution in the control space in the deterministic case can lose its solution in the presence of uncertainties on the control parameters, which suggests that the control space itself should be redefined in such a situation to recover an admissible problem. This permits to evaluate the cost of making reliable a system that has been deterministically designed but has uncertain parameters. A shape optimization problem closes the paper showing the importance of including VaR information during the design iterations and not only at the end of the procedure.Copyright © 2013 John Wiley &amp; Sons, Ltd.
</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2060" xmlns="http://purl.org/rss/1.0/"><title>Stability criteria for continuous-time systems with additive time-varying delays</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2060</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Stability criteria for continuous-time systems with additive time-varying delays</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xun-Lin Zhu, Youyi Wang, Xin Du</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2013-01-07T04:25:59.899209-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2060</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2060</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2060</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2060-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper studies the problem of stability analysis for continuous-time systems with two additive time-varying delay components. By taking the independence and the variation of the additive delay components into consideration, more general type of Lyapunov functionals are defined. Together with a tighter estimation of the upper bound of the cross-product terms derived from the derivatives of the Lyapunov functionals, less conservative delay-dependent stability criteria are established in terms of LMIs. Combining with a reciprocally convex combination technique, the newly obtained stability conditions are also less complex. Two numerical examples are given to illustrate the effectiveness and the significant improvement of the proposed method. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
This paper studies the problem of stability analysis for continuous-time systems with two additive time-varying delay components. By taking the independence and the variation of the additive delay components into consideration, more general type of Lyapunov functionals are defined. Together with a tighter estimation of the upper bound of the cross-product terms derived from the derivatives of the Lyapunov functionals, less conservative delay-dependent stability criteria are established in terms of LMIs. Combining with a reciprocally convex combination technique, the newly obtained stability conditions are also less complex. Two numerical examples are given to illustrate the effectiveness and the significant improvement of the proposed method. Copyright © 2013 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2059" xmlns="http://purl.org/rss/1.0/"><title>Some error estimates of finite volume element method for parabolic optimal control problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2059</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Some error estimates of finite volume element method for parabolic optimal control problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xianbing Luo, Yanping Chen, Yunqing Huang, Tianliang Hou</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-27T07:29:37.152249-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2059</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2059</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2059</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2059-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, the finite volume element method (FVEM) is applied to solve the distributed optimal control problems governed by parabolic equation. We use the method of variational discretization concept to approximate the problems. We consider a semi-discrete and a fully discrete piecewise linear FVEMs. For the semi-discrete method, the optimal order error estimates in continuous <em>L</em><sup> ∞ </sup>(<em>J</em>; <em>L</em><sup>2</sup>) and <em>L</em><sup> ∞ </sup>(<em>J</em>; <em>H</em><sup>1</sup>)-norm are obtained; the suboptimal error estimates in continuous <em>L</em><sup> ∞ </sup>(<em>J</em>; <em>L</em><sup> ∞ </sup>)-norm are also obtained. For the fully discrete method, the optimal order error estimates in discrete <em>L</em><sup>2</sup>(<em>J</em>; <em>L</em><sup>2</sup>) and <em>L</em><sup> ∞ </sup>(<em>J</em>; <em>L</em><sup>2</sup>)-norm are derived. Numerical experiments are presented to test these theoretical results.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

In this paper, the finite volume element method (FVEM) is applied to solve the distributed optimal control problems governed by parabolic equation. We use the method of variational discretization concept to approximate the problems. We consider a semi-discrete and a fully discrete piecewise linear FVEMs. For the semi-discrete method, the optimal order error estimates in continuous L ∞ (J; L2) and L ∞ (J; H1)-norm are obtained; the suboptimal error estimates in continuous L ∞ (J; L ∞ )-norm are also obtained. For the fully discrete method, the optimal order error estimates in discrete L2(J; L2) and L ∞ (J; L2)-norm are derived. Numerical experiments are presented to test these theoretical results.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2058" xmlns="http://purl.org/rss/1.0/"><title>Robust stability of singularly perturbed descriptor systems with uncertain Markovian switchings and nonlinear perturbations</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2058</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Robust stability of singularly perturbed descriptor systems with uncertain Markovian switchings and nonlinear perturbations</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Guoliang Wang, Qingling Zhang, Chunyu Yang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-14T07:21:53.648223-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2058</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2058</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2058</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper is concerned with the problem of robust stability of Markovian jump singularly perturbed descriptor systems with uncertain switchings and nonlinear perturbations for any <img alt="inline image" src="http://onlinelibrary.wiley.com/store/10.1002/oca.2058/asset/equation/oca2058-math-0001.gif?v=1&amp;t=hh5m2b7e&amp;s=8d6e9aed6205851615c81b026e37b107b0fe4b92" class="inlineGraphic"/>, where <img alt="inline image" src="http://onlinelibrary.wiley.com/store/10.1002/oca.2058/asset/equation/oca2058-math-0002.gif?v=1&amp;t=hh5m2b7e&amp;s=8ad68112681c9455f6e78c00c4a082072826872f" class="inlineGraphic"/> is a pre-defined positive scalar. A linear matrix inequality (LMI) condition is firstly established to guarantee the existence and uniqueness of a solution. Then, an <em>ε</em>-independent condition in terms of LMI related to <img alt="inline image" src="http://onlinelibrary.wiley.com/store/10.1002/oca.2058/asset/equation/oca2058-math-0003.gif?v=1&amp;t=hh5m2b7f&amp;s=2ec89dc122c03c9a8879a822607c677b45e32434" class="inlineGraphic"/> is derived via using an <em>ε</em>-dependent Lyapunov function, where the solution exists uniquely and is globally exponentially mean-square stable simultaneously. Finally, numerical examples are used to show the feasibility and effectiveness of the given theoretical results.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper is concerned with the problem of robust stability of Markovian jump singularly perturbed descriptor systems with uncertain switchings and nonlinear perturbations for any ε ∈0,ε̄, where ε̄ is a pre-defined positive scalar. A linear matrix inequality (LMI) condition is firstly established to guarantee the existence and uniqueness of a solution. Then, an ε-independent condition in terms of LMI related to ε̄ is derived via using an ε-dependent Lyapunov function, where the solution exists uniquely and is globally exponentially mean-square stable simultaneously. Finally, numerical examples are used to show the feasibility and effectiveness of the given theoretical results.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2051" xmlns="http://purl.org/rss/1.0/"><title>Estimating the robust domain of attraction and directional enlargement of attraction domain via Markov models</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2051</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Estimating the robust domain of attraction and directional enlargement of attraction domain via Markov models</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">R.K. Moghaddam, N. Pariz, H.M. Shanechi, A.V. Kamyad</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-12-06T23:03:34.886255-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2051</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2051</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2051</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper proposes a new approach for estimating the robust domain of attraction (RDA) and directional enlargement of the DA for dynamical systems. The proposed method analyzes stability of dynamical systems by Markov modeling and employs invariant measure as the stability indicator. Markov chains analysis focuses on asymptotic behaviors of systems and ignores the transient ones. The proposed method expresses the problem of estimating RDA and directional enlargement of DA as an infinite dimensional linear problem. The resulting linear problem is converted to a finite dimensional optimization problem using approximated Markov transition function. As a novel application, the directional enlargement of DA is used in order to increase the critical clearing time of power systems. The efficiency of proposed methods is shown via simulations. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper proposes a new approach for estimating the robust domain of attraction (RDA) and directional enlargement of the DA for dynamical systems. The proposed method analyzes stability of dynamical systems by Markov modeling and employs invariant measure as the stability indicator. Markov chains analysis focuses on asymptotic behaviors of systems and ignores the transient ones. The proposed method expresses the problem of estimating RDA and directional enlargement of DA as an infinite dimensional linear problem. The resulting linear problem is converted to a finite dimensional optimization problem using approximated Markov transition function. As a novel application, the directional enlargement of DA is used in order to increase the critical clearing time of power systems. The efficiency of proposed methods is shown via simulations. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2057" xmlns="http://purl.org/rss/1.0/"><title>Robust feedback design for combined therapy of cancer</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2057</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Robust feedback design for combined therapy of cancer</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mazen Alamir</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-29T03:35:26.347769-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2057</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2057</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2057</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2057-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, a mathematical model for the scheduling of angiogenic inhibitors with a killing agent is used to derive a robust state feedback control for the combined therapy of cancer. Robustness is considered against parameter uncertainties through the solution of the associated Hamilton–Jacobi–Isaacs (HJI) partial differential equation. Unlike open-loop optimal control paradigm, solving the HJI equation provides a guaranteed-cost feedback control and a whole visibility of the achievable performance for any possible initial state within the region of interest and for any predefined level of parameter uncertainties. Numerical investigation is proposed using an existing model that has been partially validated using human data. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

In this paper, a mathematical model for the scheduling of angiogenic inhibitors with a killing agent is used to derive a robust state feedback control for the combined therapy of cancer. Robustness is considered against parameter uncertainties through the solution of the associated Hamilton–Jacobi–Isaacs (HJI) partial differential equation. Unlike open-loop optimal control paradigm, solving the HJI equation provides a guaranteed-cost feedback control and a whole visibility of the achievable performance for any possible initial state within the region of interest and for any predefined level of parameter uncertainties. Numerical investigation is proposed using an existing model that has been partially validated using human data. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2055" xmlns="http://purl.org/rss/1.0/"><title>Relationship between maximum principle and dynamic programming principle for stochastic recursive optimal control problems of jump diffusions</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2055</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Relationship between maximum principle and dynamic programming principle for stochastic recursive optimal control problems of jump diffusions</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jingtao Shi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-23T07:38:14.311316-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2055</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2055</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2055</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2055-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper is concerned with the relationship between maximum principle and dynamic programming principle for stochastic recursive optimal control problems of jump diffusions. Under the assumption that the value function is smooth, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial market is discussed to show the applications of the main result. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper is concerned with the relationship between maximum principle and dynamic programming principle for stochastic recursive optimal control problems of jump diffusions. Under the assumption that the value function is smooth, relations among the adjoint processes, the generalized Hamiltonian function, and the value function are given. A linear quadratic recursive utility portfolio optimization problem in the financial market is discussed to show the applications of the main result. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2056" xmlns="http://purl.org/rss/1.0/"><title>Performance analysis of networked predictive control systems with data dropout</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2056</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Performance analysis of networked predictive control systems with data dropout</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yuanqing Xia, Wen Xie, Zheng Zhu, Ge Wang, Xiaoyun Wang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-23T06:28:03.494764-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2056</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2056</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2056</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper is concerned with the design of networked control systems with random network data dropout. It presents a new control scheme, which is termed networked predictive control. This scheme mainly consists of the control prediction generator and network data dropout compensator. Besides, the control prediction generator provides a set of future control predictions to make the closed-loop system achieve the desired control performance, and the network data dropout compensator removes the effects of the network transmission data dropout. Simulation results are presented to illustrate the effectiveness of the control strategy via comparing with other three existing control schemes. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper is concerned with the design of networked control systems with random network data dropout. It presents a new control scheme, which is termed networked predictive control. This scheme mainly consists of the control prediction generator and network data dropout compensator. Besides, the control prediction generator provides a set of future control predictions to make the closed-loop system achieve the desired control performance, and the network data dropout compensator removes the effects of the network transmission data dropout. Simulation results are presented to illustrate the effectiveness of the control strategy via comparing with other three existing control schemes. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2054" xmlns="http://purl.org/rss/1.0/"><title>Observer-based H ∞  control of discrete Markovian jump delay systems with random packet losses and multiplicative noises</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2054</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Observer-based H ∞  control of discrete Markovian jump delay systems with random packet losses and multiplicative noises</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Shiping Wen, Zhigang Zeng, Tingwen Huang, Gang Bao</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-13T05:01:20.331506-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2054</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2054</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2054</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2054-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper investigates the observer-based <em>H</em><sub> ∞ </sub> control problem for a class of mixed-delay Markovian jump systems with random communication packet losses and multiplicative noises. The mixed delays comprise both discrete time-varying delays and distributed delays, the random packet losses are described by a Bernoulli distributed white sequence that obeys a conditional probability distribution, and the multiplicative disturbances are in the form of a scalar Gaussian white noise with unit variance. In the presence of mixed delays, random packet losses and multiplicative noises, sufficient conditions for the existence of an observer-based feedback controller are derived such that the closed-loop control system is asymptotically mean-square stable and preserves a guaranteed <em>H</em><sub> ∞ </sub> performance. Then, a linear matrix inequality approach for designing such an observer-based <em>H</em><sub> ∞ </sub> controller is presented. Finally, a numerical example is provided to illustrate the effectiveness of the developed theoretical results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper investigates the observer-based H ∞  control problem for a class of mixed-delay Markovian jump systems with random communication packet losses and multiplicative noises. The mixed delays comprise both discrete time-varying delays and distributed delays, the random packet losses are described by a Bernoulli distributed white sequence that obeys a conditional probability distribution, and the multiplicative disturbances are in the form of a scalar Gaussian white noise with unit variance. In the presence of mixed delays, random packet losses and multiplicative noises, sufficient conditions for the existence of an observer-based feedback controller are derived such that the closed-loop control system is asymptotically mean-square stable and preserves a guaranteed H ∞  performance. Then, a linear matrix inequality approach for designing such an observer-based H ∞  controller is presented. Finally, a numerical example is provided to illustrate the effectiveness of the developed theoretical results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2053" xmlns="http://purl.org/rss/1.0/"><title>Delay-dependent feedforward control of time-delay systems with parametric uncertainties via dynamic IQCs</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2053</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Delay-dependent feedforward control of time-delay systems with parametric uncertainties via dynamic IQCs</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Levent Ucun, İbrahim B. Küçükdemiral</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-11-05T03:13:22.616971-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2053</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2053</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2053</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2053-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper studies the design problem of a robust delay-dependent <em>H</em><sub> ∞ </sub> feedforward controller design for a class of linear uncertain time-delay system having state and control delays when the system is subject to <img alt="inline image" src="http://onlinelibrary.wiley.com/store/10.1002/oca.2053/asset/equation/oca2053-math-0001.gif?v=1&amp;t=hh5m2b7x&amp;s=7cb46b1a28140ab17e2ca9a276b554fea1b5e4c8" class="inlineGraphic"/>-type disturbances. The proposed controller scheme involves two main controllers, which are static state-feedback and dynamic feedforward controllers. The state-feedback controller is used for stabilizing the delay and uncertainty-free system, whereas the feedforward controller performs disturbance attenuation. Dynamic type integral quadratic constraints (IQCs), which consist of frequency-dependent multipliers, have been introduced to represent the delays and parametric uncertainties in the system where the degree of the multiplier used in IQC representation is in an adjustable nature. This scheme allows the designer to obtain less conservative controllers with increasing precision. Sufficient delay-dependent criteria in terms of linear matrix inequalities are obtained such that the uncertain linear time-delay system is guaranteed to be globally, uniformly, asymptotically stable with a minimum disturbance attenuation level. Several numerical examples together with the simulation studies provided at the end illustrate the usefulness of the proposed design. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper studies the design problem of a robust delay-dependent H ∞  feedforward controller design for a class of linear uncertain time-delay system having state and control delays when the system is subject to L2-type disturbances. The proposed controller scheme involves two main controllers, which are static state-feedback and dynamic feedforward controllers. The state-feedback controller is used for stabilizing the delay and uncertainty-free system, whereas the feedforward controller performs disturbance attenuation. Dynamic type integral quadratic constraints (IQCs), which consist of frequency-dependent multipliers, have been introduced to represent the delays and parametric uncertainties in the system where the degree of the multiplier used in IQC representation is in an adjustable nature. This scheme allows the designer to obtain less conservative controllers with increasing precision. Sufficient delay-dependent criteria in terms of linear matrix inequalities are obtained such that the uncertain linear time-delay system is guaranteed to be globally, uniformly, asymptotically stable with a minimum disturbance attenuation level. Several numerical examples together with the simulation studies provided at the end illustrate the usefulness of the proposed design. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2052" xmlns="http://purl.org/rss/1.0/"><title>Quantized H∞ filter design of interconnected continuous-time delay systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2052</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Quantized H∞ filter design of interconnected continuous-time delay systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Magdi S. Mahmoud, Zhengrong Xiang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-10-19T04:36:16.205041-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2052</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2052</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2052</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2052-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>A generalized approach to the problem of quantized filtering is investigated by designing a set of decentralized <img alt="inline image" src="http://onlinelibrary.wiley.com/store/10.1002/oca.2052/asset/equation/oca2052-math-0001.gif?v=1&amp;t=hh5m2b82&amp;s=36be28dc8b950da81256120f7b6b5e34e43d8691" class="inlineGraphic"/> filters for a class of linear interconnected continuous-time systems with unknown-but-bounded couplings and interval delays and where the quantizer has arbitrary form. An LMI-based method using a decentralized quantized filter is designed at the subsystem level to render the global filtered system delay-dependent asymptotically stable with guaranteed <em>γ</em> − level. It is established that this setting encompasses several special cases of interest including interconnected delay-free systems, single time-delay systems and single systems. We illustrate the theoretical developments by numerical simulations.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

A generalized approach to the problem of quantized filtering is investigated by designing a set of decentralized H∞ filters for a class of linear interconnected continuous-time systems with unknown-but-bounded couplings and interval delays and where the quantizer has arbitrary form. An LMI-based method using a decentralized quantized filter is designed at the subsystem level to render the global filtered system delay-dependent asymptotically stable with guaranteed γ − level. It is established that this setting encompasses several special cases of interest including interconnected delay-free systems, single time-delay systems and single systems. We illustrate the theoretical developments by numerical simulations.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2050" xmlns="http://purl.org/rss/1.0/"><title>Reliable control of stochastic systems via sliding mode technique</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2050</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Reliable control of stochastic systems via sliding mode technique</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yugang Niu, Yonghui Liu, Tinggang Jia</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-14T07:20:39.415444-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2050</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2050</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2050</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2050-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper considers the problem of sliding mode control for uncertain stochastic systems with possible occurrence of actuator faults. There exist parameter uncertainties and state-dependent noise. Moreover, the faults may happen in any of the actuators. The reliable designing on both passive and adaptive sliding mode controllers is investigated, respectively. Both the reachability of the specified sliding surface and the stochastic stability of the sliding motion are analyzed using the stochastic Lyapunov theory. Finally, numerical simulation results are given.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper considers the problem of sliding mode control for uncertain stochastic systems with possible occurrence of actuator faults. There exist parameter uncertainties and state-dependent noise. Moreover, the faults may happen in any of the actuators. The reliable designing on both passive and adaptive sliding mode controllers is investigated, respectively. Both the reachability of the specified sliding surface and the stochastic stability of the sliding motion are analyzed using the stochastic Lyapunov theory. Finally, numerical simulation results are given.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2049" xmlns="http://purl.org/rss/1.0/"><title>Nonlinear model predictive control strategy for low thrust spacecraft missions</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2049</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Nonlinear model predictive control strategy for low thrust spacecraft missions</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Joseph A. Starek, Ilya V. Kolmanovsky</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-09-11T23:46:10.920804-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2049</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2049</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2049</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2049-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, two nonlinear model predictive control (MPC) strategies are applied to solve a low thrust interplanetary rendezvous problem. Each employs a unique, nonclassical parameterization of the control to adapt the nonlinear MPC approach to interplanetary orbital dynamics with low control authority. The approach is demonstrated numerically for a minimum-fuel Earth-to-Mars rendezvous maneuver, cast as a simplified coplanar circular orbit heliocentric transfer problem. The interplanetary transfer is accomplished by repeated solution of an optimal control problem over (i) a receding horizon with fixed number of control subintervals and (ii) a receding horizon with shrinking number of control subintervals, with a doubling strategy to maintain controllability. In both cases, the end time is left unconstrained. The performances of the nonlinear MPC strategies in terms of computation time, fuel consumption, and transfer time are compared for a constant thrust nuclear-electric propulsion system. For this example, the ability to withstand unmodeled effects and control allocation errors is verified. The second strategy, with shrinking number of control subintervals, is also shown to easily handle the more complicated bounded thrust nuclear-electric case, as well as a state-control-constrained solar-electric case. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

In this paper, two nonlinear model predictive control (MPC) strategies are applied to solve a low thrust interplanetary rendezvous problem. Each employs a unique, nonclassical parameterization of the control to adapt the nonlinear MPC approach to interplanetary orbital dynamics with low control authority. The approach is demonstrated numerically for a minimum-fuel Earth-to-Mars rendezvous maneuver, cast as a simplified coplanar circular orbit heliocentric transfer problem. The interplanetary transfer is accomplished by repeated solution of an optimal control problem over (i) a receding horizon with fixed number of control subintervals and (ii) a receding horizon with shrinking number of control subintervals, with a doubling strategy to maintain controllability. In both cases, the end time is left unconstrained. The performances of the nonlinear MPC strategies in terms of computation time, fuel consumption, and transfer time are compared for a constant thrust nuclear-electric propulsion system. For this example, the ability to withstand unmodeled effects and control allocation errors is verified. The second strategy, with shrinking number of control subintervals, is also shown to easily handle the more complicated bounded thrust nuclear-electric case, as well as a state-control-constrained solar-electric case. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2048" xmlns="http://purl.org/rss/1.0/"><title>Suboptimal robust linear visual servoing for a delayed underactuated system</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2048</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Suboptimal robust linear visual servoing for a delayed underactuated system</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">A. Benitez-Morales, Omar Santos, Hugo Romero, Luis Enrique Ramos-Velasco</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-31T05:32:31.529687-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2048</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2048</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2048</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2048-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this contribution, a suboptimal robust control law for a specific class of underactuated delayed system is synthesized. The control strategy based on very well-known results for delay-dependent stability considers the time delay involved in the dynamical system, which affects to control signal. This contribution illustrates how the theoretical results can be used to improve the real-time performance of the closed-loop system considered. The delay is introduced into the control system by the vision module, due to the time required to perform the image treatment. In order to show the good performance of the control law proposed, real-time experiments are developed by applying a visual servoing technique on the cart-inverted pendulum system. Obtained results also illustrate how the conservativeness of theoretical results affects the performance of the closed-loop system and the negative effects of delays in the control loop. Furthermore, a robust stability analysis is done to establish the robustness of control law with respect to the amount of delay presented in the system.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

In this contribution, a suboptimal robust control law for a specific class of underactuated delayed system is synthesized. The control strategy based on very well-known results for delay-dependent stability considers the time delay involved in the dynamical system, which affects to control signal. This contribution illustrates how the theoretical results can be used to improve the real-time performance of the closed-loop system considered. The delay is introduced into the control system by the vision module, due to the time required to perform the image treatment. In order to show the good performance of the control law proposed, real-time experiments are developed by applying a visual servoing technique on the cart-inverted pendulum system. Obtained results also illustrate how the conservativeness of theoretical results affects the performance of the closed-loop system and the negative effects of delays in the control loop. Furthermore, a robust stability analysis is done to establish the robustness of control law with respect to the amount of delay presented in the system.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2047" xmlns="http://purl.org/rss/1.0/"><title>Optimal control of one-dimensional cellular uptake in tissue engineering</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2047</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimal control of one-dimensional cellular uptake in tissue engineering</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Masako Kishida, Ashlee N. Ford Versypt, Daniel W. Pack, Richard D. Braatz</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-22T23:07:04.052376-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2047</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2047</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2047</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" id="oca2047-para-0002" xmlns="http://www.w3.org/1999/xhtml"><p>A control problem motivated by tissue engineering is formulated and solved, in which control of the uptake of growth factors (signaling molecules) is necessary to spatially and temporally regulate cellular processes for the desired growth or regeneration of a tissue. Four approaches are compared for determining one-dimensional optimal boundary control trajectories for a distributed parameter model with reaction, diffusion, and convection: (i) basis function expansion, (ii) method of moments, (iii) internal model control, and (iv) model predictive control (MPC). The proposed method of moments approach is computationally efficient while enforcing a nonnegativity constraint on the control input. Although more computationally expensive than methods (i)–(iii), the MPC formulation significantly reduced the computational cost compared with simultaneous optimization of the entire control trajectory. A comparison of the pros and cons of each of the four approaches suggests that an algorithm that combines multiple approaches is most promising for solving the optimal control problem for multiple spatial dimensions. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

A control problem motivated by tissue engineering is formulated and solved, in which control of the uptake of growth factors (signaling molecules) is necessary to spatially and temporally regulate cellular processes for the desired growth or regeneration of a tissue. Four approaches are compared for determining one-dimensional optimal boundary control trajectories for a distributed parameter model with reaction, diffusion, and convection: (i) basis function expansion, (ii) method of moments, (iii) internal model control, and (iv) model predictive control (MPC). The proposed method of moments approach is computationally efficient while enforcing a nonnegativity constraint on the control input. Although more computationally expensive than methods (i)–(iii), the MPC formulation significantly reduced the computational cost compared with simultaneous optimization of the entire control trajectory. A comparison of the pros and cons of each of the four approaches suggests that an algorithm that combines multiple approaches is most promising for solving the optimal control problem for multiple spatial dimensions. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2045" xmlns="http://purl.org/rss/1.0/"><title>Robust estimation of interconnected systems subject to sensor nonlinearities</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2045</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Robust estimation of interconnected systems subject to sensor nonlinearities</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Magdi S. Mahmoud, Fouad M. AL-Sunni</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-08-02T08:01:05.326866-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2045</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2045</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2045</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2045-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>An efficient robust LMI-based scheme is developed for decentralized state-estimation of linear interconnected systems with static nonlinear interconnections and subjected to sensor nonlinearities. The interconnections satisfy quadratic constraints with manipulated parameters and the sensor nonlinearities are modeled as sector nonlinearities. The design procedure utilizes a general linear estimator structure and consists of two steps: the first giving a block-diagonal Lyapunov matrix together with the robustness degree and the second determining the filter parameters. A numerical example is provided to illustrate the applicability of the method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>An efficient robust LMI-based scheme is developed for decentralized state-estimation of linear interconnected systems with static nonlinear interconnections and subjected to sensor nonlinearities. The interconnections satisfy quadratic constraints with manipulated parameters and the sensor nonlinearities are modeled as sector nonlinearities. The design procedure utilizes a general linear estimator structure and consists of two steps: the first giving a block-diagonal Lyapunov matrix together with the robustness degree and the second determining the filter parameters. A numerical example is provided to illustrate the applicability of the method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2046" xmlns="http://purl.org/rss/1.0/"><title>Less conservative results on stability for linear systems with a time-varying delay</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2046</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Less conservative results on stability for linear systems with a time-varying delay</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hong-Bing Zeng, Yong He, Min Wu, Shen-Ping Xiao</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-26T04:00:30.115822-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2046</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2046</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2046</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2046-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper is focused on the problem of stability for linear systems with a time-varying delay. A novel Lyapunov–Krasovskii functional that decomposed the delay in all integral terms is proposed. As a result, some less conservative stability criteria are derived by considering the relationship between time-varying delay and its intervals, which have wider application than the existing ones because independent upper bounds of the delay derivative in the various delay intervals are taken into account. Some numerical examples are finally given to show the effectiveness and the benefits of the proposed method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper is focused on the problem of stability for linear systems with a time-varying delay. A novel Lyapunov–Krasovskii functional that decomposed the delay in all integral terms is proposed. As a result, some less conservative stability criteria are derived by considering the relationship between time-varying delay and its intervals, which have wider application than the existing ones because independent upper bounds of the delay derivative in the various delay intervals are taken into account. Some numerical examples are finally given to show the effectiveness and the benefits of the proposed method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2044" xmlns="http://purl.org/rss/1.0/"><title>Quantized feedback fault-tolerant H ∞  controller design for linear systems with adaptive mechanism</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2044</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Quantized feedback fault-tolerant H ∞  controller design for linear systems with adaptive mechanism</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Dan Ye, Xingang Zhao, Jianda Han</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-17T21:52:09.339612-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2044</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2044</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2044</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2044-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper addresses the design problem of fault-tolerant <em>H</em><sub> ∞ </sub> controller for linear systems with state quantization. By combining linear matrix inequality technique and indirect adaptive method, a new method is proposed to design a fault-tolerant controller against actuator faults via quantized state feedback. The controller gains are updating according to the online estimation of eventual faults, which are dependent on the quantized state signals. Meanwhile, the proposed designs conditions with variable gains can be proved to be less conservative than those of the traditional controller with fixed gains. A numerical example is presented to illustrate the effectiveness of the proposed method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper addresses the design problem of fault-tolerant H ∞  controller for linear systems with state quantization. By combining linear matrix inequality technique and indirect adaptive method, a new method is proposed to design a fault-tolerant controller against actuator faults via quantized state feedback. The controller gains are updating according to the online estimation of eventual faults, which are dependent on the quantized state signals. Meanwhile, the proposed designs conditions with variable gains can be proved to be less conservative than those of the traditional controller with fixed gains. A numerical example is presented to illustrate the effectiveness of the proposed method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2043" xmlns="http://purl.org/rss/1.0/"><title>H∞ control synthesis of switched discrete-time fuzzy systems via hybrid approach</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2043</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">H∞ control synthesis of switched discrete-time fuzzy systems via hybrid approach</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Weiming Xiang, Jian Xiao</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-07-10T06:16:41.873213-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2043</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2043</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2043</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2043-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>Because switched system with nonlinear subsystems shows great difficulties in controller design by conventional methodologies, the fuzzy logic theory, which has been proven to be a practical and effective way to deal with the analysis and synthesis problems for complex nonlinear systems, is applied to design a class of hybrid fuzzy <img alt="inline image" src="http://onlinelibrary.wiley.com/store/10.1002/oca.2043/asset/equation/oca2043-math-0001.gif?v=1&amp;t=hh5m2b8s&amp;s=903c0e40a1fa2c923d5248b15cf6350a4678838a" class="inlineGraphic"/> controller for switched discrete-time fuzzy system in this paper. On a basis of one step prediction of switching signal, a hybrid parallel distributed compensation (PDC) control strategy is proposed, which includes two necessary parts: the state feedback controllers for subsystems and the update feedback controllers for switching instants. In both arbitrary and dwell-time switching cases investigated, it is proved that the hybrid PDC controller contains less conservativeness than conventional switched PDC controller. Numerical examples are given to illustrate the effectiveness and advantages of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>Because switched system with nonlinear subsystems shows great difficulties in controller design by conventional methodologies, the fuzzy logic theory, which has been proven to be a practical and effective way to deal with the analysis and synthesis problems for complex nonlinear systems, is applied to design a class of hybrid fuzzy H∞ controller for switched discrete-time fuzzy system in this paper. On a basis of one step prediction of switching signal, a hybrid parallel distributed compensation (PDC) control strategy is proposed, which includes two necessary parts: the state feedback controllers for subsystems and the update feedback controllers for switching instants. In both arbitrary and dwell-time switching cases investigated, it is proved that the hybrid PDC controller contains less conservativeness than conventional switched PDC controller. Numerical examples are given to illustrate the effectiveness and advantages of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2038" xmlns="http://purl.org/rss/1.0/"><title>Optimal drug dosing control for intensive care unit sedation by using a hybrid deterministic–stochastic pharmacokinetic and pharmacodynamic model</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2038</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimal drug dosing control for intensive care unit sedation by using a hybrid deterministic–stochastic pharmacokinetic and pharmacodynamic model</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Behnood Gholami, Wassim M. Haddad, James M. Bailey, Allen R. Tannenbaum</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-28T08:23:44.243287-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2038</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2038</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2038</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>In clinical intensive care unit practice, sedative/analgesic agents are titrated to achieve a specific level of sedation. The level of sedation is currently based on clinical scoring systems. Examples include the motor activity assessment scale, the Richmond agitation–sedation scale, and the modified Ramsay sedation scale. In general, the goal of the clinician is to find the drug dose that maintains the patient at a sedation score corresponding to a moderately sedated state. This is typically done empirically, administering a drug dose that usually is in the effective range for most patients, observing the patient's response, and then adjusting the dose accordingly. However, the response of patients to any drug dose is a reflection of the pharmacokinetic and pharmacodynamic properties of the drug and the specific patient. In this paper, we use pharmacokinetic and pharmacodynamic modeling to find an optimal drug dosing control policy to drive the patient to a desired modified Ramsay sedation scale score. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In clinical intensive care unit practice, sedative/analgesic agents are titrated to achieve a specific level of sedation. The level of sedation is currently based on clinical scoring systems. Examples include the motor activity assessment scale, the Richmond agitation–sedation scale, and the modified Ramsay sedation scale. In general, the goal of the clinician is to find the drug dose that maintains the patient at a sedation score corresponding to a moderately sedated state. This is typically done empirically, administering a drug dose that usually is in the effective range for most patients, observing the patient's response, and then adjusting the dose accordingly. However, the response of patients to any drug dose is a reflection of the pharmacokinetic and pharmacodynamic properties of the drug and the specific patient. In this paper, we use pharmacokinetic and pharmacodynamic modeling to find an optimal drug dosing control policy to drive the patient to a desired modified Ramsay sedation scale score. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2034" xmlns="http://purl.org/rss/1.0/"><title>A partitioning approach for H∞ control of singular time-delay systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2034</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A partitioning approach for H∞ control of singular time-delay systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Mourad Kchaou, Fernando Tadeo, Mohamed Chaabane</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-28T07:51:01.30784-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2034</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2034</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2034</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2034-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a new approach for delay-dependent <em>H</em><sub>∞</sub> stability analysis and control synthesis for singular systems with delay. By constructing an augmented Lyapunov–Krasovskii functional with a triple-integral term, and using the partitioning technique, a bounded real lemma is presented to ensure the singular state-delay system to be regular, impulse free and stable with <em>γ</em>-disturbance rejection. The proposed result leads to significant performance improvement in system analysis and synthesis. Based on the criterion obtained, a homotopy-based iterative LMI algorithm is developed to design a static output feedback controller. The feasibility and the effectiveness of theoretical developments are illustrated through numerical examples.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper presents a new approach for delay-dependent H∞ stability analysis and control synthesis for singular systems with delay. By constructing an augmented Lyapunov–Krasovskii functional with a triple-integral term, and using the partitioning technique, a bounded real lemma is presented to ensure the singular state-delay system to be regular, impulse free and stable with γ-disturbance rejection. The proposed result leads to significant performance improvement in system analysis and synthesis. Based on the criterion obtained, a homotopy-based iterative LMI algorithm is developed to design a static output feedback controller. The feasibility and the effectiveness of theoretical developments are illustrated through numerical examples.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2042" xmlns="http://purl.org/rss/1.0/"><title>Nash equilibrium solutions of tracking game for bilinear systems with exponential reference signals</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2042</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Nash equilibrium solutions of tracking game for bilinear systems with exponential reference signals</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Gaorong Ning, Lin Tie, Kai-Yuan Cai, Xian-Yuan Wu</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-27T00:05:42.278264-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2042</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2042</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2042</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2042-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we consider the problem of Nash equilibrium solutions of two players tracking game for bilinear systems. A successive approximation approach is modified to design optimal controllers for bilinear systems. More specifically, a sequence of extended Sylvester differential equations are solved by this modified approach. A simulation example is given to demonstrate the validity of this approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In this paper, we consider the problem of Nash equilibrium solutions of two players tracking game for bilinear systems. A successive approximation approach is modified to design optimal controllers for bilinear systems. More specifically, a sequence of extended Sylvester differential equations are solved by this modified approach. A simulation example is given to demonstrate the validity of this approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2040" xmlns="http://purl.org/rss/1.0/"><title>Improvement of the LMI change of variables for multi-objective control design problems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2040</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Improvement of the LMI change of variables for multi-objective control design problems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Emile Simon, Vincent Wertz</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-21T07:18:19.466609-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2040</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2040</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2040</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2040-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>The aim of this paper is to propose an improvement of a classical change of variables useful to solve multi-objective control design problems that can be formulated with LMIs. For multi-objective problems, the only approach guaranteed to converge to global optima is to use an iterative approach where the order of the design parameter grows (until no improvement is obtained to some relative decrease). The issue is that the order of the design parameter and the size of associated LMIs may easily grow to unacceptably large values (computationally and/or for implementation in practice). The change of variables considered here was proposed to mitigate that issue, that is, to reduce the inflation of number of variables of the corresponding optimization problems. Here, we propose a method exploiting this change of variables further in order to obtain a sequence of increasing order design parameters converging faster towards the global optimum. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The aim of this paper is to propose an improvement of a classical change of variables useful to solve multi-objective control design problems that can be formulated with LMIs. For multi-objective problems, the only approach guaranteed to converge to global optima is to use an iterative approach where the order of the design parameter grows (until no improvement is obtained to some relative decrease). The issue is that the order of the design parameter and the size of associated LMIs may easily grow to unacceptably large values (computationally and/or for implementation in practice). The change of variables considered here was proposed to mitigate that issue, that is, to reduce the inflation of number of variables of the corresponding optimization problems. Here, we propose a method exploiting this change of variables further in order to obtain a sequence of increasing order design parameters converging faster towards the global optimum. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2039" xmlns="http://purl.org/rss/1.0/"><title>Optimal chemotherapy in cancer treatment: state dependent Riccati equation control and extended Kalman filter</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2039</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimal chemotherapy in cancer treatment: state dependent Riccati equation control and extended Kalman filter</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yazdan Batmani, Hamid Khaloozadeh</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-21T05:27:33.272157-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2039</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2039</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2039</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2039-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this work, we design a nonlinear state feedback controller based on the State Dependent Riccati Equation (SDRE) technique to eliminate the tumor. One of the most interesting advantages of the SDRE is that it is possible to consider the specific conditions of patients by defining appropriate weights in the cost function and by limiting the administrated drug. Another advantage of this approach is that there are infinite ways to form the state dependent matrices. For each patient, a suitable drug regimen has been obtained using these advantages. A nonlinear model has been utilized to predict the growth of tumor. The model is a system of ODE with four state variables: normal cells, tumor cells, immune cells, and drug concentration. To use the SDRE controller, all state variables must be available for feedback. But for measuring the tumor size, the professional equipment is needed. So, it is impossible to measure the tumor size any time. We suppose that the number of normal cells could be measured in the presence of the Gaussian white noise. Therefore, we can design a state observer to estimate the immeasurable states from measurements. Extended Kalman Filter (EKF) can be used as a state observer for a nonlinear system, and in this work, we use EKF as a nonlinear state observer. Consequently, we can use the SDRE technique just by measuring the normal cell population. Numerical simulations are given to illustrate the design procedure and to show the flexibility of the method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In this work, we design a nonlinear state feedback controller based on the State Dependent Riccati Equation (SDRE) technique to eliminate the tumor. One of the most interesting advantages of the SDRE is that it is possible to consider the specific conditions of patients by defining appropriate weights in the cost function and by limiting the administrated drug. Another advantage of this approach is that there are infinite ways to form the state dependent matrices. For each patient, a suitable drug regimen has been obtained using these advantages. A nonlinear model has been utilized to predict the growth of tumor. The model is a system of ODE with four state variables: normal cells, tumor cells, immune cells, and drug concentration. To use the SDRE controller, all state variables must be available for feedback. But for measuring the tumor size, the professional equipment is needed. So, it is impossible to measure the tumor size any time. We suppose that the number of normal cells could be measured in the presence of the Gaussian white noise. Therefore, we can design a state observer to estimate the immeasurable states from measurements. Extended Kalman Filter (EKF) can be used as a state observer for a nonlinear system, and in this work, we use EKF as a nonlinear state observer. Consequently, we can use the SDRE technique just by measuring the normal cell population. Numerical simulations are given to illustrate the design procedure and to show the flexibility of the method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2035" xmlns="http://purl.org/rss/1.0/"><title>Stochastic control of networked control systems with packet dropout and time-varying delay</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2035</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Stochastic control of networked control systems with packet dropout and time-varying delay</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Yan Wang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-21T05:17:17.871444-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2035</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2035</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2035</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2035-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper studies the stochastic stabilization problem for discrete-time networked control systems with time delay and packet dropout. The message losses and time delay from the sensor to the controller and from the controller to the actuator are considered simultaneously. A two-state Markov chain is used to model the correlated packet dropout process. By introducing free weighting matrices, the sufficient condition on the stochastic stability of such networked control system is obtained. An improved criterion is found by introducing the delay fractioning method and a new Lyapunov–Krasovskii functional. On the basis of the stability condition, the mode-dependent controller is given in terms of linear matrix inequalities. A simulation example is given to show the proposed results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper studies the stochastic stabilization problem for discrete-time networked control systems with time delay and packet dropout. The message losses and time delay from the sensor to the controller and from the controller to the actuator are considered simultaneously. A two-state Markov chain is used to model the correlated packet dropout process. By introducing free weighting matrices, the sufficient condition on the stochastic stability of such networked control system is obtained. An improved criterion is found by introducing the delay fractioning method and a new Lyapunov–Krasovskii functional. On the basis of the stability condition, the mode-dependent controller is given in terms of linear matrix inequalities. A simulation example is given to show the proposed results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2041" xmlns="http://purl.org/rss/1.0/"><title>Robust fault detection filter design for a class of neutral-type neural networks with time-varying discrete and unbounded distributed delays</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2041</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Robust fault detection filter design for a class of neutral-type neural networks with time-varying discrete and unbounded distributed delays</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xian Zhang, Xue Lin, Yantao Wang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-19T08:19:38.914243-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2041</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2041</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2041</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2041-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper is concerned with the problem of robust fault detection filter design for a class of neutral-type neural networks with time-varying discrete and unbounded distributed delays. A Luenberger-type observer is designed for monitoring fault. By introducing an appropriate Lyapunov–Krasovskii functional and by using Jensen's inequality techniques to deal with its derivative, a new sufficient condition for the existence of robust fault detection filter is proposed in the form of LMIs with nonlinear constraints. To solve the nonlinear problem, a cone complementarity linearization algorithm is proposed. In addition, several numerical examples are provided to illustrate the applicability of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper is concerned with the problem of robust fault detection filter design for a class of neutral-type neural networks with time-varying discrete and unbounded distributed delays. A Luenberger-type observer is designed for monitoring fault. By introducing an appropriate Lyapunov–Krasovskii functional and by using Jensen's inequality techniques to deal with its derivative, a new sufficient condition for the existence of robust fault detection filter is proposed in the form of LMIs with nonlinear constraints. To solve the nonlinear problem, a cone complementarity linearization algorithm is proposed. In addition, several numerical examples are provided to illustrate the applicability of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2036" xmlns="http://purl.org/rss/1.0/"><title>New criteria on stability analysis for uncertain neutral system with mixed time-varying delays</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2036</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">New criteria on stability analysis for uncertain neutral system with mixed time-varying delays</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Huabin Chen</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-13T09:24:31.094801-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2036</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2036</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2036</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper mainly studies the problem of the robustly stability analysis for uncertain neutral system with mixed time-varying delays. By constructing an augmented Lyapunov–Krasovskii functional, some new delay-dependent criteria can be established in terms of linear matrix inequalities. Compared with some existing results, our delay-dependent criteria can be shown to be some less conservative ones via some illustrative numerical examples. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper mainly studies the problem of the robustly stability analysis for uncertain neutral system with mixed time-varying delays. By constructing an augmented Lyapunov–Krasovskii functional, some new delay-dependent criteria can be established in terms of linear matrix inequalities. Compared with some existing results, our delay-dependent criteria can be shown to be some less conservative ones via some illustrative numerical examples. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2037" xmlns="http://purl.org/rss/1.0/"><title>Optimal dropout policies for networked control systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2037</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimal dropout policies for networked control systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Qiang Ling</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-06-08T06:32:40.092375-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2037</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2037</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2037</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2037-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>By realizing the feedback paths over communication networks, we get a class of networked control systems (NCSs), where the network's quality-of-service (QoS) is commonly characterized by the average dropout rate of feedback data packets. The control performance of an NCS however, is determined not only by the average dropout rate but also by the dropout pattern of feedback data packets. This paper provides a systematic way to determine the optimal dropout pattern (policy) under a given average dropout rate, where the performance is measured by the output signal power under an exogenous white noise. By modeling the finite-memory dropout policies with the general Markov chain, this paper formulates the optimal dropout policy design into the optimization of parameters of a dropout Markov chain. That optimization is first solved by an augmented Lagrangian gradient method, which may be stuck at local optima because of the problem's non-convexity. To compensate this weakness, we apply the branch-and-bound method to the optimization whose constraints are bilinear. The branch-and-bound method can approach the global optimal solution with any desired tolerance in finite steps. The obtained optimal dropout policy may be interpreted as a network's QoS constraint whose enforcement provides a hard guarantee on the control system's performance. An example is used to illustrate the effectiveness of the achieved results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>By realizing the feedback paths over communication networks, we get a class of networked control systems (NCSs), where the network's quality-of-service (QoS) is commonly characterized by the average dropout rate of feedback data packets. The control performance of an NCS however, is determined not only by the average dropout rate but also by the dropout pattern of feedback data packets. This paper provides a systematic way to determine the optimal dropout pattern (policy) under a given average dropout rate, where the performance is measured by the output signal power under an exogenous white noise. By modeling the finite-memory dropout policies with the general Markov chain, this paper formulates the optimal dropout policy design into the optimization of parameters of a dropout Markov chain. That optimization is first solved by an augmented Lagrangian gradient method, which may be stuck at local optima because of the problem's non-convexity. To compensate this weakness, we apply the branch-and-bound method to the optimization whose constraints are bilinear. The branch-and-bound method can approach the global optimal solution with any desired tolerance in finite steps. The obtained optimal dropout policy may be interpreted as a network's QoS constraint whose enforcement provides a hard guarantee on the control system's performance. An example is used to illustrate the effectiveness of the achieved results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2033" xmlns="http://purl.org/rss/1.0/"><title>Singular linear quadratic optimal control for singular stochastic discrete-time systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2033</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Singular linear quadratic optimal control for singular stochastic discrete-time systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Jun-e Feng, Peng Cui, Zhongsheng Hou</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-05-09T03:42:34.178679-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2033</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2033</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2033</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2033-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>The finite time horizon singular linear quadratic (LQ) optimal control problem is investigated for singular stochastic discrete-time systems. The problem is transformed into positive LQ one for standard stochastic systems via two equivalent transformations. It is proved that the singular LQ optimal control problem is solvable under two reasonable rank conditions. Via dynamic programming principle, the desired optimal controller is presented in terms of matrix iterative form. One simulation is provided to show the effectiveness of the proposed approaches. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The finite time horizon singular linear quadratic (LQ) optimal control problem is investigated for singular stochastic discrete-time systems. The problem is transformed into positive LQ one for standard stochastic systems via two equivalent transformations. It is proved that the singular LQ optimal control problem is solvable under two reasonable rank conditions. Via dynamic programming principle, the desired optimal controller is presented in terms of matrix iterative form. One simulation is provided to show the effectiveness of the proposed approaches. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2032" xmlns="http://purl.org/rss/1.0/"><title>Robust quantized feedback stabilization of linear systems based on sliding mode control</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2032</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Robust quantized feedback stabilization of linear systems based on sliding mode control</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Bo-Chao Zheng, Guang-Hong Yang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-05-09T03:42:15.146693-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2032</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2032</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2032</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2032-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper investigates the robust quantized feedback stabilization problem for a class of single-input linear uncertain systems on the basis of sliding mode control schemes. It is assumed that the system signals including the system state and control input are quantized before being transmitted through digital communication channels. A static adjustment policy of the quantization parameter for dynamic quantizers is developed. With the adjustment of the quantization parameter, a sliding mode control strategy is designed to ensure the reachability of the sliding manifold, and then, the system is induced into the stable sliding motion thereafter. Finally, an example is provided to illustrate the effectiveness of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper investigates the robust quantized feedback stabilization problem for a class of single-input linear uncertain systems on the basis of sliding mode control schemes. It is assumed that the system signals including the system state and control input are quantized before being transmitted through digital communication channels. A static adjustment policy of the quantization parameter for dynamic quantizers is developed. With the adjustment of the quantization parameter, a sliding mode control strategy is designed to ensure the reachability of the sliding manifold, and then, the system is induced into the stable sliding motion thereafter. Finally, an example is provided to illustrate the effectiveness of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2031" xmlns="http://purl.org/rss/1.0/"><title>A framework of robust fault estimation observer design for continuous-time/discrete-time systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2031</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A framework of robust fault estimation observer design for continuous-time/discrete-time systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Ke Zhang, Bin Jiang, Vincent Cocquempot, Huaguang Zhang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-05-02T02:26:48.124697-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2031</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2031</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2031</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2031-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>A design framework of the observer-based robust fault estimation for continuous-time/discrete-time systems is presented in this paper. Firstly, a multiconstrained fault estimation observer under the <em>H</em><sub>∞</sub> performance specification with the regional pole constraint is proposed to achieve robust fault estimation. Then, the existence conditions for both continuous-time/discrete-time systems are derived explicitly. Furthermore, by introducing slack variables, improved results on the multiconstrained fault estimation observer design are obtained such that different Lyapunov functions can be separately designed for each constraint. Finally, simulation results of a vertical takeoff and landing aircraft are presented to illustrate our contributions. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>A design framework of the observer-based robust fault estimation for continuous-time/discrete-time systems is presented in this paper. Firstly, a multiconstrained fault estimation observer under the H∞ performance specification with the regional pole constraint is proposed to achieve robust fault estimation. Then, the existence conditions for both continuous-time/discrete-time systems are derived explicitly. Furthermore, by introducing slack variables, improved results on the multiconstrained fault estimation observer design are obtained such that different Lyapunov functions can be separately designed for each constraint. Finally, simulation results of a vertical takeoff and landing aircraft are presented to illustrate our contributions. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2025" xmlns="http://purl.org/rss/1.0/"><title>Quasi-average mean square consensus for wireless sensor networks under three topologies with respect to sleeping-awaking method</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2025</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Quasi-average mean square consensus for wireless sensor networks under three topologies with respect to sleeping-awaking method</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Wuneng Zhou, Jinping Mou, Tianbo Wang, Chuan Ji, Jian'an Fang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-12T07:06:17.156904-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2025</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2025</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2025</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2025-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>The quasi-average mean square consensus problem for wireless sensor networks is studied in this paper. The related networks considered are time continuous and linear, and possess the leader–follower structures in which some sensors act as leaders and the others act as followers, with the locale information controlled. Three different leader–follower structures are proposed in this paper. The first one is the topology with fixed leaders and varying followers which arrives at a quasi-average mean square consensus by applying the sleeping-awaking method to all cliques of the followers. The second one is the topology with fixed leaders and fixed followers which arrives at a quasi-average value consensus via the general protocol. The third one is the topology with varying leaders and fixed followers which arrives at a quasi-average mean square consensus by applying the sleeping-awaking method to all cliques of the leaders. For mentioned three topologies, some necessity and sufficiency conditions of the related consensus are obtained, respectively. To illustrate the effectiveness of the obtained results, some numerical examples are presented finally. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The quasi-average mean square consensus problem for wireless sensor networks is studied in this paper. The related networks considered are time continuous and linear, and possess the leader–follower structures in which some sensors act as leaders and the others act as followers, with the locale information controlled. Three different leader–follower structures are proposed in this paper. The first one is the topology with fixed leaders and varying followers which arrives at a quasi-average mean square consensus by applying the sleeping-awaking method to all cliques of the followers. The second one is the topology with fixed leaders and fixed followers which arrives at a quasi-average value consensus via the general protocol. The third one is the topology with varying leaders and fixed followers which arrives at a quasi-average mean square consensus by applying the sleeping-awaking method to all cliques of the leaders. For mentioned three topologies, some necessity and sufficiency conditions of the related consensus are obtained, respectively. To illustrate the effectiveness of the obtained results, some numerical examples are presented finally. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2029" xmlns="http://purl.org/rss/1.0/"><title>Bilinear matrix inequality approaches to robust guaranteed cost control for uncertain discrete-time delay system</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2029</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Bilinear matrix inequality approaches to robust guaranteed cost control for uncertain discrete-time delay system</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Xiaohong Nian, Zhaomei Sun, Haibo Wang, Hang Zhang, Xia Wang</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-02T01:38:15.437221-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2029</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2029</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2029</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2029-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>The robust guaranteed cost control problem for uncertain discrete-time delay system is considered in this paper. Sufficient conditions for the existence of the robust guaranteed cost controllers via memoryless state feedback and static output feedback are expressed as bilinear matrix inequality (BMI). Furthermore, the design methods of optimal robust guaranteed cost controllers, which minimize the upper bound of a given quadratic cost function are presented. Alternate iterative algorithms are proposed to solve the nonconvex optimization problems with BMI constrains. A numerical example is given to illustrate the effectiveness of the proposed methods.Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>The robust guaranteed cost control problem for uncertain discrete-time delay system is considered in this paper. Sufficient conditions for the existence of the robust guaranteed cost controllers via memoryless state feedback and static output feedback are expressed as bilinear matrix inequality (BMI). Furthermore, the design methods of optimal robust guaranteed cost controllers, which minimize the upper bound of a given quadratic cost function are presented. Alternate iterative algorithms are proposed to solve the nonconvex optimization problems with BMI constrains. A numerical example is given to illustrate the effectiveness of the proposed methods.Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2027" xmlns="http://purl.org/rss/1.0/"><title>Multi-period mean-variance portfolio selection in a regime-switching market with a bankruptcy state</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2027</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Multi-period mean-variance portfolio selection in a regime-switching market with a bankruptcy state</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Huiling Wu, Yan Zeng</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-02T01:34:54.449478-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2027</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2027</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2027</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2027-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper first develops a discrete-time multi-period mean-variance portfolio selection model under the assumption that return of a risky asset depends on the states of a stochastic market with a bankruptcy state. When bankruptcy happens, the investor can only retrieve a random fraction <em>δ</em> of the wealth that she or he should acquire and then invests her or his retrieved money in a risk-free asset until the terminal time. Then, by dynamic programming approach and induction method, explicit closed-form expressions for the optimal strategy and efficient frontier are derived. Analysis of the optimal results is also provided. Finally, some numerical examples are presented to illustrate the effects of bankruptcy probability and fraction <em>δ</em> on the efficient frontier and optimal strategy. Specially, (i) our results under the mean-variance model have quite different properties compared with those under power-utility criterion, and (ii) our model generalizes the existing mean-variance portfolio selection with regime switching without bankruptcy state. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>This paper first develops a discrete-time multi-period mean-variance portfolio selection model under the assumption that return of a risky asset depends on the states of a stochastic market with a bankruptcy state. When bankruptcy happens, the investor can only retrieve a random fraction δ of the wealth that she or he should acquire and then invests her or his retrieved money in a risk-free asset until the terminal time. Then, by dynamic programming approach and induction method, explicit closed-form expressions for the optimal strategy and efficient frontier are derived. Analysis of the optimal results is also provided. Finally, some numerical examples are presented to illustrate the effects of bankruptcy probability and fraction δ on the efficient frontier and optimal strategy. Specially, (i) our results under the mean-variance model have quite different properties compared with those under power-utility criterion, and (ii) our model generalizes the existing mean-variance portfolio selection with regime switching without bankruptcy state. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2026" xmlns="http://purl.org/rss/1.0/"><title>A quadratically convergent inexact SQP method for optimal control of differential algebraic equations</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2026</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A quadratically convergent inexact SQP method for optimal control of differential algebraic equations</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Boris Houska, Moritz Diehl</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-02T00:27:58.983192-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2026</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2026</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2026</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">n/a</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2026-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we present an inexact sequential quadratic programming method in the context of a direct multiple shooting approach for differential algebraic equations. For the case that a numerical integration routine is used to compute the states of a relaxed differential algebraic equation, the computation of sensitivities, with respect to a large number of algebraic states, can become very expensive. To overcome this limitation, the inexact sequential quadratic programming method that we propose in this paper requires neither the computation of any sensitivity direction of the differential state trajectory, with respect to the algebraic states, nor the consistent initialization of the differential algebraic equation. We prove the locally quadratic convergence of the proposed method. Finally, we demonstrate the numerical performance of the method by optimizing a distillation column with 82 differential and 122 algebraic states. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>In this paper, we present an inexact sequential quadratic programming method in the context of a direct multiple shooting approach for differential algebraic equations. For the case that a numerical integration routine is used to compute the states of a relaxed differential algebraic equation, the computation of sensitivities, with respect to a large number of algebraic states, can become very expensive. To overcome this limitation, the inexact sequential quadratic programming method that we propose in this paper requires neither the computation of any sensitivity direction of the differential state trajectory, with respect to the algebraic states, nor the consistent initialization of the differential algebraic equation. We prove the locally quadratic convergence of the proposed method. Finally, we demonstrate the numerical performance of the method by optimizing a distillation column with 82 differential and 122 algebraic states. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2019" xmlns="http://purl.org/rss/1.0/"><title>Solution of linear optimal control problems with time delay using a composite Chebyshev finite difference method</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2019</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Solution of linear optimal control problems with time delay using a composite Chebyshev finite difference method</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">H.R. Marzban, S.M. Hoseini</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-14T07:06:13.247045-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2019</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2019</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2019</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">253</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">274</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2019-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, a composite Chebyshev finite difference method is introduced and applied for finding the solution of optimal control of time-delay systems with a quadratic performance index. This method is an extension of the Chebyshev finite difference scheme. The proposed method can be regarded as a nonuniform finite difference scheme and is based on a hybrid of block-pulse functions and Chebyshev polynomials using the well-known Chebyshev–Gauss–Lobatto points. Various types of time-delay systems are included to demonstrate the validity and the applicability of the technique. The method is easy to implement and provides very accurate results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
In this paper, a composite Chebyshev finite difference method is introduced and applied for finding the solution of optimal control of time-delay systems with a quadratic performance index. This method is an extension of the Chebyshev finite difference scheme. The proposed method can be regarded as a nonuniform finite difference scheme and is based on a hybrid of block-pulse functions and Chebyshev polynomials using the well-known Chebyshev–Gauss–Lobatto points. Various types of time-delay systems are included to demonstrate the validity and the applicability of the technique. The method is easy to implement and provides very accurate results. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2020" xmlns="http://purl.org/rss/1.0/"><title>Energy-optimal trajectory planning for the Pendubot and the Acrobot</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2020</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Energy-optimal trajectory planning for the Pendubot and the Acrobot</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">John Gregory, Alberto Olivares, Ernesto Staffetti</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-24T00:41:42.238633-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2020</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2020</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2020</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">275</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">295</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2020-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we study the trajectory-planning problem for planar underactuated robot manipulators with two revolute joints in the presence of gravity. This problem is studied as an optimal control problem. We consider both possible models of planar underactuated robot manipulators, namely with the elbow joint not actuated, called Pendubot, and with the shoulder joint not actuated, called Acrobot. Our method consists of a numerical resolution of a reformulation of the optimal control problem, as an unconstrained calculus of variations problem, in which the dynamic equations of the mechanical system are regarded as constraints and treated by means of special derivative multipliers. We solve the resulting calculus of variations problem by using a numerical approach based on the Euler–Lagrange necessary condition in integral form. In which, time is discretized, and admissible variations for each variable are approximated using a linear combination of the piecewise continuous basis functions of time. In this way, a general method for the solution of optimal control problems with constraints is obtained, which, in particular, can deal with nonintegrable differential constraints arising from the dynamic models of underactuated planar robot manipulators with two revolute joints in the presence of gravity. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
In this paper, we study the trajectory-planning problem for planar underactuated robot manipulators with two revolute joints in the presence of gravity. This problem is studied as an optimal control problem. We consider both possible models of planar underactuated robot manipulators, namely with the elbow joint not actuated, called Pendubot, and with the shoulder joint not actuated, called Acrobot. Our method consists of a numerical resolution of a reformulation of the optimal control problem, as an unconstrained calculus of variations problem, in which the dynamic equations of the mechanical system are regarded as constraints and treated by means of special derivative multipliers. We solve the resulting calculus of variations problem by using a numerical approach based on the Euler–Lagrange necessary condition in integral form. In which, time is discretized, and admissible variations for each variable are approximated using a linear combination of the piecewise continuous basis functions of time. In this way, a general method for the solution of optimal control problems with constraints is obtained, which, in particular, can deal with nonintegrable differential constraints arising from the dynamic models of underactuated planar robot manipulators with two revolute joints in the presence of gravity. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2021" xmlns="http://purl.org/rss/1.0/"><title>Delay-dependent robust H ∞  control for uncertain singular time-delay system with Markovian jumping parameters</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2021</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Delay-dependent robust H ∞  control for uncertain singular time-delay system with Markovian jumping parameters</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Hongqian Lu, Wuneng Zhou, Chunmei Duan, Xingguang Qi</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-24T07:33:40.292784-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2021</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2021</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2021</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">296</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">307</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2021-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>The problem of robust <em>H</em><sub> ∞ </sub> control for a class of uncertain singular time-delay systems with Markovian jumping parameters is addressed in this paper. The considered Markovian jump singular systems involve constant time delay and norm-bounded uncertainties. On the basis of LMI approach, a delay-dependent condition is proposed, which ensures the nominal Markovian jump singular system to be regular, impulse-free and stochastically stable. From the delay-dependent condition, a sufficient condition leading to the existence of a state feedback controller that guarantees the robust admissibility and the <em>H</em><sub> ∞ </sub> performance is also given. A numerical example is given to demonstrate the applicability of the proposed method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
The problem of robust H ∞  control for a class of uncertain singular time-delay systems with Markovian jumping parameters is addressed in this paper. The considered Markovian jump singular systems involve constant time delay and norm-bounded uncertainties. On the basis of LMI approach, a delay-dependent condition is proposed, which ensures the nominal Markovian jump singular system to be regular, impulse-free and stochastically stable. From the delay-dependent condition, a sufficient condition leading to the existence of a state feedback controller that guarantees the robust admissibility and the H ∞  performance is also given. A numerical example is given to demonstrate the applicability of the proposed method. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2022" xmlns="http://purl.org/rss/1.0/"><title>Optimal originator valuation and the global financial crisis</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2022</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Optimal originator valuation and the global financial crisis</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">M.A. Petersen, J. Mukuddem-Petersen, S. Thomas, B. Waal</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-02-20T08:56:05.407779-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2022</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2022</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2022</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">308</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">327</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2022-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>In this paper, we discuss subprime mortgage design in both a theoretical- and numerical-quantitative framework. In particular, we model mortgages that are able to fully amortize, voluntarily prepay (involving prepayment and possibly refinancing), or default. In this regard, we find that mortgage refinancing is curtailed by high loan-to-value ratios because of house price depreciation, whereas low loan-to-value ratios increase mortgagor house equity. Furthermore, an optimal originator valuation problem under mortgage origination is solved. In this case, optimal mortgage value and rates as well as profit are computed. The paper supports the view that the subprime mortgage crisis was partially caused by the intricacy of design of subprime mortgages that led to information (asymmetry, contagion, inefficiency, and loss) problems, valuation opaqueness, and ineffective risk mitigation. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
In this paper, we discuss subprime mortgage design in both a theoretical- and numerical-quantitative framework. In particular, we model mortgages that are able to fully amortize, voluntarily prepay (involving prepayment and possibly refinancing), or default. In this regard, we find that mortgage refinancing is curtailed by high loan-to-value ratios because of house price depreciation, whereas low loan-to-value ratios increase mortgagor house equity. Furthermore, an optimal originator valuation problem under mortgage origination is solved. In this case, optimal mortgage value and rates as well as profit are computed. The paper supports the view that the subprime mortgage crisis was partially caused by the intricacy of design of subprime mortgages that led to information (asymmetry, contagion, inefficiency, and loss) problems, valuation opaqueness, and ineffective risk mitigation. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2023" xmlns="http://purl.org/rss/1.0/"><title>Further results on H ∞  control for discrete-time uncertain singular systems with interval time-varying delays in state and input</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2023</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Further results on H ∞  control for discrete-time uncertain singular systems with interval time-varying delays in state and input</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Huanyu Zhu, Xian Zhang, Shaochun Cui</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-04-27T06:49:23.130143-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2023</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2023</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2023</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">328</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">347</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2023-para-0001" xmlns="http://www.w3.org/1999/xhtml"><p>This paper investigates the state feedback robust <em>H</em><sub> ∞ </sub> control problem of a class of discrete-time singular systems with norm-bounded uncertainties and interval time-varying delays in state and input. A new bounded real lemma for discrete-time singular systems with a pair of time-varying interval state delays is first investigated. Mathematical comparisons of the new bounded real lemma and two existing ones are presented. Then, on the basis of the bounded real lemma proposed here, a sufficient condition in the form of nonlinear matrix inequality, such that the considered state feedback robust <em>H</em><sub> ∞ </sub> control problem is solvable, is given. In order to solve the nonlinear matrix inequality, a cone complementarity linearization algorithm is offered. Several numerical examples are presented to show the applicability of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
This paper investigates the state feedback robust H ∞  control problem of a class of discrete-time singular systems with norm-bounded uncertainties and interval time-varying delays in state and input. A new bounded real lemma for discrete-time singular systems with a pair of time-varying interval state delays is first investigated. Mathematical comparisons of the new bounded real lemma and two existing ones are presented. Then, on the basis of the bounded real lemma proposed here, a sufficient condition in the form of nonlinear matrix inequality, such that the considered state feedback robust H ∞  control problem is solvable, is given. In order to solve the nonlinear matrix inequality, a cone complementarity linearization algorithm is offered. Several numerical examples are presented to show the applicability of the proposed approach. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2028" xmlns="http://purl.org/rss/1.0/"><title>Nonlinear observers for a class of nonlinear descriptor systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2028</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">Nonlinear observers for a class of nonlinear descriptor systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Chunyu Yang, Qingling Zhang, Tianyou Chai</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-28T01:58:04.57458-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2028</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2028</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2028</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">348</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">363</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3><div class="para" id="oca2028-para-0002" xmlns="http://www.w3.org/1999/xhtml"><p>This paper considers a class of nonlinear descriptor systems whose nonlinear terms are time-varying and satisfy a quadratic inequality. An nonlinear observer is constructed and the error system is represented by a Lur'e descriptor system (LDS). Motivated by the basic idea of absolute stability theory, both types of full-order and reduced-order observers are constructed by a unified approach. The proposed method generalizes the existing ones for standard state-space systems, and global convergence of the nonlinear observer is achieved without the usual global Lipschitz restriction. Furthermore, the stability criterion for the error system extends the existing ones for LDS in the sense that the involved interconnected nonlinearities are time-varying and in unbounded sector. Finally, the design methods are reduced to a linear matrix inequality problem and illustrated by two numerical examples. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>
This paper considers a class of nonlinear descriptor systems whose nonlinear terms are time-varying and satisfy a quadratic inequality. An nonlinear observer is constructed and the error system is represented by a Lur'e descriptor system (LDS). Motivated by the basic idea of absolute stability theory, both types of full-order and reduced-order observers are constructed by a unified approach. The proposed method generalizes the existing ones for standard state-space systems, and global convergence of the nonlinear observer is achieved without the usual global Lipschitz restriction. Furthermore, the stability criterion for the error system extends the existing ones for LDS in the sense that the involved interconnected nonlinearities are time-varying and in unbounded sector. Finally, the design methods are reduced to a linear matrix inequality problem and illustrated by two numerical examples. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item><item rdf:about="http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2030" xmlns="http://purl.org/rss/1.0/"><title>A back propagation through time-like min–max optimal control algorithm for nonlinear systems</title><link>http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2030</link><dc:title xmlns:dc="http://purl.org/dc/elements/1.1/">A back propagation through time-like min–max optimal control algorithm for nonlinear systems</dc:title><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">Vladimir Milić, Josip Kasać, Dubravko Majetić</dc:creator><dc:date xmlns:dc="http://purl.org/dc/elements/1.1/">2012-03-28T01:53:21.559868-05:00</dc:date><dc:identifier xmlns:dc="http://purl.org/dc/elements/1.1/">doi:10.1002/oca.2030</dc:identifier><dc:rights xmlns:dc="http://purl.org/dc/elements/1.1/"/><dc:publisher xmlns:dc="http://purl.org/dc/elements/1.1/">John Wiley &amp; Sons, Inc.</dc:publisher><prism:doi xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">10.1002/oca.2030</prism:doi><prism:url xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">http://onlinelibrary.wiley.com/resolve/doi?DOI=10.1002%2Foca.2030</prism:url><prism:section xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">Research Article</prism:section><prism:startingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">364</prism:startingPage><prism:endingPage xmlns:prism="http://prismstandard.org/namespaces/1.2/basic/">378</prism:endingPage><content:encoded xmlns:content="http://purl.org/rss/1.0/modules/content/"><![CDATA[
<h3 xhtml="http://www.w3.org/1999/xhtml" xmlns:ol="http://www.wiley.com/namespaces/ol/xsl-lib">SUMMARY</h3>
<div class="para" xmlns="http://www.w3.org/1999/xhtml"><p>This paper presents a conjugate gradient-based algorithm for feedback min–max optimal control of nonlinear systems. The algorithm has a backward-in-time recurrent structure similar to the back propagation through time (BPTT) algorithm. The control law is given as the output of the one-layer NN. Main contribution of the paper includes the integration of BPTT techniques, conjugate gradient methods, Adams method for solving ODEs and automatic differentiation, to provide an effective, numerically robust algorithm for solving optimal min–max control problems. The proposed algorithm is evaluated on a robotic system with two DOFs. Copyright © 2012 John Wiley &amp; Sons, Ltd.</p></div>]]></content:encoded><description>

This paper presents a conjugate gradient-based algorithm for feedback min–max optimal control of nonlinear systems. The algorithm has a backward-in-time recurrent structure similar to the back propagation through time (BPTT) algorithm. The control law is given as the output of the one-layer NN. Main contribution of the paper includes the integration of BPTT techniques, conjugate gradient methods, Adams method for solving ODEs and automatic differentiation, to provide an effective, numerically robust algorithm for solving optimal min–max control problems. The proposed algorithm is evaluated on a robotic system with two DOFs. Copyright © 2012 John Wiley &amp; Sons, Ltd.</description></item></rdf:RDF>