Risk-aware graph search with dynamic edge cost discovery

Author:

Chung Jen Jen1ORCID,Smith Andrew J2,Skeele Ryan3,Hollinger Geoffrey A2

Affiliation:

1. Eidgenössische Technische Hochschule Zürich, Switzerland

2. Oregon State University, USA

3. Spectrum Geomatix, USA

Abstract

In this paper, we introduce a novel algorithm for incorporating uncertainty into lookahead planning. Our algorithm searches through connected graphs with uncertain edge costs represented by known probability distributions. As a robot moves through the graph, the true edge costs of adjacent edges are revealed to the planner prior to traversal. This locally revealed information allows the planner to improve performance by predicting the benefit of edge costs revealed in the future and updating the plan accordingly in an online manner. Our proposed algorithm, risk-aware graph search (RAGS), selects paths with high probability of yielding low costs based on the probability distributions of individual edge traversal costs. We analyze RAGS for its correctness and computational complexity and provide a bounding strategy to reduce its complexity. We then present results in an example search domain and report improved performance compared with traditional heuristic search techniques. Lastly, we implement the algorithm in both simulated missions and field trials using satellite imagery to demonstrate the benefits of risk-aware planning through uncertain terrain for low-flying unmanned aerial vehicles.

Funder

Office of Naval Research

National Aeronautics and Space Administration

Publisher

SAGE Publications

Subject

Applied Mathematics,Artificial Intelligence,Electrical and Electronic Engineering,Mechanical Engineering,Modeling and Simulation,Software

Cited by 19 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Multi-Sample Long Range Path Planning under Sensing Uncertainty for Off-Road Autonomous Driving;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13

2. Generating Sparse Probabilistic Graphs for Efficient Planning in Uncertain Environments;2024 IEEE International Conference on Robotics and Automation (ICRA);2024-05-13

3. ANMIP: Adaptive Navigation based on Mutual Information Perception in Uncertain Environments;2023 IEEE International Conference on Robotics and Biomimetics (ROBIO);2023-12-04

4. SocialMapf: Optimal and Efficient Multi-Agent Path Finding With Strategic Agents for Social Navigation;IEEE Robotics and Automation Letters;2023-06

5. Contextual Multi-Objective Path Planning;2023 IEEE International Conference on Robotics and Automation (ICRA);2023-05-29

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3