首页 | 本学科首页   官方微博 | 高级检索  
     


Imprecise Navigation
Authors:Matt Duckham  Lars Kulik  Michael Worboys
Affiliation:(1) NCGIA, University of Maine, ME, 04469-5711, U.S.A
Abstract:Conventional models of navigation commonly assume a navigation agentrsquos location can be precisely determined. This paper examines the more general case, where an agentrsquos actual location cannot be precisely determined. This paper develops a formal model of navigation under imprecision using a graph. Two key strategies for dealing with imprecision are identified and defined: contingency and refinement. A contingency strategy aims to find an instruction sequence that maximizes an agentrsquos chances of reaching its destination. A refinement strategy aims to use knowledge gained as an agent moves through the network to disambiguate location. Examples of both strategies are empirically tested using a simulation with computerized navigation agents moving through a road network at different levels of locational imprecision. The results of the simulation indicate that both the strategies, contingency and refinement, applied individually can produce significant improvements in navigation performance under imprecision, at least at relatively fine granularities. Using both strategies in concert produced significant improvements in performance across all granularities.
Keywords:granularity  wayfinding  navigation agent  graph theory  indiscernibility
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号