The swath segment selection problem: extending AI search techniques to a novel real-world problem

摘要

We introduce the Swath Segment Selection problem (SSSP). The SSSP consists of a constrained geometric covering problem and a capacitated resource problem. It comes from the real-life problem of scheduling on- and off-times for air or space-borne instruments that image a target by flying over and collecting a swath of information.