<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <title-group>
        <article-title>Learning Classifier Systems for Self-Explaining Socio-Technical-Systems</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Michael Heider</string-name>
          <email>michael.heider@uni-a.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Richard Nordsieck</string-name>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jo¨ rg Ha¨hner</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Organic Computing Group, Universita ̈t Augsburg</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>XITASO GmbH IT &amp; Software Solutions</institution>
          ,
          <addr-line>Augsburg</addr-line>
          ,
          <country country="DE">Germany</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>In socio-technical settings, operators are increasingly assisted by decision support systems. By employing these, important properties of socio-technical systems such as self-adaptation and self-optimization are expected to improve further. To be accepted by and engage efficiently with operators, decision support systems need to be able to provide explanations regarding the reasoning behind specific decisions. In this paper, we propose the usage of Learning Classifier Systems, a family of rule-based machine learning methods, to facilitate transparent decision making and highlight some techniques to improve that. We then raise three general research questions that should be answered for any machine learningbased recommendation agent and four additional questions that are more tailored towards rule-based systems. These seven stakeholder-focussed questions provide a template for the approach of self-explaining decision support systems in new domains or settings.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Increasing automation of manufacturing creates a
continuous interest in properties commonly associated with
lifelike or organic computing systems, such as self-adaptation
or self-optimisation, within the producing industry
        <xref ref-type="bibr" rid="ref9">(Permin et al., 2016)</xref>
        . These properties are often achieved
using data driven and learning methods
        <xref ref-type="bibr" rid="ref10 ref15 ref7">(Zhang et al., 2017;
Lughofer et al., 2019; Schoettler et al., 2020)</xref>
        as with
increasing digitalisation and IoT efforts, data can be collected
in large amounts. In modern factories, products are usually
inspected by the machines’ operators (or specialized
quality assurance personnel; we subsume the different roles
under ‘operator’ here for the sake of simplicity) to assess their
quality, cf. Figure 1. Recent advances into automated
inspection often integrate computer vision-based approaches
        <xref ref-type="bibr" rid="ref8">(Margraf et al., 2017)</xref>
        . However, these can be of limited
use when quality is not assessable from the surface, e. g.
structural or chemical properties that involve laboratory
testing. Thus, these systems currently can only partially
automate inspection while the conclusions with regards to
machine reconfiguration are still reached manually. This
requires a large amount of operator knowledge and experience
to achieve optimal or even satisfactory results. In settings
with heterogeneous machines and few operators, the strain
on operator experience is further increased and production
can be seriously threatened by a loss of qualified personnel,
e. g. through retirement.
      </p>
      <p>To reduce reliance on specific knowledge of operators and
improve the self-adapting and self-optimizing systems, the
operator can be assisted by decision support systems. These
can easily incorporate large amounts of information
simultaneously and are less biased to well known settings,
especially compared to operators that only have limited
understanding of or experience with the machines. Such decision
support systems utilise learning from past experience and
ongoing human expert feedback. Combining human
operators and supervised learning (SL) agents that collaboratively
adjust machines (or lines thereof) manufacturing products
expands the socio-technical system with a decision making
dimension, cf. Figure 2. Typical shopfloor environments
will feature many workers operating on many machines but
not necessarily in a one to one array, e. g. multiple workers
might be needed to operate a single machine while other
machines can be operated by a single worker due to automation.
Additionally, to utilise the available data most efficiently,
not every machine should need their own model but
models should generalise over multiple machines of the same
or similar type. For production lines where multiple
models would participate, the parametrisation choices of
preceding machines would need to be accounted for by subsequent
models, e. g. through the help of models of higher
abstraction. In this environment, models take input from and
advise multiple operators while operators might interact with
different models throughout a shift.</p>
      <p>An integral element for implementing these systems is
that operators are able to trust decisions made by their
recommendation agents. This requires the system to be
selfexplaining in both adequate form and abstraction level. This
involves both an explanation regarding the basis of the
recommendation, e. g. what input parameters led to this
output, as well as an assessment of the quality of the decision,
e. g. what is the expected error in quality when executing
the recommended parametrisation. In this paper, we posit
that Learning Classifier Systems are well-suited to be used
within the proposed supervised learning agent by reviewing
different explainability techniques in light of this setting. We
then highlight a variety of open research questions that need
to be addressed to successfully apply LCSs (or other
rulebased systems) in this context.</p>
    </sec>
    <sec id="sec-2">
      <title>Learning Classifier Systems</title>
      <p>
        Learning Classifier Systems (LCSs) are a family of
