<!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>Exploring the Unified Planning Framework for a More Integrated and Flexible Fault-Tolerant Flight Path Planning System</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Sondes Morchedi</string-name>
          <email>sondes.morchedi@unibw.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Prakash Jamakatel</string-name>
          <email>prakash.jamakatel@unibw.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Jane Jean Kiam</string-name>
          <email>jane.kiam@unibw.de</email>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Planning, Fault-tolerant Flight Planning, Flight Path Planning</institution>
          ,
          <addr-line>Unified Planning Framework, PDDL</addr-line>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Universität der Bundeswehr München, Institute for Flight Systems</institution>
          ,
          <addr-line>Werner-Heisenberg-Weg 39, 85579 Neubiberg</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2022</year>
      </pub-date>
      <abstract>
        <p>This paper reports the ambitions of an ongoing work intended to exploit the Unified Planning Framework (UPF) to enhance and extend a flight path planning system we developed using an automated planner to compute flight trajectories in non-nominal situations. We identify i) multiple benefits to draw using UPF, specifically to overcome the shortcomings of our previous implementation and ii) possible extensions of the flight path planning system thanks to the functions the UPF ofers.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>1. Introduction</title>
      <p>
        For more sustainable mobility solutions, the next generation aircraft is expected to reduce
emissions significantly during flights while providing a better overall aircraft performance and
safety [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. In line with this, future intelligent flight systems are required to adapt to varying
conditions, to the system’s dynamics, and to handle faults while keeping the pilot informed.
A fault-tolerant flight path planning system is an essential part of an intelligent flight system.
In addition to increasing fuel eficiency, it is also expected to reduce damage and casualties in
emergency situations caused by unforeseen events, e.g. faulty mechanics or human errors 1.
      </p>
      <p>
        In the previous work [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], an automated flight path planning system was developed to assist
the pilot in a single-pilot ultralight aircraft. The system was implemented using a PDDL+
compatible automated planner [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], which uses a forward state-space search and heuristics
capable of coping with non-linear mathematical operations. In this paper, we report an ongoing
work aimed at extending the previous work, by exploring the benefits of the UPF [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. We first
provide a brief summary of the previous work, followed by an overview of the adapted system
nEvelop-O
(J. J. Kiam)
CEUR
Workshop
Proceedings
medical requirements [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ].
architecture and underline the expected benefits of exploiting the UPF. Subsequently, we discuss
the ongoing progress and challenges faced, alongside with the future work considered.
      </p>
    </sec>
    <sec id="sec-2">
      <title>2. Exploring the UPF for the Flight Path Planning System</title>
      <p>(a) Automated fault-tolerant flight path
planning with ENHSP.</p>
      <p>(b) A more flexible flight path planning system with
the UPF</p>
      <p>
        The aim of the automated fault-tolerant flight path planning system is to determine a flight
trajectory meant to guide an aircraft (e.g. a single-pilot ultralight in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]) from its current position
to a goal position placed within the vicinity of a safe landing area. This is helpful especially
when the pilot is overwhelmed, typically when an emergency landing is required due to low-fuel
level, or to a mechanical fault. Figure 1a illustrates the architecture adopted in the previous
work [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], in which the automated flight-path planning system considers weather information
known at planning time2, the current state (i.e. position and fault detection state variables) of
the aircraft, and the goal position, all encoded as part of the (PDDL+) problem instance. The
aircraft’s physical model is encoded as a problem domain adapted from [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ]. The ENHSP planner
solver [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] is exploited to compute an executable temporal plan  =&lt;  0( 0),  1( 1), ⋯ ,   (  ) &gt;,
with each  ∗ representing a set of control parameters, namely the turn rate and the climb rate,
which will be used to predict the sequence of waypoints &lt;  0( 0),  1( 1), ⋯ ,   (  ) &gt;, setting
therefore a feasible reference trajectory for the autopilot to guide the airplane, in case the pilot
is incapable of steering the aircraft. A learning module built on k-means clustering is part of the
planning system to determine the optimal planning parameters for non-nominal situations (i.e.
emergency landing with low fuel or maneuvering a faulty aircraft) using flight data generated
from flight simulations, for tuning the ENHSP planner solver, as well as for selecting the ranges
of the state variables in the planning problem, in order to simplify the search [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ].
      </p>
      <p>
        Nevertheless, there are several shortcomings worth mentioning in the previous works [
        <xref ref-type="bibr" rid="ref4 ref9">4, 9</xref>
        ].
To call the ENHSP planner solver, another bash instance is created within the flight path
planning system, and run as an external process, limiting therefore the interaction with the
planner solver. Furthermore, minimum changes in the problem instance, due to either a new
2The weather information used is from the National Oceanic and Atmospheric Administration (NOAA) [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ].
goal condition, e.g. if a better landing area is detected, or to minimal changes in the weather
information, the problem domain and instance have to be parsed and grounded entirely, which
can be time-consuming for a more complex problem model. Therefore, we have identified the
UPF as a more compact and eficient framework that can overcome these shortcomings, and
ofer more meaningful extensions to the fault-tolerant flight path planning system.
      </p>
      <sec id="sec-2-1">
        <title>2.1. The Unified Planning Framework (UPF)</title>
        <p>
          The UPF [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] is a collaborative efort under development within the AIPlan4EU project, with the
purpose of providing flexibility in the planning problem definition (similar to Tarski [
          <xref ref-type="bibr" rid="ref10">10</xref>
          ]) and
making a wide range of planning technologies accessible (similar to Planutils [
          <xref ref-type="bibr" rid="ref11">11</xref>
          ]), via their
integration as Python libraries within a single framework.
        </p>
      </sec>
      <sec id="sec-2-2">
        <title>2.2. Benefits of using UPF for the Flight Path Planning System</title>
        <p>
          Based on the published information and objectives of the UPF in [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ] and [
          <xref ref-type="bibr" rid="ref12">12</xref>
          ], we identified
some features of the UPF that can be exploited to develop a more flexible and integrated flight
path planning system, of which the architecture is as depicted in Figure 1b. The benefits drawn
from the UPF-based flight path planning system architecture are described below.
Overcoming the shortcomings of the previous work: Without having to invoke an external
bash process, it is more flexible to interact with the planning engines within the same Python
framework, which is particularly useful when we consider a human-in-the-loop planning system,
in which the pilot can modify a solution plan, for example by adding an intermediate waypoint.
In this case, the P l a n V a l i d a t o r can be called programmatically.
        </p>
        <p>
          A more prominent improvement the UPF will bring forth is the coping with a dynamic
environment, as it allows to change state variables programmatically without having to parse
the entire problem instance completely, reducing thereby the overall computational time. With
this flexible parsing, a partial planning problem containing typically weather data and airspace
constraints can be pre-encoded, later completed by the pilot (with goals or additional constraints),
who interacts with the flight path planning system via a cockpit user interface. Domain-specific
validator can check the pilot’s inputs for conflicts (with the constraints of the existing partial
problem) before including them into the planning problem. Having this implemented, the flight
path planning system will conform with the EASA Roadmap for the use of AI in a cockpit: the
system is pilot-centered, with AI playing an assisting role [
          <xref ref-type="bibr" rid="ref13">13</xref>
          ].
        </p>
        <p>Other potential extensions: To date, the only planner solver used for the (kinodynamic) flight
path planning problem at hand is ENHSP. The main hindrance in using other planners is the
lack of support for non-linear mathematical operations encoded in the problem domain. With
the parser of UPF supporting the encoding of non-linear mathematical operations, it is likely
that more planner solvers capable of solving this class of problem will be included in the UPF,
leading to the possibility of creating multiple planning instances in parallel for diferent planners
or for diferent heuristics of the same planner, emulating thereby “diverse planning” to obtain
multiple solutions that can be presented to the pilot for assisting him/her in decision-making.</p>
        <p>
          Since the current implementation relies only on one solver (ENHSP), plan repair, although can
be considered, can only be done externally to the AI planning module, and in a “programmatic”
and domain-specific manner, as in [
          <xref ref-type="bibr" rid="ref8">8</xref>
          ], where partial plans are “stitched” together by adding an
artificial “bridge” to ensure continuity between them. With the UPF, even if the planner solver
does not include plan repair capabilities, another planning engine can be used for repairing a
plan, which is relevant to our use case, given the dynamic environment, e.g. a no-fly-zone is
determined during flight due to detected moving objects nearby (such as drones, cranes, etc.).
        </p>
        <p>
          The learning module in the previous work was based on an unsupervised learning method,
with the aim to select the set of planning and control parameters to optimize the likelihood of a
safe landing in non-nominal situations. This learning module can be extended to include inverse
reinforcement learning to learn aircraft maneuvers from an experienced pilot in emergency
landing, and use these “pre-learned” maneuvers as actions in the planning problem. Having
planning libraries implemented in Python enables the exploitation of Python libraries such as
scikit-learn [
          <xref ref-type="bibr" rid="ref14">14</xref>
          ] or OpenAI Gym [
          <xref ref-type="bibr" rid="ref15">15</xref>
          ] within the same Python-based system.
        </p>
      </sec>
    </sec>
    <sec id="sec-3">
      <title>3. Discussion and Future Work</title>
      <p>
        Having identified the benefits of the UPF for our current flight path planning system that was
developed in Matlab in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] and in C++ in [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], we are currently working towards porting the
parser for weather data, the automated encoding of problem models, and the learning module
into Python3. As soon as the integration of PDDL+ syntax and global constraints, which have
been proven to be extremely handy in defining no-fly zones in a compact manner, is realized in
the UPF, the architecture shown in Figure 1b can be fully implemented without much adaptation
and its performance can be compared to the previous work. Subsequently, the improvements
and extension described in Section 2.2 can also be included.
      </p>
      <sec id="sec-3-1">
        <title>3.1. Future Work to Include Hierarchical Task Network Planning</title>
        <p>
          As pointed out in the “Future Work” of [
          <xref ref-type="bibr" rid="ref6">6</xref>
          ], hierarchical structures will be added into the UPF,
