<!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>Continuous Exploitative Measurement Tra jectories Using Bayesian Optimisation</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Tom V</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>nkist</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Dirk D</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>hrijv</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Tom Dh</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Ghent University - imec, IDLab</institution>
          ,
          <addr-line>Technologiepark-Zwijnaarde 126, Ghent 9052</addr-line>
          ,
          <country country="BE">Belgium</country>
        </aff>
      </contrib-group>
      <abstract>
        <p>Line-based sampling strategies aim to capture as much information as possible along a trajectory, whilst minimizing the trajectory's length. The current state of the art primarily contains exploration techniques that focus on uniformly sampling the measurement space. In this work, Bayesian optimization is used to create a novel exploitative line-based sampling strategy, that is able to guide the sampling process towards interesting regions.</p>
      </abstract>
      <kwd-group>
        <kwd>Bayesian Optimization</kwd>
        <kwd>Line-Based Sampling</kwd>
        <kwd>Experiments</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Introduction</title>
      <p>
        Automated data collecting, using robots and drones, is omnipresent in both
scienti c studies and engineering applications. In such a context, the length of the
measurement trajectory is limited by battery restrictions or operating costs. As
such, a line-based sampling strategy is used, which aims at minimising the
trajectory length whilst maximising the information gained per step. The current state
of the art primarily contains explorative techniques that uniformly sample the
measurement space [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. A model-driven approach allows the strategy to create a
representation of the measurement space which can guide the sampling process
towards interesting regions. In this work, Bayesian optimisation (BO) is used
to create a line-based sampling strategy for global optimization that naturally
deals with the exploration-exploitation trade o .
Classic BO aims to nd the global optimum of the measurement space, using few
data-points. This is typically quanti ed by evaluating an Acquisition Function
(AF) over the entire space. Maximising the AF returns the sample location that
has most potential to improve on the current global optimum. The maximum
of the AF is iteratively acquired and recalculated in the search for the global
Copyright 2019 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
      </p>
      <p>R. Delanghe et al.
optimum. The advantage of using an AF is that it naturally deals with the
exploration exploitation trade-o .</p>
      <p>In this work, BO is used to create a Line-based Bayesian optimisation (LBO)
strategy. The AF's maximum is used as a waypoint for the measurement probe.
To reach this point, the probe moves in small steps, straight towards the
waypoint and samples at every step until it is reached. At every step, it is allowed
to deviate from its trajectory by some angle if this results in the sampling of
a point with a higher acquisition score. The stepsize and angle of deviation are
parameters of the strategy. This LBO strategy can only be used in convex spaces
and is deterministic if the underlying BO is deterministic as well.
3</p>
    </sec>
    <sec id="sec-2">
      <title>Experimentation, Results And Discussion</title>
      <p>(a) RMSE Between estimated space and
the ground truth.
(b) Fraction of the maximum sampled
value, compared to the global maximum</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>Van</given-names>
            <surname>Steenkiste</surname>
          </string-name>
          ,
          <string-name>
            <surname>T.</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. van der</given-names>
            <surname>Herten</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Deschrijver</surname>
          </string-name>
          , and
          <string-name>
            <given-names>T.</given-names>
            <surname>Dhaene</surname>
          </string-name>
          .
          <year>2019</year>
          ,
          <article-title>Apr</article-title>
          . ALBATROS:
          <article-title>adaptive line-based sampling trajectories for sequential measurements</article-title>
          .
          <source>Engineering with Computers</source>
          <volume>35</volume>
          (
          <issue>2</issue>
          ):
          <fpage>537</fpage>
          -
          <lpage>550</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>H.</given-names>
            <surname>Choset</surname>
          </string-name>
          and
          <string-name>
            <given-names>P.</given-names>
            <surname>Pignon</surname>
          </string-name>
          ,
          <article-title>Coverage path planning: The boustrophedon cellular decomposition</article-title>
          ,
          <source>in Field and service robotics</source>
          , pp.
          <volume>203</volume>
          {
          <issue>209</issue>
          , Springer,
          <year>1998</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>3. MathWorks, peaks. https://nl.mathworks.com/help/matlab/ref/peaks.html.</mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>