MINDPT: a code for minimizing detection probability up to a given time away from a sabotage target
Technical Report
·
OSTI ID:5161829
This report documents a subroutine designed for use by safeguards analysts in determining good physical routes for a saboteur to follow in a fixed-site facility. The mathematical criterion used in MINDPT is based on the idea that a saboteur should minimize his probability of detection until he is so close to the target that it is too late for defensive forces to respond to an alarm and interrupt the adversary's activities. Dijkstra's algorithm for shortest paths is applied several times to a graph weighted with both delay times and detection probabilities. The paths obtained by MINDPT minimize detection probability from off-site up to a locus of points a given time away from a target and minimize time from the locus to the target. By varying the given time (thought of as a guard-response time) from zero upward the analyst can determine an entire spectrum of paths to a target, ranging from those that minimize only detection probability through those that have two segments as mentioned above to those that minimize time only.
- Research Organization:
- Sandia Labs., Albuquerque, N.Mex. (USA)
- DOE Contract Number:
- EY-76-C-04-0789
- OSTI ID:
- 5161829
- Report Number(s):
- SAND-77-2039
- Country of Publication:
- United States
- Language:
- English
Similar Records
POST: a subroutine for Path Ordering of Sabotage Targets
SPTH3: subroutine for finding shortest sabotage paths
Adversary pathfinding
Technical Report
·
Thu Jan 31 23:00:00 EST 1980
·
OSTI ID:5352881
SPTH3: subroutine for finding shortest sabotage paths
Technical Report
·
Fri Jul 01 00:00:00 EDT 1977
·
OSTI ID:7089490
Adversary pathfinding
Conference
·
Tue Dec 31 23:00:00 EST 1985
·
OSTI ID:6140779