NASA NTRS · 20060029147
The swath segment selection problem: extending AI search techniques to a novel real-world problem
Abstract
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Knight, R., Smith, B.. 2003-08-15. The swath segment selection problem: extending AI search techniques to a novel real-world problem. https://ntrs.nasa.gov/citations/20060029147
Cite the original work for its findings. Save a collection to share your selection of sources.