被曝を意識した経路計画:等被曝回廊の提案
Exposure Conscious Path Planning for Equal Exposure Corridors
環境全体への視線露出を最小化する経路計画は非マルコフ的で厳密解が難しいことを示し、A*の最適性ギャップや近似ヒューリスティクスの計算時間とのトレードオフを分析、露出を増やさない全経路を多項式時間で求められる等被曝回廊の概念を提案した。
著者: Eugene T. Hamzezadeh, John G. Rogers, Neil T. Dantam, Andrew J. Petruska
分類: cs.RO
原文アブストラクト
While maximizing line-of-sight coverage of specific regions or agents in the environment is a well-explored path planning objective, the converse problem of minimizing exposure to the entire environment during navigation is especially interesting in the context of minimizing detection risk. This work demonstrates that minimizing line-of-sight exposure to the environment is non-Markovian, which cannot be efficiently solved optimally with traditional path planning. The optimality gap of the graph-search algorithm A* and the trade-offs in optimality vs. computation time of several approximating heuristics is explored. Finally, the concept of equal-exposure corridors, which afford polynomial time determination of all paths that do not increase exposure, is presented.
