Decentralized on-board planning and scheduling for crosslink-enabled Earth-observing constellations

Small satellites have improved in capability, nearing a future where high data-rate payloads and crosslinks can provide improved geospatial and temporal coverage, while at a fraction of the cost. Planning and scheduling for efficient bulk data routing with discrete crosslink windows in a dynamic network is a difficult combinatorial optimization problem [30]. As problem size grows, quickly solving the planning and scheduling problem involves implementing algorithms that can leverage parallelization. Decentralized algorithms are inherently parallelizable and can be implemented on-orbit by individual satellites. This thesis investigates a decentralized approach that builds upon the Coupled Constraints Consensus Based Bundle Algorithm (CCBBA) with enhancements to address maximum flow problems.

Name thesis:degree_name

Master

Department dc:contributor.department

Massachusetts Institute of Technology. Department of Aeronautics and Astronautics

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2019

Author dc:creator

• Grunwald, Warren C.

Advisor dc:contributor.advisor

• Mark Abramson and Kerri Cahoy.

• Aeronautics and Astronautics.

Statement dc:rights

• MIT theses are protected by copyright. They may be viewed, downloaded, or printed from this source but further reproduction or distribution in any format is prohibited without written permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

https://hdl.handle.net/1721.1/124178

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/124178