본문

서브메뉴

Numerical Methods for Discontinuous Remote Sensing Coverage Analysis
Numerical Methods for Discontinuous Remote Sensing Coverage Analysis  / Jonathan Sipps
Numerical Methods for Discontinuous Remote Sensing Coverage Analysis

상세정보

자료유형  
 학위논문 서양
최종처리일시  
20260311091532.5
ISBN  
9798270231552
DDC  
518
저자명  
Sipps, Jonathan
서명/저자  
Numerical Methods for Discontinuous Remote Sensing Coverage Analysis / Jonathan Sipps
발행사항  
[Sl] : The University of Texas at Austin, 2025
형태사항  
1 electronic resource (284 pages)
주기사항  
Source: Dissertations Abstracts International, Volume: 87-06, Section: B.
주기사항  
Advisors: Magruder, Lori Committee members: Fridovich-Keil, David; Frank, Jeremy; Bettadpur, Srinivas; Ann Chen, Jingyi.
학위논문주기  
- Ph.D. : The University of Texas at Austin, 2025.
초록/해제  
요약Distributed Spacecraft Missions (DSMs) have the potential to revolutionize Earth observation through increased spatial, temporal, spectral, and radiometric data resolution, but iterating over all possible mission architectures to identify a "best" candidate presents a novel computational challenge. Dominant elements in the trade space are orbit design, instrument choice, the number of satellites, and the DSM (or constellation) structure, each of which may have multiple options, which increases trade space size combinatorically. Compounding this complexity is the need to satisfy multiple objectives at once, balancing the total and consistent coverage of Earth. Evolutionary algorithms can search the trade space intelligently but they require many simulation evaluations to approximate the typically multi-objective pareto front. We have developed an efficient semi-analytic routine, to compute the access events of Earth-based targets for circular, low Earth orbit remote sensing platforms, which is from 1 to 4 orders of magnitude faster than competing state-of-the-art methods, due to low algorithm complexity with respect to simulation period and instrument swath size. Exhaustive search over all orbital revolutions is replaced with a hash-based vector search, which instantly queries the orbital revolution of target observation. The technique further has relaxed assumptions such as the need for repeating ground tracks or simplified constellation structures commonly found in literature. In addition, we have formalized the observation of probabilistic targets, particularly useful for sub-sampled coverage, as applied to lidar or small swath coverage, or coverage of geophysically obscured targets, such as under cloud cover or dense vegetation. We leverage Monte Carlo to evaluate the count of probabilistic target observations, the probability of at least one observation, and the stochastic revisit interval, extensible to a field of spatial targets. Coupled with relevant geophysical datasets, we apply these techniques to reveal the optimal inclination of a bathymetric space-borne lidar to be 110 deg. Then we find the optimal distribution of satellites in sun-synchronous vs. inclined orbital regimes to optimally observe global wildfire at night. Lower per-evaluation runtime via a novel semi-analytic routine, coupled with data-driven coverage, give mission planners a tool to meet the computational demands of DSM design, exploring the wide array of options to meet the National Academies Decadal Survey science objectives.
언어주기  
English
일반주제명  
Geophysics
일반주제명  
Geographic information science
일반주제명  
Remote sensing
일반주제명  
Theoretical physics
키워드  
Distributed Spacecraft Missions
키워드  
Earth observation
키워드  
Orbit design
키워드  
Semi-analytic routine
기타저자  
The University of Texas at Austin Aerospace Engineering
기본자료저록  
Dissertations Abstracts International. 87-06B.
전자적 위치 및 접속  
로그인 후 원문을 볼 수 있습니다.

MARC

 008260311s2025        us                                    eng  d
