Name
Abstract | ||
|---|---|---|
Space mission planning/scheduling is determining the set of spacecraft activities to meet mission objectives while respecting mission constraints. One important category of mission constraints is data management. As the spacecraft acquires data via science instruments and engineering telemetry, it must store the data on board until it is able to downlink the data to ground communications stations. Because onboard storage and communication opportunities are often limited, this can be a challenging task. This paper first describes the general problem of onboard memory management for spacecraft that allow concurrent data collection and downlink activities. Then, a fast, intuitive heuristic is presented for solving this problem, and its use on the Rosetta comet rendezvous mission is evaluated. Finally, different local heuristics are compared for a greedy search to a global graph-based solution, measuring performance in terms of runtime and robustness to downlink buffer overflow. The results show that local heuristics can produce solutions that are comparable, and often better than, solutions from a global formulation. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.2514/1.I010544 | JOURNAL OF AEROSPACE INFORMATION SYSTEMS |
Field | DocType | Volume |
Heuristic,Computer science,Real-time computing,Greedy algorithm,Memory management,Heuristics,Rendezvous,Data management,Buffer overflow,Distributed computing,Spacecraft | Journal | 14 |
Issue | ISSN | Citations |
12 | 1940-3151 | 0 |
PageRank | References | Authors |
0.34 | 3 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gregg Rabideau | 1 | 244 | 29.61 |
| Steve Chien | 2 | 286 | 43.51 |
| M. Galer | 3 | 0 | 0.34 |
| Federico Nespoli | 4 | 0 | 0.34 |
| Manuel Costa | 5 | 1589 | 88.62 |