非構造環境での待ち伏せゲームのためのランダム経路分布計画
Planning Random path distributions for ambush games in unstructured environments
敵対環境での車両運用のため、2人ゼロ和ゲームを線形計画法で解く計画手法を提案し、環境特性をよく表すネットワーク構築への拡張と従来計画手法との性能比較を行った。
著者: Emmanuel Boidot, Eric Feron
分類: cs.RO, cs.GT
原文アブストラクト
Operating vehicles in adversarial environments require non-conventional planning techniques. A two-player, zero-sum non-cooperative game is introduced, which is solved via a linear program. An extension is proposed to construct networks displaying good representations of the environment characteristics, while offering acceptable results for the technique used. Sensitivity of the solution to the LP solver algorithm is identified. The performances of the planner are finally assessed by comparison with those of conventional planners. Results are used to formulate secondary objectives to the problem.
