Share Email Print

Proceedings Paper

Stochastic search and graph techniques for MCM path planning
Author(s): Christine Piatko; Christopher P. Diehl; Paul McNamee; Cheryl L. Resch; I-Jeng Wang
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We have been developing path planning techniques to look for paths that balance the utility and risk associated with different routes through a minefield. Such methods will allow a battlegroup commander to evaluate alternative route options while searching for low risk paths. A risk management framework can be used to describe the relative values of different factors such as risk versus time to objective, giving the commander the capability to balance path safety against other mission objectives. We will describe our recent investigations of two related path planning problems in this framework. We have developed a stochastic search technique to identify low risk paths that satisfy a constraint on the transit time. The objective is to generate low risk paths quickly so that the user can interactively explore the time-risk tradeoff. We will compare this with the related problem of finding the fastest bounded-risk path, and the potential use of dynamic graph algorithms to quickly find new paths as the risk bound is varied.

Paper Details

Date Published: 13 August 2002
PDF: 11 pages
Proc. SPIE 4742, Detection and Remediation Technologies for Mines and Minelike Targets VII, (13 August 2002); doi: 10.1117/12.479130
Show Author Affiliations
Christine Piatko, Johns Hopkins Univ. (United States)
Christopher P. Diehl, Johns Hopkins Univ. (United States)
Paul McNamee, Johns Hopkins Univ. (United States)
Cheryl L. Resch, Johns Hopkins Univ. (United States)
I-Jeng Wang, Johns Hopkins Univ. (United States)

Published in SPIE Proceedings Vol. 4742:
Detection and Remediation Technologies for Mines and Minelike Targets VII
J. Thomas Broach; Russell S Harmon; Gerald J. Dobeck, Editor(s)

© SPIE. Terms of Use
Back to Top