rulebased learning systems
        <xref ref-type="bibr" rid="ref14">(Urbanowicz and Moore, 2009)</xref>
        .
While LCSs are a diverse field, they share some common
properties. In general, LCSs produce models consisting of a
finite number of if-then rules (classifiers) where individual
premises (conditions), and by extension the global model
structure, are optimized using a—typically evolutionary—
metaheuristic and the conclusions of the rules use a
problemdependent model. These classifiers or local models can then
individually be ascribed a quality of their prediction within
their respective subspace of the global model’s input space.
In our view, these commonalities are sufficient to motivate
their application within a decision support system, however,
we acknowledge that choosing the “right” LCS for an actual
implementation needs to be done use-case specific as some
LCSs will yield better results than others.
      </p>
      <p>
        Explainability in LCSs
Explainbility of machine learning is usually differentiated
into transparent methods, allowing interpretation of
decisions and comprehension of the model from the structure
itself, and post-hoc methods, utilising visualisation, model
transformation into intrinsicly interpretable models and
similar techniques on models that are not by themselves
interpretable
        <xref ref-type="bibr" rid="ref2">(Barredo Arrieta et al., 2020)</xref>
        . As rule-based
learning systems, LCSs generally fall into the domain of
transparent models and are regarded as excellent for
interpretability due to their relation to human behaviour.
However, several factors can limit the degree to which humans
can easily comprehend the model and follow its decision
making process. Most notable are the number of
classifiers and the formulation thereof. Conditions in complex
feature spaces are harder to understand than those that
operate directly on the data, e. g. higher level features
aggregating multiple sensor readings versus the readings themselves.
Additionally, conditions can be formulated using complex
non-linear functions rather than readable decision
boundaries
        <xref ref-type="bibr" rid="ref3">(Bull and O’Hara, 2002)</xref>
        . Conclusions that utilise
complex black box models, such as neural networks
        <xref ref-type="bibr" rid="ref4">(Lanzi and
Loiacono, 2006)</xref>
        , are also harder to understand than linear
or constant models even if these local black box models are
usually much smaller than a model of the same class that
encompasses the complete problem space would need to be.
      </p>
      <p>
        These issues can warrant design adjustments within the
LCS or the application of post-hoc methods. The number
of rules can be combated depending on the type of
system considered: For Pittsburgh-style systems, this is
usually achieved by promoting small individuals through
adjustments of the fitness function
        <xref ref-type="bibr" rid="ref1">(Bacardit and Garrell, 2007)</xref>
        whereas, in Michigan-style systems, rule subsumption and
compaction methods are applied
        <xref ref-type="bibr" rid="ref12 ref5">(Tan et al., 2013; Liu et al.,
2019)</xref>
        . An improved understanding of singular classifiers
can be pursued by promoting simplicity during training
through a suitable fitness function, by applying analysis
typical for the respective models, e. g. feature importance
estimations in neural networks, and with a variety of
visualisation methods
        <xref ref-type="bibr" rid="ref13 ref5 ref6">(Urbanowicz et al., 2012; Liu et al., 2019,
2021)</xref>
        .
      </p>
    </sec>
    <sec id="sec-3">
      <title>LCSs in Industrial decision support systems</title>
      <p>
        Many different LCSs have been proposed over the years
and while originally envisioned as a powerful reinforcement
learner, they have been extended for all learning paradigms
        <xref ref-type="bibr" rid="ref14">(Urbanowicz and Moore, 2009)</xref>
        . We consider the
application as a decision support system that proposes settings to
an operator and informs them of the reasoning behind this
choice to be a supervised learning task. This can be solved
with either online or offline learning as long as the model
used to make recommendations provides a compacted
version of itself for inference and subsequently serving
explanations. The LCS learns from experiences including sensor
readings, product information, used machine settings and
resulting quality measures, all of which will be a mixture of
real and categorical values. When tasked with assisting an
operator, the SL agent uses sensor readings and product
information to propose machine settings and predict the
expected quality.
      </p>
      <p>
        Besides the previously introduced explainability
techniques, LCSs also easily allow us to provide operators with
all examples from our training data that formed the local
model (as we know which samples were matched by the
classifier’s condition). This can help further the trust that the
model’s predictions are actually based on existing expertise.
Going beyond traditional explaining by example
        <xref ref-type="bibr" rid="ref2">(Barredo
Arrieta et al., 2020)</xref>
        , each example that influenced this
