资源论文On Qualitative Route Descriptions: Representation and Computational Complexity

On Qualitative Route Descriptions: Representation and Computational Complexity

2019-11-12 | |  59 |   33 |   0
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. 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 in?uence of the agent model on the optimization and the processing of route instructions.

上一篇:Relating Carneades with Abstract Argumentation Bas van Gijzel Henry Prakken

下一篇:Translating First-Order Theories into Logic Programs

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...