Skip to main content
Log in

On Qualitative Route Descriptions

Representation, Agent Models, and Computational Complexity

  • Published:
Journal of Philosophical Logic Aims and scope Submit manuscript

Abstract

The generation of route descriptions is a fundamental task of navigation systems. A particular problem in this context is to identify routes that can easily be described and processed by users. In this work, we present a framework for representing route networks with the qualitative information necessary to evaluate and optimize route descriptions with regard to ambiguities in them. We identify different agent models that differ in how agents are assumed to process route descriptions while navigating through route networks and discuss which agent models can be translated into PDL programs. Further, we analyze the computational complexity of matching route descriptions and paths in route networks in dependency of the agent model. Finally, we empirically evaluate the influence of the agent model on the optimization and the processing of route instructions.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. http://www.openstreetmap.org/

  2. http://www.everytrail.com/

References

  1. Bradfield, J., & Stirling, C. (2006). Modal mu-calculi. In: P. Blackburn, J. van Benthem, F. Wolter (Eds.) In The handbook of modal logic. . Elsevier, (pp. 721–756)

  2. Cai, J.-Y., Gundermann, T., Hartmanis, J., Hemachandra, L.A., Sewelson, V., Wagner, K., Wechsung, G. (1988). The Boolean hierarchy I: structural properties. SIAM Journal on Computing, 17 (6). 1232–1252.

  3. Diestel, R. (2010). Graph theory, 4th edn. Springer.

  4. Duckham, M., & Kulik, L. (2003). Simplest paths: automated route selection for navigation. In: W. Kuhn, M.F. Worboys, S. Timpf (Eds.) In Proceedings of the spatial information theory. Foundations of geographic information science, international conference, COSIT 2003. . Springer, (pp. 169–185)

  5. Duckham, M., Winter, S., Robinson, M. (2010). Including landmarks in routing instructions. Journal of Location Based Services, 4 (1), 28–52.

    Article  Google Scholar 

  6. Edelkamp, S., & Schrödl, S. (2003). Route planning and map inference with global positioning traces. In: R. Klein, H.-W. Six, L.M. Wegner (Eds.) In Computer science in perspective, essays dedicated to Thomas Ottmann. . Springer, (pp. 128–151)

  7. Fischer, M.J., & Ladner, R.E. (1979). Propositional dynamic logic of regular programs. Journal of Compututer and System Sciences, 18 (2), 194–211.

    Article  Google Scholar 

  8. Garey, M.R., Johnson, D.S., Stockmeyer, L.J. (1976). Some simplified NP-complete graph problems. Theoretical Computer Science, 1 (3), 237–267.

    Article  Google Scholar 

  9. Haque, S., Kulik, L., Klippel, A. (2006). Algorithms for reliable navigation and wayfinding. In: T. Barkowsky, M. Knauff, G. Ligozat, D. R. Montello (Eds.) In Spatial cognition. . Springer, (pp. 308–326)

  10. Harel, D., Kozen, D., Tiuryn, J. (2000). Dynamic logic. MIT Press.

  11. Karp, R.M. (1972). Reducibility among combinatorial problems. In: R.E. Miller, & J.W. Thatcher (Eds.) In Proceedings of a symposium on the Complexity of Computer Computations. . Plenum Press, New York, (pp. 85–103)

  12. Klippel, A., & Montello, D.R. (2007). Linguistic and nonlinguistic turn direction concepts. In: S. Winter, M. Duckham, L. Kulik, B. Kuipers (Eds.) In Proceedings of the spatial information theory, 8th international conference, COSIT 2007. . Springer, (pp. 354–372)

  13. Krieg-Brückner, B., Frese, U., Lüttich, K., Mandel, C., Mossakowski, T., Ross, R.J. (2004). Specification of an ontology for route graphs. In: C. Freksa, M. Knauff, B. Krieg-Brückner, B. Nebel, T. Barkowsky (Eds.) In Spatial cognition IV: reasoning, action, interaction, international conference spatial cognition 2004, revised selected papers. . Springer, (pp. 390–412)

  14. Kuipers, B. (2000). The spatial semantic hierarchy. Artificial Intelligence, 119 (1-2), 191–233.

    Article  Google Scholar 

  15. Lange, M. (2006). Model checking propositional dynamic logic with all extras. Journal of Applied Logic, 4 (1), 39–49.

    Article  Google Scholar 

  16. Mark, D.M. (1986). Automated route selection for navigation. Aerospace and Electronic Systems Magazine, 1 (9), 2–5.

    Article  Google Scholar 

  17. Papadimitriou, C.H., & Yannakakis, M. (1984). The complexity of facets (and some facets of complexity). Journal of Computer and System Sciences, 28 (2), 244–259.

    Article  Google Scholar 

  18. Pratt, V.R. (1980). Application of modal logic to programming. Studia Logica, 11 (2–3), 257–274.

    Article  Google Scholar 

  19. Renz, J., & Mitra, D. (2004). Qualitative direction calculi with arbitrary granularity. In: C. Zhang, H.W. Guesgen, W.-K. Yeap (Eds.) In Proceedings of the PRICAI 2004: trends in artificial intelligence, 8th pacific rim international conference on artificial intelligence. . Springer, (pp. 65–74)

  20. Renz, J., & Wölfl, S. (2010). A qualitative representation of route networks. In Proceedings of the ECAI 2010 - 19th European conference on artificial intelligence. . IOS Press, (pp. 1091–1092)

  21. Richter, K.-F., & Duckham, M. (2008). Simplest instructions: finding easy-to-describe routes for navigation. In: T.J. Cova, H.J. Miller, K Beard, A.U. Frank, M.F. Goodchild (Eds.) In Proceedings of the geographic information science, 5th international conference, GIScience 2008. . Springer, (pp. 274–289)

  22. Streett, R.S. (1982). Propositional dynamic logic of looping and converse is elementarily decidable. Information and Control, 54(1/2), 121–141.

    Article  Google Scholar 

  23. Westphal, M., & Renz, J. (2011). Evaluating and minimizing ambiguities in qualitative route instructions. In: I.F. Cruz, D. Agrawal, C.S. Jensen, E. Ofek, E. Tanin (Eds.) In Proceedings of the 19th ACM SIGSPATIAL international symposium on advances in geographic information systems, ACM-GIS 2011. . ACM, (pp. 171–180)

  24. Westphal, M., Wölfl, S., Nebel, B., Renz, J. (2011). On qualitative route descriptions: representation and computational complexity. In: T. Walsh (Ed.) In IJCAI 2011, Proceedings of the 22nd international joint conference on artificial intelligence, 2011. . IJCAI/AAAI, (pp. 1120–1125)

Download references

Acknowledgments

The authors thank the anonymous reviewers for helpful feedback and suggestions. Further, the authors are grateful to Julien Hué and Robert Mattmüller for fruitful discussions. This work was supported by DFG (SFB/TR8 Spatial Cognition, project R4-[LogoSpace]), an ARC Future Fellowship (FT0990811), and a joint Go8/DAAD project (D/08/13855).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Matthias Westphal.

Additional information

This article is a significantly extended version of the following conference paper: Matthias Westphal, Stefan Wölfl, Bernhard Nebel, and Jochen Renz. On Qualitative Route Descriptions: Representation and Computational Complexity. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 1120-1125. AAAI Press 2011.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Westphal, M., Wölfl, S., Nebel, B. et al. On Qualitative Route Descriptions. J Philos Logic 44, 177–201 (2015). https://doi.org/10.1007/s10992-014-9333-7

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10992-014-9333-7

Keywords

Navigation