Loading...
Please wait, while we are loading the content...
Solving the swath segment selection problem
| Content Provider | NASA Technical Reports Server (NTRS) |
|---|---|
| Author | Knight, Russell Smith, Benjamin |
| Copyright Year | 2006 |
| Description | Several artificial-intelligence search techniques have been tested as means of solving the swath segment selection problem (SSSP) -- a real-world problem that is not only of interest in its own right, but is also useful as a test bed for search techniques in general. In simplest terms, the SSSP is the problem of scheduling the observation times of an airborne or spaceborne synthetic-aperture radar (SAR) system to effect the maximum coverage of a specified area (denoted the target), given a schedule of downlinks (opportunities for radio transmission of SAR scan data to a ground station), given the limit on the quantity of SAR scan data that can be stored in an onboard memory between downlink opportunities, and given the limit on the achievable downlink data rate. The SSSP is NP complete (short for "nondeterministic polynomial time complete" -- characteristic of a class of intractable problems that can be solved only by use of computers capable of making guesses and then checking the guesses in polynomial time). |
| File Size | 121376 |
| Page Count | 1 |
| File Format | |
| Alternate Webpage(s) | http://archive.org/details/NASA_NTRS_Archive_20110013119 |
| Archival Resource Key | ark:/13960/t47q3zf96 |
| Language | English |
| Publisher Date | 2006-09-01 |
| Access Restriction | Open |
| Subject Keyword | Documentation And Information Science Airborne Radar Swath Width Selection Scheduling Artificial Intelligence Remote Sensing Synthetic Aperture Radar Search Profiles Ntrs Nasa Technical Reports Server (ntrs) Nasa Technical Reports Server Aerodynamics Aircraft Aerospace Engineering Aerospace Aeronautic Space Science |
| Content Type | Text |
| Resource Type | Technical Report |
