<!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>Reasoning About Large Places</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>Bernd Krieg-Bruckner</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
          <xref ref-type="aff" rid="aff1">1</xref>
        </contrib>
        <contrib contrib-type="author">
          <string-name>Hui Shi</string-name>
          <email>shig@informatik.uni-bremen.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>SFB/TR8 Spatial Cognition, Universitat Bremen</institution>
          ,
          <country country="DE">Germany</country>
        </aff>
        <aff id="aff1">
          <label>1</label>
          <institution>Small Places as Decision Points in Route Graphs</institution>
        </aff>
      </contrib-group>
      <fpage>4</fpage>
      <lpage>6</lpage>
      <abstract>
        <p>To support natural interactive way- nding tasks, computational formalisms of places are needed. In this extended abstract we present the idea of conceptual route graphs, which represent places using decision points, local route graphs and directional relations for modelling places in di erent way- nding situations. The application of formal spatial representations allows formal spatial reasoning about places, in particular deductions with qualitative calculi.</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>Large Places with Local Route Graphs</title>
      <p>Here, we extend the above notions for \small" places, suitable for reasoning about
decision points in a network, e.g. in a corridor-like situation, with a framework
for \large" places that have a sizable extent, such that, to reach an outgoing
from an incoming route segment, one has to \cross" the (supposedly vacuous)
place, walk around its perimeter (as for a tra c circle), or do some even more
complicated micro-navigation. First, we consider large places which cover a
wellde ned area (that constitutes a region in itself) with a border. We classify such
large places according to their accessibility (and resulting navigability), e.g.:
open the area is an open navigable space, allowing cross-cuts;
closed the central area is closed, navigation is only possible around the
perimeter (e.g. a tra c circle);
complex navigability is more complex (e.g. a tra c circle with an island, such
that navigation around the perimeter permits occasional access to the island,
which is a nested open space allowing cross-cuts).</p>
      <p>
        In either case we may represent the large place by a local route graph that
re nes the place (as seen at a higher level of abstraction) into a route graph
with a \higher resolution" for micro-navigation; incoming and outgoing route
segments are connected to this local route graph such that it allows a transition
from each incoming to every outgoing route segment (this condition has been
speci ed for route graph re nements in [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ]).
      </p>
      <p>An open place is represented by a route graph that includes all possible
connections of incoming to outgoing segments cutting across the open space;
a closed place by a linear route graph representing the perimeter (mono- or
bidirectional). The dynamic situation of a person being \in the middle" of an open
space can be handled by a (dynamically moving) extra place representing the
pose (position and orientation) of this person, with route segments connecting
to (incoming and) outgoing segments.
3</p>
    </sec>
    <sec id="sec-2">
      <title>Direction Relations for Large Places</title>
      <p>
        As an alternative to route descriptions, human way- nding tasks often specify
locations of salient landmarks in an open space. A recent experiment showed that
such scene descriptions improve visualization, memorization and way- nding
success, in an indoor environment [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ]. Combining route descriptions with location
speci cations is required for navigation tasks in an environment containing large
places where route graphs do not exist or are less explicit: from an incoming
route ending at an exit location in the perimeter of a large place, navigation
will be continued using a place description leading to an entry location of an
outgoing route segment.
      </p>
      <p>
        A place description comprises landmarks and directional relations. Since
DDC is a model of relations between three points, or between a point and a
directed route segment, and does not capture relations between objects with
spatial extent, new models are needed for the formal representation of
directional relations. For example, Goyal and Egenhofer's direction-relation matrix
[
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], Skiadopoulos and Koubarakis' projection based cardinal directional relations
[
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], or Kurata and Shi's heterogeneous cardinal direction [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ] are possible models
for representing and deducing directional relations between spatial objects.
4
      </p>
    </sec>
    <sec id="sec-3">
      <title>Conclusions</title>
      <p>To model places in human or cooperative human-robot way- nding tasks,
qualitative maps that integrate route graphs, point-based orientation models and
directional models for representing places are needed. Depending on the level of
abstraction, a place may be either, a decision point in a route graph, at which
reorientation is needed to connect incoming and outgoing route segments; after
re nement, a local route graph, which allows a transition from each incoming to
every outgoing route segment; or a large open place, where scene descriptions
are required to make the local connection.</p>
      <p>
        Extending the conceptual route graph developed in [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ] with directional