enabling thereby the solving of Hierarchical Task Network (HTN) planning problems. This will
further benefit the extension of the flight path planning system to an even more versatile flight
management system capable of assisting the pilot with tasks of higher abstraction levels3 while
simultaneously communicating a flight path plan to reach the desired goal location. With this
extension, not only that (high-level) task and motion planning can be supported by the same
framework and communicated to the pilot in a hierarchical manner (that is more comprehensible
for human cognition), plan and goal recognition can also be performed in an automated fashion
using HTN planning engines [
          <xref ref-type="bibr" rid="ref17">17</xref>
          ], resulting in a close-loop assisting system.
        </p>
      </sec>
    </sec>
    <sec id="sec-4">
      <title>4. Acknowledgments</title>
      <p>
        This work is done within the research group ”Intelligent Control of Highly Over-Actuated
Flight Systems” funded by Munich Aerospace and within the MOREALIS project funded by the
German Federal Ministry of Economic Afairs and Climate Action.
3Pilots are in general instructed with tasks that are hierarchical in nature, and abstract away minute details, as
domain-level knowledge is assumed [
        <xref ref-type="bibr" rid="ref16">16</xref>
        ].
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          [1]
          <string-name>
            <given-names>European</given-names>
            <surname>Union Aviation Safety Agency</surname>
          </string-name>
          ,
          <article-title>Study on the societal acceptance of urban air mobility in europe</article-title>
          ,
          <year>2021</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          [2]
          <string-name>
            <surname>A. De Voogt</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          <string-name>
            <surname>Chaves</surname>
            , E. Harden,
            <given-names>M.</given-names>
          </string-name>
          <string-name>
            <surname>Silvestre</surname>
            ,
            <given-names>P.</given-names>
          </string-name>
          <string-name>
            <surname>Gamboa</surname>
          </string-name>
          ,
          <article-title>Ultralight accidents in the us, uk, and portugal</article-title>
          ,
          <source>Safety</source>
          <volume>4</volume>
          (
          <year>2018</year>
          )
          <fpage>23</fpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          [3]
          <string-name>
            <given-names>European</given-names>
            <surname>Union Aviation Safety Agency</surname>
          </string-name>
          , Light sport aircraft,
          <year>2022</year>
          . Accessed:
          <fpage>2022</fpage>
          -10-18.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          [4]
          <string-name>
            <given-names>B. S.</given-names>
            <surname>León</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Kiam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Schulte</surname>
          </string-name>
          ,
          <article-title>Model-based automated flight path planning for an ultralight aircraft (</article-title>
          <year>2020</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          [5]
          <string-name>
            <given-names>E.</given-names>
            <surname>Scala</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Haslum</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Thiébaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Ramirez</surname>
          </string-name>
          ,
          <article-title>Interval-based relaxation for general numeric planning</article-title>
          ,
          <source>in: ECAI</source>
          <year>2016</year>
          , IOS Press,
          <year>2016</year>
          , pp.
          <fpage>655</fpage>
          -
          <lpage>663</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          [6]
          <string-name>
            <given-names>A. A.</given-names>
            <surname>Micheli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Alexandre</surname>
          </string-name>
          Bit-Monnot, al.,
          <article-title>Unified planning: A python library making planning technology accessible</article-title>
          ,
          <source>in: International Conference on Automated Planning and Scheduling: System Demonstrations</source>
          ,
          <year>2022</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          [7]
          <string-name>
            <given-names>G.</given-names>
            <surname>Rutledge</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Alpert</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Ronald</surname>
          </string-name>
          ,
          <string-name>
            <surname>B. Lawrence,</surname>
          </string-name>
          <article-title>The noaa operational model archive and distribution system (nomads) (</article-title>
          <year>2003</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          [8]
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Kiam</surname>
          </string-name>
          , E. Scala,
          <string-name>
            <given-names>M. R.</given-names>
            <surname>Javega</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Schulte</surname>
          </string-name>
          ,
          <article-title>An ai-based planning framework for haps in a time-varying environment</article-title>
          ,
          <source>in: Proceedings of the International Conference on Automated Planning and Scheduling</source>
          , volume
          <volume>30</volume>
          ,
          <year>2020</year>
          , pp.
          <fpage>412</fpage>
          -
          <lpage>420</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          [9]
          <string-name>
            <given-names>B. S.</given-names>
            <surname>León</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J. J.</given-names>
            <surname>Kiam</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Schulte</surname>
          </string-name>
          ,
          <article-title>A fault-tolerant automated flight path planning system for an ultralight aircraft</article-title>
          , in: M.
          <string-name>
            <surname>Baldoni</surname>
          </string-name>
          , S. Bandini (Eds.),
          <source>AIxIA 2020 - Advances in Artificial Intelligence</source>
          , Springer International Publishing, Cham,
          <year>2021</year>
          , pp.
          <fpage>175</fpage>
          -
          <lpage>190</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          [10]
          <string-name>
            <given-names>M.</given-names>
            <surname>Ramırez</surname>
          </string-name>
          , G. Frances, Tarski, URL https://github. com/aig-upf/tarski. Accessed on (
          <year>2021</year>
          )
          <fpage>05</fpage>
          -
          <lpage>17</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          [11]
          <string-name>
            <given-names>S.</given-names>
            <surname>J. K. M. Muise Christian</surname>
          </string-name>
          , Pommerening Florian,
          <article-title>Planutils: Bringing planning to the masses</article-title>
          ,
          <source>International Conference on Automated Planning and Scheduling: System Demonstrations</source>
          (
          <year>2022</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          [12]
          <string-name>
            <given-names>A.</given-names>
            <surname>Micheli</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Arnold</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Bit-Monnot</surname>
          </string-name>
          ,
          <article-title>and other contributors, Unified-planning documentation</article-title>
          , https://unified-planning.readthedocs.io/en/latest/,
          <year>2022</year>
          . Accessed:
          <fpage>2022</fpage>
          -10-21.
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          [13]
          <string-name>
            <given-names>European</given-names>
            <surname>Union Aviation Safety</surname>
          </string-name>
          <article-title>Agency (EASA), Artifial intelligence roadmap: A humancentric approach to ai in aviation</article-title>
          ,
          <year>2020</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          [14]
          <string-name>
            <given-names>F.</given-names>
            <surname>Pedregosa</surname>
          </string-name>
          ,
          <string-name>
            <given-names>G.</given-names>
            <surname>Varoquaux</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Gramfort</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Michel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>B.</given-names>
            <surname>Thirion</surname>
          </string-name>
          ,
          <string-name>
            <given-names>O.</given-names>
            <surname>Grisel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Blondel</surname>
          </string-name>
          ,
          <string-name>
            <given-names>P.</given-names>
            <surname>Prettenhofer</surname>
          </string-name>
          ,
          <string-name>
            <given-names>R.</given-names>
            <surname>Weiss</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Dubourg</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Vanderplas</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Passos</surname>
          </string-name>
          ,
          <string-name>
            <given-names>D.</given-names>
            <surname>Cournapeau</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Brucher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>M.</given-names>
            <surname>Perrot</surname>
          </string-name>
          , E. Duchesnay,
          <article-title>Scikit-learn: Machine learning in Python</article-title>
          ,
          <source>Journal of Machine Learning Research</source>
          <volume>12</volume>
          (
          <year>2011</year>
          )
          <fpage>2825</fpage>
          -
          <lpage>2830</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          [15]
          <string-name>
            <given-names>G.</given-names>
            <surname>Brockman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>V.</given-names>
            <surname>Cheung</surname>
          </string-name>
          ,
          <string-name>
            <given-names>L.</given-names>
            <surname>Pettersson</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schneider</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Schulman</surname>
          </string-name>
          ,
          <string-name>
            <given-names>J.</given-names>
            <surname>Tang</surname>
          </string-name>
          , W. Zaremba, Openai gym,
          <source>arXiv preprint arXiv:1606.01540</source>
          (
          <year>2016</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref16">
        <mixed-citation>
          [16]
          <string-name>
            <given-names>Cessna</given-names>
            <surname>Aircraft</surname>
          </string-name>
          <string-name>
            <surname>Company</surname>
          </string-name>
          ,
          <article-title>Cessna 172 1974 skyhawk owner's manual: Pilot operating handbook (poh) / aircraft flight manual (afm</article-title>
          ),
          <source>Independently Published</source>
          ,
          <year>1972</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref17">
        <mixed-citation>
          [17]
          <string-name>
            <given-names>D.</given-names>
            <surname>Höller</surname>
          </string-name>
          , G. Behnke,
          <string-name>
            <given-names>P.</given-names>
            <surname>Bercher</surname>
          </string-name>
          ,
          <string-name>
            <given-names>S.</given-names>
            <surname>Biundo</surname>
          </string-name>
          ,
          <article-title>Plan and goal recognition as htn planning</article-title>
          ,
          <source>in: 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI)</source>
          , IEEE,
          <year>2018</year>
          , pp.
          <fpage>466</fpage>
          -
          <lpage>473</lpage>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>