Computer Science > Robotics
[Submitted on 12 Sep 2023 (v1), last revised 10 Apr 2024 (this version, v2)]
Title:Inspection planning under execution uncertainty
View PDF HTML (experimental)Abstract:Autonomous inspection tasks necessitate path-planning algorithms to efficiently gather observations from points of interest (POI). However, localization errors commonly encountered in urban environments can introduce execution uncertainty, posing challenges to successfully completing such tasks. Unfortunately, existing algorithms for inspection planning do not explicitly account for execution uncertainty, which can hinder their performance. To bridge this gap, we present IRIS-under uncertainty (IRIS-U^2), the first inspection-planning algorithm that offers statistical guarantees regarding coverage, path length, and collision probability. Our approach builds upon IRIS -- our framework for deterministic inspection planning, which is highly efficient and provably asymptotically-optimal. The extension to the much more involved uncertain setting is achieved by a refined search procedure that estimates POI coverage probabilities using Monte Carlo (MC) sampling. The efficacy of IRIS-U^2 is demonstrated through a case study focusing on structural inspections of bridges. Our approach exhibits improved expected coverage, reduced collision probability, and yields increasingly precise statistical guarantees as the number of MC samples grows. Furthermore, we demonstrate the potential advantages of computing bounded sub-optimal solutions to reduce computation time while maintaining statistical guarantees.
Submission history
From: Shmeul David Alpert [view email][v1] Tue, 12 Sep 2023 10:28:43 UTC (9,595 KB)
[v2] Wed, 10 Apr 2024 18:12:20 UTC (10,170 KB)
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.