通过高低可见点权衡路径成本与信息获取,提升不确定环境导航效率。
Navigating in Uncertain Environments with Heterogeneous Visibility
- 基于不同可见度节点设计启发式算法,优化路径与观测收益之和。
- 相比不考虑观测的最短路径,平均路径成本更低;计算开销呈指数级降低。
- 仅调一个超参数即可适配多种场景,适合复杂地形导航任务。
在连接性不确定的环境中导航,需在路径代价与信息获取之间取得平衡。不同于依赖局部感知的方法,本文提出一种框架,其中节点具有不同可见度,可在特定位置观测远距离边。我们设计了一种新型启发式算法,权衡前往高可见点的绕行成本与信息收益,通过优化自定义观测奖励与路径成本之和实现。引入技术对大量环境实现采样最短路径,用于评估边的观测价值并快速估算最高收益路径。该方法仅通过调节单一超参数即可适应多种场景。在基于真实地形数据的地图上测试,结果表明其平均路径成本低于不考虑观测的最短路径基线,且相比已有兼顾观测与成本的方法,计算开销呈指数级降低。
原文摘要 · Abstract (English)
Navigating an environment with uncertain connectivity requires a strategic balance between minimizing the cost of traversal and seeking information to resolve map ambiguities. Unlike previous approaches that rely on local sensing, we utilize a framework where nodes possess varying visibility levels, allowing for observation of distant edges from certain vantage points. We propose a novel heuristic algorithm that balances the cost of detouring to high-visibility locations against the gain in information by optimizing the sum of a custom observation reward and the cost of traversal. We introduce a technique to sample the shortest path on numerous realizations of the environment, which we use to define an edge's utility for observation and to quickly estimate the path with the highest reward. Our approach can be easily adapted to a variety of scenarios by tuning a single hyperparameter that determines the importance of observation. We test our method on a variety of uncertain navigation tasks, including a map based on real-world topographical data. The method demonstrates lower mean cost of traversal compared to a shortest path baseline that does not consider observation and has exponentially lower computational overhead compared to an existing method for balancing observation with path cost minimization.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。