<?xml version="1.0" encoding="UTF-8" standalone="no"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" article-type="research-article">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Mech. Eng.</journal-id>
<journal-title>Frontiers in Mechanical Engineering</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Mech. Eng.</abbrev-journal-title>
<issn pub-type="epub">2297-3079</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/fmech.2016.00011</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Mechanical Engineering</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Bandwidth Reduction and Convergence Analysis of Extremum Seeking Control with Feedback Encoding</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name><surname>Wijesinghe</surname> <given-names>Vikum S.</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/374192"/>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name><surname>Premaratne</surname> <given-names>Upeka Kanchana</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="corresp" rid="cor1">&#x0002A;</xref>
<uri xlink:href="http://frontiersin.org/people/u/281087"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Department of Electronic and Telecommunication Engineering, University of Moratuwa</institution>, <addr-line>Moratuwa</addr-line>, <country>Sri Lanka</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Hamid Reza Karimi, Polytechnic University of Milan, Italy</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Sachin Prakash Wadikhaye, Eaton Technologies Pvt. Ltd, India; Jianbin Qiu, Harbin Institute of Technology, China</p></fn>
<corresp content-type="corresp" id="cor1">&#x0002A;Correspondence: Upeka Kanchana Premaratne, <email>upeka&#x00040;uom.lk</email></corresp>
<fn fn-type="other" id="fn001"><p>Specialty section: This article was submitted to Mechatronics, a section of the journal Frontiers in Mechanical Engineering</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>28</day>
<month>11</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="collection">
<year>2016</year>
</pub-date>
<volume>2</volume>
<elocation-id>11</elocation-id>
<history>
<date date-type="received">
<day>06</day>
<month>08</month>
<year>2016</year>
</date>
<date date-type="accepted">
<day>04</day>
<month>11</month>
<year>2016</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2016 Wijesinghe and Premaratne.</copyright-statement>
<copyright-year>2016</copyright-year>
<copyright-holder>Wijesinghe and Premaratne</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/"><p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) or licensor are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p></license>
</permissions>
<abstract>
<p>Frequently, a physical plant of a control system has an optimum operating point such as the spark (or injection) time of an internal combustion engine that results in maximum torque. Extremum Seeking Control (ESC) is a method of adaptive control capable of locating and maintaining a plant at such an optimum operating point in real time. It is capable of doing so with minimal <italic>a priori</italic> knowledge of the plant and can also track slowly varying changes. Input perturbed ESC schemes that use periodic dither signals have the disadvantage of requiring a high bandwidth for sampling and correlating the plant output with the dither signal. If the feedback path was to be implemented over a packet switched communication network, the high bandwidth requirement could result in increased congestion and consequently packet delays and dropouts. As a solution encoding using sporadic (aperiodic) sampling techniques can be used in the feedback path of the ESC scheme to reduce the required bandwidth. However, in order to ensure convergence of the ESC scheme with encoding, the effect of the signal reconstruction error due to encoding on the critical correlation stage has to be investigated. The contribution of this paper is an investigation of the convergence requirements and bandwidth performance of two encoding schemes; Memory-Based Event Triggering (MBET) and Event Triggered Adaptive Differential Modulation (ETADM). The results show that MBET can fail for objective functions with plateaus. ETADM fails when the number of ETADM steps used for reconstructing the plant output per perturbation cycle is too low to allow correlation. In terms of bandwidth reduction MBET performs better than ETADM (97% and 70%, respectively). However, the use of MBET results in a longer convergence time.</p>
</abstract>
<kwd-group>
<kwd>extremum seeking control</kwd>
<kwd>networked control systems</kwd>
<kwd>network traffic reduction</kwd>
<kwd>encoding schemes</kwd>
<kwd>memory-based event triggering</kwd>
<kwd>event triggered adaptive differential modulation</kwd>
</kwd-group>
<counts>
<fig-count count="8"/>
<table-count count="3"/>
<equation-count count="12"/>
<ref-count count="40"/>
<page-count count="9"/>
<word-count count="6096"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="introduction">
<label>1</label> <title>Introduction</title>
<p>When a plant is time invariant, known <italic>a priori</italic> and not subject to exogenous disturbances, finding an optimum operating point offline can be computationally intensive but achievable. The amount of computation would generally grow exponentially with the number of variables. When the plant is time variant and subject to exogenous disturbances, this task becomes more challenging since the optimum operating point has to be sought and maintained online (i.e., in real time).</p>
<p>Extremum Seeking Control (ESC) is a potential solution to this problem. It is a type of adaptive control capable of seeking an optimal operating point and maintaining the plant near it. Since ESC is capable of achieving this without much <italic>a priori</italic> knowledge of the plant, it can handle plant perturbations and exogenous disturbances. ESC has been applied to a wide range of real world problems such as handling thermoacoustic instability in Banaszuk et al. (<xref ref-type="bibr" rid="B3">2004</xref>). Beaudoin et al. (<xref ref-type="bibr" rid="B4">2006</xref>) use ESC for bluff body drag reduction, while in Dixon and Frew (<xref ref-type="bibr" rid="B8">2006</xref>), it is used for optimizing sensor networks. This technique is used for vehicle control in Stankovich and Stipanovic (<xref ref-type="bibr" rid="B32">2009</xref>). Recent publications such as Munteanu and Bratcu (<xref ref-type="bibr" rid="B22">2015</xref>), Li et al. (<xref ref-type="bibr" rid="B18">2016</xref>), and Bizon (<xref ref-type="bibr" rid="B5">2016</xref>) suggest a significant interest in using ESC for maximum power point tracking in photovoltaic cells. Other state-of-the-art applications include those in thermodynamic process optimization such as Mu et al. (<xref ref-type="bibr" rid="B21">2015</xref>) and Hu et al. (<xref ref-type="bibr" rid="B13">2015</xref>). It has also been used for online optimization of anaerobic digestion as in Lara-Cisneros et al. (<xref ref-type="bibr" rid="B16">2015</xref>).</p>
<p>The prevalent form of ESC uses a dither (i.e., excitation) signal to explore the search space of the control problem by perturbing the control inputs. This can be periodic as in Tan et al. (<xref ref-type="bibr" rid="B33">2010</xref>) and Krstic and Wang (<xref ref-type="bibr" rid="B15">2000</xref>) or stochastic as in Spall (<xref ref-type="bibr" rid="B31">1992</xref>) and Manzie and Krstic (<xref ref-type="bibr" rid="B20">2009</xref>).</p>
<sec id="S1-1">
<label>1.1</label> <title>Motivation</title>
<p>In a networked control system (NCS) that is packet switched, when a periodically sampled variable is transmitted over the communication network it can be subject to the congestion related issues such as delay, delay variation, and packet drops as reported in Zampieri (<xref ref-type="bibr" rid="B40">2008</xref>), Donkers et al. (<xref ref-type="bibr" rid="B9">2011</xref>), and Premaratne (<xref ref-type="bibr" rid="B24">2014</xref>). In Wu et al. (<xref ref-type="bibr" rid="B39">2013</xref>), it is demonstrated that congestion can lead to increased packet drops. If the bandwidth intensive feedback loop from the plant output sensor to the correlator (Figure <xref ref-type="fig" rid="F1">1</xref>) is transmitted over a communication network, it would be subjected to the issues mentioned above.</p>
<fig position="float" id="F1">
<label>Figure 1</label>
<caption><p><bold>Extremum seeking control with feedback over a communication network</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g001.tif"/>
</fig>
<p>A realistic example of such a control system is an extremum seeking control scheme such as that of Scotson and Wellstead (<xref ref-type="bibr" rid="B30">1990</xref>) being used for optimizing the ignition timing of a ship. Since, the sensor that measures the torque of the propeller shaft is often located at a significant distance from the engine timing controller as mentioned in Hao and Ji (<xref ref-type="bibr" rid="B10">2012</xref>), the use of a communication network to complete the feedback path is a justifiable solution. A furnace with a gas emission sensor located at a significant distance due to the operating temperature range of the sensor is another realistic example.</p>
<p>The rational for using sporadic (i.e., aperiodic) sampling is to mitigate congestion due to periodic sampling by decreasing the effective sampling rate. Studies by Arzen (<xref ref-type="bibr" rid="B1">1999</xref>), Astrom and Bernhardsson (<xref ref-type="bibr" rid="B2">2002</xref>), and Henningsson et al. (<xref ref-type="bibr" rid="B11">2008</xref>) have demonstrated the ability of sporadic sampling to reduce the effective sampling rate provided the exogenous disturbances of the control system have a bounded rate of change. Table V of Premaratne et al. (<xref ref-type="bibr" rid="B27">2017</xref>) provides empirical evidence that sporadic sampling can reduce the likelihood of packet drops due to decreased transmission. This is an additional advantage.</p>
<p>Possible sporadic sampling techniques include Memory-Based Event Triggering (MBET) proposed by Arzen (<xref ref-type="bibr" rid="B1">1999</xref>) and further developed in Lehmann and Lunze (<xref ref-type="bibr" rid="B17">2010</xref>) and Lunze and Lehmann (<xref ref-type="bibr" rid="B19">2010</xref>). In Event Triggered Adaptive Delta Modulation (ETADM) proposed by Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>), event triggering is combined with Adaptive Delta Modulation (ADM). The main motivation for investigation is the effect of the reconstruction error of the above sporadic sampling techniques on the vital correlation stage of the ESC scheme.</p>
</sec>
<sec id="S1-2">
<label>1.2</label> <title>Contribution</title>
<p>The contribution of this paper is the investigation of the convergence requirements and bandwidth performance of MBET and ETADM when used in the feedback path of a sinusoidally perturbed ESC scheme.</p>
</sec>
<sec id="S1-3">
<label>1.3</label> <title>Outline of This Paper</title>
<p>The background of the encoding schemes used is discussed under the Preliminaries (Section <xref ref-type="sec" rid="S2">2</xref>). In Section <xref ref-type="sec" rid="S3">3</xref>, the main results are discussed. These include the requirements for convergence of MBET (Section <xref ref-type="sec" rid="S3-8">3.1</xref>) and ETADM (Section <xref ref-type="sec" rid="S3-9">3.2</xref>). In Section <xref ref-type="sec" rid="S3-10">3.3</xref>, the bandwidth reduction of both encoding methods is compared.</p>
</sec>
</sec>
<sec id="S2">
<label>2</label> <title>Preliminaries</title>
<sec id="S2-4">
<label>2.1</label> <title>Notations</title>
<p>The set of real numbers and positive integers (excluding zero) is represented by <inline-formula><mml:math id="M1"><mml:mi mathvariant="double-struck">R</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M2"><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">Z</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>, respectively. The absolute value of a variable <inline-formula><mml:math id="M3"><mml:mi>z</mml:mi><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi></mml:math></inline-formula> is given by &#x0007C;<italic>z</italic>&#x0007C;. The letter <italic>k</italic> in square brackets is used to denote a periodic (clocked) discrete time sample. A class <inline-formula><mml:math id="M4"><mml:mi mathvariant="script">K</mml:mi><mml:mi mathvariant="script">L</mml:mi></mml:math></inline-formula> function is a two-argument function <inline-formula><mml:math id="M5"><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mn>0</mml:mn><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>. The first argument is a function (known as a class <inline-formula><mml:math id="M6"><mml:mi mathvariant="script">K</mml:mi></mml:math></inline-formula> function) which is continuous, strictly increasing, <inline-formula><mml:math id="M7"><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mn>0</mml:mn><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> and zero when the argument is zero. The second argument of a <inline-formula><mml:math id="M8"><mml:mi mathvariant="script">K</mml:mi><mml:mi mathvariant="script">L</mml:mi></mml:math></inline-formula> function is strictly decreasing. The definitions of <inline-formula><mml:math id="M9"><mml:mi mathvariant="script">K</mml:mi></mml:math></inline-formula> and <inline-formula><mml:math id="M10"><mml:mi mathvariant="script">K</mml:mi><mml:mi mathvariant="script">L</mml:mi></mml:math></inline-formula> functions are taken from page 144 of Khalil (<xref ref-type="bibr" rid="B14">2002</xref>).</p>
</sec>
<sec id="S2-5">
<label>2.2</label> <title>Control System Model</title>
<p>The control system considered consists of an encoded feedback loop (Figure <xref ref-type="fig" rid="F1">1</xref>). The system description is given by,
<disp-formula id="E1"><label>(1)</label><mml:math id="M11"><mml:mfenced separators="" open="" close="}"><mml:mrow><mml:mtable class="aligned"><mml:mtr><mml:mtd columnalign="left"><mml:mi>&#x01E8B;</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>x</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>u</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mtext>&#x02009;&#x02009;with&#x02009;&#x02009;</mml:mtext><mml:mi>x</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="left"><mml:mi>y</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>G</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:math></disp-formula>
where <inline-formula><mml:math id="M12"><mml:mi>x</mml:mi><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup></mml:math></inline-formula> is the plant state, <inline-formula><mml:math id="M13"><mml:mi>u</mml:mi><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi></mml:math></inline-formula> is the control input, and <inline-formula><mml:math id="M14"><mml:mi>y</mml:mi><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi></mml:math></inline-formula> is the output <inline-formula><mml:math id="M15"><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">N</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo></mml:mrow></mml:msup></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>. Both <italic>F</italic> and <italic>G</italic> are globally Lipschitz with respect to their arguments. Typically <italic>G</italic> is a concave (or convex) function with a single isolated optimum point. The high pass and low pass filters are excluded due to possible interference with the bandwidth limiting encoding scheme.</p>
<p><bold>Assumption 1</bold>. <italic>There exists a globally Lipchitz x</italic>&#x0002A;: <inline-formula><mml:math id="M16"><mml:mi mathvariant="double-struck">R</mml:mi><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:msup><mml:mrow><mml:mi mathvariant="double-struck">R</mml:mi></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>n</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:msup></mml:math></inline-formula> <italic>such that for all</italic> <inline-formula><mml:math id="M17"><mml:mi>u</mml:mi><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi></mml:math></inline-formula>, <italic>F</italic>(<italic>x</italic>&#x0002A;(<italic>u</italic>), <italic>u</italic>)&#x02009;&#x0003D;&#x02009;0.</p>
<p><bold>Assumption 2</bold>. <italic>F</italic>(<italic>x</italic>&#x0002A;(<italic>u</italic>), <italic>u</italic>)&#x02009;&#x0003D;&#x02009;0 <italic>is uniformly globally asymptotically stable in u</italic>.</p>
<p>Let <italic>&#x003D5;</italic>(<italic>u</italic>):&#x02009;&#x0003D;&#x02009;<italic>G</italic>(<italic>x</italic>&#x0002A;(<italic>u</italic>)) be the steady state plant output with an isolated maximum <italic>v</italic>. Assumptions 1 and 2 ensure the stability of the ESC scheme such that for any bounded input <italic>u</italic>, the state <italic>x</italic> will remain bounded and converge to the unique equilibrium point determined by the diffeomorphism <italic>x</italic>&#x0002A;(<italic>u</italic>).</p>
<p><bold>Definition 1</bold>. <italic>From</italic> Tan et al. (<xref ref-type="bibr" rid="B34">2006</xref>) and Nesic (<xref ref-type="bibr" rid="B23">2009</xref>): <italic>The system</italic> <inline-formula><mml:math id="M18"><mml:mi>&#x01E8B;</mml:mi><mml:mtext>&#x02009;</mml:mtext><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>F</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>x</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, <italic>where x</italic>&#x02009;&#x02208;&#x02009;<italic>R</italic><sup><italic>n</italic></sup>, <italic>t</italic>&#x02009;&#x02208;&#x02009;<italic>R</italic>&#x02009;&#x02265;&#x02009;0<italic>, and &#x003B5;</italic>&#x02009;&#x02208;&#x02009;<italic>R</italic><sup><italic>l</italic></sup>&#x02009;&#x0003E;&#x02009;0 <italic>are, respectively, the state of the system, the time variable, and the parameter vector, is said to be semi-globally practically asymptotically (SPA) stable, uniformly in</italic> (<italic>&#x003B5;<sub>i</sub></italic>,&#x02009;&#x02026;,&#x02009;<italic>&#x003B5;<sub>j</sub></italic>), <italic>j</italic>&#x02009;&#x02208;&#x02009;1,&#x02009;&#x02026;,&#x02009;<italic>l</italic>, <italic>if there exists &#x003B2;</italic>&#x02009;&#x02208;&#x02009;<italic>KL such that the following holds. For each pair of strictly positive real numbers</italic> (&#x00394;,<italic>&#x003BD;</italic>), <italic>there exist real numbers</italic> <inline-formula><mml:math id="M19"><mml:msubsup><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msubsup><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msubsup><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mn>&#x00394;</mml:mn><mml:mtext>,</mml:mtext><mml:mn>&#x003BD;</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, <italic>k</italic>&#x02009;&#x0003D;&#x02009;1, 2,&#x02009;&#x02026;,&#x02009;<italic>j, and for each fixed</italic> <inline-formula><mml:math id="M20"><mml:msub><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x02009;</mml:mtext><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mn>0</mml:mn><mml:mo class="MathClass-punc">,</mml:mo><mml:msubsup><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msubsup></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, <italic>k</italic>&#x02009;&#x0003D;&#x02009;1, 2,&#x02009;&#x02026;,&#x02009;<italic>j, there exist</italic> <italic>&#x003B5;<sub>i</sub></italic>&#x02009;&#x0003D;&#x02009;<italic>&#x003B5;<sub>i</sub></italic>(<italic>&#x003B5;</italic><sub>1</sub>, <italic>&#x003B5;</italic><sub>2</sub>,&#x02009;&#x02026;,&#x02009;<italic>&#x003B5;<sub>i</sub></italic><sub>&#x02212;1</sub>, &#x00394;, <italic>&#x003BD;</italic>), <italic>with i</italic>&#x02009;&#x0003D;&#x02009;<italic>j</italic>&#x02009;&#x0002B;&#x02009;1, <italic>j</italic>&#x02009;&#x0002B;&#x02009;2,&#x02009;&#x02026;,&#x02009;l, <italic>such that the solutions of</italic> <inline-formula><mml:math id="M21"><mml:mi>&#x01E8B;</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>F</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>x</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula><italic>with the so constructed parameters&#x02009;&#x003B5;&#x02009;</italic>&#x0003D;&#x02009;(<italic>&#x003B5;</italic><sub>1</sub>,&#x02009;&#x02026;,&#x02009;<italic>&#x003B5;<sub>l</sub></italic>) <italic>satisfy</italic>:
<disp-formula id="E2"><label>(2)</label><mml:math id="M22"><mml:mi class="MathClass-rel">&#x0007C;</mml:mi><mml:mi>x</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi class="MathClass-rel">&#x0007C;</mml:mi><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:mi>&#x003B2;</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi class="MathClass-rel">&#x0007C;</mml:mi><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mi class="MathClass-rel">&#x0007C;</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x003B5;</mml:mi></mml:mrow><mml:mrow><mml:mi>l</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>&#x003BD;</mml:mi><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
for all <italic>t</italic>&#x02009;&#x02265;&#x02009;<italic>t</italic><sub>0</sub>&#x02009;&#x02265;&#x02009;0, <italic>x</italic>(<italic>t</italic><sub>0</sub>)&#x02009;&#x0003D;&#x02009;<italic>x</italic>(<italic>t</italic><sub>0</sub>) with &#x0007C;<italic>x</italic><sub>0</sub>&#x0007C;&#x02009;&#x02264;&#x02009;&#x00394;. If we have that <italic>j</italic>&#x02009;&#x0003D;&#x02009;l, then we say that the system is SPA stable, uniformly in <italic>&#x003B5;</italic>.</p>
<p><bold>Assumption 3</bold>. <italic>The ESC scheme of (1) is SPA stable</italic>.</p>
<p>If a dynamical system such as equation (<xref ref-type="disp-formula" rid="E1">1</xref>) is SPA stable its output can start from an arbitrarily large initial bound &#x00394; (&#x0007C;&#x0007C;<italic>x</italic><sub>0</sub>&#x0007C;&#x0007C;&#x02009;&#x02264;&#x02009;&#x00394;) and converging to an arbitrarily small bound <italic>&#x003BC;</italic> such that &#x0007C;&#x0007C;<italic>y</italic>(<italic>t</italic>)&#x02009;&#x02212;&#x02009;<italic>y<sub>v</sub></italic>&#x0007C;&#x0007C;&#x02009;&#x02264;&#x02009;<italic>&#x003BC;</italic> where <italic>y<sub>v</sub></italic>&#x02009;&#x0003D;&#x02009;<italic>&#x003D5;</italic>(<italic>v</italic>) is the desired steady state value of <italic>y</italic>(<italic>t</italic>) (i.e., the optimum). Assumption 3 extends the results of Assumptions 1 and 2 to the practical situation where the continuous periodic dither input results in an output perturbed by the bounded harmonics of the periodic input dither.</p>
</sec>
<sec id="S2-6">
<label>2.3</label> <title>Encoding Scheme and Communication Network Model</title>
<p>The purpose of an encoding scheme is to reduce the bandwidth of a signal by minimizing redundancy. A common redundancy in control systems is the high dependence of adjacent samples. This enables the low bandwidth difference between two adjacent samples to be used instead of the entire sample itself. However, according to Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>), the transmission of the difference is only beneficial in systems that use time division multiple access (TDMA). An alternative to this is to use sporadic sampling (aperiodic sampling) where the transmission takes place only when there is a significant change in the signal. This makes them more suitable for packet switched NCS. Both encoding schemes considered in this paper fall into this category.</p>
<p>When an encoding scheme is used it is necessary to sample the encoded variable (i.e., the output of the plant) at a sufficient rate <italic>T<sub>S</sub></italic>. The encoded variable will then have to be reconstructed and held for the sampling time <italic>T<sub>S</sub></italic>. This results in an error which can be modeled as a disturbance <italic>d</italic>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<inline-formula><mml:math id="M23"><mml:mi>&#x00233;</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>y</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula> (Figure <xref ref-type="fig" rid="F2">2</xref>) where <italic>k</italic> is the discretized time of the reconstruction due to holding. Due to this error further assumptions are necessary.</p>
<fig position="float" id="F2">
<label>Figure 2</label>
<caption><p><bold>Reconstruction error modeled as a disturbance</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g002.tif"/>
</fig>
<p><bold>Assumption 4</bold>. <italic>For the sufficient sampling time</italic> <italic>T<sub>S</sub></italic>, <italic>there exists an error bound</italic> &#x00394;<italic><sub>q</sub></italic> <italic>where</italic> <inline-formula><mml:math id="M24"><mml:mi class="MathClass-rel">&#x0007C;</mml:mi><mml:mi>y</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>y</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow><mml:mi class="MathClass-rel">&#x0007C;</mml:mi><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:msub><mml:mrow><mml:mn>&#x00394;</mml:mn></mml:mrow><mml:mrow><mml:mi>q</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> <italic>for t</italic>&#x02009;&#x02208;&#x02009;[(<italic>k</italic>&#x02009;&#x02212;&#x02009;1) <italic>T<sub>S</sub></italic>, <italic>kT<sub>S</sub></italic>). <italic>For convenience</italic>, &#x00394;<italic><sub>q</sub></italic> <italic>is taken as the upper bound of the quantization error</italic>.</p>
<p><bold>Assumption 5</bold>. <italic>Ideal synchronized clocks are used for periodic sampling and reconstruction of y</italic>(<italic>t</italic>).</p>
<p><bold>Assumption 6</bold>. <italic>The communication network uses packet switched multiple access with a negligible channel access time compared to</italic> <italic>T<sub>S</sub></italic>.</p>
<p>From Assumption 4, the ESC scheme of equation (<xref ref-type="disp-formula" rid="E1">1</xref>) need not be considered as a discrete system as in Choi et al. (<xref ref-type="bibr" rid="B6">2002</xref>). Assumptions 5 and 6 are necessary to neglect any effect due to delay and delay variation (jitter), which is inevitable in a packet switched communication network according to the results of Zampieri (<xref ref-type="bibr" rid="B40">2008</xref>), Donkers et al. (<xref ref-type="bibr" rid="B9">2011</xref>), and Premaratne (<xref ref-type="bibr" rid="B24">2014</xref>).</p>
<p>In Tan et al. (<xref ref-type="bibr" rid="B33">2010</xref>), it is mentioned that dither signal <italic>p</italic>(<italic>t</italic>) cannot be correlated to the disturbance <italic>d</italic>(<italic>t</italic>). This can be expressed as:
<disp-formula id="E3"><label>(3)</label><mml:math id="M25"><mml:munder accentunder="true"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>lim</mml:mtext></mml:mrow><mml:mrow><mml:mtext>&#x02009;</mml:mtext></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mo class="MathClass-rel">&#x0221E;</mml:mo></mml:mrow></mml:munder><mml:mtext>&#x02009;</mml:mtext><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x0222B;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi mathvariant="italic">dt</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>0</mml:mn></mml:math></disp-formula>
where <italic>T</italic> is the perturbation period and <italic>p</italic>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<italic>b</italic> sin(<italic>&#x003C9;t</italic>). If the two correlate, the direction of update <italic>u</italic> may be wrongly inferred. This is one of the assumptions used in Tan et al. (<xref ref-type="bibr" rid="B33">2010</xref>) to prove convergence of the system. In addition, it is also mentioned that in practice a small correlation can be tolerated provided that the integral of equation (<xref ref-type="disp-formula" rid="E3">3</xref>) is sufficiently small. Therefore, it is possible to relax the requirement of equation (<xref ref-type="disp-formula" rid="E3">3</xref>) such that
<disp-formula id="E4"><label>(4)</label><mml:math id="M26"><mml:munder accentunder="true"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>lim</mml:mtext></mml:mrow><mml:mrow><mml:mtext>&#x02009;</mml:mtext></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mo class="MathClass-rel">&#x0221E;</mml:mo></mml:mrow></mml:munder><mml:mtext>&#x02009;</mml:mtext><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x0222B;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi mathvariant="italic">dt</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>O</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>b</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></disp-formula>
will suffice for <inline-formula><mml:math id="M27"><mml:mn>1</mml:mn><mml:mo class="MathClass-rel">&#x0226B;</mml:mo><mml:mi>b</mml:mi></mml:math></inline-formula>. The requirement of equation (<xref ref-type="disp-formula" rid="E3">3</xref>) can be used to prove convergence when the reconstruction error can be obtained analytically as in the case of MBET (Lemma 1). When this becomes difficult as for ETADM; equation (<xref ref-type="disp-formula" rid="E4">4</xref>) or empirical correlation of the integrator input of (Figure <xref ref-type="fig" rid="F1">1</xref>) has to be used.</p>
</sec>
<sec id="S2-7">
<label>2.4</label> <title>Encoding Schemes</title>
<p>In this section, the two encoding schemes used (MBET and ETADM) are introduced in terms of their functionality and main parameters. Based on this in Section <xref ref-type="sec" rid="S3">3</xref>, the scenarios under which these encoding schemes fail for ESC are derived.</p>
<sec id="S2-7-1">
<label>2.4.1</label> <title>Memory-Based Event Triggering</title>
<p>In MBET of Arzen (<xref ref-type="bibr" rid="B1">1999</xref>), Lehmann and Lunze (<xref ref-type="bibr" rid="B17">2010</xref>), and Lunze and Lehmann (<xref ref-type="bibr" rid="B19">2010</xref>), a periodically sampled input is used. A subsequent sampling <italic>event</italic> takes place when the difference between the input and the stored input value during the previously triggered event exceed a threshold. The event-based sample is then transmitted across the communication network and at the receiver a Zero Order Hold (ZOH) is used to reconstruct the original signal. The pseudo code of a MBET encoder is given by Figure <xref ref-type="fig" rid="F3">3</xref>.</p>
<fig position="float" id="F3">
<label>Figure 3</label>
<caption><p><bold>Pseudocode for a MBET encoder</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g003.tif"/>
</fig>
<p>The output <italic>z</italic>[<italic>k</italic>] becomes the reconstruction <inline-formula><mml:math id="M28"><mml:mi>&#x00233;</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow></mml:math></inline-formula> once it is held at the ZOH. According to the results of Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>), this method is highly efficient in reducing network traffic. However, according to Hirche and Buss (<xref ref-type="bibr" rid="B12">2004</xref>), it can become unstable when a packet drop occurs. The main parameter for MBET is the event triggering threshold <italic>e<sub>T</sub></italic>. From the result of Lemma 1 of Premaratne (<xref ref-type="bibr" rid="B25">2016</xref>), an MBET encoded signal can be practically approximated to a biased quantizer with a step size of <italic>e<sub>T</sub></italic>. This makes it relatively simple to apply to a practical system.</p>
</sec>
<sec id="S2-7-2">
<label>2.4.2</label> <title>Event Triggered Adaptive Differential Modulation</title>
<p>In ETADM of Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>), the error between the input and <italic>locally</italic> reconstructed signal is first encoded at the transmitter by an Adaptive Differential Modulation (ADM) encoder (Figures <xref ref-type="fig" rid="F6">6</xref> and <xref ref-type="fig" rid="F7">7</xref>). The ADM encoder encodes the difference into a variable step size <italic>S</italic>[<italic>k</italic>] (for a given time), ranging from a minimum step size <italic>S</italic><sub>min</sub> to a maximum step size <italic>S</italic><sub>max</sub> with a step increment of &#x00394;<italic>S</italic>. When the ADM encoder converges to the input, the step size forms a periodic cycle <italic>S</italic>[<italic>k</italic>]&#x02009;&#x0003D;&#x02009;&#x02212;&#x02009;<italic>S</italic>[<italic>k</italic>&#x02009;&#x02212;&#x02009;1]&#x02009;&#x0003D;&#x02009;&#x000B1;&#x02009;<italic>S</italic><sub>min</sub>. From Theorem 3 of Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>), this periodic cycle can be blocked by a subsequent encoder such that
<disp-formula id="E5"><label>(5)</label><mml:math id="M29"><mml:mi>M</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>S</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mi>S</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>S</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub><mml:mspace width="0.3em" class="nbsp" /><mml:mtext>where</mml:mtext><mml:mspace width="0.3em" class="nbsp" /><mml:msub><mml:mrow><mml:mi>e</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>min</mml:mi></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mn>0</mml:mn></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mtext>elsewhere</mml:mtext><mml:mo class="MathClass-punc">.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:math></disp-formula></p>
<p>The non-zero output of <italic>M</italic>(&#x022C5;) is then transmitted across the communication network (Figure <xref ref-type="fig" rid="F8">8</xref>). At the receiver, the signal is reconstructed (i.e., decoded) by a lossy integrator similar to that of the encoder instead of a ZOH. The lossy integrator makes ETADM robust to bounded packet drops compared to MBET. When compared to MBET, the computational complexity of ETADM is significantly higher. Encoding MBET requires only three lines of pseudo code (Figure <xref ref-type="fig" rid="F3">3</xref>). One the other hand, ETADM requires two lossy integrators, the block <italic>M</italic>(&#x022C5;) and a sign function calculation and the step adaptation of Figure <xref ref-type="fig" rid="F7">7</xref>. The step adaptation itself has to detect the input sequence of continuous &#x02212;1 or 1 and increment the step size. If there is a transition in the input (i.e., &#x02212;1 becomes 1 or vice versa), the step size has to be decremented. Furthermore, the selection of parameters for a particular application is heuristic.</p>
</sec>
</sec>
</sec>
<sec id="S3">
<label>3</label> <title>Main Results</title>
<p>In this section, the effects of using encoding schemes for ESC are analyzed from a theoretical perspective and empirically verified using Simulink. Reasonable parameters are selected for the simulated ESC example with <italic>b</italic>&#x02009;&#x0003D;&#x02009;0.2 and <italic>G</italic>&#x02009;&#x0003D;&#x02009;<italic>&#x003F5;/b</italic>&#x02009;&#x0003D;&#x02009;1. The system dynamics of the simulated example are given by <inline-formula><mml:math id="M30"><mml:mi>&#x01E8B;</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>&#x003D5;</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>x</mml:mi></mml:math></inline-formula>. The objective function and frequency are selected according to the scenario. Each simulation has a sampling time of 0.01&#x02009;s and is run for 5000&#x02009;s.</p>
<sec id="S3-8">
<label>3.1</label> <title>Memory-Based Event Triggering</title>
<p><bold>Lemma 1</bold>. <italic>The sinusoidally perturbed ESC system described by (1) that satisfies Assumptions 1 to 6 will converge under MBET encoding if there exists no u<sub>x</sub></italic>, <inline-formula><mml:math id="M31"><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02208;</mml:mo><mml:mi mathvariant="double-struck">R</mml:mi></mml:math></inline-formula> <italic>such that</italic> &#x0007C;<italic>&#x003D5;</italic>(<italic>u<sub>x</sub></italic>)&#x02009;&#x02212;&#x02009;<italic>&#x003D5;</italic>(<italic>u<sub>y</sub></italic>)&#x0007C;&#x02009;&#x0003C;&#x02009;<italic>e<sub>T</sub> and</italic> &#x0007C;(<italic>u<sub>x</sub></italic>&#x02009;&#x02212;&#x02009;<italic>u<sub>y</sub></italic>)&#x0007C;&#x02009;&#x0003E;&#x02009;2<italic>b where b</italic>&#x02009;&#x0003E;&#x02009;0 <italic>is the amplitude of the sinusoidal perturbation</italic>.</p>
<p><bold>Proof</bold>. At steady state for an initial value <italic>u</italic><sub>0</sub>&#x02009;&#x02208;&#x02009;[<italic>u<sub>x</sub></italic>, <italic>u<sub>y</sub></italic>] such that <italic>u</italic>&#x02009;&#x02208;&#x02009;[<italic>u</italic><sub>0</sub>&#x02009;&#x02212;&#x02009;<italic>b</italic>, <italic>u</italic><sub>0</sub>&#x02009;&#x0002B;&#x02009;<italic>b</italic>] &#x02282; [<italic>u<sub>x</sub></italic>, <italic>u<sub>y</sub></italic>], no events will be triggered since &#x0007C;<italic>&#x003D5;</italic>(<italic>u<sub>x</sub></italic>)&#x02009;&#x02212;&#x02009;<italic>&#x003D5;</italic>(<italic>u<sub>y</sub></italic>)&#x0007C;&#x02009;&#x0003C;&#x02009;<italic>e<sub>T</sub></italic>. Therefore, <inline-formula><mml:math id="M32"><mml:mi>d</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mtext>&#x02009;</mml:mtext><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>y</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>&#x00233;</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>g</mml:mi><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>b</mml:mi><mml:mtext>sin</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfenced></mml:mrow></mml:mfenced><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub><mml:mtext>&#x02009;</mml:mtext><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mtext>&#x02009;</mml:mtext><mml:mi>&#x003D5;</mml:mi><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>b</mml:mi><mml:mtext>sin</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfenced><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, where <italic>y<sub>S</sub></italic> is a constant since no events are triggered. Therefore from equation (<xref ref-type="disp-formula" rid="E3">3</xref>),
<disp-formula id="E6"><mml:math id="M33"><mml:mtable columnalign="left" class="align-star"><mml:mtr><mml:mtd class="align-even"><mml:munder accentunder="true"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>lim</mml:mtext></mml:mrow><mml:mrow><mml:mtext>&#x02009;</mml:mtext></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mo class="MathClass-rel">&#x0221E;</mml:mo></mml:mrow></mml:munder><mml:mtext>&#x02009;</mml:mtext><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x0222B;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mtext>&#x02009;</mml:mtext><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi>d</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi mathvariant="italic">dt</mml:mi></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:munder accentunder="true"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>lim</mml:mtext></mml:mrow><mml:mrow><mml:mtext>&#x02009;</mml:mtext></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mo class="MathClass-rel">&#x0221E;</mml:mo></mml:mrow></mml:munder><mml:mtext>&#x02009;</mml:mtext><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x0222B;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mtext>&#x02009;</mml:mtext><mml:mi>b</mml:mi><mml:mtext>&#x02009;sin</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mfenced separators="" open="[" close="]"><mml:mrow><mml:mi>&#x003D5;</mml:mi><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>b</mml:mi><mml:mtext>&#x02009;sin</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfenced><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mi mathvariant="italic">dt</mml:mi></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>b</mml:mi><mml:munder accentunder="true"><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mtext>lim</mml:mtext></mml:mrow><mml:mrow><mml:mtext>&#x02009;</mml:mtext></mml:mrow></mml:mover></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mo class="MathClass-rel">&#x02192;</mml:mo><mml:mo class="MathClass-rel">&#x0221E;</mml:mo></mml:mrow></mml:munder><mml:mtext>&#x02009;</mml:mtext><mml:msubsup><mml:mrow><mml:mo class="MathClass-op">&#x0222B;</mml:mo></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msubsup><mml:mtext>&#x02009;sin</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi>&#x003D5;</mml:mi><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>b</mml:mi><mml:mtext>&#x02009;sin</mml:mtext><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>&#x003C9;</mml:mi><mml:mi>t</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfenced><mml:mi mathvariant="italic">dt</mml:mi><mml:mo class="MathClass-rel">&#x02260;</mml:mo><mml:mn>0</mml:mn><mml:mo class="MathClass-punc">.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>The correlation is non-zero due to the fact that since <italic>&#x003D5;</italic> is Lipschitz for all <italic>&#x003D5;</italic> such that <inline-formula><mml:math id="M34"><mml:mfrac><mml:mrow><mml:mi>d</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">du</mml:mi></mml:mrow></mml:mfrac><mml:mi>&#x003D5;</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x02260;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>, <italic>&#x003D5;</italic>(<italic>u</italic><sub>0</sub>&#x02009;&#x0002B;&#x02009;<italic>b</italic> sin(<italic>&#x003C9;t</italic>)) consists of a fundamental at <italic>&#x003C9;</italic> and harmonics.</p>
<p><bold>Example 1</bold>. <italic>Consider the system of (1) with u</italic>&#x02009;&#x0003D;&#x02009;<italic>x and the plant input-output map</italic>:
<disp-formula id="E7"><label>(6)</label><mml:math id="M35"><mml:mi>y</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>G</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02215;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msup><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mn>6</mml:mn></mml:mrow></mml:msup><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>From the plot of Figure <xref ref-type="fig" rid="F4">4</xref>, the optimum input, <italic>v</italic>&#x02009;&#x02248;&#x02009;0.75, and the corresponding optimum output is <italic>&#x003D5;</italic>(<italic>v</italic>) &#x02248; 1.2. The output map has a plateau at <italic>u</italic>&#x02009;&#x0003D;&#x02009;<italic>x</italic>&#x02009;&#x02208;&#x02009;[&#x02212;0.21, 0.21] where <italic>y</italic> &#x02248;1. When <italic>b</italic>&#x02009;&#x0003D;&#x02009;0.2 and perturbation frequency <italic>f</italic> &#x02009;&#x0003D;&#x02009;<italic>&#x003C9;</italic>/(2<italic>&#x003C0;</italic>)&#x02009;&#x0003D;&#x02009;10&#x02009;Hz, the system fails to converge when <italic>e<sub>T</sub></italic>&#x02009;&#x0003D;&#x02009;0.1 (Figure <xref ref-type="fig" rid="F5">5</xref>A) and succeeds only when <italic>e<sub>T</sub></italic> is reduced to 0.01 (Figure <xref ref-type="fig" rid="F5">5</xref>B).</p>
<fig position="float" id="F4">
<label>Figure 4</label>
<caption><p><bold>Input-output map of the plant of example 1</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g004.tif"/>
</fig>
<fig position="float" id="F5">
<label>Figure 5</label>
<caption><p><bold>MBET encoded ESC performance for the plant of example 1</bold>. <bold>(A)</bold> Non-convergence for <italic>e<sub>T</sub></italic>&#x02009;&#x0003D;&#x02009;0.1. <bold>(B)</bold> Convergence for <italic>e<sub>T</sub></italic>&#x02009;&#x0003D;&#x02009;0.01.</p></caption>
<graphic xlink:href="fmech-02-00011-g005.tif"/>
</fig>
<p><bold>Remark 1</bold>. <italic>In order to guarantee convergence when using MBET, prior knowledge of the non-existence of a plateau in the function <italic>&#x003D5;</italic>(u) is required. This may not be possible in a time variant objective function</italic>.</p>
</sec>
<sec id="S3-9">
<label>3.2</label> <title>Event Triggered Adaptive Differential Modulation</title>
<p>Unlike in MBET, the error <italic>d</italic>(<italic>t</italic>) of ETADM is complex to model. This is due to the complex state transitions of the ETADM encoder that are highlighted in Theorem 2 of Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>). Therefore, it is necessary to ensure that the reconstruction <inline-formula><mml:math id="M36"><mml:mi>&#x00233;</mml:mi><mml:mrow><mml:mo class="MathClass-open">[</mml:mo><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mo class="MathClass-close">]</mml:mo></mml:mrow></mml:math></inline-formula> and <italic>p</italic>(<italic>t</italic>) are correlated unless <italic>y</italic>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<italic>&#x003D5;</italic>(<italic>v</italic>). Thus, if the perturbation frequency <italic>f</italic> can by tracked by a cycle of the encoder state <italic>S</italic>[<italic>k</italic>], this requirement can be satisfied. Taking the minimum number of samples to maintain a cycle as <italic>&#x003BB;</italic>, the value of <italic>f</italic> would be given by
<disp-formula id="E8"><label>(7)</label><mml:math id="M37"><mml:mi>f</mml:mi><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>&#x003BB;</mml:mn><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>Finding a suitable value for <italic>&#x003BB;</italic> requires insight into the cyclic behavior of <italic>S</italic>[<italic>k</italic>] of the ADM encoder based upon its implementation (Figures <xref ref-type="fig" rid="F6">6</xref> and <xref ref-type="fig" rid="F7">7</xref>).</p>
<fig position="float" id="F6">
<label>Figure 6</label>
<caption><p><bold>Schematic of the ADM encoder</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g006.tif"/>
</fig>
<fig position="float" id="F7">
<label>Figure 7</label>
<caption><p><bold>Schematic of the ADM decoder</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g007.tif"/>
</fig>
<fig position="float" id="F8">
<label>Figure 8</label>
<caption><p><bold>Stages of ETADM encoding</bold>.</p></caption>
<graphic xlink:href="fmech-02-00011-g008.tif"/>
</fig>
<p>From the proof of Theorem 2 of Premaratne et al. (<xref ref-type="bibr" rid="B26">2013</xref>), the possible values of <italic>S</italic>[<italic>k</italic>] are discrete and range from <italic>S</italic><sub>max</sub>, &#x02212;(<italic>S</italic><sub>max</sub>&#x02009;&#x0002B;&#x02009;&#x00394;<italic>S</italic>),&#x02009;&#x02026;,&#x02009;&#x02212;<italic>S</italic><sub>min</sub>, and <italic>S</italic><sub>min</sub>, <italic>S</italic><sub>min</sub>&#x02009;&#x0002B;&#x02009;&#x00394;<italic>S</italic>&#x02009;&#x02026;&#x02009;<italic>S</italic><sub>max</sub>. Thus, these discrete values can be taken as individual states. By denoting the state (i.e., value of <italic>S</italic>[<italic>k</italic>]) at time <italic>k</italic> is denoted by the subscript <italic>S<sub>k</sub></italic> and the sign of <italic>e</italic>[<italic>k</italic>] as <italic>E<sub>k</sub></italic>&#x02009;&#x0003D;&#x02009;<italic>sgn</italic>(<italic>e</italic>[<italic>k</italic>])&#x02009;&#x0003D;&#x02009;{&#x02212;1, 0, 1} the state transitions can be represented as:
<disp-formula id="E9"><label>(8)</label><mml:math id="M38"><mml:mtable columnalign="left" class="align"><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>&#x00394;</mml:mn><mml:mi>S</mml:mi></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>1</mml:mn><mml:mtext>&#x02009;and&#x02009;</mml:mtext><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02260;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>1</mml:mn><mml:mtext>&#x02009;and&#x02009;</mml:mtext><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>&#x00394;</mml:mn><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mtext>&#x02009;and&#x02009;</mml:mtext><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02260;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mtext>&#x02009;and&#x02009;</mml:mtext><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
if <italic>S<sub>k</sub></italic> is positive and
<disp-formula id="E10"><label>(9)</label><mml:math id="M39"><mml:mtable columnalign="left" class="align"><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfenced separators="" open="{" close=""><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>&#x00394;</mml:mn><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mspace width="0.3em" class="nbsp" /><mml:mtext>and</mml:mtext><mml:mspace width="0.3em" class="nbsp" /><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02260;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn><mml:mspace width="0.3em" class="nbsp" /><mml:mtext>and</mml:mtext><mml:mspace width="0.3em" class="nbsp" /><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>&#x00394;</mml:mn><mml:mi>S</mml:mi></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>1</mml:mn><mml:mspace width="0.3em" class="nbsp" /><mml:mtext>and</mml:mtext><mml:mspace width="0.3em" class="nbsp" /><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02260;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mtd><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>E</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>1</mml:mn><mml:mspace width="0.3em" class="nbsp" /><mml:mtext>and</mml:mtext><mml:mspace width="0.3em" class="nbsp" /><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
if <italic>S<sub>k</sub></italic> is negative.</p>
<p>Since the cycle given by <italic>S</italic>[<italic>k</italic>]&#x02009;&#x0003D;&#x02009;&#x02212;&#x02009;<italic>S</italic>[<italic>k</italic>&#x02009;&#x02212;&#x02009;1]&#x02009;&#x0003D;&#x02009;&#x000B1;&#x02009;<italic>S</italic><sub>min</sub> would be blocked by equation (<xref ref-type="disp-formula" rid="E5">5</xref>), from equations (<xref ref-type="disp-formula" rid="E8">8</xref>) and (<xref ref-type="disp-formula" rid="E9">9</xref>), the cycle with the next largest step size (i.e., &#x000B1;(<italic>S</italic><sub>min</sub>&#x02009;&#x0002B;&#x02009;&#x00394;<italic>S</italic>)) is given by
<disp-formula id="E11"><label>(10)</label><mml:math id="M40"><mml:mtable columnalign="left" class="align"><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>3</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-punc">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>2</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>&#x00394;</mml:mn><mml:mi>S</mml:mi><mml:mo class="MathClass-punc">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-punc">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>&#x00394;</mml:mn><mml:mi>S</mml:mi><mml:mo class="MathClass-punc">,</mml:mo></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msub></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>S</mml:mi></mml:mrow><mml:mrow><mml:mtext>min</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-punc">.</mml:mo></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>This cycle becomes {0, <italic>S</italic><sub>min</sub>&#x02009;&#x0002B;&#x02009;&#x00394;<italic>S</italic>, 0, &#x02212;<italic>S</italic><sub>min</sub>&#x02009;&#x02212;&#x02009;&#x00394;<italic>S</italic>} after blocking by equation (<xref ref-type="disp-formula" rid="E5">5</xref>).</p>
<p>From equation (<xref ref-type="disp-formula" rid="E10">10</xref>), the minimum value of <italic>&#x003BB;</italic> is four. However, since the lossy integrator with an equation given by <italic>x</italic>[<italic>k</italic>&#x02009;&#x0002B;&#x02009;1]&#x02009;&#x0003D;&#x02009;<italic>Kx</italic>[<italic>k</italic>]&#x02009;&#x0002B;&#x02009;<italic>KM</italic>(<italic>S</italic>[<italic>k</italic>]) (<italic>K&#x02009;&#x0003C;&#x02009;</italic>1 with <italic>K</italic> being as close as possible to one) attenuates the signal when <italic>M</italic>(<italic>S</italic>[<italic>k</italic>])&#x02009;&#x0003D;&#x02009;0, additional transitions of <italic>S</italic>[<italic>k</italic>]&#x02009;&#x0003D;&#x02009;&#x000B1;&#x02009;(<italic>S</italic><sub>min</sub>&#x02009;&#x0002B;&#x02009;&#x00394;<italic>S</italic>) would be required to compensate for the attenuation <italic>x</italic>[<italic>k</italic>&#x02009;&#x0002B;&#x02009;1]&#x02009;&#x0003D;&#x02009;<italic>Kx</italic>[<italic>k</italic>]. Thus, the perturbation frequency of equation (<xref ref-type="disp-formula" rid="E7">7</xref>) will have to satisfy the condition
<disp-formula id="E12"><label>(11)</label><mml:math id="M41"><mml:mi>f</mml:mi><mml:mo class="MathClass-rel">&#x0003C;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>&#x003BB;</mml:mn><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>4</mml:mn><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi>S</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>This result is verified for a bell function <italic>&#x003D5;</italic>(<italic>u</italic>)&#x02009;&#x0003D; exp[&#x02212;(<italic>u</italic>&#x02009;&#x02212;&#x02009;2)<sup>2</sup>/2] with a maximum at <italic>u</italic>&#x02009;&#x0003D;&#x02009;2. Three sets of parameters for ETADM encoding (S1, S2, and S3) are selected such that <italic>S</italic><sub>min</sub> is comparable with the perturbation amplitude <italic>b</italic> (Table <xref ref-type="table" rid="T1">1</xref>). For these results and the sampling time of 0.01&#x02009;s, <italic>f</italic> &#x02009;&#x0003C;&#x02009;25&#x02009;Hz.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p><bold>Encoding scheme parameters</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">Parameter set</th>
<th align="center" colspan="3">Values<hr/></th>
</tr>
<tr>
<th align="center"/>
<th align="center"><italic>S</italic><sub>min</sub></th>
<th align="center"><italic>S</italic><sub>max</sub></th>
<th align="center">&#x00394;<italic>S</italic></th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">ETADM S1</td>
<td align="center">0.2</td>
<td align="center">0.8</td>
<td align="center">0.2</td>
</tr>
<tr>
<td align="left">ETADM S2</td>
<td align="center">0.1</td>
<td align="center">0.4</td>
<td align="center">0.1</td>
</tr>
<tr>
<td align="left">ETADM S3</td>
<td align="center">0.05</td>
<td align="center">0.2</td>
<td align="center">0.05</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Table <xref ref-type="table" rid="T2">2</xref> shows the results in terms of correlation, convergence, and bandwidth reduction. Out of the multiple frequencies used 50&#x02009;Hz and 25&#x02009;Hz are selected so that the perturbation cycle can only be reconstructed by two and four ETADM step values, respectively. For both of these frequencies, there is no significant correlation and convergence as predicted by equation (<xref ref-type="disp-formula" rid="E11">11</xref>). The frequency of 40&#x02009;Hz is selected in between 50&#x02009;Hz and 25&#x02009;Hz for observation of the intermediate behavior. In this case, though there is an unexpectedly high correlation, the convergence time is very large compared to the remaining values. Consistent results are obtained for frequencies below 25&#x02009;Hz where there is a sufficiently high correlation and rapid convergence.</p>
<table-wrap position="float" id="T2">
<label>Table 2</label>
<caption><p><bold>ETADM performance results (correlation, convergence, and bandwidth reduction)</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">Property</th>
<th align="left"><italic>S</italic><italic><sub>min</sub></italic></th>
<th align="center" colspan="8">Frequency (Hz)<hr/></th>
</tr>
<tr>
<th align="center"/>
<th align="center"/>
<th align="center">0.5</th>
<th align="center">1</th>
<th align="center">5</th>
<th align="center">10</th>
<th align="center">12.5</th>
<th align="center">25</th>
<th align="center">40</th>
<th align="center">50</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Correlation</td>
<td align="left">0.2</td>
<td align="center">0.5542</td>
<td align="center">0.6029</td>
<td align="center">0.5650</td>
<td align="center">0.6413</td>
<td align="center">0.6804</td>
<td align="center">&#x02212;0.0132</td>
<td align="center">0.8229</td>
<td align="center">&#x02212;0.0042</td>
</tr>
<tr>
<td align="left"/>
<td align="left">0.1</td>
<td align="center">0.8060</td>
<td align="center">0.8105</td>
<td align="center">0.8216</td>
<td align="center">0.8594</td>
<td align="center">0.8578</td>
<td align="center">0.0410</td>
<td align="center">0.9377</td>
<td align="center">0.0000</td>
</tr>
<tr>
<td align="left"/>
<td align="left">0.05</td>
<td align="center">0.9332</td>
<td align="center">0.9338</td>
<td align="center">0.9371</td>
<td align="center">0.9142</td>
<td align="center">0.8413</td>
<td align="center">0.1535</td>
<td align="center">0.9619</td>
<td align="center">0.0000</td>
</tr>
<tr>
<td align="left">Convergence Time (s)</td>
<td align="left">0.2</td>
<td align="center">196.5</td>
<td align="center">225.3</td>
<td align="center">266.2</td>
<td align="center">361.8</td>
<td align="center">414.7</td>
<td align="center">&#x02013;</td>
<td align="center">1636</td>
<td align="center">&#x02013;</td>
</tr>
<tr>
<td align="left"/>
<td align="left">0.1</td>
<td align="center">198.6</td>
<td align="center">213.2</td>
<td align="center">238.5</td>
<td align="center">279.0</td>
<td align="center">380.3</td>
<td align="center">&#x02013;</td>
<td align="center">1328</td>
<td align="center">&#x02013;</td>
</tr>
<tr>
<td align="left"/>
<td align="left">0.05</td>
<td align="center">204.5</td>
<td align="center">207.3</td>
<td align="center">226.3</td>
<td align="center">319.0</td>
<td align="center">409.1</td>
<td align="center">&#x02013;</td>
<td align="center">2164</td>
<td align="center">&#x02013;</td>
</tr>
<tr>
<td align="left">Bandwidth Reduction (%)</td>
<td align="left">0.2</td>
<td align="center">73.36</td>
<td align="center">74.41</td>
<td align="center">72.75</td>
<td align="center">72.18</td>
<td align="center">72.68</td>
<td align="center">50.00</td>
<td align="center">71.55</td>
<td align="center">75.20</td>
</tr>
<tr>
<td align="left"/>
<td align="left">0.1</td>
<td align="center">74.29</td>
<td align="center">72.79</td>
<td align="center">74.73</td>
<td align="center">74.36</td>
<td align="center">71.22</td>
<td align="center">50.08</td>
<td align="center">74.47</td>
<td align="center">74.84</td>
</tr>
<tr>
<td align="left"/>
<td align="left">0.05</td>
<td align="center">70.36</td>
<td align="center">70.29</td>
<td align="center">69.91</td>
<td align="center">67.92</td>
<td align="center">63.96</td>
<td align="center">50.03</td>
<td align="center">72.91</td>
<td align="center">74.53</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="S3-10">
<label>3.3</label> <title>Performance Comparison</title>
<p>Table <xref ref-type="table" rid="T3">3</xref> compares the performance of MBET and ETADM with <italic>e<sub>T</sub></italic>&#x02009;&#x0003D;&#x02009;<italic>S</italic><sub>min</sub>&#x02009;&#x0003D;&#x02009;0.1 with a periodically sampled benchmark. The results show that for comparable parameters MBET outperforms ETADM in terms of bandwidth reduction. This confirms the previously published results of (Premaratne et al., <xref ref-type="bibr" rid="B26">2013</xref>). However, though MBET is more bandwidth efficient than ETADM, it is increases the convergence time compared to the benchmark.</p>
<table-wrap position="float" id="T3">
<label>Table 3</label>
<caption><p><bold>Traffic reduction and convergence comparison</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="left">Encoder</th>
<th align="center" colspan="3">Convergence<hr/></th>
<th align="center" colspan="2">Traffic reduction<hr/></th>
</tr>
<tr>
<th align="center"/>
<th align="center">Time (s)</th>
<th align="center">Diff. (s)</th>
<th align="center">Diff. (%)</th>
<th align="center">Samples</th>
<th align="center">%</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">Benchmark</td>
<td align="center">255.2</td>
<td align="center">&#x02013;</td>
<td align="center">&#x02013;</td>
<td align="center">&#x02013;</td>
<td align="center">&#x02013;</td>
</tr>
<tr>
<td align="left">ETADM</td>
<td align="center">257.1</td>
<td align="center">1.9</td>
<td align="center">0.7</td>
<td align="center">30002</td>
<td align="center">70.0</td>
</tr>
<tr>
<td align="left">MBET</td>
<td align="center">296.1</td>
<td align="center">40.8</td>
<td align="center">13.8</td>
<td align="center">3018</td>
<td align="center">97.0</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
</sec>
<sec id="S4" sec-type="discussion">
<label>4</label> <title>Discussion</title>
<p>Extremum Seeking Control (ESC) is an effective method capable of locating and maintaining a plant at an optimum operating point. It can do so with minimal <italic>a priori</italic> knowledge of the plant. When the ESC scheme uses sinusoidal input perturbation a high bandwidth is required for sampling and correlating the plant output with the dither signal. This can be reduced by using an encoding scheme for the feedback path. In this paper the convergence requirements and bandwidth performance of two encoding schemes, Memory-Based Event Triggering (MBET) and Event Triggered Adaptive Differential Modulation (ETADM) are investigated.</p>
<p>The result of Lemma 1 proves that MBET will not converge if the objective function has a plateau such that the plateau range is greater than the perturbation amplitude and height is less that the MBET threshold. ESC is expected to function without <italic>a priori</italic> knowledge of the objective function. As mentioned in Remark 1, when MBET encoding is used, knowledge of the non-existence of a plateau in the objective function is necessary.</p>
<p>In the case of ETADM, the convergence result depends on the correlation between the plant output and its reconstruction. The requirement of <italic>f</italic> &#x02009;&#x0003C;&#x02009;1/(4<italic>T<sub>S</sub></italic>) [equation (<xref ref-type="disp-formula" rid="E11">11</xref>)] was obtained for the perturbation frequency which were confirmed in the empirical results of Table <xref ref-type="table" rid="T2">2</xref>.</p>
<p>In terms of bandwidth reduction, MBET performs better than ETADM with 97% and 70% bandwidth reduction, respectively. However, the use of MBET results in a longer convergence time. Out of the two methods, the authors prefer ETADM due to this reason because the convergence time is significantly less than that of MBET. Furthermore, ETADM can mimic the periodic output of the plant due to its cyclic behavior and is also robust to packet drops. The effects of packet drops on control systems have been subjected to numerous recent studies, such as Cloosterman et al. (<xref ref-type="bibr" rid="B7">2008</xref>), Quevedo et al. (<xref ref-type="bibr" rid="B29">2011</xref>), and Quevedo and Nesic (<xref ref-type="bibr" rid="B28">2011</xref>). Of particular interest is the use of Markovian chains for modeling the dropout as in Wei et al. (<xref ref-type="bibr" rid="B35">2014a</xref>,<xref ref-type="bibr" rid="B36">b</xref>, <xref ref-type="bibr" rid="B38">2015b</xref>) and Wei et al. (<xref ref-type="bibr" rid="B37">2015a</xref>) for application in ESC.</p>
<p>In this paper, the benchmark of <italic>S</italic><sub>min &#x0003D;</sub> <italic>e<sub>T</sub></italic> was used. The main future direction is to develop a more comprehensive benchmark in terms of parameters and dynamical systems for comparing diverse sporadic sampling methods. In addition, for any problem, the parameters of ETADM have to be selected heuristically. Developing a framework for selecting suitable parameters for ETADM encoding for a particular application is another required future direction. The possibility of using low bandwidth asymptotic cycles similar to that reported in Premaratne (<xref ref-type="bibr" rid="B25">2016</xref>) instead of a sinusoidal perturbation for ESC is another interesting research avenue.</p>
</sec>
<sec id="S5">
<title>Author Contributions</title>
<p>VW did the fundamental research, formulated the basic theory of the paper, and wrote the initial paper. UP supervised the first author, refined the theoretical and empirical work, and did the final editing of the paper.</p>
</sec>
<sec id="S6">
<title>Conflict of Interest Statement</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
</body>
<back>
<ack>
<p>The authors would like to acknowledge Dr. Prathapasinghe Dharmawansa for his support and constructive comments.</p>
</ack>
<ref-list>
<title>References</title>
<ref id="B1"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Arzen</surname> <given-names>K. E.</given-names></name></person-group> (<year>1999</year>). &#x0201C;<article-title>A simple event-based PID controller</article-title>,&#x0201D; in <source>IFAC Congress</source> (<publisher-loc>Beijing</publisher-loc>: <publisher-name>IFAC</publisher-name>), <fpage>423</fpage>&#x02013;<lpage>428</lpage>.</citation></ref>
<ref id="B2"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Astrom</surname> <given-names>K. J.</given-names></name> <name><surname>Bernhardsson</surname> <given-names>B. M.</given-names></name></person-group> (<year>2002</year>). &#x0201C;<article-title>Comparison of Riemann and Lebesgue sampling for first order stochastic systems</article-title>,&#x0201D; in <conf-name>Proceedings of the 41st IEEE Conference on Decision and Control</conf-name>, Vol. <volume>2</volume> (<conf-loc>Las Vegas, NV</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>2011</fpage>&#x02013;<lpage>2016</lpage>.</citation></ref>
<ref id="B3"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Banaszuk</surname> <given-names>A.</given-names></name> <name><surname>Ariyur</surname> <given-names>K. B.</given-names></name> <name><surname>Krstic</surname> <given-names>M.</given-names></name> <name><surname>Jacobsen</surname> <given-names>C. A.</given-names></name></person-group> (<year>2004</year>). <article-title>An adaptive algorithm for control of thermoacoustic instability</article-title>. <source>Automatica</source> <volume>40</volume>, <fpage>1965</fpage>&#x02013;<lpage>1972</lpage>.<pub-id pub-id-type="doi">10.1016/j.automatica.2004.06.008</pub-id></citation></ref>
<ref id="B4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Beaudoin</surname> <given-names>J. F.</given-names></name> <name><surname>Cadot</surname> <given-names>O.</given-names></name> <name><surname>Aider</surname> <given-names>J. L.</given-names></name> <name><surname>Wesfried</surname> <given-names>J.</given-names></name></person-group> (<year>2006</year>). <article-title>Bluff body drag reduction by extremum seeking control</article-title>. <source>J. Fluids Struct.</source> <volume>22</volume>, <fpage>973</fpage>&#x02013;<lpage>978</lpage>.<pub-id pub-id-type="doi">10.1016/j.jfluidstructs.2006.04.010</pub-id></citation></ref>
<ref id="B5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bizon</surname> <given-names>N.</given-names></name></person-group> (<year>2016</year>). <article-title>Global maximum power point tracking (GMPPT) of photovoltaic array using the extremum seeking control (ESC): a review and a new gmppt esc scheme</article-title>. <source>Renew. Sustain. Energ. Rev.</source> <volume>57</volume>, <fpage>524</fpage>&#x02013;<lpage>539</lpage>.<pub-id pub-id-type="doi">10.1016/j.rser.2015.12.221</pub-id></citation></ref>
<ref id="B6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Choi</surname> <given-names>J. Y.</given-names></name> <name><surname>Krstic</surname> <given-names>M.</given-names></name> <name><surname>Ariyur</surname> <given-names>K. B.</given-names></name> <name><surname>Lee</surname> <given-names>J. S.</given-names></name></person-group> (<year>2002</year>). <article-title>Extremum seeking control for discrete-time systems</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>47</volume>, <fpage>318</fpage>&#x02013;<lpage>323</lpage>.<pub-id pub-id-type="doi">10.1109/9.983370</pub-id></citation></ref>
<ref id="B7"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Cloosterman</surname> <given-names>M. B. G.</given-names></name> <name><surname>van de Wouw</surname> <given-names>N.</given-names></name> <name><surname>Heemels</surname> <given-names>W. P. M. H.</given-names></name> <name><surname>Nijmeijer</surname> <given-names>H.</given-names></name></person-group> (<year>2008</year>). &#x0201C;<article-title>Stabilization of networked control systems with large delays and packet dropouts</article-title>,&#x0201D; in <conf-name>American Control Conference</conf-name> (<conf-loc>Seattle, WA</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>4991</fpage>&#x02013;<lpage>4996</lpage>.</citation></ref>
<ref id="B8"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Dixon</surname> <given-names>C.</given-names></name> <name><surname>Frew</surname> <given-names>E. W.</given-names></name></person-group> (<year>2006</year>). &#x0201C;<article-title>Controlling the mobility of network nodes using decentralized extremum seeking</article-title>,&#x0201D; in <conf-name>Proceedings of the 45th IEEE Conference on Decision and Control</conf-name> (<conf-loc>San Diego, CA</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>1291</fpage>&#x02013;<lpage>1296</lpage>.</citation></ref>
<ref id="B9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Donkers</surname> <given-names>M.</given-names></name> <name><surname>Heemels</surname> <given-names>W.</given-names></name> <name><surname>van de Wouw</surname> <given-names>N.</given-names></name> <name><surname>Hetel</surname> <given-names>L.</given-names></name></person-group> (<year>2011</year>). <article-title>Stability analysis of networked control systems using a switched linear systems approach</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>56</volume>, <fpage>2101</fpage>&#x02013;<lpage>2115</lpage>.<pub-id pub-id-type="doi">10.1109/TAC.2011.2107631</pub-id></citation></ref>
<ref id="B10"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Hao</surname> <given-names>H.</given-names></name> <name><surname>Ji</surname> <given-names>Q.</given-names></name></person-group> (<year>2012</year>). &#x0201C;<article-title>A design of marine propulsion shaft power telemetry system</article-title>,&#x0201D; in <source>Advances in Mechanical and Electronic Engineering</source>, eds <person-group person-group-type="editor"><name><surname>Jin</surname> <given-names>D.</given-names></name> <name><surname>Lin</surname> <given-names>S.</given-names></name></person-group> (<publisher-loc>Berlin and Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>185</fpage>&#x02013;<lpage>189</lpage>.</citation></ref>
<ref id="B11"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Henningsson</surname> <given-names>T.</given-names></name> <name><surname>Johannesson</surname> <given-names>E.</given-names></name> <name><surname>Cervin</surname> <given-names>A.</given-names></name></person-group> (<year>2008</year>). <article-title>Sporadic event-based control of first-order linear stochastic systems</article-title>. <source>Autamatica</source> <volume>44</volume>, <fpage>2890</fpage>&#x02013;<lpage>2895</lpage>.<pub-id pub-id-type="doi">10.1016/j.automatica.2008.03.026</pub-id></citation></ref>
<ref id="B12"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Hirche</surname> <given-names>S.</given-names></name> <name><surname>Buss</surname> <given-names>M.</given-names></name></person-group> (<year>2004</year>). &#x0201C;<article-title>Packet loss effects in passive telepresence systems</article-title>,&#x0201D; in <conf-name>Decision and Control, 2004. CDC. 43rd IEEE Conference On</conf-name>, Vol. <volume>4</volume> (<conf-loc>Paradise Islands, Bahamas</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>4010</fpage>&#x02013;<lpage>4015</lpage>.</citation></ref>
<ref id="B13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hu</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Cao</surname> <given-names>F.</given-names></name> <name><surname>Xing</surname> <given-names>Z.</given-names></name></person-group> (<year>2015</year>). <article-title>Extremum seeking control of COP optimization for air-source transcritical CO<sub>2</sub> heat pump water heater system</article-title>. <source>Appl. Energy</source> <volume>147</volume>, <fpage>361</fpage>&#x02013;<lpage>372</lpage>.<pub-id pub-id-type="doi">10.1016/j.apenergy.2015.03.010</pub-id></citation></ref>
<ref id="B14"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Khalil</surname> <given-names>H. K.</given-names></name></person-group> (<year>2002</year>). <source>Nonlinear Systems</source>, <edition>3rd Edn</edition>. <publisher-loc>New Jersey, USA</publisher-loc>: <publisher-name>Prentice Hall</publisher-name>.</citation></ref>
<ref id="B15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Krstic</surname> <given-names>M.</given-names></name> <name><surname>Wang</surname> <given-names>H. H.</given-names></name></person-group> (<year>2000</year>). <article-title>Stability of extremum seeking feedback for general nonlinear dynamic systems</article-title>. <source>Automatica</source> <volume>36</volume>, <fpage>595</fpage>&#x02013;<lpage>601</lpage>.<pub-id pub-id-type="doi">10.1016/S0005-1098(99)00183-1</pub-id></citation></ref>
<ref id="B16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lara-Cisneros</surname> <given-names>G.</given-names></name> <name><surname>Aguilar-L&#x000F3;pez</surname> <given-names>R.</given-names></name> <name><surname>Femat</surname> <given-names>R.</given-names></name></person-group> (<year>2015</year>). <article-title>On the dynamic optimization of methane production in anaerobic digestion via extremum-seeking control approach</article-title>. <source>Comput. Chem. Eng.</source> <volume>75</volume>, <fpage>49</fpage>&#x02013;<lpage>59</lpage>.<pub-id pub-id-type="doi">10.1016/j.compchemeng.2015.01.018</pub-id></citation></ref>
<ref id="B17"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Lehmann</surname> <given-names>D.</given-names></name> <name><surname>Lunze</surname> <given-names>J.</given-names></name></person-group> (<year>2010</year>). <article-title>&#x0201C;Event-based control using quantized state information,&#x0201D;</article-title> in <conf-name>IFAC Proceedings</conf-name>, Vol. <volume>43</volume> (<conf-loc>Sinaia Romania</conf-loc>), p. <fpage>1</fpage>&#x02013;<lpage>6</lpage>.</citation></ref>
<ref id="B18"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Li</surname> <given-names>X.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Seem</surname> <given-names>J. E.</given-names></name> <name><surname>Lei</surname> <given-names>P.</given-names></name></person-group> (<year>2016</year>). <article-title>Detection of internal resistance change for photovoltaic arrays using extremum-seeking control MPPT signals</article-title>. <source>IEEE Trans. Control Syst. Technol.</source> <volume>24</volume>, <fpage>325</fpage>&#x02013;<lpage>333</lpage>.<pub-id pub-id-type="doi">10.1109/TCST.2015.2424857</pub-id></citation></ref>
<ref id="B19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Lunze</surname> <given-names>J.</given-names></name> <name><surname>Lehmann</surname> <given-names>D.</given-names></name></person-group> (<year>2010</year>). <article-title>A state-feedback approach to event-based control</article-title>. <source>Automatica</source> <volume>46</volume>, <fpage>211</fpage>&#x02013;<lpage>215</lpage>.<pub-id pub-id-type="doi">10.1016/j.automatica.2009.10.035</pub-id></citation></ref>
<ref id="B20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Manzie</surname> <given-names>C.</given-names></name> <name><surname>Krstic</surname> <given-names>M.</given-names></name></person-group> (<year>2009</year>). <article-title>Extremum seeking with stochastic perturbations</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>54</volume>, <fpage>580</fpage>&#x02013;<lpage>585</lpage>.<pub-id pub-id-type="doi">10.1109/TAC.2008.2008320</pub-id></citation></ref>
<ref id="B21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Mu</surname> <given-names>B.</given-names></name> <name><surname>Li</surname> <given-names>Y.</given-names></name> <name><surname>Seem</surname> <given-names>J. E.</given-names></name> <name><surname>Hu</surname> <given-names>B.</given-names></name></person-group> (<year>2015</year>). <article-title>A multivariable Newton-based extremum seeking control for condenser water loop optimization of chilled-water plant</article-title>. <source>J. Dyn. Syst. Meas. Control</source> <volume>137</volume>, <fpage>111011</fpage>.<pub-id pub-id-type="doi">10.1115/1.4031051</pub-id></citation></ref>
<ref id="B22"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Munteanu</surname> <given-names>I.</given-names></name> <name><surname>Bratcu</surname> <given-names>A. I.</given-names></name></person-group> (<year>2015</year>). <article-title>Mppt for grid-connected photovoltaic systems using ripple-based extremum seeking control: analysis and control design issues</article-title>. <source>Solar Energy</source> <volume>111</volume>, <fpage>30</fpage>&#x02013;<lpage>42</lpage>.<pub-id pub-id-type="doi">10.1016/j.solener.2014.10.027</pub-id></citation></ref>
<ref id="B23"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Nesic</surname> <given-names>D.</given-names></name></person-group> (<year>2009</year>). &#x0201C;<article-title>Extremum seeking control: convergence analysis</article-title>,&#x0201D; in <conf-name>2009 European Control Conference (ECC)</conf-name> (<conf-loc>Budapest</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>1702</fpage>&#x02013;<lpage>1715</lpage>.</citation></ref>
<ref id="B24"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Premaratne</surname> <given-names>U.</given-names></name></person-group> (<year>2014</year>). &#x0201C;<article-title>Empirical network jitter measurements for the simulation of a networked control system</article-title>,&#x0201D; in <conf-name>International Conference on Advances in ICT for Emerging Regions (ICTer)</conf-name> (<conf-loc>Colombo</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>235</fpage>&#x02013;<lpage>240</lpage>.</citation></ref>
<ref id="B25"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Premaratne</surname> <given-names>U.</given-names></name></person-group> (<year>2016</year>). &#x0201C;<article-title>Limit cycle like asymptotic dynamics in feedback loops with memory based event triggering</article-title>,&#x0201D; in <conf-name>Moratuwa Engineering Research Conference (MERCon)</conf-name> (<conf-loc>Colombo</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>427</fpage>&#x02013;<lpage>431</lpage>.</citation></ref>
<ref id="B26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Premaratne</surname> <given-names>U.</given-names></name> <name><surname>Halgamuge</surname> <given-names>S. K.</given-names></name> <name><surname>Mareels</surname> <given-names>I. M. Y.</given-names></name></person-group> (<year>2013</year>). <article-title>Event triggered adaptive differential modulation: a new method for traffic reduction in networked control systems</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>58</volume>, <fpage>1696</fpage>&#x02013;<lpage>1706</lpage>.<pub-id pub-id-type="doi">10.1109/TAC.2013.2242571</pub-id></citation></ref>
<ref id="B27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Premaratne</surname> <given-names>U.</given-names></name> <name><surname>Halgamuge</surname> <given-names>S. K.</given-names></name> <name><surname>Mareels</surname> <given-names>I. M. Y.</given-names></name></person-group> (<year>2017</year>). &#x0201C;<article-title>Traffic reduction in packet switched networked control systems using deadband error modulation</article-title>,&#x0201D; in <source>IEEE Transactions on Automatic Control</source>.<pub-id pub-id-type="doi">10.1109/TAC.2016.2615685</pub-id></citation></ref>
<ref id="B28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Quevedo</surname> <given-names>D. E.</given-names></name> <name><surname>Nesic</surname> <given-names>D.</given-names></name></person-group> (<year>2011</year>). <article-title>Input-to-state stability of packetized predictive control over unreliable networks affected by packet-dropouts</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>56</volume>, <fpage>370</fpage>&#x02013;<lpage>375</lpage>.<pub-id pub-id-type="doi">10.1109/TAC.2010.2095950</pub-id></citation></ref>
<ref id="B29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Quevedo</surname> <given-names>D. E.</given-names></name> <name><surname>Ostergaard</surname> <given-names>J.</given-names></name> <name><surname>Nesic</surname> <given-names>D.</given-names></name></person-group> (<year>2011</year>). <article-title>Packetized predictive control of stochastic systems over bit-rate limited channels with packet loss</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>56</volume>, <fpage>2854</fpage>&#x02013;<lpage>2868</lpage>.<pub-id pub-id-type="doi">10.1109/TAC.2011.2139410</pub-id></citation></ref>
<ref id="B30"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Scotson</surname> <given-names>P. G.</given-names></name> <name><surname>Wellstead</surname> <given-names>P. E.</given-names></name></person-group> (<year>1990</year>). <article-title>Self-tuning optimization of spark ignition automotive engines</article-title>. <source>IEEE Commun. Mag.</source> <volume>10</volume>, <fpage>94</fpage>&#x02013;<lpage>101</lpage>.</citation></ref>
<ref id="B31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Spall</surname> <given-names>J. C.</given-names></name></person-group> (<year>1992</year>). <article-title>Multivariate stochastic approximation using a simultaneous perturbation gradient approximation</article-title>. <source>IEEE Trans. Automat. Contr.</source> <volume>37</volume>, <fpage>332</fpage>&#x02013;<lpage>341</lpage>.<pub-id pub-id-type="doi">10.1109/9.119632</pub-id></citation></ref>
<ref id="B32"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Stankovich</surname> <given-names>M. S.</given-names></name> <name><surname>Stipanovic</surname> <given-names>D. M.</given-names></name></person-group> (<year>2009</year>). &#x0201C;<article-title>Discrete time extremum seeking by autonomous vehicles in a stochastic environment</article-title>,&#x0201D; in <conf-name>Joint 48th IEEE Conference on Decision and Control 28th Chinese Control Conference</conf-name> (<conf-loc>Shanghai</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>4541</fpage>&#x02013;<lpage>4546</lpage>.</citation></ref>
<ref id="B33"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>Y.</given-names></name> <name><surname>Moase</surname> <given-names>W. H.</given-names></name> <name><surname>Manzie</surname> <given-names>C.</given-names></name> <name><surname>Nesic</surname> <given-names>D.</given-names></name> <name><surname>Mareels</surname> <given-names>I.</given-names></name></person-group> (<year>2010</year>). &#x0201C;<article-title>Extremum seeking from 1922 to 2010</article-title>,&#x0201D; in <conf-name>Proceedings of the 29th Chinese Control Conference</conf-name> (<conf-loc>Beijing</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>).</citation></ref>
<ref id="B34"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Tan</surname> <given-names>Y.</given-names></name> <name><surname>Nesic</surname> <given-names>D.</given-names></name> <name><surname>Mareels</surname> <given-names>I.</given-names></name></person-group> (<year>2006</year>). <article-title>On non-local stability properties of extremum seeking control</article-title>. <source>Automatica</source> <volume>42</volume>, <fpage>889</fpage>&#x02013;<lpage>903</lpage>.<pub-id pub-id-type="doi">10.1016/j.automatica.2006.01.014</pub-id></citation></ref>
<ref id="B35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Qiu</surname> <given-names>J.</given-names></name> <name><surname>Karimi</surname> <given-names>H. R.</given-names></name> <name><surname>Wang</surname> <given-names>M.</given-names></name></person-group> (<year>2014a</year>). <article-title>Filtering design for two-dimensional Markovian jump systems with state-delays and deficient mode information</article-title>. <source>Inf. Sci.</source> <volume>269</volume>, <fpage>316</fpage>&#x02013;<lpage>331</lpage>.<pub-id pub-id-type="doi">10.1016/j.ins.2013.12.042</pub-id></citation></ref>
<ref id="B36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Qiu</surname> <given-names>J.</given-names></name> <name><surname>Karimi</surname> <given-names>H. R.</given-names></name> <name><surname>Wang</surname> <given-names>M.</given-names></name></person-group> (<year>2014b</year>). <article-title>Model reduction for continuous-time markovian jump systems with incomplete statistics of mode information</article-title>. <source>Int. J. Syst. Sci.</source> <volume>45</volume>, <fpage>1496</fpage>&#x02013;<lpage>1507</lpage>.<pub-id pub-id-type="doi">10.1080/00207721.2013.837545</pub-id></citation></ref>
<ref id="B37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Qiu</surname> <given-names>J.</given-names></name> <name><surname>Karimi</surname> <given-names>H. R.</given-names></name> <name><surname>Wang</surname> <given-names>M.</given-names></name></person-group> (<year>2015a</year>). <article-title>Model approximation for two-dimensional markovian jump systems with state-delays and imperfect mode information</article-title>. <source>Multidimens. Syst. Signal Process.</source> <volume>26</volume>, <fpage>575</fpage>&#x02013;<lpage>597</lpage>.<pub-id pub-id-type="doi">10.1007/s11045-013-0276-x</pub-id></citation></ref>
<ref id="B38"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wei</surname> <given-names>Y.</given-names></name> <name><surname>Qiu</surname> <given-names>J.</given-names></name> <name><surname>Karimi</surname> <given-names>H. R.</given-names></name></person-group> (<year>2015b</year>). <article-title>Quantized H-infinity filtering for continuous-time Markovian jump systems with deficient mode information</article-title>. <source>Asian J. Control</source> <volume>17</volume>, <fpage>1914</fpage>&#x02013;<lpage>1923</lpage>.<pub-id pub-id-type="doi">10.1002/asjc.1052</pub-id></citation></ref>
<ref id="B39"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wu</surname> <given-names>H.</given-names></name> <name><surname>Feng</surname> <given-names>Z.</given-names></name> <name><surname>Guo</surname> <given-names>C.</given-names></name> <name><surname>Zhang</surname> <given-names>Y.</given-names></name></person-group> (<year>2013</year>). <article-title>ICTCP: incast congestion control for TCP in data-center networks</article-title>. <source>IEEE/ACM Trans. Netw.</source> <volume>21</volume>, <fpage>345</fpage>&#x02013;<lpage>358</lpage>.<pub-id pub-id-type="doi">10.1109/TNET.2012.2197411</pub-id></citation></ref>
<ref id="B40"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Zampieri</surname> <given-names>S.</given-names></name></person-group> (<year>2008</year>). &#x0201C;<article-title>Trends in networked control systems</article-title>,&#x0201D; in <conf-name>Proceedings of the 17th World Congress of the International Federation of Automatic Control</conf-name> (<conf-loc>Seoul</conf-loc>: <conf-sponsor>IFAC</conf-sponsor>), <fpage>2886</fpage>&#x02013;<lpage>2894</lpage>.</citation></ref>
</ref-list>
</back>
</article>