■001000017361191
■00520260311091532.5
■006m          o    d                
■007cr|nu||||||||
■020    ▼a9798270231552
■040    ▼aMiAaPQD▼beng▼cMiAaPQD▼erda
■082    ▼a518
■1001  ▼aSipps,  Jonathan▼eauthor.
■24510▼aNumerical  Methods  for  Discontinuous  Remote  Sensing  Coverage  Analysis  ▼cJonathan  Sipps
■260    ▼a[Sl]▼bThe  University  of  Texas  at  Austin▼c2025
■264  1▼aAnn  Arbor▼bProQuest  Dissertations  &  Theses▼c2025
■300    ▼a1  electronic  resource  (284  pages)
■336    ▼atext▼btxt▼2rdacontent
■337    ▼acomputer▼bc▼2rdamedia
■338    ▼aonline  resource▼bcr▼2rdacarrier
■500    ▼aSource:  Dissertations  Abstracts  International,  Volume:  87-06,  Section:  B.
■500    ▼aAdvisors:  Magruder,  Lori    Committee  members:  Fridovich-Keil,  David;  Frank,  Jeremy;  Bettadpur,  Srinivas;  Ann  Chen,  Jingyi.
■5021  ▼bPh.D.▼cThe  University  of  Texas  at  Austin▼d2025.
■520    ▼aDistributed  Spacecraft  Missions  (DSMs)  have  the  potential  to  revolutionize  Earth  observation  through  increased  spatial,  temporal,  spectral,  and  radiometric  data  resolution,  but  iterating  over  all  possible  mission  architectures  to  identify  a  "best"  candidate  presents  a  novel  computational  challenge.  Dominant  elements  in  the  trade  space  are  orbit  design,  instrument  choice,  the  number  of  satellites,  and  the  DSM  (or  constellation)  structure,  each  of  which  may  have  multiple  options,  which  increases  trade  space  size  combinatorically.  Compounding  this  complexity  is  the  need  to  satisfy  multiple  objectives  at  once,  balancing  the  total  and  consistent  coverage  of  Earth.  Evolutionary  algorithms  can  search  the  trade  space  intelligently  but  they  require  many  simulation  evaluations  to  approximate  the  typically  multi-objective  pareto  front.  We  have  developed  an  efficient  semi-analytic  routine,  to  compute  the  access  events  of  Earth-based  targets  for  circular,  low  Earth  orbit  remote  sensing  platforms,  which  is  from  1  to  4  orders  of  magnitude  faster  than  competing  state-of-the-art  methods,  due  to  low  algorithm  complexity  with  respect  to  simulation  period  and  instrument  swath  size.  Exhaustive  search  over  all  orbital  revolutions  is  replaced  with  a  hash-based  vector  search,  which  instantly  queries  the  orbital  revolution  of  target  observation.  The  technique  further  has  relaxed  assumptions  such  as  the  need  for  repeating  ground  tracks  or  simplified  constellation  structures  commonly  found  in  literature.  In  addition,  we  have  formalized  the  observation  of  probabilistic  targets,  particularly  useful  for  sub-sampled  coverage,  as  applied  to  lidar  or  small  swath  coverage,  or  coverage  of  geophysically  obscured  targets,  such  as  under  cloud  cover  or  dense  vegetation.  We  leverage  Monte  Carlo  to  evaluate  the  count  of  probabilistic  target  observations,  the  probability  of  at  least  one  observation,  and  the  stochastic  revisit  interval,  extensible  to  a  field  of  spatial  targets.  Coupled  with  relevant  geophysical  datasets,  we  apply  these  techniques  to  reveal  the  optimal  inclination  of  a  bathymetric  space-borne  lidar  to  be  110  deg.  Then  we  find  the  optimal  distribution  of  satellites  in  sun-synchronous  vs.  inclined  orbital  regimes  to  optimally  observe  global  wildfire  at  night.  Lower  per-evaluation  runtime  via  a  novel  semi-analytic  routine,  coupled  with  data-driven  coverage,  give  mission  planners  a  tool  to  meet  the  computational  demands  of  DSM  design,  exploring  the  wide  array  of  options  to  meet  the  National  Academies  Decadal  Survey  science  objectives.
■546    ▼aEnglish
■590    ▼aSchool  code:  0227
■650  4▼aGeophysics
■650  4▼aGeographic  information  science
■650  4▼aRemote  sensing
■650  4▼aTheoretical  physics
■653    ▼aDistributed  Spacecraft  Missions
■653    ▼aEarth  observation
■653    ▼aOrbit  design
■653    ▼aSemi-analytic  routine
■7102  ▼aThe  University  of  Texas  at  Austin▼bAerospace  Engineering.▼edegree  granting  institution.
■7201  ▼aMagruder,  Lori▼edegree  supervisor.
■7730  ▼tDissertations  Abstracts  International▼g87-06B.
■85640▼uhttp://www.riss.kr/pdu/ddodLink.do?id=T17361191▼nKERIS▼z이  자료의  원문은  한국교육학술정보원에서  제공합니다.

미리보기

내보내기

chatGPT토론

Ai 추천 관련 도서


    신착도서 더보기
    최근 3년간 통계입니다.

    소장정보

    • 예약
    • 소재불명신고
    • 나의폴더
    • 우선정리요청
    • 비도서대출신청
    • 야간 도서대출신청
    소장자료
    등록번호 청구기호 소장처 대출가능여부 대출정보
    TF17818 전자도서 대출가능 마이폴더 부재도서신고 비도서대출신청 야간 도서대출신청

    * 대출중인 자료에 한하여 예약이 가능합니다. 예약을 원하시면 예약버튼을 클릭하십시오.

    해당 도서를 다른 이용자가 함께 대출한 도서

    관련 인기도서

    로그인 후 이용 가능합니다.