IRIS incrementally densifies sampling-based roadmaps and applies near-optimal graph search to produce inspection plans that asymptotically converge to optimal while running orders of magnitude faster than prior methods.
A survey and annotated bibliography of multiobjective combinatorial optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search
IRIS incrementally densifies sampling-based roadmaps and applies near-optimal graph search to produce inspection plans that asymptotically converge to optimal while running orders of magnitude faster than prior methods.