Paper
13 August 2002 Stochastic search and graph techniques for MCM path planning
Christine Piatko, Christopher P. Diehl, Paul McNamee, Cheryl L. Resch, I-Jeng Wang
Author Affiliations +
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.
© (2002) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Christine Piatko, Christopher P. Diehl, Paul McNamee, Cheryl L. Resch, and I-Jeng Wang "Stochastic search and graph techniques for MCM path planning", Proc. SPIE 4742, Detection and Remediation Technologies for Mines and Minelike Targets VII, (13 August 2002); https://doi.org/10.1117/12.479130
Lens.org Logo
CITATIONS
Cited by 7 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Land mines

Mining

Stochastic processes

Algorithm development

Safety

Applied physics

Computer simulations

Back to Top