models for place descriptions poses a new challenge. The focus will be on the
connection of two route segments conjoined by a large place represented as a detailed
conceptual route graph or modelled via a set of directional relations between
spatial objects.
      </p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <given-names>C.</given-names>
            <surname>Freksa</surname>
          </string-name>
          .
          <article-title>Using orientation information for qualitative spatial reasoning</article-title>
          . In A. U. Frank,
          <string-name>
            <surname>I. Campari</surname>
          </string-name>
          , and U. Formentini, editors,
          <article-title>Theories and methods of spatio-temporal reasoning in geographic space</article-title>
          , volume
          <volume>639</volume>
          <source>of LNCS</source>
          , pages
          <volume>162</volume>
          {
          <fpage>178</fpage>
          . Springer, Berlin,
          <year>1992</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <given-names>R.</given-names>
            <surname>Goyal</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Egenhofer</surname>
          </string-name>
          .
          <article-title>Consistent queries over cardinal directions across di erent levels of detail</article-title>
          .
          <source>In 11th International Workshop on Database and Expert Systems Applications</source>
          , pages
          <volume>876</volume>
          {
          <fpage>880</fpage>
          ,
          <year>2000</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <given-names>B.</given-names>
            <surname>Krieg-Bru</surname>
          </string-name>
          ckner, U. Frese, K. Luttich, C. Mandel,
          <string-name>
            <given-names>T.</given-names>
            <surname>Mossakowski</surname>
          </string-name>
          , and
          <string-name>
            <given-names>R.</given-names>
            <surname>Ross</surname>
          </string-name>
          .
          <article-title>Speci cation of an Ontology for Route Graphs</article-title>
          . In C. Freksa,
          <string-name>
            <given-names>M.</given-names>
            <surname>Knau</surname>
          </string-name>
          , B. KriegBruckner, B. Nebel, and T. Barkowsky, editors,
          <source>Spatial Cognition IV: Reasoning</source>
          , Action, Interaction.
          <source>International Conference Spatial Cognition</source>
          <year>2004</year>
          , Frauenchiemsee, Germany,
          <year>October 2004</year>
          , Proceedings, pages
          <volume>390</volume>
          {
          <fpage>412</fpage>
          , Berlin, Heidelberg,
          <year>2005</year>
          . Springer.
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4. B.
          <article-title>Krieg-Bruckner and</article-title>
          <string-name>
            <given-names>H.</given-names>
            <surname>Shi</surname>
          </string-name>
          .
          <article-title>Orientation Calculi and Route Graphs: Towards Semantic Representations for Route Descriptions</article-title>
          . In M. Raubal,
          <string-name>
            <given-names>H.</given-names>
            <surname>Miller</surname>
          </string-name>
          ,
          <string-name>
            <given-names>A.</given-names>
            <surname>Frank</surname>
          </string-name>
          , and M. Goodchild, editors,
          <source>Geographic Information Science - Fourth International Conference, GIScience 2006, number 4197 in Lecture Notes in Computer Science</source>
          , pages
          <volume>234</volume>
          {
          <fpage>250</fpage>
          . Springer, Berlin,
          <year>2006</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <given-names>Y.</given-names>
            <surname>Kurata</surname>
          </string-name>
          and
          <string-name>
            <given-names>H.</given-names>
            <surname>Shi</surname>
          </string-name>
          .
          <article-title>Toward heterogeneous cardinal direction calculus</article-title>
          .
          <source>In Proceedings of the 32nd Annual German Conference on Arti cal Intelligence</source>
          , volume
          <volume>5803</volume>
          <source>of Lecture Notes in Arti cal Intelligence</source>
          ,
          <year>2009</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <given-names>V.</given-names>
            <surname>Mast</surname>
          </string-name>
          ,
          <string-name>
            <given-names>C.</given-names>
            <surname>Jian</surname>
          </string-name>
          , and
          <string-name>
            <given-names>D.</given-names>
            <surname>Zhekova</surname>
          </string-name>
          .
          <article-title>Elaborate descriptive information in indoor route instructions</article-title>
          .
          <source>In Cognitive Science</source>
          <year>2012</year>
          , to appear.
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <given-names>S.</given-names>
            <surname>Skiadopoulos</surname>
          </string-name>
          and
          <string-name>
            <given-names>M.</given-names>
            <surname>Koubarakis</surname>
          </string-name>
          .
          <article-title>Composing cardinal direction relations</article-title>
          .
          <source>Articial Intelligence</source>
          ,
          <volume>152</volume>
          (
          <issue>2</issue>
          ):
          <volume>143</volume>
          {
          <fpage>171</fpage>
          ,
          <year>February 2004</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>K.</given-names>
            <surname>Zimmermann</surname>
          </string-name>
          and
          <string-name>
            <given-names>C.</given-names>
            <surname>Freksa</surname>
          </string-name>
          .
          <article-title>Qualitative Spatial Reasoning Using Orientation, Distance, and Path Knowledge</article-title>
          .
          <source>Applied Intelligence</source>
          ,
          <volume>6</volume>
          (
          <issue>1</issue>
          ):
          <volume>49</volume>
          {
          <fpage>58</fpage>
          ,
          <year>1996</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>