Skip navigation
  • Home
  • Browse
    • Communities
      & Collections
    • Browse Items by:
    • Publication Date
    • Author
    • Title
    • Subject
    • Department
  • Sign on to:
    • My MacSphere
    • Receive email
      updates
    • Edit Profile


McMaster University Home Page
  1. MacSphere
  2. Open Access Dissertations and Theses Community
  3. Open Access Dissertations and Theses
Please use this identifier to cite or link to this item: http://hdl.handle.net/11375/29293
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorTharmarasa, Ratnasingham-
dc.contributor.authorChatterjee, Abhijit-
dc.date.accessioned2023-12-21T15:13:28Z-
dc.date.available2023-12-21T15:13:28Z-
dc.date.issued2023-
dc.identifier.urihttp://hdl.handle.net/11375/29293-
dc.description.abstractThe recent generation of Agile Earth Observation Satellite (AEOS) has emerged to be highly effective due to its increased attitude maneuvering capabilities. However, due to these increased degrees of freedom in maneuverability, the scheduling problem has become increasingly difficult than its non-agile predecessors. The AEOS scheduling problem consists of finding an optimal assignment of user-requested imaging tasks to the respective AEOSs in their orbits by satisfying the operational resource constraints in a specified time frame. Some of these tasks might require imaging the same area of interest (AOI) multiple times, while in some tasks, the AOIs are too large for the AEOS to image in a single attempt. Some tasks might even arise while the AEOSs are preoccupied with existing tasks. This thesis focuses on formulating the AEOS scheduling models where onboard energy and memory constraints while operating and the task specifications are diverse. A mixed-integer non-linear scheduling problem with a reward factor has been considered in order to handle multiple scan requirements for a task. Although initially, it is assumed that the AOIs are small, this work is extended to a three-stage optimization framework to handle the segmentation of large AOIs into smaller regions that can be imaged in a single scan. The uncertainty regarding scan failure is handled through a Markov Decision Process (MDP). These two proposed methods have significant benefits when tasks are available to schedule prior to the mission. However, they lack the flexibility to accommodate newly arrived tasks during the mission. When multiple new tasks arrive during the mission, predictive scheduling based on learning historical data of task arrivals is proposed, which can schedule tasks in an online manner faster than complete rescheduling and minimize disruption from the original schedule. Evolutionary optimization-based solution methodologies are proposed to solve these models and are validated with simulations.en_US
dc.language.isoen_USen_US
dc.subjectSatellite Schedulingen_US
dc.subjectEvolutionary algorithmen_US
dc.subjectAgile satelliteen_US
dc.subjectMDPen_US
dc.subjectPredictive Schedulingen_US
dc.subjectLearningen_US
dc.titleOffline-Online Multiple Agile Satellite Scheduling using Learning and Evolutionary Optimizationen_US
dc.typeThesisen_US
dc.contributor.departmentElectrical and Computer Engineeringen_US
dc.description.degreetypeThesisen_US
dc.description.degreeDoctor of Philosophy (PhD)en_US
Appears in Collections:Open Access Dissertations and Theses

Files in This Item:
File Description SizeFormat 
Chatterjee_Abhijit_202311_PhD.pdf
Open Access
7.39 MBAdobe PDFView/Open
Show simple item record Statistics


Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.

Sherman Centre for Digital Scholarship     McMaster University Libraries
©2022 McMaster University, 1280 Main Street West, Hamilton, Ontario L8S 4L8 | 905-525-9140 | Contact Us | Terms of Use & Privacy Policy | Feedback

Report Accessibility Issue