Engineering topics
Trowbridge, Michael
Publications and source records attributed to Trowbridge, Michael.
Area Coverage Planning with 3-axis Steerable, 2D Framing Sensors
Existing algorithms for Agile Earth Observing Satellites((Lemaitre et al. 2002)) were largely created for 1D line sensors that acquire images in linear swaths. However, imaging satellites increasingly use 2D framing sensors (cameras) that capture discrete rectangular images. We describe tiling step-stare approaches that are more suited to rectangular image footprints than are 1D swath-based algorithms. Optimal area planning for these 2D framing instruments is an NPcomplete problem and intractable for large areas, so we present four approximation algorithms. Strategies are compared against a prior 2D framing instrument algorithm (Knight 2014) in three computational experiments. The impact of observer agility on schedule makespan is examined. Makespans vary more as observer agility decreases toward a critical point, then vary less after the critical point, suggesting a possible problem phase transition.
Algorithms for area coverage planning with 3-axis steerable, 2D framing sensors
UNKNOWN
Intermediate Fidelity Solid State Recorder Modeling for NISAR
At 26Tb/day return average, NISAR (National Aero- nautics and Space Administration (NASA) and the In- dian Space Research Organization (ISRO) Synthetic Aperture Radar) will stress ground station facilities with a variable cadence of data generation observing nearly all of earth's land and ice to produce global time- series maps of cryospheric, solid-Earth and ecosystem phenomena. Between the instrument data generation source and downlink sink lies the primary science data bu er, the SSR (Solid State Recorder). The SSR has deferred, discrete le deletion events that occur only after a le is played back to all required ground segments (sometimes both NASA and ISRO). A forward dispatch, advancing frontier repropagation playback scheduler is proposed as a model of the SSR's greedy playback scheduling behavior. Schedules based on the existing low delity model and new intermediate delity model are compared to assess the impact of deferred, discrete deletion on planning. The low delity model is found to produce unfeasible schedules that exceed SSR capacity, causing 3.87% of all observations in a 12 day simulation to be removed by repair actions.
Heuristic Area Cost Estimation for Observational Coverage Schedulers
This paper presents a comparison of heuris- tics used to estimate the amount of time it would take for a spacecraft to image an area using Boustrophedon decomposition (Choset and Pignon 1998). Machine learning tech- niques are used to characterize algorithmic performance of coverage algorithms. It is shown that an ordinary least-squares linear model is among the most accurate in a set of constant and linear order regression models both in terms of memory consumption and schedule duration. These are demonstrated using the ASPEN planning system (Fukunaga et al. 1997) on the Eagle Eye domain.