classifier’s weights could theoretically be listed, whereas in
black box models usually the entire sample influences
every weight.
      </p>
      <p>
        In Michigan-style LCSs, each individual classifier gets
ascribed a quality measure (or multiple thereof in XCS(F)).
This (or in case of multiple measures, at least one of them)
represents the classifier’s fitness and is used to guide the
evolutionary process. Moreover, we can utilise these measures
to provide our operator with additional information on how
exact and therefore useful a recommendation is. Classifiers
with a low prediction quality and thus a high expected error
might provide poor machine settings while other classifiers
in the model might actually provide very useful settings.
This disparity in niches of the feature space can also allow
insights into where new sampling should take place
        <xref ref-type="bibr" rid="ref11 ref8">(Stein
et al., 2017)</xref>
        and allows to differentiate the model further.
Even if—viewed globally—the model is less than optimal,
it can still be used within the SL agent and aid operators on
tasks where it is well fit.
      </p>
    </sec>
    <sec id="sec-4">
      <title>Open Research Questions</title>
      <p>Following this theoretical examination of the applicability
of LCSs as decision support systems for the parametrisation
of industrial machinery in a complex socio-technical
environment, we want to raise several open research questions
we aim at answering in the coming years. Note that we
broaden the scope from our operators that interact directly
or indirectly with the machine to all stakeholders that have a
vested interest in the operation of the shopfloor, both digital
and analogue. Thus, this can also include regulatory bodies,
safety officers, management, customers and others.
1. To what extent does a stakeholder request explanations?
This can have numerous dimensions, such as depth,
frequency or diversity of explanations. In this question we
assume that stakeholders may seek explanations that go
beyond regulatory requirements, although a potential
answer may be that they are not interested in further/deeper
explanations. This raises another aspect: How important
is explainability deemed if prediction quality potentially
suffers?
2. What are the differences between types of stakeholders?
Tying directly into the previous question, we assume that
the diverse stakeholders will answer this question
differently. Someone that operates the machine directly might
prefer examples of past experiences while quality
assurance personnel might prefer visualisations or vice versa.
Stakeholders may also hold different understandings of
the machine itself, so explanations would need to
accommodate specific levels of prior knowledge. Furthermore,
diversity between individual operators might be
substantial and warrant personalisation approaches.
3. How many rules may the served model contain before
being too large? For the full model, smaller rule sets are
easier to generate a general understanding on, while larger
rule sets can provide a more diverse coverage of the
input space and therefore more accurate and
comprehensible predictions. In some cases, like explanations for
specific decisions, the entirety of the rule set might not even
be of interest and operators may prefer explanations to be
limited to the rules whose conditions matched the
situation.
4. What form can conditions take before they are too
complex to be understood? Many rule representations have
been proposed in the past and while ellipsoids or neural
networks can provide improved results, cuboids might be
easier to comprehend. This should also probe whether the
exact condition is even considered relevant or if operators
are content with knowing that it applies in this instance.
5. How important are explanations of why the decision
boundary of a classifier is placed a certain way? In LCSs,
the model structure (and decision boundary of each rule)
is optimized using a metaheuristic to localise the
classifiers in a way that they fit the data well. Within this
question, we want to ascertain how important insights into this
process are to operators.
6. What form can conclusions take before they are too
complex to be understood? While linear models are widely
regarded as easily comprehensible, more complex models
might yield better results and typical explanations, such
as feature importance analysis, can satisfy the operators’
want for understanding the decision making process. This
also translates to the usage of mixing models (where
multiple classifiers are used to construct a prediction) and the
comprehension thereof.
7. What information do operators request about the
training process? Relating to question 5, this question aims
towards the training in general and what steps are
performed in the process rather than at an analysis of the
utilised model.</p>
    </sec>
    <sec id="sec-5">
      <title>Conclusion</title>
      <p>In this paper, we introduced a complex socio-technical
