Region adjacency graph in sabotage studies
Technical Report
·
OSTI ID:7247233
Fixed-site safeguards systems have been modeled by weighted graphs (networks) in which shortest paths represent routes that are optimal for saboteurs. Realistic models involving hundreds of nodes and arcs can be efficiently solved by methods based on Dijkstra's algorithm. The greatest effort is in the preparation of the model. This report shows how the usual sabotage graphs can be greatly simplified for special cases in which all the arcs of a region have the same weight. The resulting model, a region adjacency graph, has many fewer nodes and arcs and consequently requires less effort for both model preparation and pathfinding. Since the arc weights really should vary within a region for physical reasons, this simplified technique should be viewed as approximate insofar as this variation is ignored.
- Research Organization:
- Sandia Labs., Albuquerque, N.Mex. (USA)
- DOE Contract Number:
- E(29-1)-789
- OSTI ID:
- 7247233
- Report Number(s):
- SAND-76-0574
- Country of Publication:
- United States
- Language:
- English
Similar Records
KSPTH: a subroutine for the K shortest paths in a sabotage graph
SPTH3: subroutine for finding shortest sabotage paths
MINDPT: a code for minimizing detection probability up to a given time away from a sabotage target
Technical Report
·
Mon Aug 01 00:00:00 EDT 1977
·
OSTI ID:7085571
SPTH3: subroutine for finding shortest sabotage paths
Technical Report
·
Fri Jul 01 00:00:00 EDT 1977
·
OSTI ID:7089490
MINDPT: a code for minimizing detection probability up to a given time away from a sabotage target
Technical Report
·
Wed Nov 30 23:00:00 EST 1977
·
OSTI ID:5161829