A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Multiobjective Optimization for the Stochastic Physical Search Problem
[chapter]
2015
Lecture Notes in Computer Science
We model an intelligence collection activity as multiobjective optimization on a binary stochastic physical search problem, providing formal definitions of the problem space and nondominated solution sets. We present the Iterative Domination Solver as an approximate method for generating solution sets that can be used by a human decision maker to meet the goals of a mission. We show that our approximate algorithm performs well across a range of uncertainty parameters, with orders of magnitude
doi:10.1007/978-3-319-19066-2_21
fatcat:sbbnvkjnfzfuxpkrw2vypmauci