This work focuses on the problem of planning solar array operations on the International Space Station. The goal is to find a viable orientation for ten joints which attach panels to the station. These orientations and modes must satisfy various constraints and the final schedule should also take into account certain preferences. This is a task suitable for automated planning and scheduling, but new technologies are gaining very slowly in the field of the human spaceflights. In this work we will analyze the current solution of this problem and then we will propose a new algorithm that will exploit techniques of automated planning and scheduling. In the contrast with the original greedy algorithm, the suggested algorithm initially finds any solution and then tries to improve it by optimazing partial objective functions. Due to the size of the search space, the search attempts are limited by the time limit. Powered by TCPDF (www.tcpdf.org)
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:341471 |
| Date | January 2014 |
| Creators | Jelínek, Jan |
| Contributors | Barták, Roman, Vilím, Petr |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0016 seconds