system within an industrial manufacturing setting where
operators and supervised learning agents collaboratively adjust
machine settings to optimize product quality. In these
systems, operators can interact with a variety of heterogeneous
machines and different agents throughout a single shift,
while the agents also interact with different operators.
Assisting the operators with recommendations from the agents
decreases the necessity for experience and helps extract and
conserve experience of senior operators that might otherwise
be lost over time. We introduced Learning Classifier
Systems (LCS) and reviewed why these rule-based systems are
generally considered explainable. Building on that, we
expanded on requirements for the design of an LCS within our
agent and highlighted beneficial properties of LCSs for this
application. This led to seven open research questions
regarding the explainability and need thereof. Three of these
questions are applicable to a variety of machine learning
models, e. g. To what extent does a stakeholder request
explanations?, and aim at analysing general wants and needs,
while the other four questions are more specific for
rulebased systems (LCSs, decision trees, etc.). Answers to these
questions are likely very domain- and stakeholder-specific
and would need to be answered for each manufacturing
problem independently. Although we assume that general
trends should be transferable, these questions can also serve
as a template whenever applying rule-based learning
systems to a new scenario where comprehensibility is
essential. Consequently, we are confident that LCSs can introduce
self-explaining into these socio-technical-systems while
advancing industrial manufacturing practices.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <string-name>
            <surname>Bacardit</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Garrell</surname>
            ,
            <given-names>J. M.</given-names>
          </string-name>
          (
          <year>2007</year>
          ).
          <article-title>Bloat control and generalization pressure using the minimum description length principle for a pittsburgh approach learning classifier system</article-title>
          . In Kovacs, T.,
          <string-name>
            <surname>Llora</surname>
            <given-names>`</given-names>
          </string-name>
          ,
          <string-name>
            <given-names>X.</given-names>
            ,
            <surname>Takadama</surname>
          </string-name>
          ,
          <string-name>
            <given-names>K.</given-names>
            ,
            <surname>Lanzi</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P. L.</given-names>
            ,
            <surname>Stolzmann</surname>
          </string-name>
          ,
          <string-name>
            <surname>W.</surname>
          </string-name>
          , and Wilson, S. W., editors,
          <source>Learning Classifier Systems</source>
          , pages
          <fpage>59</fpage>
          -
          <lpage>79</lpage>
          , Berlin, Heidelberg. Springer Berlin Heidelberg.
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <string-name>
            <given-names>Barredo</given-names>
            <surname>Arrieta</surname>
          </string-name>
          ,
          <string-name>
            <surname>A.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D</given-names>
            <surname>´</surname>
          </string-name>
          ıaz-Rodr´ıguez,
          <string-name>
            <given-names>N.</given-names>
            ,
            <surname>Del Ser</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            ,
            <surname>Bennetot</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Tabik</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Barbado</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            ,
            <surname>Garcia</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Gil-Lopez</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Molina</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Benjamins</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Chatila</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            , and
            <surname>Herrera</surname>
          </string-name>
          ,
          <string-name>
            <surname>F.</surname>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Explainable Artificial Intelligence (XAI): Concepts, taxonomies, opportunities and challenges toward responsible AI</article-title>
          .
          <source>Information Fusion</source>
          ,
          <volume>58</volume>
          :
          <fpage>82</fpage>
          -
          <lpage>115</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <surname>Bull</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          <article-title>and</article-title>
          <string-name>
            <surname>O'Hara</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2002</year>
          ).
          <article-title>Accuracy-Based Neuro and NeuroFuzzy Classifier Systems</article-title>
          .
          <source>In Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation</source>
          ,
          <source>GECCO'02, page 905-911</source>
          , San Francisco, CA, USA. Morgan Kaufmann Publishers Inc.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          <string-name>
            <surname>Lanzi</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Loiacono</surname>
            ,
            <given-names>D.</given-names>
          </string-name>
          (
          <year>2006</year>
          ).
          <article-title>XCSF with Neural Prediction</article-title>
          .
          <source>In 2006 IEEE International Conference on Evolutionary Computation</source>
          , pages
          <fpage>2270</fpage>
          -
          <lpage>2276</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Browne</surname>
            ,
            <given-names>W. N.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Xue</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Absumption to complement subsumption in learning classifier systems</article-title>
          .
          <source>In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO '19, page 410-418</source>
          , New York, NY, USA. Association for Computing Machinery.
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          <string-name>
            <surname>Liu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Browne</surname>
            ,
            <given-names>W. N.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Xue</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          (
          <year>2021</year>
          ).
          <article-title>Visualizations for rule-based machine learning</article-title>
          .
          <source>Natural Computing.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          <string-name>
            <surname>Lughofer</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Zavoianu</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pollak</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Pratama</surname>
            , M., Meyer-Heye,
            <given-names>P.</given-names>
          </string-name>
          , Zo¨rrer, H.,
          <string-name>
            <surname>Eitzinger</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Radauer</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          (
          <year>2019</year>
          ).
          <article-title>Autonomous Supervision and Optimization of Product Quality in a Multi-stage Manufacturing Process based on Selfadaptive Prediction Models</article-title>
          .
          <source>Journal of Process Control</source>
          ,
          <volume>76</volume>
          :
          <fpage>27</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          <string-name>
            <surname>Margraf</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Engstler</surname>
            ,
            <given-names>L.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Geinitz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Hahner</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>An evolutionary learning approach to selfconfiguring image pipelines in the context of carbon fiber fault detection</article-title>
          .
          <source>In 2017 16th IEEE International Conference on Machine Learning and Applications (ICMLA)</source>
          , pages
          <fpage>147</fpage>
          -
          <lpage>154</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          <string-name>
            <surname>Permin</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bertelsmeier</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Blum</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          , Bu¨tzler, J.,
          <string-name>
            <surname>Haag</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Kuz</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          , O¨ zdemir,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Stemmler</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            ,
            <surname>Thombansen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>U.</given-names>
            ,
            <surname>Schmitt</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Brecher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Schlick</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            ,
            <surname>Abel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            ,
            <surname>Poprawe</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            ,
            <surname>Loosen</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            ,
            <surname>Schulz</surname>
          </string-name>
          ,
          <string-name>
            <given-names>W.</given-names>
            , and
            <surname>Schuh</surname>
          </string-name>
          ,
          <string-name>
            <surname>G.</surname>
          </string-name>
          (
          <year>2016</year>
          ).
          <article-title>Self-optimizing Production Systems</article-title>
          .
          <source>Procedia CIRP</source>
          ,
          <volume>41</volume>
          :
          <fpage>417</fpage>
          -
          <lpage>422</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          <string-name>
            <surname>Schoettler</surname>
            ,
            <given-names>G.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Nair</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Luo</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Bahl</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Ojea</surname>
            ,
            <given-names>J. A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Solowjow</surname>
            ,
            <given-names>E.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Levine</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          (
          <year>2020</year>
          ).
          <article-title>Deep Reinforcement Learning for Industrial Insertion Tasks with Visual Inputs and Natural Rewards</article-title>
          .
          <source>In 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)</source>
          , pages
          <fpage>5548</fpage>
          -
          <lpage>5555</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          <string-name>
            <surname>Stein</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Maier</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          , and Ha¨hner, J. (
          <year>2017</year>
          ).
          <article-title>Toward curious learning classifier systems: Combining xcs with active learning concepts</article-title>
          .
          <source>In Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO '17, page 1349-1356</source>
          , New York, NY, USA. Association for Computing Machinery.
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          <string-name>
            <surname>Tan</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Urbanowicz</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          (
          <year>2013</year>
          ).
          <article-title>Rapid Rule Compaction Strategies for Global Knowledge Discovery in a Supervised Learning Classifier System</article-title>
          .
          <source>In ECAL 2013: The Twelfth European Conference on Artificial Life</source>
          , pages
          <fpage>110</fpage>
          -
          <lpage>117</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          <string-name>
            <surname>Urbanowicz</surname>
            ,
            <given-names>R. J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Granizo-Mackenzie</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          , and
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>J. H.</given-names>
          </string-name>
          (
          <year>2012</year>
          ).
          <article-title>An analysis pipeline with statistical and visualization-guided knowledge discovery for michigan-style learning classifier systems</article-title>
          .
          <source>IEEE Computational Intelligence Magazine</source>
          ,
          <volume>7</volume>
          (
          <issue>4</issue>
          ):
          <fpage>35</fpage>
          -
          <lpage>45</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          <string-name>
            <surname>Urbanowicz</surname>
            ,
            <given-names>R. J.</given-names>
          </string-name>
          and
          <string-name>
            <surname>Moore</surname>
            ,
            <given-names>J. H.</given-names>
          </string-name>
          (
          <year>2009</year>
          ).
          <article-title>Learning classifier systems: A complete introduction, review, and roadmap</article-title>
          .
          <source>Journal of Artificial Evolution and Applications</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          <string-name>
            <surname>Zhang</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qian</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Lv</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          , and Liu,
          <string-name>
            <surname>Y.</surname>
          </string-name>
          (
          <year>2017</year>
          ).
          <article-title>Agent and cyberphysical system based self-organizing and self-adaptive intelligent shopfloor</article-title>
          .
          <source>IEEE Transactions on Industrial Informatics</source>
          ,
          <volume>13</volume>
          (
          <issue>2</issue>
          ):
          <fpage>737</fpage>
          -
          <lpage>747</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>