<?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. Robot. AI</journal-id>
<journal-title>Frontiers in Robotics and AI</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Robot. AI</abbrev-journal-title>
<issn pub-type="epub">2296-9144</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.3389/frobt.2016.00042</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Robotics and AI</subject>
<subj-group>
<subject>Original Research</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Evaluating Morphological Computation in Muscle and DC-Motor Driven Models of Hopping Movements</article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name><surname>Ghazi-Zahedi</surname> <given-names>Keyan</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/77657"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Haeufle</surname> <given-names>Daniel F. B.</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/346066"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Mont&#x000FA;far</surname> <given-names>Guido</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/171377"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Schmitt</surname> <given-names>Syn</given-names></name>
<xref ref-type="aff" rid="aff2"><sup>2</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/356133"/>
</contrib>
<contrib contrib-type="author">
<name><surname>Ay</surname> <given-names>Nihat</given-names></name>
<xref ref-type="aff" rid="aff1"><sup>1</sup></xref>
<xref ref-type="aff" rid="aff3"><sup>3</sup></xref>
<xref ref-type="aff" rid="aff4"><sup>4</sup></xref>
<uri xlink:href="http://frontiersin.org/people/u/291893"/>
</contrib>
</contrib-group>
<aff id="aff1"><sup>1</sup><institution>Information Theory of Cognitive Systems, Max Planck Institute for Mathematics in the Sciences</institution>, <addr-line>Leipzig</addr-line>, <country>Germany</country></aff>
<aff id="aff2"><sup>2</sup><institution>The Department of Sport and Movement Science, Stuttgart Research Centre for Simulation Technology, University of Stuttgart</institution>, <addr-line>Stuttgart</addr-line>, <country>Germany</country></aff>
<aff id="aff3"><sup>3</sup><institution>Faculty of Mathematics and Computer Science, University of Leipzig</institution>, <addr-line>Leipzig</addr-line>, <country>Germany</country></aff>
<aff id="aff4"><sup>4</sup><institution>Santa Fe Institute</institution>, <addr-line>Santa Fe, NM</addr-line>, <country>USA</country></aff>
<author-notes>
<fn fn-type="edited-by"><p>Edited by: Claudius Gros, Goethe University Frankfurt, Germany</p></fn>
<fn fn-type="edited-by"><p>Reviewed by: Dimitrije Markovi&#x0107;, Dresden University of Technology, Germany; Sam Neymotin, State University of New York, USA; Gennaro Esposito, Univertitat Politecnica de Catalunya, Spain</p></fn>
<corresp content-type="corresp" id="cor1">&#x0002A;Correspondence: Keyan Ghazi-Zahedi, <email>zahedi&#x00040;mis.mpg.de</email></corresp>
<fn fn-type="other" id="fn001"><p>Specialty section: This article was submitted to Computational Intelligence, a section of the journal Frontiers in Robotics and AI</p></fn>
</author-notes>
<pub-date pub-type="epub">
<day>25</day>
<month>07</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="collection">
<year>2016</year>
</pub-date>
<volume>3</volume>
<elocation-id>42</elocation-id>
<history>
<date date-type="received">
<day>29</day>
<month>04</month>
<year>2016</year>
</date>
<date date-type="accepted">
<day>30</day>
<month>06</month>
<year>2016</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#x000A9; 2016 Ghazi-Zahedi, Haeufle, Mont&#x000FA;far, Schmitt and Ay.</copyright-statement>
<copyright-year>2016</copyright-year>
<copyright-holder>Ghazi-Zahedi, Haeufle, Mont&#x000FA;far, Schmitt and Ay</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>In the context of embodied artificial intelligence, morphological computation refers to processes, which are conducted by the body (and environment) that otherwise would have to be performed by the brain. Exploiting environmental and morphological properties are an important feature of embodied systems. The main reason is that it allows to significantly reduce the controller complexity. An important aspect of morphological computation is that it cannot be assigned to an embodied system <italic>per se</italic>, but that it is, as we show, behavior and state dependent. In this work, we evaluate two different measures of morphological computation that can be applied in robotic systems and in computer simulations of biological movement. As an example, these measures were evaluated on muscle and DC-motor driven hopping models. We show that a state-dependent analysis of the hopping behaviors provides additional insights that cannot be gained from the averaged measures alone. This work includes algorithms and computer code for the measures.</p>
</abstract>
<kwd-group>
<kwd>morphological computation</kwd>
<kwd>sensorimotor loop</kwd>
<kwd>embodied artificial intelligence</kwd>
<kwd>muscle models</kwd>
<kwd>information theory</kwd>
</kwd-group>
<counts>
<fig-count count="4"/>
<table-count count="6"/>
<equation-count count="15"/>
<ref-count count="37"/>
<page-count count="12"/>
<word-count count="9859"/>
</counts>
</article-meta>
</front>
<body>
<sec id="S1" sec-type="introduction">
<label>1</label> <title>Introduction</title>
<p>Morphological computation (MC), in the context of embodied (artificial) intelligence, refers to processes, which are conducted by the body (and environment) that otherwise would have to be performed by the brain (Pfeifer and Bongard, <xref ref-type="bibr" rid="B22">2006</xref>). A nice example of MC is given by Wootton (<xref ref-type="bibr" rid="B35">1992</xref>) (see p. 188), who describes how &#x0201C;active muscular forces cannot entirely control the wing shape in flight. They can interact dynamically with the aerodynamic and inertial forces that the wings experience and with the wing&#x02019;s own elasticity; the instantaneous results of these interactions are <italic>essentially</italic> determined by the architecture of the wing itself [&#x02026;]&#x0201D;</p>
<p>MC is relevant in the study of biological and robotic systems. To illustrate the utility of MC in robotics, we will first briefly discuss the Passive Dynamic Walker (McGeer, <xref ref-type="bibr" rid="B19">1990</xref>), which is a purely mechanical system. The proportions of the legs and the weight distribution are similar to those of human legs. The Passive Dynamic Walker shows that walking can result from the interaction of the system&#x02019;s physical properties and its environment (in this case a slope of 3&#x000B0;). No actuation is required for the walking behavior. Transferred to robotics, this means that systems with high morphological computation only need to generate motor commands when they are needed. Not only does such a control increase the durability of the systems (because the wear-out of the actuators is decreased), it also means that robots with high MC will have a reduced energy demand for their actuation (e.g., Niiyama et al. (<xref ref-type="bibr" rid="B21">2012</xref>) and Renjewski et al. (<xref ref-type="bibr" rid="B27">2015</xref>)). By outsourcing computation to the embodiment, the controller complexity, and hence, the computational cost can be reduced, which again contributes to the overall reduction of the energy consumption. For contemporary mobile robots, the energy supply still is one of the biggest unsolved problems, as mobile robots can either operate only for a short period of time or have to carry heavy batteries (Baughman, <xref ref-type="bibr" rid="B4">2005</xref>). To summarize, increasing MC for a robotic system potentially decreases the overall energy demand, the controller complexity, and finally also the wear-out of the system.</p>
<p>This said, one should not mistake MC to be synonymous for energy efficiency. One example in which MC does not relate to energy efficiency is human running, in particular, running in an outdoor environment, such as a downhill off-road path. The runner is not able to detect every change of slope or see every stone, tree branch, etc., on the ground. This means that most irregularities are sensed at the moment when the foot touches the ground (M&#x000FC;ller et al., <xref ref-type="bibr" rid="B20">2015</xref>). However, an immediate reaction in the sense of neural change in muscle activity is not possible, as the communication pathway from the feet to the spinal cord and back is simply too long (&#x0007E;0.02&#x02009;s). Running on an irregular ground is only possible because of the physical properties of the muscle-tendon system. Not only do they have a shock-absorbing function, within certain limits, irregularities of the ground can be accounted for without any explicit control (Brown et al., <xref ref-type="bibr" rid="B6">1995</xref>; Proctor and Holmes, <xref ref-type="bibr" rid="B26">2010</xref>; M&#x000FC;ller et al., <xref ref-type="bibr" rid="B20">2015</xref>). In this case, MC does not contribute to the energy efficiency (running is not energy efficient), but it is required to enable the behavior. We believe that maximizing MC covers more than just energy efficiency (fast adaptivity in uncertain environments is one example), but that this is an immediate benefit in the field of robotics.</p>
<p>For biological systems, energy efficiency and adaptivity are important and evolutionary advantages. A strong indication for the importance of energy efficiency is given by the fact that the human brain accounts for only 2% of the body mass but is responsible for 20% of the entire energy consumption (Clark and Sokoloff, <xref ref-type="bibr" rid="B8">1999</xref>). The energy consumption is also remarkably constant (Sokoloff et al., <xref ref-type="bibr" rid="B31">1955</xref>). Under the assumption that the acquisition of energy was not a trivial task throughout most of the evolution of humans, on can safely conclude that as much computation as possible has been outsourced to the embodiment. When hunting prey or escaping from a predator, adaptivity to irregularities in the environment through morphological properties is a clear evolutionary advantage. Therefore, MC may be a driving force in evolution.</p>
<p>In biological systems, movements are typically generated by muscles. Several simulation studies have shown that the muscles&#x02019; typical non-linear contraction dynamics can be exploited in movement generation with very simple control strategies (Schmitt and Haeufle, <xref ref-type="bibr" rid="B30">2015</xref>). Muscles improve movement stability in comparison to torque driven models (van Soest and Bobbert, <xref ref-type="bibr" rid="B33">1993</xref>) or simplified linearized muscle models [for an overview see (Haeufle et al., <xref ref-type="bibr" rid="B13">2012</xref>)]. Muscles also reduce the influence of the controller on the actual kinematics (they can act as a low-pass filter). This means that the hopping kinematics of the system is more predetermined with non-linear muscle characteristics than with simplified linear muscle characteristics (Haeufle et al., <xref ref-type="bibr" rid="B13">2012</xref>). And finally, in hopping movements, muscles reduce the control effort (amount of information required to control the movement) by a factor of approximately 20 in comparison to a DC-motor driven movement (Haeufle et al., <xref ref-type="bibr" rid="B15">2014</xref>).</p>
<p>In view of these results, we expect that MC plays an important role in the control of muscle driven movement. To study this quantitatively, a suitable measure for MC is required. There are several approaches to formalize MC. Hauser et al. (<xref ref-type="bibr" rid="B16">2011</xref>) proposes a dynamical systems approach in which the effect of the morphology on the attractor landscape of the systems is taken into account. Polani (<xref ref-type="bibr" rid="B24">2011</xref>) minimizes the controller complexity in a reinforcement learning setting. This is very close to our second quantification MC<sub>MI</sub> (see Section <xref ref-type="sec" rid="S3-2">3.2</xref>). The difference is that we take the behavior complexity instead of a reward signal into account. R&#x000FC;ckert and Neumann (<xref ref-type="bibr" rid="B28">2013</xref>) measure morphological computation indirectly by measuring how changes of the morphology reduce or increase the required controller complexity in the context of stochastic optimal control.</p>
<p>In our previous work, we have focused on a direct quantification of the embodiment, whereas most other approaches quantify MC indirectly through the controller complexity. In particular, in our first publication (Zahedi and Ay, <xref ref-type="bibr" rid="B36">2013</xref>), we focused on an agent-centric perspective of measuring MC. We had proposed two different, complementary concepts of measuring morphological computation (which are discussed below). From those concepts, which rely on information that is only partially available to the agent, we derived quantifications that only rely on the agents sensors and actuators. In this publication, we evaluate MC on simulated muscles models, which means that we have access to the full system&#x02019;s state. Hence, in this publication, we concentrate on measures, which operate on the full system&#x02019;s state. This allows us to investigate how the concepts operate on realistic muscle models without taking approximation errors into account that occur from limited sensor information. In a different publication (Ghazi-Zahedi and Rauh, <xref ref-type="bibr" rid="B12">2015</xref>), we applied an information decomposition (Bertschinger et al., <xref ref-type="bibr" rid="B5">2014</xref>) to the sensorimotor loop and developed a refined understand the two concepts that we have proposed in Zahedi and Ay (<xref ref-type="bibr" rid="B36">2013</xref>). Both publications used a binary toy world model to evaluate the measures. With this toy model, it was possible to show that these measures capture the conceptual idea of MC and, in consequence, that they are candidates to measure MC in more complex and more realistic systems.</p>
<p>The main contribution of this publication is to evaluate two measures of MC on biologically realistic hopping models. With this, we want to demonstrate their applicability in non-trivial, realistic scenarios. Based on our previous findings (see above), we hypothesize that MC is higher in hopping movements driven by a non-linear muscle compared to those driven by a simplified linear muscle or a DC-motor. Furthermore, our experiments show that a state-dependent analysis of MC for the different models leads to insights, which cannot be gained from the averaged measures alone. Finally, we provide detailed instructions on how to apply these measures to robotic systems and to computer simulations, including MATLAB<sup>&#x000AE;</sup>, <monospace>C</monospace>&#x0002B;&#x0002B; code, and the data used in this publication (Ghazi-Zahedi, <xref ref-type="bibr" rid="B11">2016</xref>). With this, we hope to provide a tool for the evaluation of MC in a large variety of applications.</p>
<p>The quantifications of MC require a formal representation of the sensorimotor loop (see Figure <xref ref-type="fig" rid="F1">1</xref>), which is introduced in the next section as far as it is required to understand the remainder of this work. For further information, the reader is referred to Klyubin et al. (<xref ref-type="bibr" rid="B18">2004</xref>), Zahedi et al. (<xref ref-type="bibr" rid="B37">2010</xref>), Ay and Zahedi (<xref ref-type="bibr" rid="B2">2013</xref>), and Zahedi and Ay (<xref ref-type="bibr" rid="B36">2013</xref>).</p>
<fig id="F1" position="float">
<label>Figure 1</label>
<caption><p><bold>Left-hand side: Schematics of a cognitive system and the interactions of sensors, brain, actuators, and environment</bold>. Right-hand side: Causal model of the sensorimotor loop for a reactive system (no internal state). This figure depicts a single step of an embodied, reactive system&#x02019;s sensorimotor loop. The state of the world, sensors, and actuators are modeled by the random variables <italic>W</italic>, <italic>S</italic>, and <italic>A</italic>. The arrows between the variables depict the causal relations. The Greek letters denote the corresponding kernels. The sensor kernel <italic>&#x003B2;</italic>(<italic>s</italic>&#x0007C;<italic>w</italic>) determines how the agent senses the world. The policy is given by <italic>&#x003C0;</italic>(<italic>a</italic>&#x0007C;<italic>s</italic>), and finally the world dynamics kernel <italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w, a</italic>) determines how the next world state <italic>W</italic>&#x02032; depends on the previous world state <italic>W</italic> and action <italic>A</italic>. A detailed explanation is given in Section <xref ref-type="sec" rid="S2">2</xref>.</p></caption>
<graphic xlink:href="frobt-03-00042-g001.tif"/>
</fig>
</sec>
<sec id="S2">
<label>2</label> <title>The Sensorimotor Loop</title>
<p>The conceptual idea of the sensorimotor loop is similar to the basic control loop systematics, which is the basis of robotics and also of computer simulations of human movement. In our understanding, a cognitive system consists of a brain or controller, which sends signals to the system&#x02019;s actuators, thereby affecting the system&#x02019;s environment. We prefer to capture the body and environment in a single random variable named <italic>world</italic>. This is consistent with other concepts of agent-environment distinctions. An example for such a distinction can be found in the context of reinforcement learning, where the environment (world) is everything that cannot be changed arbitrarily by the agent (Sutton and Barto, <xref ref-type="bibr" rid="B32">1998</xref>). A more thorough discussion of the brain-body-environment distinction can be found in (von Uexkuell, <xref ref-type="bibr" rid="B34">1934</xref>; Clark, <xref ref-type="bibr" rid="B7">1996</xref>) and more recently by Ay and L&#x000F6;hr (<xref ref-type="bibr" rid="B1">2015</xref>). A brief example of a world, based on a robot simulation, is given below. The loop is closed as the system acquires information about its internal state (e.g., current pose) and its world through its sensors.</p>
<p>For simplicity, we only discuss the sensorimotor loop for reactive systems in this work (for a detailed discussion, please see Ay and Zahedi (<xref ref-type="bibr" rid="B3">2014</xref>)). This is plausible, because behaviors which exploit the embodiment (e.g., walking, swimming, flying) are typically reactive. A measure that takes the controller state into account is discussed in Zahedi and Ay (<xref ref-type="bibr" rid="B36">2013</xref>). Restricting ourselves to reactive systems results in three (stochastic) processes <italic>S</italic>(<italic>t</italic>), <italic>A</italic>(<italic>t</italic>), and <italic>W</italic> (<italic>t</italic>), <inline-formula><mml:math id="M1"><mml:mi>t</mml:mi><mml:mn>&#x02208;</mml:mn><mml:mi mathvariant="double-struck">N</mml:mi></mml:math></inline-formula> that constitute the sensorimotor loop (see Figure <xref ref-type="fig" rid="F1">1</xref>), which take values <italic>s, a</italic>, and <italic>w</italic>, in the sensor, actuator, and world state spaces (their respective domains will be clear from the context). The directed edges (see Figure <xref ref-type="fig" rid="F1">1</xref>) reflect causal dependencies between these random variables. We consider time to be discrete, i.e., <inline-formula><mml:math id="M2"><mml:mi>t</mml:mi><mml:mn>&#x02208;</mml:mn><mml:mi mathvariant="double-struck">N</mml:mi></mml:math></inline-formula> and are interested in what happens in a single time step. Therefore, we use the following notation. Random variables without any time index refer to some fixed time <italic>t</italic> and primed variables to time <italic>t</italic>&#x02009;&#x0002B;&#x02009;1, i.e., the two variables <italic>S, S</italic>&#x02032; refer to <italic>S</italic>(<italic>t</italic>) and <italic>S</italic>(<italic>t</italic>&#x02009;&#x0002B;&#x02009;1).</p>
<p>Starting with the initial distribution over world states, denoted by <italic>p</italic>(<italic>w</italic>), the sensorimotor loop for reactive systems is given by three conditional probability distributions, <italic>&#x003B2;, &#x003B1;, &#x003C0;</italic>, also referred to as kernels. The sensor kernel, which determines how the agent perceives the world, is denoted by <italic>&#x003B2;</italic>(<italic>s</italic>&#x0007C;<italic>w</italic>), the agent&#x02019;s controller or policy is denoted by <italic>&#x003C0;</italic>(<italic>a</italic>&#x0007C;<italic>s</italic>), and finally, the world dynamics kernel is denoted by <italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w</italic>,<italic>a</italic>).</p>
<p>To understand the function of the world dynamics kernel <italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w</italic>,<italic>a</italic>), it is useful to think of a robotic simulation. In this scenario, the world state <italic>W</italic> is the state of the simulator at a given time step, which includes the pose of all objects, their velocities, applied forces, etc. The actuator state <italic>A</italic> is the value that the controller passes on to the physics engine prior to the next physics update. Hence, the world dynamics kernel <italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w</italic>,<italic>a</italic>) is closely related to the forward model that is known in the context of robotics and biomechanics.</p>
<p>Based on this notation, we can now formulate quantifications of MC in the next section.</p>
</sec>
<sec id="S3">
<label>3</label> <title>Quantifying Morphological Computation</title>
<p>In the introduction, we stated that MC relates to the computation that the body (and environment) performs that otherwise would have to be conducted by the controller (or brain). This means that we want to measure the extent to which the system&#x02019;s behavior is the result of the world dynamics (i.e., the body&#x02019;s internal dynamics and it&#x02019;s interaction with its world) and how much of the behavior is determined by the policy <italic>&#x003C0;</italic> (see Figure <xref ref-type="fig" rid="F1">1</xref>). In our previous publication (Zahedi and Ay, <xref ref-type="bibr" rid="B36">2013</xref>), we have derived two complementary concepts to quantify MC (see Section <xref ref-type="sec" rid="S1">1</xref> for a discussion). The two measures discussed below were chosen for presentation in this work, because they represent the two concepts.</p>
<sec id="S3-1">
<label>3.1</label> <title>Morphological Computation as Conditional Mutual Information (MC<sub>W</sub>)</title>
<p>The first quantification, which is used in this work, was introduced in Zahedi and Ay (<xref ref-type="bibr" rid="B36">2013</xref>). The idea behind it can be summarized in the following way. The world dynamics kernel <italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w</italic>,<italic>a</italic>) captures the influence of the actuator signal <italic>A</italic> and the previous world state <italic>W</italic> on the next world state <italic>W</italic>&#x02032;. A complete lack of MC would mean that the behavior of the system is entirely determined by the system&#x02019;s controller, and hence, by the actuator state <italic>A</italic>. In this case, the world dynamics kernel reduces to <italic>p</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>a</italic>). Every difference from this assumption means that the previous world state <italic>W</italic> had an influence, and hence, information about <italic>W</italic> changes the distribution over the next world states <italic>W</italic>&#x02032;. The discrepancy of these two distributions can be measured with the average of the Kullback-Leibler divergence <italic>D</italic><sub>KL</sub>(<italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w</italic>,<italic>a</italic>) &#x0007C;&#x0007C; <italic>p</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>a</italic>)), which is also known as the conditional mutual information <italic>I(W&#x02032;;W&#x0007C;A)</italic>. This distance is formally given by (see also Algorithm <xref ref-type="table" rid="AL2">2</xref>)
<disp-formula id="E1"><label>(1)</label><mml:math id="M4"><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>W</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-punc">:</mml:mo><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mstyle displaystyle='true'><mml:munder class="msub"><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>w</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:munder></mml:mstyle><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>w</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mn>&#x003B1;</mml:mn><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>w</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
</sec>
<sec id="S3-2">
<label>3.2</label> <title>Morphological Computation as Comparison of Behavior and Controller Complexity (MC<sub>MI</sub>)</title>
<p>The second quantification follows concept one of Zahedi and Ay (<xref ref-type="bibr" rid="B36">2013</xref>). The assumption that underlies this concept is that, for a given behavior, MC decreases with an increasing effect of the action <italic>A</italic> on the next world state <italic>W</italic>&#x02032;. The corresponding measure MC<sub>A</sub> &#x0221D;&#x02013;<inline-formula><mml:math id="M5"><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula> cannot be used in systems with deterministic policy, because for these systems <inline-formula><mml:math id="M6"><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>&#x02009;&#x0003D;&#x02009;0 (see <xref ref-type="sec" rid="S11">Appendix A</xref>). Therefore, for this publication, we require an adaptation that operates on world states and is applicable to deterministic systems.</p>
<p>The new measure compares the complexity of the behavior with the complexity of the controller. The complexity of the behavior can be measured by the mutual information of consecutive world states, <italic>I</italic>(<italic>W</italic>&#x02032;;<italic>W</italic>), and the complexity of the controller can be measured by the mutual information of sensor and actuator states, <inline-formula><mml:math id="M7"><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, for the following reason. The mutual information of two random variables can also be written as difference of entropies: <inline-formula><mml:math id="M8"><mml:mi>I</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>Y</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>&#x02009;&#x0003D;&#x02009;<italic>H</italic>(<italic>X</italic>)&#x02009;&#x02212;&#x02009;<italic>H</italic>(<italic>X</italic>&#x0007C;<italic>Y</italic>), <italic>H</italic>(<italic>X</italic>)&#x02009;&#x0003D;&#x02009;&#x02212;&#x02211; <sub><italic>x</italic></sub> <italic>p</italic>(<italic>x</italic>)log<sub>2</sub> <italic>p</italic>(<italic>x</italic>), <italic>H</italic>(<italic>X&#x0007C;Y</italic>)&#x02009;&#x0003D;&#x02009;&#x02212;&#x02211;<sub><italic>x,y</italic></sub> <italic>p</italic>(<italic>x, y</italic>) log<sub>2</sub> <italic>p</italic>(<italic>x</italic>&#x0007C;<italic>y</italic>), which, applied to our setting, means that the mutual information <italic>I</italic>(<italic>W</italic>&#x02032;;<italic>W</italic>) is high, if we have a high entropy over world states <italic>W</italic>&#x02032; (first term) that are highly predicable (second term). Summarized, this means that the mutual information <italic>I</italic>(<italic>W</italic>&#x02032;;<italic>W</italic>) is high if the system shows a diverse but non-random behavior. Obviously, this is what we would like to see in an embodied system. On the other hand, a system with high MC should produce a complex behavior based on a controller with low complexity. Hence, we want to reduce the mutual information <inline-formula><mml:math id="M9"><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, because this either means that the policy has a low diversity in its output (low entropy over actuator states <italic>H</italic>(<italic>A</italic>)) or that there is only a very low correlation between sensor states <italic>S</italic> and actuator states <italic>A</italic> (high conditional entropy <italic>H</italic>(<italic>A</italic>&#x0007C;<italic>S</italic>)). Therefore, we define the second measure as the difference of these two terms, which is (see also Algorithm <xref ref-type="table" rid="AL4">4</xref>).
<disp-formula id="E2"><label>(2)</label><mml:math id="M10"><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>MI</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>Equation <xref ref-type="disp-formula" rid="E2">2</xref> reveals that this measure is closely related to the work by Polani (<xref ref-type="bibr" rid="B24">2011</xref>), and in particular his work on relevant information (Polani et al., <xref ref-type="bibr" rid="B25">2006</xref>), which minimizes the controller complexity while maximizing a reward function, i.e., min <inline-formula><mml:math id="M11"><mml:mo>(</mml:mo><mml:mi>I</mml:mi><mml:mo>(</mml:mo><mml:mi>S</mml:mi><mml:mo>;</mml:mo><mml:mi>A</mml:mi><mml:mo>)</mml:mo><mml:mo>&#x02212;</mml:mo><mml:mn>&#x003B2;</mml:mn><mml:mi mathvariant="double-struck">E</mml:mi><mml:mn>&#x0007B;</mml:mn><mml:mi>Q</mml:mi><mml:mn>(</mml:mn><mml:mi>s</mml:mi><mml:mi>,</mml:mi><mml:mi>a</mml:mi><mml:mi>)&#x0007D;)</mml:mi></mml:math></inline-formula>.</p>
<p>For deterministic systems, as those studied in this work, the two proposed measures, MC<sub>W</sub> and MC<sub>MI</sub> [see equations (<xref ref-type="disp-formula" rid="E1">1</xref>) and (<xref ref-type="disp-formula" rid="E2">2</xref>)], are closely related. In particular, it holds that MC<sub>W</sub>&#x02009;&#x02212;&#x02009;MC<sub>MI</sub>&#x02009;&#x0003D;&#x02009;<italic>H</italic>(<italic>A</italic>&#x0007C;<italic>W</italic>&#x02032;) (see <xref ref-type="sec" rid="S12">Appendix B</xref>). The inequality MC<sub>W</sub>&#x02009;&#x02265;&#x02009;MC<sub>MI</sub> may not be satisfied always, because discretization can introduce stochasticity.</p>
<p>Note that in the case of a passive observer, i.e., a system that observes the world but in which there is no causal dependency between the action and the next world state (i.e., missing connection between <italic>A</italic> and <italic>W</italic>&#x02032; in Figure <xref ref-type="fig" rid="F1">1</xref>), the controller complexity <inline-formula><mml:math id="M12"><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula> in equation (<xref ref-type="disp-formula" rid="E2">2</xref>) will reduce the amount of MC measured by MC<sub>MI</sub>, although the actuator state does not influence the world dynamics. This might be perceived as a potential shortcoming. In the context discussed in this paper, e.g., data recorded from biological or robotic systems, we think that this will not be an issue.</p>
<p>The next section introduces the hopping models on which the two measures are evaluated.</p>
</sec>
<sec id="S3-3">
<label>3.3</label> <title>Algorithms</title>
<p>This section presents the algorithms to calculate both measures in pseudo-code. Implementations of the algorithms in MATLAB<sup>&#x000AE;</sup> and <monospace>C</monospace>&#x0002B;&#x0002B; are available at Ghazi-Zahedi (<xref ref-type="bibr" rid="B11">2016</xref>). The repository also contains the data sets used in this publication.</p>
<p>Note that we use a compressed notion in Algorithms <xref ref-type="table" rid="AL2">2</xref>&#x02013;<xref ref-type="table" rid="AL5">5</xref>, in which <italic>x</italic>&#x02032;&#x02009;&#x0003D;&#x02009;<italic>x</italic>(<italic>t</italic>&#x02009;&#x0002B;&#x02009;1) and <italic>x</italic>&#x02009;&#x0003D;&#x02009;<italic>x</italic>(<italic>t</italic>).</p>
<p>The first algorithm (see Algorithm <xref ref-type="table" rid="AL1">1</xref>) is required to pre-process the data. Currently, our measure only work on discretized data. This means that we need to bin the system&#x02019;s variables (position, velocity, etc.), and furthermore, combine to a uni-variate random variable <italic>W</italic>. The same procedure must also be followed for the action state variable <italic>A</italic> and sensor state variable <italic>S</italic>.</p>
<table-wrap position="float" id="AL1">
<label>Algorithm 1</label>
<caption><p><bold>Discretisation of the data</bold>. This part is the same for all measures, depending on which time series are required. The minimum and maximum were determined of the data of all hopping models.</p></caption>
<table frame="hsides" rules="groups">
<tbody>
<tr>
<td align="left"><bold>Require:</bold> <italic>t</italic>&#x02009;&#x0003D;&#x02009;1, 2,&#x02009;&#x02026;&#x02009;,&#x02009;<italic>T</italic></td>
</tr>
<tr>
<td align="left"><bold>Require:</bold> time series <italic>y</italic>&#x02009;&#x0003D;&#x02009;(<italic>y</italic>(<italic>t</italic>)), <inline-formula><mml:math id="M13"><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover><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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, <inline-formula><mml:math id="M14"><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x000A8;</mml:mo></mml:mover><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x000A8;</mml:mo></mml:mover><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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, <italic>a</italic>&#x02009;&#x0003D;&#x02009;(<italic>a</italic>(<italic>t</italic>)), <italic>s</italic>&#x02009;&#x0003D;&#x02009;(<italic>s</italic>(<italic>t</italic>)), <italic>t</italic>&#x02009;&#x0003D;&#x02009;1, 2,&#x02009;&#x02026;&#x02009;,&#x02009;<italic>T</italic></td>
</tr>
<tr>
<td align="left"><bold>Require:</bold> Number of bins <italic>B<sub>x</sub></italic> for time series <italic>x</italic></td>
</tr>
<tr>
<td align="left">&#x02003;1: <italic>y</italic>&#x0002A;(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;(<italic>y</italic>(<italic>t</italic>)&#x02009;&#x02212;&#x02009;min(<italic>y</italic>))/(max(<italic>y</italic>)&#x02009;&#x02212;&#x02009;min(<italic>y</italic>)) &#x022C5; <italic>B<sub>y</sub></italic></td>
</tr>
<tr>
<td align="left">&#x02003;2: repeat previous step analogously for <inline-formula><mml:math id="M15"><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:math></inline-formula>, <inline-formula><mml:math id="M16"><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x000A8;</mml:mo></mml:mover></mml:math></inline-formula>, <italic>a</italic>, and <italic>s</italic> to generate discretised time series <inline-formula><mml:math id="M17"><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>, <inline-formula><mml:math id="M18"><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x000A8;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup></mml:math></inline-formula>, <italic>a</italic>&#x0002A;, and <italic>s</italic>&#x0002A;</td>
</tr>
<tr>
<td align="left">&#x02003;3: <inline-formula><mml:math id="M19"><mml:msup><mml:mrow><mml:mi>w</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup><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-rel">&#x0003D;</mml:mo><mml:msup><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup><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">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup><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">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mi>y</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>B</mml:mi></mml:mrow><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:msup><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x000A8;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02217;</mml:mo></mml:mrow></mml:msup><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></td>
</tr>
<tr>
<td align="left">&#x02003;4: The previous step must be applied to sensors and actuators, if they result from more than one time series</td>
</tr>
<tr>
<td align="left">&#x02003;5: <italic>w</italic>&#x02032;&#x0002A;&#x02009;&#x0003D;&#x02009;(<italic>w</italic>&#x0002A;(2), <italic>w</italic>&#x0002A;(3),&#x02009;&#x02026;&#x02009;,&#x02009;<italic>w</italic>&#x0002A;(<italic>T</italic>))</td>
</tr>
<tr>
<td align="left">&#x02003;6: <italic>w</italic>&#x0002A;&#x02009;&#x0003D;&#x02009;(<italic>w</italic>&#x0002A;(1), <italic>w</italic>&#x0002A;(2),&#x02009;&#x02026;&#x02009;,&#x02009;<italic>w</italic>&#x0002A;(<italic>T</italic>&#x02009;&#x02212;&#x02009;1))</td>
</tr>
<tr>
<td align="left">&#x02003;7: <italic>s</italic>&#x0002A;&#x02009;&#x0003D;&#x02009;(<italic>s</italic>&#x0002A;(1), <italic>s</italic>&#x0002A;(2),&#x02009;&#x02026;&#x02009;,&#x02009;<italic>s</italic>&#x0002A;(<italic>T</italic>&#x02009;&#x02212;&#x02009;1))</td>
</tr>
<tr>
<td align="left">&#x02003;8: <italic>a</italic>&#x0002A;&#x02009;&#x0003D;&#x02009;(<italic>a</italic>&#x0002A;(1), <italic>a</italic>&#x0002A;(2),&#x02009;&#x02026;&#x02009;,&#x02009;<italic>a</italic>&#x0002A;(<italic>T</italic>&#x02009;&#x02212;&#x02009;1))</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Once the discretised uni-variate random variables <italic>W</italic>, <italic>A, S, W</italic>&#x02032; are available, we can now calculate the two measures MC<sub>W</sub> (see Algorithm <xref ref-type="table" rid="AL2">2</xref>) and MC<sub>MI</sub> (see Algorithm <xref ref-type="table" rid="AL4">4</xref>).</p>
<table-wrap position="float" id="AL2">
<label>Algorithm 2</label>
<caption><p><bold>Algorithm for MC<sub>W</sub></bold>.</p></caption>
<table frame="hsides" rules="groups">
<tbody>
<tr>
<td align="left">&#x02003;1: <italic>p</italic>(<italic>w</italic>&#x02032;, <italic>w, a</italic>) &#x02190; (0)<sub>&#x0007C;<italic>W</italic>&#x0007C; &#x000D7;&#x0007C;<italic>W</italic>&#x0007C; &#x000D7;&#x0007C;<italic>A</italic>&#x0007C;</sub> &#x0007B;Matrix with &#x0007C;<italic>W</italic> &#x0007C;&#x02009;&#x000D7;&#x02009;&#x0007C;<italic>W</italic> &#x0007C;&#x02009;&#x000D7;&#x02009;&#x0007C;<italic>A</italic>&#x0007C; entries set to zero&#x0007D;</td>
</tr>
<tr>
<td align="left">&#x02003;2: <bold>for</bold> <italic>t</italic>&#x02009;&#x0003D;&#x02009;1, 2,&#x02026;,<italic>T</italic>&#x02009;&#x02212;&#x02009;1 and <italic>w<sub>t&#x0002B;1</sub></italic>, <italic>w<sub>t</sub></italic> &#x02208; <italic>w</italic>&#x0002A;, <italic>a<sub>t</sub></italic> &#x02208; <italic>a</italic>&#x0002A; <bold>do</bold></td>
</tr>
<tr>
<td align="left">&#x02003;3: <italic>p</italic>(<italic>w<sub>t&#x0002B;1</sub></italic>, <italic>w<sub>t</sub>, a<sub>t</sub></italic>) &#x02190; <italic>p</italic>(<italic>w<sub>t&#x0002B;1</sub></italic>, <italic>w<sub>t</sub>, a<sub>t</sub></italic>)&#x02009;&#x0002B;&#x02009;1</td>
</tr>
<tr>
<td align="left">&#x02003;4: <bold>end for</bold></td>
</tr>
<tr>
<td align="left">&#x02003;5: <italic>p</italic>(<italic>w&#x02032;, w, a</italic>) &#x02190; <italic>p</italic>(<italic>w&#x02032;, w, a</italic>)/(<italic>T</italic>&#x02009;&#x02212;&#x02009;1)</td>
</tr>
<tr>
<td align="left">&#x02003;6: Estimate <italic>p</italic>(<italic>w&#x02032;, a</italic>) from <italic>w</italic>&#x0002A;, <italic>a</italic>&#x0002A; or by summing over <italic>w</italic></td>
</tr>
<tr>
<td align="left">&#x02003;7: <inline-formula><mml:math id="M20"><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;8: <inline-formula><mml:math id="M21"><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;9: <inline-formula><mml:math id="M22"><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>W</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The state-dependent calculations of the two measures on require minimal changes to the original algorithms. Instead of averaging over all states, which leads to a single number as a result, the measures are evaluated <italic>n</italic>-tupel in the data set. This means that for MC<sub>W</sub>, the logarithm is evaluated for every triple <italic>w<sub>t&#x0002B;1</sub></italic>, <italic>w<sub>t</sub>, a<sub>t</sub></italic> (see Algorithm <xref ref-type="table" rid="AL3">3</xref>). Consequently, the logarithms that are used in the measure MC<sub>MI</sub> are evaluated for every 4-tupel <italic>w<sub>t&#x0002B;1</sub></italic>, <italic>w<sub>t</sub>, a<sub>t</sub>, s<sub>t</sub></italic> in the data set. The arithmetic mean (<inline-formula><mml:math id="M23"><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:mfrac><mml:mo class="MathClass-op">&#x02211;</mml:mo><mml:msub><mml:mrow><mml:mi>x</mml:mi></mml:mrow><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>, where <italic>x<sub>t</sub></italic> is either MC<sub>W</sub>(<italic>t</italic>) or MC<sub>MI</sub>(<italic>t</italic>), see Algorithms <xref ref-type="table" rid="AL3">3</xref> and <xref ref-type="table" rid="AL5">5</xref>) of the state-dependent MC values leads to same values that result from the original algorithms.</p>
<table-wrap position="float" id="AL3">
<label>Algorithm 3</label>
<caption><p><bold>Algorithm for state-dependent MC<sub>W</sub>(<italic>t</italic>)</bold>.</p></caption>
<table frame="hsides" rules="groups">
<tbody>
<tr>
<td align="left">&#x02003;1: Perform steps 1&#x02013;8 from Algorithm <xref ref-type="table" rid="AL2">2</xref></td>
</tr>
<tr>
<td align="left">&#x02003;2: <bold>for</bold> <italic>t</italic>&#x02009;&#x0003D;&#x02009;1,2,&#x02009;&#x02026;&#x02009;,&#x02009;<italic>T</italic>&#x02009;&#x02212;&#x02009;1 and <italic>w</italic>&#x02032;, <italic>w</italic> &#x02208; <italic>w</italic>&#x0002A;, <italic>a</italic> &#x02208; <italic>a</italic>&#x0002A; <bold>do</bold></td>
</tr>
<tr>
<td align="left">&#x02003;3: <inline-formula><mml:math id="M24"><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>W</mml:mtext></mml:mrow></mml:msub><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-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfrac><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">w,a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;4: <bold>end for</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap position="float" id="AL4">
<label>Algorithm 4</label>
<caption><p><bold>Algorithm for MC<sub>MI</sub></bold>.</p></caption>
<table frame="hsides" rules="groups">
<tbody>
<tr>
<td align="left">&#x02003;1: Estimate <italic>p</italic>(<italic>w</italic>&#x02032;, <italic>w</italic>) from <italic>w</italic>&#x0002A; (see Algorithm <xref ref-type="table" rid="AL2">2</xref>)</td>
</tr>
<tr>
<td align="left">&#x02003;2: Estimate <italic>p</italic>(<italic>a, s</italic>) from <italic>a</italic>&#x0002A;, <italic>s</italic>&#x0002A; (see Algorithm <xref ref-type="table" rid="AL2">2</xref>)</td>
</tr>
<tr>
<td align="left">&#x02003;3: <inline-formula><mml:math id="M48"><mml:mi mathvariant="italic">H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;4: <inline-formula><mml:math id="M49"><mml:mi mathvariant="italic">H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>w</mml:mi></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02215;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;5: <inline-formula><mml:math id="M50"><mml:mi mathvariant="italic">H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">a</mml:mi></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;6: <inline-formula><mml:math id="M51"><mml:mi mathvariant="italic">H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">a,s</mml:mi></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a,s</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a,s</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02215;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi mathvariant="italic">a</mml:mi></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a,s</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow></mml:mfenced></mml:math></inline-formula></td>
</tr>
<tr>
<td align="left">&#x02003;7: MC<sub>MI</sub>&#x02009;&#x0003D;&#x02009;<italic>H</italic>(<italic>W</italic>&#x02032;)&#x02009;&#x02212;&#x02009;<italic>H</italic>(<italic>W</italic>&#x02032;&#x0007C;<italic>W</italic>)&#x02009;&#x02212;&#x02009;<italic>H</italic>(<italic>A</italic>)&#x0002B;<italic>H</italic>(<italic>A&#x0007C;S</italic>)</td>
</tr>
</tbody>
</table>
</table-wrap>
<table-wrap position="float" id="AL5">
<label>Algorithm 5</label>
<caption><p><bold>Algorithm for state-dependent MC<sub>MI</sub>(<italic>t</italic>)</bold>.</p></caption>
<table frame="hsides" rules="groups">
<tbody>
<tr>
<td align="left">&#x02003;1: Perform step 1&#x02013;2 from Algorithm <xref ref-type="table" rid="AL4">4</xref></td>
</tr>
<tr>
<td align="left">&#x02003;2: <bold>for</bold> <italic>t</italic>&#x02009;&#x0003D;&#x02009;1,2,&#x02009;&#x02026;&#x02009;,&#x02009;<italic>T</italic>&#x02009;&#x02212;&#x02009;1 and <italic>w</italic>&#x02032;, <italic>w</italic> &#x02208; <italic>w</italic>&#x0002A;, <italic>a</italic> &#x02208; <italic>a</italic>&#x0002A;, <italic>s</italic> &#x02208; <italic>s</italic>&#x0002A; <bold>do</bold></td>
</tr>
<tr>
<td align="left">&#x02003;3: <inline-formula><mml:math id="M52"><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>MI</mml:mtext></mml:mrow></mml:msub><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-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>w</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>w</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi mathvariant="normal">log</mml:mi></mml:mrow><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi mathvariant="italic">a</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi mathvariant="italic">S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>)</td>
</tr>
<tr>
<td align="left">&#x02003;4: <bold>end for</bold></td>
</tr>
</tbody>
</table>
</table-wrap>
<p>This concludes the discussion of the measures and their implementation. The next section presents the muscle and DC-motor model against which these measure were evaluated.</p>
</sec>
</sec>
<sec id="S4">
<label>4</label> <title>Hopping Models</title>
<p>In a reduced model, hopping motions can be described by a one-dimensional differential equation (Haeufle et al., <xref ref-type="bibr" rid="B14">2010</xref>):
<disp-formula id="E3"><label>(3)</label><mml:math id="M25"><mml:mi>m</mml:mi><mml:mover accent='true'><mml:mi>y</mml:mi><mml:mo>&#x000A8;</mml:mo></mml:mover><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi mathvariant="italic">mg</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mfenced separators="" open="&#x0007B;" close=""><mml:mrow><mml:mtable equalrows="false" columnlines="none" equalcolumns="false" class="array"><mml:mtr><mml:mtd class="array" columnalign="left"><mml:mn>0</mml:mn><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mi>y</mml:mi><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mspace width="1em" class="quad"/><mml:mtext>flight phase</mml:mtext></mml:mtd></mml:mtr><mml:mtr><mml:mtd class="array" columnalign="left"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd class="array" columnalign="left"><mml:mi>y</mml:mi><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:mspace width="1em" class="quad"/><mml:mtext>ground contact</mml:mtext></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where the point mass <italic>m</italic>&#x02009;&#x0003D;&#x02009;80&#x02009;kg represents the total mass of the hopper, which is accelerated by the gravitational force (<italic>g</italic>&#x02009;&#x0003D;&#x02009;&#x02013;9.81&#x02009;m/s<sup>2</sup>) in negative <italic>y</italic>-direction. An opposing leg force <italic>F<sub>L</sub></italic> in positive <italic>y</italic>-direction can act only during ground contact (<italic>y</italic>&#x02009;&#x02264;&#x02009;<italic>l</italic><sub>0</sub>&#x02009;&#x0003D;&#x02009;1&#x02009;m). Hopping motions are then characterized by alternating flight and stance phases. For this manuscript, we investigated three different models for the leg force (Figure <xref ref-type="fig" rid="F2">2</xref>). All models have in common, that the leg force depends on a control signal <italic>u</italic>(<italic>t</italic>) and the system state <italic>y</italic>(<italic>t</italic>), <inline-formula><mml:math id="M26"><mml:mi>&#x01E8F;</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>: <inline-formula><mml:math id="M27"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>L</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>u</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-punc">,</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:mo class="MathClass-punc">,</mml:mo><mml:mi>&#x01E8F;</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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, meaning, that the force modulation partially depends on the controller output <italic>u</italic>(<italic>t</italic>) and partially on the dynamic characteristics, or material properties of the actuator. The control parameters of all three models were adjusted to generate the same periodic hopping height of max (<italic>y</italic>(<italic>t</italic>))&#x02009;&#x0003D;&#x02009;1.070&#x02009;m. All models were implemented in MATLAB<sup>&#x000AE;</sup> Simulink&#x02122; (Ver2014b) and solved with ode45 Dormand-Prince variable time step solver with absolute and relative tolerances of 10<sup>&#x02212;12</sup>. To evaluate and compare the results of the models, a time-discrete output with constant sampling frequency is required (see Section <xref ref-type="sec" rid="S3-3">3.3</xref>). Therefore, the quasi-continuous variable time step signals generated by the ode45 solver are not adequate. To generate the desired output at 1&#x02009;kHz sampling frequency, we used the Simulink built-in feature to generate desired output only. This way, the solver decreased step-size below 1&#x02009;ms if required for precision, however, Simulink would only output the data for 1&#x02009;kHz sampling frequency. This is similar to measuring a continuous physical system with a discrete time sensor. The models were solved for T&#x02009;&#x0003D;&#x02009;8&#x02009;s.</p>
<fig id="F2" position="float">
<label>Figure 2</label>
<caption><p><bold>Hopping models</bold>. The MusFib model considers the non-linear contraction dynamics of active muscle fibers and is driven by a mono-synaptic force-feedback reflex. The MusLin model only differs in the contraction dynamics, where the force-length relation is neglected and the force-velocity relation is approximated linearly. The DCMot model generates the leg force with a DC motor. It is controlled by a proportional-differential controller (PD), enforcing the desired trajectory. The desired trajectory is the recorded trajectory from the MusFib Model. The sensor signals are shown as blue arrows, and the actuator control signals are shown as green arrows. In case of the muscle models, the sensor signal is the muscle force <italic>F<sub>M</sub></italic>, and the actuator control signal is the neural muscle stimulation <italic>u</italic>. In case of the DC-motor model, the sensor signals are the position and velocity of the mass, and the actuator control signal is the motor armature voltage <italic>u<sub>DC</sub></italic>.</p></caption>
<graphic xlink:href="frobt-03-00042-g002.tif"/>
</fig>
<sec id="S4-4">
<label>4.1</label> <title>Muscle-Fiber Model (MusFib)</title>
<p>A biological muscle generates its active force in muscle fibers whose contraction dynamics are well studied. It was found that the contraction dynamics are qualitatively and quantitatively (with some normalizations) very similar across muscles of all sizes and across many species. In the MusFib model, the leg force is modeled to incorporate the active muscle fibers&#x02019; contraction dynamics. The model has been motivated and described in detail elsewhere (Haeufle et al., <xref ref-type="bibr" rid="B14">2010</xref>, <xref ref-type="bibr" rid="B13">2012</xref>, <xref ref-type="bibr" rid="B15">2014</xref>). In a nutshell, the material properties of the muscle fibers are characterized by two terms modulating the leg force
<disp-formula id="E4"><label>(4)</label><mml:math id="M28"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>MusFib</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>q</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:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>fib</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-punc">,</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>The first term <italic>q</italic>(<italic>t</italic>) represents the muscle activity. The activity depends on the neural stimulation <italic>u</italic>(<italic>t</italic>) of the muscle 0.001&#x02009;&#x02264;&#x02009;<italic>u</italic>(<italic>t</italic>)&#x02009;&#x02264;&#x02009;1 and is governed by biochemical processes modeled as a first-order ODE called activation dynamics
<disp-formula id="E5"><label>(5)</label><mml:math id="M29"><mml:mover accent="true"><mml:mrow><mml:mi>q</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:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mn>&#x003C4;</mml:mn></mml:mrow></mml:mfrac><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:mi>u</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>q</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:mrow></mml:mfenced><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
with the time constant <italic>&#x003C4;</italic>&#x02009;&#x0003D;&#x02009;10&#x02009;ms. The second term in equation (<xref ref-type="disp-formula" rid="E5">5</xref>) <italic>F</italic><sub>fib</sub> considers the force-length and force-velocity relation of biological muscle fibers. It is a function of the system state, i.e., the muscle length <italic>l<sub>M</sub></italic>&#x02009;&#x0003D;&#x02009;<italic>y</italic> and muscle contraction velocity <inline-formula><mml:math id="M30"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>&#x01E8F;</mml:mi></mml:math></inline-formula> during ground contact <italic>y</italic>&#x02009;&#x02264;&#x02009;<italic>l</italic><sub>0</sub> and constant <italic>l<sub>M</sub></italic>&#x02009;&#x0003D;&#x02009;<italic>l</italic><sub>0</sub> <inline-formula><mml:math id="M31"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula> during flight <italic>y</italic>&#x02009;&#x0003E;&#x02009;<italic>l</italic><sub>0</sub>:
<disp-formula id="E6"><label>(6)</label><mml:math id="M32"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>fib</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">max</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:mi mathvariant="normal">exp</mml:mi><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>c</mml:mi><mml:msup><mml:mrow><mml:mfenced separators="" open="|" close="|"><mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mtext>opt</mml:mtext></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mrow><mml:mtext>opt</mml:mtext></mml:mrow></mml:msub><mml:mi>w</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:mfenced></mml:mrow><mml:mrow><mml:mn>3</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfenced><mml:mo class="MathClass-bin">&#x000D7;</mml:mo><mml:mfenced separators="" open="&#x0007B;" close=""><mml:mrow><mml:mtable><mml:mtr><mml:mtd><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>max</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>max</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>K</mml:mi><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003E;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>N</mml:mi><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>N</mml:mi><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mfrac><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>max</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>7</mml:mn><mml:mo class="MathClass-punc">.</mml:mo><mml:mn>56</mml:mn><mml:mi>K</mml:mi><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>max</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mspace width="1em" class="quad"/></mml:mtd><mml:mtd><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:mn>0</mml:mn></mml:mtd></mml:mtr></mml:mtable></mml:mrow></mml:mfenced><mml:mspace width="0.5em" class="quad"/><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>Here, we use a maximum isometric muscle force <italic>F</italic><sub>max</sub>&#x02009;&#x0003D;&#x02009;2.5&#x02009;kN, an optimal muscle length <italic>l</italic><sub>opt</sub>&#x02009;&#x0003D;&#x02009;0.9&#x02009;m, force-length parameters <italic>w</italic>&#x02009;&#x0003D;&#x02009;0.45 <italic>m</italic> and <italic>c</italic>&#x02009;&#x0003D;&#x02009;30, and force-velocity parameters <inline-formula><mml:math id="M33"><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi mathvariant="italic">max</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>3</mml:mn><mml:mo class="MathClass-punc">.</mml:mo><mml:mn>5</mml:mn><mml:mi>m</mml:mi><mml:msup><mml:mrow><mml:mi>s</mml:mi></mml:mrow><mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula>, <italic>K</italic>&#x02009;&#x0003D;&#x02009;1.5, and <italic>N</italic>&#x02009;&#x0003D;&#x02009;1.5&#x02009;(Haeufle et al., <xref ref-type="bibr" rid="B14">2010</xref>).</p>
<p>In this model, periodic hopping is generated with a controller representing a mono-synaptic force-feedback. The neural muscle stimulation
<disp-formula id="E7"><label>(7)</label><mml:math id="M34"><mml:mi>u</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-rel">&#x0003D;</mml:mo><mml:mi>G</mml:mi><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>MusFib</mml:mtext></mml:mrow></mml:msub><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:mn>&#x003B4;</mml:mn></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></disp-formula>
is based on the time delayed (<italic>&#x003B4;</italic>&#x02009;&#x0003D;&#x02009;15&#x02009;ms) muscle fiber force <italic>F</italic><sub><italic>L</italic>,MusFib</sub>. Please note that this delay corresponds to the biophysical time delay due to the signal propagation velocity of neurons. The feedback gain is <italic>G</italic>&#x02009;&#x0003D;&#x02009;2.4/<italic>F</italic><sub>max</sub>, and the stimulation at touch down <italic>u</italic><sub>0</sub>&#x02009;&#x0003D;&#x02009;0.027.</p>
<p>This model neither considers leg geometry nor tendon elasticity and is therefore the simplest hopping model with muscle-fiber-like contraction dynamics. The model output was the world state <inline-formula><mml:math id="M35"><mml:mi>w</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-rel">&#x0003D;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><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-punc">,</mml:mo><mml:mi>&#x01E8F;</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-punc">,</mml:mo><mml:mover accent='true'><mml:mi>y</mml:mi><mml:mo>&#x000A8;</mml:mo></mml:mover><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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, the sensor state <italic>s</italic>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<italic>F</italic><sub><italic>L</italic>,MusFib</sub>(<italic>t</italic>), and the neural control command <italic>a</italic>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<italic>u</italic>(<italic>t</italic>). For this model, these are the values that the random variables <italic>W</italic>, <italic>S</italic>, and <italic>A</italic> take at each time step.</p>
</sec>
<sec id="S4-5">
<label>4.2</label> <title>Linearized Muscle-Fiber Model (MusLin)</title>
<p>This model differs from the model MusFib only in the representation of the force&#x02013;length&#x02013;velocity relation, i.e., <inline-formula><mml:math id="M36"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>MusLin</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>q</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:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>lin</mml:mtext></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula> [see equation (<xref ref-type="disp-formula" rid="E6">6</xref>)]. More precisely, the force&#x02013;length relation is neglected and the force&#x02013;velocity relation is approximated linearly
<disp-formula id="E8"><label>(8)</label><mml:math id="M37"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mtext>lin</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>1</mml:mn><mml:mo class="MathClass-bin">&#x022C5;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mn>1</mml:mn><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mn>&#x003BC;</mml:mn><mml:msub><mml:mrow><mml:mover accent="true"><mml:mrow><mml:mi>l</mml:mi></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover></mml:mrow><mml:mrow><mml:mi>M</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
with <italic>&#x003BC;</italic>&#x02009;&#x0003D;&#x02009;0.25&#x02009;m/s. Feedback gain <italic>G</italic>&#x02009;&#x0003D;&#x02009;0.8/<italic>F</italic><sub>max</sub> and stimulation at touch down <italic>u</italic><sub>0</sub>&#x02009;&#x0003D;&#x02009;0.19 were chosen to achieve the same hopping height as the MusFib model.</p>
</sec>
<sec id="S4-6">
<label>4.3</label> <title>DC-Motor Model (DCMot)</title>
<p>An approach to mimic biological movement in a technical system (robot) is to track recorded kinematic trajectories with electric motors and a PD-control approach. The DCMot model implements this approach [slightly modified from Haeufle et al. (<xref ref-type="bibr" rid="B15">2014</xref>)]. The leg force generated by the DC-motor was modeled as
<disp-formula id="E9"><label>(9)</label><mml:math id="M38"><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mtext>DCMot</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>&#x003B3;</mml:mn><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>&#x003B3;</mml:mn><mml:msub><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where <italic>k<sub>T</sub></italic>&#x02009;&#x0003D;&#x02009;0.126&#x02009;Nm/A is the motor constant, <italic>I<sub>DC</sub></italic> the current through the motor windings, <italic>&#x003B3;</italic>&#x02009;&#x0003D;&#x02009;100:1 the ratio of an ideal gear translating the rotational torque <italic>T<sub>DC</sub></italic> and movement <inline-formula><mml:math id="M39"><mml:mover accent="true"><mml:mrow><mml:mn>&#x003C6;</mml:mn></mml:mrow><mml:mo class="MathClass-op">&#x002D9;</mml:mo></mml:mover><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-rel">&#x0003D;</mml:mo><mml:mn>&#x003B3;</mml:mn><mml:mi>&#x01E8F;</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> of the motor to the translational leg force and movement required for hopping. The electrical characteristics of the motor can be modeled as
<disp-formula id="E10"><label>(10)</label><mml:math id="M40"><mml:msub><mml:mrow><mml:mi>&#x00130;</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>L</mml:mi></mml:mrow></mml:mfrac><mml:mfenced separators="" open="(" close=")"><mml:mrow><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mi>k</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi></mml:mrow></mml:msub><mml:mn>&#x003B3;</mml:mn><mml:mi>&#x01E8F;</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>R</mml:mi><mml:msub><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfenced><mml:mo class="MathClass-punc">,</mml:mo></mml:math></disp-formula>
where &#x02013;48&#x02009;V&#x02009;&#x02264;&#x02009;<italic>u<sub>DC</sub></italic>&#x02009;&#x02264;&#x02009;48&#x02009;V is the armature voltage (control signal), <italic>R</italic>&#x02009;&#x0003D;&#x02009;7.19&#x003A9; the resistance, and <italic>L</italic>&#x02009;&#x0003D;&#x02009;1.6 <italic>mH</italic> the inductance of the motor windings. The motor parameters were taken from a commercially available DC-motor commonly used in robotics applications (Maxon EC-max 40, nominal Torque <italic>T</italic><sub>nominal</sub>&#x02009;&#x0003D;&#x02009;0.212&#x02009;Nm). As this relatively small motor would not be able to lift the same mass, the body mass was adapted to guarantee comparable accelerations
<disp-formula id="E11"><label>(11)</label><mml:math id="M41"><mml:msub><mml:mrow><mml:mi>m</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mfrac><mml:mrow><mml:mn>&#x003B3;</mml:mn><mml:msub><mml:mrow><mml:mi>T</mml:mi></mml:mrow><mml:mrow><mml:mtext>nominal</mml:mtext></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mi>F</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="normal">max</mml:mi></mml:mrow></mml:msub></mml:mrow></mml:mfrac><mml:mi>m</mml:mi><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>0</mml:mn><mml:mo class="MathClass-punc">.</mml:mo><mml:mn>68</mml:mn><mml:mi mathvariant="italic">kg</mml:mi><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>The controller implemented in this technical model is a standard PD-controller. The controller tries to minimize the error between a desired kinematic trajectory (<italic>y</italic><sub>des</sub>(<italic>t</italic>) and <inline-formula><mml:math id="M42"><mml:msub><mml:mrow><mml:mi>&#x01E8F;</mml:mi></mml:mrow><mml:mrow><mml:mtext>des</mml:mtext></mml:mrow></mml:msub><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>) and the actual position and velocity (<italic>y</italic>(<italic>t</italic>) and <inline-formula><mml:math id="M43"><mml:mi>&#x01E8F;</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>) by adapting the motor voltage:
<disp-formula id="E12"><label>(12)</label><mml:math id="M44"><mml:msub><mml:mrow><mml:mi>u</mml:mi></mml:mrow><mml:mrow><mml:mi mathvariant="italic">DC</mml:mi></mml:mrow></mml:msub><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-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>y</mml:mi></mml:mrow><mml:mrow><mml:mtext>des</mml:mtext></mml:mrow></mml:msub><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>t</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-bin">&#x0002B;</mml:mo><mml:msub><mml:mrow><mml:mi>K</mml:mi></mml:mrow><mml:mrow><mml:mi>D</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:msub><mml:mrow><mml:mi>&#x01E8F;</mml:mi></mml:mrow><mml:mrow><mml:mtext>des</mml:mtext></mml:mrow></mml:msub><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>&#x01E8F;</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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-punc">.</mml:mo></mml:math></disp-formula></p>
<p>Here, the feedback gains are <italic>K<sub>P</sub></italic>&#x02009;&#x0003D;&#x02009;5000&#x02009;V/m and <italic>K<sub>D</sub></italic>&#x02009;&#x0003D;&#x02009;500&#x02009;Vs/m. The desired trajectory during ground contact was taken from the periodic hopping trajectory of the MusFib model (<italic>y</italic><sub>des</sub>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<italic>y</italic><sub>MusFib</sub>(<italic>t</italic>) and <inline-formula><mml:math id="M45"><mml:msub><mml:mrow><mml:mi>&#x01E8F;</mml:mi></mml:mrow><mml:mrow><mml:mtext>des</mml:mtext></mml:mrow></mml:msub><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-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mi>&#x01E8F;</mml:mi></mml:mrow><mml:mrow><mml:mtext>MusFib</mml:mtext></mml:mrow></mml:msub><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>).</p>
<p>This model is the simplest implementation of negative feedback control that allows to enforce a desired hopping trajectory on a technical system. The model output was the world state <inline-formula><mml:math id="M46"><mml:mi>w</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-rel">&#x0003D;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><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-punc">,</mml:mo><mml:mi>&#x01E8F;</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-punc">,</mml:mo><mml:mover accent='true'><mml:mi>y</mml:mi><mml:mo>&#x000A8;</mml:mo></mml:mover><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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, the sensor state <inline-formula><mml:math id="M47"><mml:mi>s</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-rel">&#x0003D;</mml:mo><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><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-punc">,</mml:mo><mml:mi>&#x01E8F;</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:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:math></inline-formula>, and the actuator control command <italic>a</italic>(<italic>t</italic>)&#x02009;&#x0003D;&#x02009;<italic>u<sub>DC</sub></italic>(<italic>t</italic>).</p>
</sec>
</sec>
<sec id="S5">
<label>5</label> <title>Experiments</title>
<p>This section discusses the experiments that were conducted with the hopping models and the preprocessing of the data. Algorithms for the calculations are provided in the previous section (Section <xref ref-type="sec" rid="S3">3</xref>). At this stage, the measures operate on discrete state spaces [see equations (<xref ref-type="disp-formula" rid="E1">1</xref>)&#x02013;(<xref ref-type="disp-formula" rid="E4">4</xref>) and Algorithms <xref ref-type="table" rid="AL2">2</xref>&#x02013;<xref ref-type="table" rid="AL4">4</xref>]. Hence, the data was discretized in the following way. To ensure the comparability of the results, the domain (range of values) for each variable (e.g., the position <italic>y</italic>) was calculated over all hopping models. Then, the data of each variable was discretized into 300 values (bins). The algorithm for the discretization is described in Algorithm <xref ref-type="table" rid="AL1">1</xref>. Different binning resolutions were evaluated, and the most stable results were found for more than 100 bins. Finding the optimal binning resolution is a problem of itself and beyond the scope of this work. In practice, however, a reasonable binning can be found by increasing the binning until further increase has little influence on the outcome of the measures.</p>
<p>The possible range of actuator values is different for the motor and muscle models. For the muscle models, the values are in the unit interval, i.e., <italic>a</italic>(<italic>t</italic>) &#x02208; [0,1], whereas the values for the motor can have higher values (see above). Hence, to ensure comparability, we normalized the actions of the motor to the unit interval before they were discretized.</p>
<p>The hopping models are deterministic, which means that only a few hopping cycles are necessary to estimate the required probability distributions. To ensure comparability of the results, we parameterized the hopping models to achieve the same hopping height.</p>
</sec>
<sec id="S6">
<label>6</label> <title>Results</title>
<p>The following paragraphs discuss the findings based on the averaged results presented in Table <xref ref-type="table" rid="T1">1</xref> first and then follow with a discussion of the state-dependent results presented in Figure <xref ref-type="fig" rid="F3">3</xref>.</p>
<table-wrap position="float" id="T1">
<label>Table 1</label>
<caption><p><bold>Numerical results on the hopping models for MC<sub>W</sub> [Morphological Computation as Conditional Mutual Information, see equation (14)] and MC<sub>MI</sub> [Morphological Computation as the comparison between behavior and controller complexity, see equation (<xref ref-type="disp-formula" rid="E2">2</xref>)]</bold>.</p></caption>
<table frame="hsides" rules="groups">
<thead>
<tr>
<th align="center"/>
<th align="center">Muscle fiber model MusFib</th>
<th align="center">Lineraized muscle model MusLin</th>
<th align="center">DC motor model DCMot</th>
</tr>
</thead>
<tbody>
<tr>
<td align="left">MC<sub>W</sub></td>
<td align="center">7.219 bits</td>
<td align="center">4.975 bits</td>
<td align="center">4.960 bits</td>
</tr>
<tr>
<td align="left">MC<sub>MI</sub></td>
<td align="center">7.310 bits</td>
<td align="center">5.153 bits</td>
<td align="center">4.990 bits</td>
</tr>
</tbody>
</table>
</table-wrap>
<fig id="F3" position="float">
<label>Figure 3</label>
<caption><p><bold>Comparison of state-dependent MC<sub>W</sub> on the three hopping models (upper plot)</bold>. The lower plot visualizes the hopping position. The red line separates stance and flight phases. The plots only show a small fraction of the recorded data. The full data is shown in Figure <xref ref-type="fig" rid="F4">4</xref>. For better readability, all the plots for MC are smoothened with a moving average of block size 5. The plots show that MC is high during the flight phase for all systems, i.e., whenever the behavior of the system is only governed by gravity. Only for the MusFib, MC is highest when the muscle is contracting. The other two models show low MC when the muscle is contracting and in general when the hopper touches the ground.</p></caption>
<graphic xlink:href="frobt-03-00042-g003.tif"/>
</fig>
<p>All three models generated a similar movement, i.e., periodic hopping with a hopping height of 1.07&#x02009;m. However, the control signals and the trajectories of the center of mass vary between models (Figure <xref ref-type="fig" rid="F4">4</xref>). Therefore, the computed values for the morphological computation (MC) vary between the models for both quantification methods (Table <xref ref-type="table" rid="T1">1</xref>). Compared to the complex muscle fiber model (MusFib), the linearized muscle model (MusLin) and the technical DC-motor model (DCMot) result in significantly lower values of MC (&#x02248;30% less, see Table <xref ref-type="table" rid="T1">1</xref>).</p>
<fig id="F4" position="float">
<label>Figure 4</label>
<caption><p><bold>Plots of state-dependent MC (first two rows) and the world state (following four rows) for all muscle models</bold>. The red line in the position plot indicates the time steps at which the hopper touches ground (position is below the red line). Note that the stimulation is dimensionless.</p></caption>
<graphic xlink:href="frobt-03-00042-g004.tif"/>
</fig>
<p>To analyze the differences between the models in more detail, we plotted the state-dependent MC (see Algorithm <xref ref-type="table" rid="AL3">3</xref>). Figure <xref ref-type="fig" rid="F3">3</xref> shows the values of MC<sub>W</sub> for each state of the models during two hopping cycles. We chose to discuss MC<sub>W</sub> only, because the corresponding values of MC<sub>MI</sub> are very similar to those of MC<sub>W</sub>, and hence, a discussion of the state-dependent MC<sub>MI</sub> will not provide any additional insights. The plots for all models and the entire data are shown in Figure <xref ref-type="fig" rid="F4">4</xref>.</p>
<p>The orange line shows the state-dependent MC for the linear muscle model (MusLin) and the blue line for the non-linear muscle model (MusFib). The green line shows the state-dependent MC for the motor model (DCMot). In the figure, the lower lines show the position <italic>y</italic> of the center of mass over time. The PD-controller of the DCMot model is parameterized to follow the trajectory of the MusFib model, which is why the blue and green position plots coincide. The original data is shown in Figure <xref ref-type="fig" rid="F4">4</xref>. There are basically three phases, which need to be distinguished (indicated by the vertical lines). First, the flight phase, during which the hopper does not touch the ground (position plots are above the red line), second, the deceleration phase, which occurs after landing (position is below the red line but still declining), and finally, the acceleration phase, in which the position is below the red line but increasing.</p>
<p>The first observation is that MC is very similar for all models during most of the flight phase (position above the red line) and that it is proportional to the velocity of the systems. By that we mean that MC decreases when the velocity during flight decreases and increases when the system&#x02019;s speed (toward the ground) increases. During flight, the behavior of the system is governed only by the interaction of the body (mass, velocity) and the environment (gravity) and not by the actuator models. Also, all actuator control signals are constant during flight. This explains why the values coincide for the three models.</p>
<p>For all models, MC drops as soon as the systems touch the ground. DCMot and MusLin reach their highest values only during the flight phase, which can be expected at least from a motor model that is not designed to exploit MC. The graphs also reveal that the MusLin model shows slightly higher MC around mid-stance phase, compared to the DCMot model. For the non-linear muscle model, the behavior is different. Shortly after touching the ground, the system shows a strong decline of MC, which is followed by a strong incline during the deceleration with the muscle. Contrary to the other two models, the non-linear muscle model MusFib shows the highest values when the muscle is contracted the most (until mid-stance). This is an interesting result, as it shows that the non-linear muscle is capable of showing more MC while the muscle is operating, compared to the flight phase, in which the behavior is only determined by the interaction of the body and environment.</p>
</sec>
<sec id="S7" sec-type="discussion">
<label>7</label> <title>Discussion</title>
<p>This work presented two different quantifications of morphological computation including algorithms, MATLAB<sup>&#x000AE;</sup>, and <monospace>C</monospace>&#x0002B;&#x0002B; code to use them (Ghazi-Zahedi, <xref ref-type="bibr" rid="B11">2016</xref>). We demonstrated their applicability in experiments with non-trivial, biologically realistic hopping models and discussed the importance of a state-based analysis of morphological computation. The first quantification, MC<sub>W</sub>, measures MC as the conditional mutual information of the world and actuator states. Morphological computation is the additional information that the previous world state <italic>W</italic> provides about the next world state <italic>W</italic>&#x02032;, given that the current actuator state <italic>A</italic> is known. The second quantification, MC<sub>MI</sub>, compares the behavior and controller complexity to determine the amount of MC.</p>
<p>The numerical results of the two quantifications MC<sub>W</sub> and MC<sub>MI</sub> confirm our hypothesis that the MusFib model should show significantly higher MC, compared to the two other models (MusLin, DCMot). These results complement previous findings showing that the minimum information required to generate hopping is reduced by the material properties of the non-linear muscle fibers compared to the DC-motor driven model (Haeufle et al., <xref ref-type="bibr" rid="B15">2014</xref>). More precisely, the higher MC in the MusFib model can be attributed to the force&#x02013;velocity characteristics of the muscle fibers. Previous hopping simulations showed that these non-linear contraction dynamics reduce the influence of the controller on the actual hopping kinematics (Haeufle et al., <xref ref-type="bibr" rid="B14">2010</xref>, <xref ref-type="bibr" rid="B13">2012</xref>). This means, that the kinematic trajectory is more predetermined by the material properties as compared to the linearized muscle model MusLin, or the motor model DCMot. Similar effects have been demonstrated for jumping (van Soest and Bobbert, <xref ref-type="bibr" rid="B33">1993</xref>) and walking (Gerritsen et al., <xref ref-type="bibr" rid="B10">1998</xref>; John et al., <xref ref-type="bibr" rid="B17">2013</xref>). In conclusion, this implied that studies on neural control of biological movement should consider the biomechanical characteristics of muscle contraction (Pinter et al., <xref ref-type="bibr" rid="B23">2012</xref>; Schmitt et al., <xref ref-type="bibr" rid="B29">2013</xref>; Dura-Bernal et al., <xref ref-type="bibr" rid="B9">2016</xref>).</p>
<p>We also showed that a state-dependent analysis of MC leads to additional insights. Here, we see that the non-linear muscle model is capable of showing significantly more morphological computation in the stance phase, compared to the flight phase, during which the behavior is only determined by the interaction of the body and environment. This shows that morphological computation is not only behavior dependent but also state-dependent. Future work will include the analysis of additional behaviors, such as walking and running, for which we expect, based on the findings of this work, to see more morphological computation of the non-linear muscle model MusFib.</p>
<p>To summarize the previous paragraphs, in this work we have showed that the results obtained from the two measures MC<sub>W</sub> and MC<sub>MI</sub> correspond to the intuitive understanding of morphological computation in muscle and DC-motor models. Furthermore, the results are in accordance with previous work on the control complexity of these models (Haeufle et al., <xref ref-type="bibr" rid="B15">2014</xref>). We also showed that both measures show very similar results for deterministic systems. Hence, one might ask if there is a justifiable preference for one of the two measures. To answer this question, it is helpful to set the methods and results of this work in perspective to our previous work.</p>
<p>In our first publication (Zahedi and Ay, <xref ref-type="bibr" rid="B36">2013</xref>), we proposed two concepts for quantifying morphological computation. The first concept MC<sub>A</sub>&#x02009;&#x0003D;&#x02009;<italic>D</italic>(<italic>p</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w, a</italic>) &#x0007C;&#x0007C; <italic>p</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w</italic>)) was not used in this work, because it not applicable to deterministic systems. The original concepts were developed for stochastic systems only. Instead, we analyzed a replacement, which is the measure MC<sub>MI</sub>. In this work, we showed that MC<sub>MI</sub> and MC<sub>W</sub> are almost equivalent in the context of deterministic systems. In our second work into account, we applied an information decomposition to the sensorimotor loop (Ghazi-Zahedi and Rauh, <xref ref-type="bibr" rid="B12">2015</xref>), and found that the second concept, MC<sub>W</sub>, can be decomposed into the unique information that the current world state <italic>W</italic> contains about the next world state <italic>W</italic>&#x02032; and the synergistic information about the next world state <italic>W</italic>&#x02032; that is only available if the current world state <italic>W</italic> and current action <italic>A</italic> are taken into account simultaneously. If we take all of these results into consideration, we can conclude that there are more arguments in favor of MC<sub>W</sub> than MC<sub>MI</sub> for the following reasons. (1) The decomposition of MC<sub>W</sub> leads to quantities, which nicely reflect intuitive understanding of morphological computation (Ghazi-Zahedi and Rauh, <xref ref-type="bibr" rid="B12">2015</xref>). (2) MC<sub>W</sub> and MC<sub>MI</sub> lead to almost identical results for deterministic systems (see <xref ref-type="sec" rid="S12">Appendix B</xref>). (3) MC<sub>W</sub> can be computed more easily. It requires the joint distribution of only three random variables (<italic>W</italic>, <italic>A, W</italic>&#x02032;), whereas MC<sub>MI</sub> requires the joint distributions of <italic>p</italic>(<italic>w</italic>&#x02032;, <italic>w</italic>) and <italic>p</italic>(<italic>a, s</italic>), and hence, also information about the sensor states <italic>S</italic>. This does not mean that we conclude that MC<sub>W</sub> is the final answer to the question on how to quantify morphological computation. Yet, these are strong indications, that the second concept proposed in Zahedi and Ay (<xref ref-type="bibr" rid="B36">2013</xref>) is the path to take for further investigations. Nevertheless, the results of this paper show that MC<sub>W</sub> can already be used to quantify morphological computation in realistic systems. Hence, the next step is to apply MC<sub>W</sub> on high-dimensional data collected from natural systems. The first issue that needs to be solved here is the formulation of MC<sub>W</sub> for the continuous domain, which is our next step.</p>
<p>We believe that quantifying morphological computation is also useful in the context of robotics, e.g., in the optimization of morphology and control. Hence, in currently ongoing work, we are applying MC<sub>W</sub> (and the provided software, which we hope proves to be beneficial also to others) to study the effect of morphological design and controller variations on morphological computation in the context of soft robotics.</p>
</sec>
<sec id="S8" sec-type="author-contributor">
<title>Author Contributions</title>
<p>The paper was mainly written by KG-Z and DH but with strong contributions by the other three authors. The experiments were conducted by KG-Z and DH with strong contributions by GM. All authors contributed significantly to the discussion of the results and the final manuscript.</p>
</sec>
<sec id="S9">
<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 DC-motor model is based on a Simulink model provided by Roger Aarenstrup (<uri xlink:href="http://in.mathworks.com/matlabcentral/fileexchange/11829-dc-motor-model">http://in.mathworks.com/matlabcentral/fileexchange/11829-dc-motor-model</uri>).</p>
</ack>
<sec id="S10">
<title>Funding</title>
<p>This work was partly funded by the DFG Priority Program Autonomous Learning (DFG-SPP 1527). DH and SS would like to thank the German Research Foundation (DFG) for financial support of the project within the Cluster of Excellence in Simulation Technology (EXC 310/1) at the University of Stuttgart.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Ay</surname> <given-names>N.</given-names></name> <name><surname>L&#x000F6;hr</surname> <given-names>W.</given-names></name></person-group> (<year>2015</year>). <article-title>The umwelt of an embodied agent &#x02013; a measure-theoretic definition</article-title>. <source>Theory Biosci.</source> <volume>134</volume>, <fpage>105</fpage>&#x02013;<lpage>116</lpage>.<pub-id pub-id-type="doi">10.1007/s12064-015-0217-3</pub-id></citation></ref>
<ref id="B2"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Ay</surname> <given-names>N.</given-names></name> <name><surname>Zahedi</surname> <given-names>K.</given-names></name></person-group> (<year>2013</year>). <article-title>&#x0201C;An information theoretic approach to intention and deliberative decision-making of embodied systems,&#x0201D;</article-title> in <source>Advances in Cognitive Neurodynamics III</source>, eds <person-group person-group-type="editor"><name><surname>Tishby</surname> <given-names>N.</given-names></name> <name><surname>Polani</surname> <given-names>D.</given-names></name></person-group> (<publisher-loc>Heidelberg</publisher-loc>: <publisher-name>Springer</publisher-name>), <fpage>1887</fpage>&#x02013;<lpage>1915</lpage>.</citation></ref>
<ref id="B3"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Ay</surname> <given-names>N.</given-names></name> <name><surname>Zahedi</surname> <given-names>K.</given-names></name></person-group> (<year>2014</year>). <article-title>&#x0201C;On the causal structure of the sensorimotor loop,&#x0201D;</article-title> in <source>Guided Self-Organization: Inception, volume 9 of Emergence, Complexity and Computation</source>, ed. <person-group person-group-type="editor"><name><surname>Prokopenko</surname> <given-names>M.</given-names></name></person-group> (<publisher-loc>Berlin; Heidelberg</publisher-loc>: <publisher-name>Springer-Verlag</publisher-name>), <fpage>261</fpage>&#x02013;<lpage>294</lpage>.</citation></ref>
<ref id="B4"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Baughman</surname> <given-names>R. H.</given-names></name></person-group> (<year>2005</year>). <article-title>Materials science. Playing nature&#x02019;s game with artificial muscles</article-title>. <source>Science</source> <volume>308</volume>, <fpage>63</fpage>&#x02013;<lpage>65</lpage>.<pub-id pub-id-type="doi">10.1126/science.1099010</pub-id></citation></ref>
<ref id="B5"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Bertschinger</surname> <given-names>N.</given-names></name> <name><surname>Rauh</surname> <given-names>J.</given-names></name> <name><surname>Olbrich</surname> <given-names>E.</given-names></name> <name><surname>Jost</surname> <given-names>J.</given-names></name> <name><surname>Ay</surname> <given-names>N.</given-names></name></person-group> (<year>2014</year>). <article-title>Quantifying unique information</article-title>. <source>Entropy</source> <volume>16</volume>, <fpage>2161</fpage>&#x02013;<lpage>2183</lpage>.<pub-id pub-id-type="doi">10.3390/e16042161</pub-id></citation></ref>
<ref id="B6"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Brown</surname> <given-names>I. E.</given-names></name> <name><surname>Scott</surname> <given-names>S. H.</given-names></name> <name><surname>Loeb</surname> <given-names>G. E.</given-names></name></person-group> (<year>1995</year>). <article-title>Preflexes &#x02013; programmable high-gain zero-delay intrinsic responses of perturbed musculoskeletal systems</article-title>. <source>Soc. Neurosci. Abstr.</source> <volume>21</volume>, <fpage>562</fpage>.</citation></ref>
<ref id="B7"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Clark</surname> <given-names>A.</given-names></name></person-group> (<year>1996</year>). <source>Being There: Putting Brain, Body, and World Together Again</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>.</citation></ref>
<ref id="B8"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Clark</surname> <given-names>D. D.</given-names></name> <name><surname>Sokoloff</surname> <given-names>L.</given-names></name></person-group> (<year>1999</year>). <article-title>&#x0201C;Circulation and energy metabolism of the brain,&#x0201D;</article-title> in <source>Basic Neurochemistry: Molecular, Cellular and Medical Aspects</source>, <edition>6th Edn</edition>, Chap. 31, eds <person-group person-group-type="editor"><name><surname>Siegel</surname> <given-names>G. J.</given-names></name> <name><surname>Agranoff</surname> <given-names>B. W.</given-names></name> <name><surname>Albers</surname> <given-names>R. W.</given-names></name> <name><surname>Fisher</surname> <given-names>S. K.</given-names></name> <name><surname>Uhler</surname> <given-names>M. D.</given-names></name></person-group> (<publisher-loc>Philadelphia, PA</publisher-loc>: <publisher-name>Lippincott-Raven</publisher-name>), <fpage>637</fpage>&#x02013;<lpage>669</lpage>.</citation></ref>
<ref id="B9"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Dura-Bernal</surname> <given-names>S.</given-names></name> <name><surname>Li</surname> <given-names>K.</given-names></name> <name><surname>Neymotin</surname> <given-names>S. A.</given-names></name> <name><surname>Francis</surname> <given-names>J. T.</given-names></name> <name><surname>Principe</surname> <given-names>J. C.</given-names></name> <name><surname>Lytton</surname> <given-names>W. W.</given-names></name></person-group> (<year>2016</year>). <article-title>Restoring behavior via inverse neurocontroller in a lesioned cortical spiking model driving a virtual arm</article-title>. <source>Front. Neurosci.</source> <volume>10</volume>:<fpage>28</fpage>.<pub-id pub-id-type="doi">10.3389/fnins.2016.00028</pub-id><pub-id pub-id-type="pmid">26903796</pub-id></citation></ref>
<ref id="B10"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Gerritsen</surname> <given-names>K. G.</given-names></name> <name><surname>van den Bogert</surname> <given-names>A. J.</given-names></name> <name><surname>Hulliger</surname> <given-names>M.</given-names></name> <name><surname>Zernicke</surname> <given-names>R. F.</given-names></name></person-group> (<year>1998</year>). <article-title>Intrinsic muscle properties facilitate locomotor control &#x02013; a computer simulation study</article-title>. <source>Motor Control</source> <volume>2</volume>, <fpage>206</fpage>&#x02013;<lpage>220</lpage>.<pub-id pub-id-type="pmid">9644290</pub-id></citation></ref>
<ref id="B11"><citation citation-type="web"><person-group person-group-type="author"><name><surname>Ghazi-Zahedi</surname> <given-names>K.</given-names></name></person-group> (<year>2016</year>). <source>Entropy&#x0002B;&#x0002B; GitHub Repository</source>. Available at: <uri xlink:href="http://github.com/kzahedi/entropy">http://github.com/kzahedi/entropy</uri></citation></ref>
<ref id="B12"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Ghazi-Zahedi</surname> <given-names>K.</given-names></name> <name><surname>Rauh</surname> <given-names>J.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x0201C;Quantifying morphological computation based on an information decomposition of the sensorimotor loop,&#x0201D;</article-title> in <conf-name>Proceedings of the 13th European Conference on Artificial Life (ECAL 2015)</conf-name> (<conf-loc>York, UK</conf-loc>: <conf-sponsor>MIT Press</conf-sponsor>), <fpage>70</fpage>&#x02013;<lpage>77</lpage>.</citation></ref>
<ref id="B13"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haeufle</surname> <given-names>D. F. B.</given-names></name> <name><surname>Grimmer</surname> <given-names>S.</given-names></name> <name><surname>Kalveram</surname> <given-names>K.-T.</given-names></name> <name><surname>Seyfarth</surname> <given-names>A.</given-names></name></person-group> (<year>2012</year>). <article-title>Integration of intrinsic muscle properties, feed-forward and feedback signals for generating and stabilizing hopping</article-title>. <source>J. R. Soc. Interface</source> <volume>9</volume>, <fpage>1458</fpage>&#x02013;<lpage>1469</lpage>.<pub-id pub-id-type="doi">10.1098/rsif.2011.0694</pub-id><pub-id pub-id-type="pmid">22219395</pub-id></citation></ref>
<ref id="B14"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haeufle</surname> <given-names>D. F. B.</given-names></name> <name><surname>Grimmer</surname> <given-names>S.</given-names></name> <name><surname>Seyfarth</surname> <given-names>A.</given-names></name></person-group> (<year>2010</year>). <article-title>The role of intrinsic muscle properties for stable hopping &#x02013; stability is achieved by the force&#x02013;velocity relation</article-title>. <source>Bioinspir. Biomim.</source> <volume>5</volume>, <fpage>016004</fpage>.<pub-id pub-id-type="doi">10.1088/1748-3182/5/1/016004</pub-id></citation></ref>
<ref id="B15"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Haeufle</surname> <given-names>D. F. B.</given-names></name> <name><surname>G&#x000FC;nther</surname> <given-names>M.</given-names></name> <name><surname>Wunner</surname> <given-names>G.</given-names></name> <name><surname>Schmitt</surname> <given-names>S.</given-names></name></person-group> (<year>2014</year>). <article-title>Quantifying control effort of biological and technical movements: an information-entropy-based approach</article-title>. <source>Phys. Rev. E</source> <volume>89</volume>, <fpage>012716</fpage>.<pub-id pub-id-type="doi">10.1103/PhysRevE.89.012716</pub-id><pub-id pub-id-type="pmid">24580266</pub-id></citation></ref>
<ref id="B16"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Hauser</surname> <given-names>H.</given-names></name> <name><surname>Ijspeert</surname> <given-names>A.</given-names></name> <name><surname>F&#x000FC;chslin</surname> <given-names>R. M.</given-names></name> <name><surname>Pfeifer</surname> <given-names>R.</given-names></name> <name><surname>Maass</surname> <given-names>W.</given-names></name></person-group> (<year>2011</year>). <article-title>Towards a theoretical foundation for morphological computation with compliant bodies</article-title>. <source>Biol. Cybern.</source> <volume>105</volume>, <fpage>355</fpage>&#x02013;<lpage>370</lpage>.<pub-id pub-id-type="doi">10.1007/s00422-012-0471-0</pub-id><pub-id pub-id-type="pmid">22290137</pub-id></citation></ref>
<ref id="B17"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>John</surname> <given-names>C. T.</given-names></name> <name><surname>Anderson</surname> <given-names>F. C.</given-names></name> <name><surname>Higginson</surname> <given-names>J. S.</given-names></name> <name><surname>Delp</surname> <given-names>S. L.</given-names></name></person-group> (<year>2013</year>). <article-title>Stabilisation of walking by intrinsic muscle properties revealed in a three-dimensional muscle-driven simulation</article-title>. <source>Comput. Methods Biomech. Biomed. Engin.</source> <volume>16</volume>, <fpage>451</fpage>&#x02013;<lpage>462</lpage>.<pub-id pub-id-type="doi">10.1080/10255842.2011.627560</pub-id><pub-id pub-id-type="pmid">22224406</pub-id></citation></ref>
<ref id="B18"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Klyubin</surname> <given-names>A. S.</given-names></name> <name><surname>Polani</surname> <given-names>D.</given-names></name> <name><surname>Nehaniv</surname> <given-names>C. L.</given-names></name></person-group> (<year>2004</year>). <article-title>&#x0201C;Organization of the information flow in the perception-action loop of evolved agents,&#x0201D;</article-title> in <conf-name>Proceedings of 2004 NASA/DoD Conference on Evolvable Hardware, 2004</conf-name> (<conf-loc>Seattle</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>177</fpage>&#x02013;<lpage>180</lpage>.</citation></ref>
<ref id="B19"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>McGeer</surname> <given-names>T.</given-names></name></person-group> (<year>1990</year>). <article-title>Passive dynamic walking</article-title>. <source>Int. J. Rob. Res.</source> <volume>9</volume>, <fpage>62</fpage>&#x02013;<lpage>82</lpage>.<pub-id pub-id-type="doi">10.1177/027836499000900206</pub-id></citation></ref>
<ref id="B20"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>M&#x000FC;ller</surname> <given-names>R.</given-names></name> <name><surname>Haeufle</surname> <given-names>D. F. B.</given-names></name> <name><surname>Blickhan</surname> <given-names>R.</given-names></name></person-group> (<year>2015</year>). <article-title>Preparing the leg for ground contact in running: the contribution of feed-forward and visual feedback</article-title>. <source>J. Exp. Biol.</source> <volume>218</volume>, <fpage>451</fpage>&#x02013;<lpage>457</lpage>.<pub-id pub-id-type="doi">10.1242/jeb.113688</pub-id><pub-id pub-id-type="pmid">25524978</pub-id></citation></ref>
<ref id="B21"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Niiyama</surname> <given-names>R.</given-names></name> <name><surname>Nishikawa</surname> <given-names>S.</given-names></name> <name><surname>Kuniyoshi</surname> <given-names>Y.</given-names></name></person-group> (<year>2012</year>). <article-title>Biomechanical approach to open-loop bipedal running with a musculoskeletal athlete robot</article-title>. <source>Adv. Rob.</source> <volume>26</volume>, <fpage>383</fpage>&#x02013;<lpage>398</lpage>.<pub-id pub-id-type="doi">10.1163/156855311X614635</pub-id></citation></ref>
<ref id="B22"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Pfeifer</surname> <given-names>R.</given-names></name> <name><surname>Bongard</surname> <given-names>J. C.</given-names></name></person-group> (<year>2006</year>). <source>How the Body Shapes the Way We Think: A New View of Intelligence</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>The MIT Press (Bradford Books)</publisher-name>.</citation></ref>
<ref id="B23"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Pinter</surname> <given-names>I. J.</given-names></name> <name><surname>Van Soest</surname> <given-names>A. J.</given-names></name> <name><surname>Bobbert</surname> <given-names>M. F.</given-names></name> <name><surname>Smeets</surname> <given-names>J. B. J.</given-names></name></person-group> (<year>2012</year>). <article-title>Conclusions on motor control depend on the type of model used to represent the periphery</article-title>. <source>Biol. Cybern.</source> <volume>106</volume>, <fpage>441</fpage>&#x02013;<lpage>451</lpage>.<pub-id pub-id-type="doi">10.1007/s00422-012-0505-7</pub-id><pub-id pub-id-type="pmid">22868500</pub-id></citation></ref>
<ref id="B24"><citation citation-type="confproc"><person-group person-group-type="author"><name><surname>Polani</surname> <given-names>D.</given-names></name></person-group> (<year>2011</year>). <article-title>&#x0201C;An informational perspective on how the embodiment can relieve cognitive burden,&#x0201D;</article-title> in <conf-name>IEEE Symposium on Artificial Life (ALIFE), 2011</conf-name> (<conf-loc>Paris</conf-loc>: <conf-sponsor>IEEE</conf-sponsor>), <fpage>78</fpage>&#x02013;<lpage>85</lpage>.</citation></ref>
<ref id="B25"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Polani</surname> <given-names>D.</given-names></name> <name><surname>Nehaniv</surname> <given-names>C.</given-names></name> <name><surname>Martinetz</surname> <given-names>T.</given-names></name> <name><surname>Kim</surname> <given-names>J. T.</given-names></name></person-group> (<year>2006</year>). <article-title>&#x0201C;Relevant information in optimized persistence vs. progeny strategies,&#x0201D;</article-title> in <source>Proc. Artificial Life X</source>, eds <person-group person-group-type="editor"><name><surname>Rocha</surname> <given-names>L. M.</given-names></name> <name><surname>Bedau</surname> <given-names>M.</given-names></name> <name><surname>Floreano</surname> <given-names>D.</given-names></name> <name><surname>Goldstone</surname> <given-names>R.</given-names></name> <name><surname>Vespignani</surname> <given-names>A.</given-names></name> <name><surname>Yaeger</surname> <given-names>L.</given-names></name></person-group> (<publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>), <fpage>337</fpage>&#x02013;<lpage>343</lpage>.</citation></ref>
<ref id="B26"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Proctor</surname> <given-names>J.</given-names></name> <name><surname>Holmes</surname> <given-names>P.</given-names></name></person-group> (<year>2010</year>). <article-title>Reflexes and preflexes: on the role of sensory feedback on rhythmic patterns in insect locomotion</article-title>. <source>Biol. Cybern.</source> <volume>102</volume>, <fpage>513</fpage>&#x02013;<lpage>531</lpage>.<pub-id pub-id-type="doi">10.1007/s00422-010-0383-9</pub-id><pub-id pub-id-type="pmid">20358220</pub-id></citation></ref>
<ref id="B27"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Renjewski</surname> <given-names>D.</given-names></name> <name><surname>Sprowitz</surname> <given-names>A.</given-names></name> <name><surname>Peekema</surname> <given-names>A.</given-names></name> <name><surname>Jones</surname> <given-names>M.</given-names></name> <name><surname>Hurst</surname> <given-names>J.</given-names></name></person-group> (<year>2015</year>). <article-title>Exciting engineered passive dynamics in a bipedal robot</article-title>. <source>IEEE Trans. Robot.</source> <volume>31</volume>, <fpage>1244</fpage>&#x02013;<lpage>1251</lpage>.<pub-id pub-id-type="doi">10.1109/TRO.2015.2473456</pub-id></citation></ref>
<ref id="B28"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>R&#x000FC;ckert</surname> <given-names>E. A.</given-names></name> <name><surname>Neumann</surname> <given-names>G.</given-names></name></person-group> (<year>2013</year>). <article-title>Stochastic optimal control methods for investigating the power of morphological computation</article-title>. <source>Artif. Life</source> <volume>19</volume>, <fpage>115</fpage>&#x02013;<lpage>131</lpage>.<pub-id pub-id-type="doi">10.1162/ARTL_a_00085</pub-id><pub-id pub-id-type="pmid">23186345</pub-id></citation></ref>
<ref id="B29"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Schmitt</surname> <given-names>S.</given-names></name> <name><surname>G&#x000FC;nther</surname> <given-names>M.</given-names></name> <name><surname>Rupp</surname> <given-names>T.</given-names></name> <name><surname>Bayer</surname> <given-names>A.</given-names></name> <name><surname>H&#x000E4;ufle</surname> <given-names>D.</given-names></name></person-group> (<year>2013</year>). <article-title>Theoretical Hill-type muscle and stability: numerical model and application</article-title>. <source>Comput. Math. Methods Med.</source> <volume>2013</volume>, <fpage>570878</fpage>.<pub-id pub-id-type="doi">10.1155/2013/570878</pub-id><pub-id pub-id-type="pmid">24319495</pub-id></citation></ref>
<ref id="B30"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Schmitt</surname> <given-names>S.</given-names></name> <name><surname>Haeufle</surname> <given-names>D. F. B.</given-names></name></person-group> (<year>2015</year>). <article-title>&#x0201C;Mechanics and thermodynamics of biological muscle &#x02013; a simple model approach,&#x0201D;</article-title> in <source>Soft Robotics</source>, <edition>1ed Edn</edition>, eds <person-group person-group-type="editor"><name><surname>Verl</surname> <given-names>A.</given-names></name> <name><surname>Albu-Sch&#x000E4;ffer</surname> <given-names>A.</given-names></name> <name><surname>Brock</surname> <given-names>O.</given-names></name> <name><surname>Raatz</surname> <given-names>A.</given-names></name></person-group> (<publisher-name>Springer</publisher-name>), <fpage>134</fpage>&#x02013;<lpage>144</lpage>.</citation></ref>
<ref id="B31"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Sokoloff</surname> <given-names>L.</given-names></name> <name><surname>Mangold</surname> <given-names>R.</given-names></name> <name><surname>Wechsler</surname> <given-names>R.</given-names></name> <name><surname>Kennedy</surname> <given-names>C.</given-names></name> <name><surname>Kety</surname> <given-names>S.</given-names></name></person-group> (<year>1955</year>). <article-title>Effect of mental arithmetic on cerebral circulation and metabolism</article-title>. <source>J. Clin. Invest.</source> <volume>34</volume>, <fpage>1101</fpage>&#x02013;<lpage>1108</lpage>.<pub-id pub-id-type="doi">10.1172/JCI103159</pub-id></citation></ref>
<ref id="B32"><citation citation-type="book"><person-group person-group-type="author"><name><surname>Sutton</surname> <given-names>R. S.</given-names></name> <name><surname>Barto</surname> <given-names>A. G.</given-names></name></person-group> (<year>1998</year>). <source>Reinforcement Learning: An Introduction</source>. <publisher-loc>Cambridge, MA</publisher-loc>: <publisher-name>MIT Press</publisher-name>.</citation></ref>
<ref id="B33"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>van Soest</surname> <given-names>A. J.</given-names></name> <name><surname>Bobbert</surname> <given-names>M. F.</given-names></name></person-group> (<year>1993</year>). <article-title>The contribution of muscle properties in the control of explosive movements</article-title>. <source>Biol. Cybern.</source> <volume>69</volume>, <fpage>195</fpage>&#x02013;<lpage>204</lpage>.<pub-id pub-id-type="doi">10.1007/BF00198959</pub-id><pub-id pub-id-type="pmid">8373890</pub-id></citation></ref>
<ref id="B34"><citation citation-type="book"><person-group person-group-type="author"><name><surname>von Uexkuell</surname> <given-names>J.</given-names></name></person-group> (<year>1934</year>). <article-title>&#x0201C;A stroll through the worlds of animals and men,&#x0201D;</article-title> in <source>Instinctive Behavior</source>, ed. <person-group person-group-type="editor"><name><surname>Schiller</surname> <given-names>C. H.</given-names></name></person-group> (<publisher-loc>New York, NY</publisher-loc>: <publisher-name>International Universities Press</publisher-name>), <fpage>5</fpage>&#x02013;<lpage>80</lpage>.</citation></ref>
<ref id="B35"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Wootton</surname> <given-names>R. J.</given-names></name></person-group> (<year>1992</year>). <article-title>Functional morphology of insect wings</article-title>. <source>Ann. Rev. Entomol.</source> <volume>37</volume>, <fpage>113</fpage>&#x02013;<lpage>140</lpage>.<pub-id pub-id-type="doi">10.1146/annurev.en.37.010192.000553</pub-id></citation></ref>
<ref id="B36"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zahedi</surname> <given-names>K.</given-names></name> <name><surname>Ay</surname> <given-names>N.</given-names></name></person-group> (<year>2013</year>). <article-title>Quantifying morphological computation</article-title>. <source>Entropy</source> <volume>15</volume>, <fpage>1887</fpage>&#x02013;<lpage>1915</lpage>.<pub-id pub-id-type="doi">10.3390/e15051887</pub-id></citation></ref>
<ref id="B37"><citation citation-type="journal"><person-group person-group-type="author"><name><surname>Zahedi</surname> <given-names>K.</given-names></name> <name><surname>Ay</surname> <given-names>N.</given-names></name> <name><surname>Der</surname> <given-names>R.</given-names></name></person-group> (<year>2010</year>). <article-title>Higher coordination with less control &#x02013; a result of information maximization in the sensori-motor loop</article-title>. <source>Adapt. Behav.</source> <volume>18</volume>, <fpage>338</fpage>&#x02013;<lpage>355</lpage>.<pub-id pub-id-type="doi">10.1177/1059712310375314</pub-id></citation></ref>
</ref-list>
<app-group>
<app id="A1">
<title>Appendix</title>
<sec id="S11">
<label>A</label> <title><italic>I</italic>(<italic>W</italic>&#x02032;;<italic>A</italic>&#x0007C;<italic>W</italic>)&#x02009;&#x0003D;&#x02009;0 for Deterministic Systems</title>
<p>In the case where <italic>&#x003B1;</italic>(<italic>w</italic>&#x02032;&#x0007C;<italic>w, a</italic>), <italic>&#x003B2;</italic>(<italic>s</italic>&#x0007C;<italic>w</italic>) and <italic>&#x003C0;</italic>(<italic>a</italic>&#x0007C;<italic>s</italic>) are deterministic, the conditional entropy <italic>H</italic>(<italic>W</italic>&#x02032;&#x0007C;<italic>W</italic>) vanishes. It follows that
<disp-formula id="E13"><mml:math id="M53"><mml:mtable columnalign="left" class="align-star"><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:mn>0</mml:mn><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"></mml:mtd><mml:mtd class="align-even"><mml:mspace width="1em" class="quad"/><mml:mo class="MathClass-rel">&#x02264;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></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:mn>0</mml:mn><mml:mo class="MathClass-punc">.</mml:mo><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
</sec>
<sec id="S12">
<label>B</label> <title>Relation between MC<sub>W</sub> and MC<sub>MI</sub></title>
<p>From the following equality
<disp-formula id="E14"><mml:math id="M54"><mml:mtable columnalign="left" class="align-star"><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></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>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
we can derive
<disp-formula id="E15"><mml:math id="M55"><mml:mtable columnalign="left" class="align-star"><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:munder class="msub"><mml:mrow><mml:munder accentunder="false"><mml:mrow><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x0FE38;</mml:mo></mml:munder></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>W</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:munder></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:munder class="msub"><mml:mrow><mml:munder accentunder="false"><mml:mrow><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow></mml:mrow><mml:mo>&#x0FE38;</mml:mo></mml:munder></mml:mrow><mml:mrow><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>MI</mml:mtext></mml:mrow></mml:msub></mml:mrow></mml:munder><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"></mml:mtd><mml:mtd class="align-even"><mml:mspace width="1em" class="quad"/><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>W</mml:mtext></mml:mrow></mml:msub><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:msub><mml:mrow><mml:mtext>MC</mml:mtext></mml:mrow><mml:mrow><mml:mtext>MI</mml:mtext></mml:mrow></mml:msub></mml:mtd><mml:mtd class="align-even"><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>I</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-punc">;</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></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>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"></mml:mtd><mml:mtd class="align-even"><mml:mspace width="1em" class="quad"/><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr><mml:mtr><mml:mtd columnalign="right" class="align-odd"></mml:mtd><mml:mtd class="align-even"><mml:mspace width="1em" class="quad"/><mml:mo class="MathClass-bin">&#x02212;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-bin">&#x0002B;</mml:mo><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></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>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>W</mml:mi><mml:mo class="MathClass-rel">&#x02032;</mml:mo></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mspace width="2em"/></mml:mtd><mml:mtd columnalign="right" class="align-label"></mml:mtd><mml:mtd class="align-label"><mml:mspace width="2em"/></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula></p>
<p>For deterministic systems, the conditional entropies <italic>H</italic>(<italic>A</italic>&#x0007C;<italic>S</italic>)&#x02009;&#x0003D;&#x02009;<italic>H</italic>(<italic>W</italic>&#x02032;&#x0007C;<italic>W</italic>)&#x02009;&#x0003D;&#x02009;<italic>H</italic>(<italic>W</italic>&#x02032;&#x0007C;<italic>A</italic>,<italic>W</italic>)&#x02009;&#x0003D;&#x02009;0. We show this exemplarily for <italic>H</italic>(<italic>A</italic>&#x0007C;<italic>S</italic>). If the action <italic>A</italic> is a function of the sensor state <italic>S</italic>, then <italic>p</italic>(<italic>a, s</italic>)&#x02009;&#x0003D;&#x02009;<italic>p</italic>(<italic>a</italic>&#x0007C;<italic>s</italic>) is either one or zero, because there is exactly one actuator value for every sensor state. Hence, <inline-formula><mml:math id="M56"><mml:mi>H</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>A</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>S</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:msub><mml:mrow><mml:mo class="MathClass-op">&#x02211;</mml:mo></mml:mrow><mml:mrow><mml:mi>a</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo class="MathClass-punc">,</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mi mathvariant="italic">logp</mml:mi><mml:mrow><mml:mo class="MathClass-open">(</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mo class="MathClass-rel">&#x0007C;</mml:mo><mml:mi>s</mml:mi></mml:mrow><mml:mo class="MathClass-close">)</mml:mo></mml:mrow><mml:mo class="MathClass-rel">&#x0003D;</mml:mo><mml:mn>0</mml:mn></mml:math></inline-formula>. The equality MC<sub>MI</sub> &#x02013; MC<sub>W</sub>&#x02009;&#x0003D;&#x02009;<italic>H</italic>(<italic>A</italic>&#x0007C;<italic>W</italic>&#x02032;) is not hold in Table <xref ref-type="table" rid="T1">1</xref>, because the discretization introduces stochasticity, and hence, the conditional entropies are only approximately zero, i.e., <italic>H</italic>(<italic>A</italic>&#x0007C;<italic>S</italic>)&#x02009;&#x02248;&#x02009;<italic>H</italic>(<italic>W</italic>&#x02032;&#x0007C;<italic>W</italic>)&#x02009;&#x02248;&#x02009;<italic>H</italic>(<italic>W</italic>&#x02032;&#x0007C;<italic>A</italic>,<italic>W</italic>)&#x02009;&#x02248;&#x02009;0.</p>
</sec>
</app>
</app-group>
</back>
</article>