User preference optimization for oversubscribed scheduling of NASA's Deep Space Network
UNKNOWN
Johnston, Mark D.↗
Engineering topics
Johnston, Mark D.
Publications and source records attributed to Johnston, Mark D..
Complexity-Based Link Assignment for NASA’s Deep Space Network for Follow-the-Sun Operations
NASA’s Deep Space Network (DSN) recently underwent a paradigm shift in its operations approach called Follow the Sun Operations (FtSO) in an effort to increase efficiency for forthcoming expansion of the network. This change requires each Deep Space Communications Complex (DSCC) to remotely control the other two complexes’ antennas during their local day shift, in contrast to locally controlling only their own antennas 24x7. Remote operations increases the workload of each complex during their day shift, specifically that of the Link Control Operators (LCOs), and presents a new challenge for planning and managing the distribution of responsibility for each link. A new DSN software assembly, the Link Complexity and Maintenance (LCM) software, was developed to support workload management for LCOs, as well as for planning site-local maintenance activities. The LCM deployment was a vital part of the transition to FtSO in November 2017. This paper discusses the architecture of LCM, its feature set, and lessons learned during its development and rollout.
Lee, Carlyn↗
Integrated Planning and Scheduling for NASA’s Deep Space Network – from Forecasting to Real-time
Over a period of several years, the software systems that plan and schedule the use of NASA’s Deep Space Network (DSN) for the projects it serves have been upgraded from a disparate set of decades-old software components, to an integrated suite covering long-range planning and forecasting, all the way to real-time scheduling. The most recent component of this suite is known as LAPS, for Loading Analysis and Planning Software, and is responsible for long-term planning and forecasting, including studies and analysis of new missions, changed mission requirements, downtime, and new or changed antenna capabilities. This paper discusses the architecture of LAPS and its interfaces with other elements of DSN planning and scheduling, its user interfaces, and some lessons learned from development and deployment.
Lad, Jigna↗
AI and Autonomy Initiatives for NASA’s Deep Space Network (DSN)
NASA’s Deep Space Network (DSN) consists of thirteen large (34- and 70-meter) antennas that are used to communicate with approximately 40 NASA and partner spacecraft, all at great distance from the earth (generally at Lunar distances and beyond). The DSN has a long history — over 50 years — and has evolved with cutting edge, often custom, telecommunications equipment and associated software systems. In recent years, and in preparation for an increasing future demand, there has been an effort to invest in initiatives that will result in significant cost savings in the future. These efforts are building on, or augmenting, the recent deployment of “Follow-the-Sun” operations (day shift remote operational control of the entire network from each of the three antenna complexes in turn) — which is being deployed in 2017. This paper focuses on Adaptive Demand Access: in a paradigm shift from completely pre-planned operations, this concept calls for spacecraft to signal their intent (or not) for near-future contacts, in case they have science results of interest, or have experienced an anomaly. This would take advantage of a beacon tone transmission, which can be detected using smaller antennas. When a connection request is received, the DSN ground systems would adaptively accommodate the request, inserting the contact into the plan as soon as possible, subject to constraints and priorities. The demand access concept incorporates onboard data analysis and science data processing, so that beacon tones can be generated with maximum information. This area is representative of several where infusing AI technologies can lead to improved effectiveness of the DSN as the network readies for support of expanded Mars exploration efforts in the 2020’s and beyond.
Wyatt, E. Jay↗
Prioritization and Oversubscribed Scheduling for NASA's Deep Space Network
No abstract available
Shouraboura, Caroline↗
Integrating Space Communication Network Capabilities via Web Portal Technologies
We have developed a service portal prototype as part of an investigation into the feasibility of using Java portlet technology as a means of providing integrated access to NASA communications network services. Portal servers provide an attractive platform for this role due to the various built-in collaboration applications they can provide, combined with the possibility to develop custom inter-operating portlets to extent their functionality while preserving common presentation and behavior. This paper describes various options for integration of network services related to planning and scheduling, and results based on use of a popular open-source portal framework. Plans are underway to develop an operational SCaN Service Portal, building on the experiences reported here.
web services↗
Experiments with a Parallel Multi-Objective Evolutionary Algorithm for Scheduling
Evolutionary multi-objective algorithms have great potential for scheduling in those situations where tradeoffs among competing objectives represent a key requirement. One challenge, however, is runtime performance, as a consequence of evolving not just a single schedule, but an entire population, while attempting to sample the Pareto frontier as accurately and uniformly as possible. The growing availability of multi-core processors in end user workstations, and even laptops, has raised the question of the extent to which such hardware can be used to speed up evolutionary algorithms. In this paper we report on early experiments in parallelizing a Generalized Differential Evolution (GDE) algorithm for scheduling long-range activities on NASA's Deep Space Network. Initial results show that significant speedups can be achieved, but that performance does not necessarily improve as more cores are utilized. We describe our preliminary results and some initial suggestions from parallelizing the GDE algorithm. Directions for future work are outlined.
scheduling↗
Automating Mid- and Long-Range Scheduling for the NASA Deep Space Network
NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system was designed and deployed as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users of the DSN. These users represent not only NASA's deep space missions, but also international partners and ground-based science and calibration users. The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. This paper describes some key aspects of the S(sup 3) system and on the challenges of modeling complex scheduling requirements and the ongoing extension of S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.
Deep Space Network↗
Automating Mid- and Long-Range Scheduling for NASA's Deep Space Network
NASA has recently deployed a new mid-range scheduling system for the antennas of the Deep Space Network (DSN), called Service Scheduling Software, or S(sup 3). This system is architected as a modern web application containing a central scheduling database integrated with a collaborative environment, exploiting the same technologies as social web applications but applied to a space operations context. This is highly relevant to the DSN domain since the network schedule of operations is developed in a peer-to-peer negotiation process among all users who utilize the DSN (representing 37 projects including international partners and ground-based science and calibration users). The initial implementation of S(sup 3) is complete and the system has been operational since July 2011. S(sup 3) has been used for negotiating schedules since April 2011, including the baseline schedules for three launching missions in late 2011. S(sup 3) supports a distributed scheduling model, in which changes can potentially be made by multiple users based on multiple schedule "workspaces" or versions of the schedule. This has led to several challenges in the design of the scheduling database, and of a change proposal workflow that allows users to concur with or to reject proposed schedule changes, and then counter-propose with alternative or additional suggested changes. This paper describes some key aspects of the S(sup 3) system and lessons learned from its operational deployment to date, focusing on the challenges of multi-user collaborative scheduling in a practical and mission-critical setting. We will also describe the ongoing project to extend S(sup 3) to encompass long-range planning, downtime analysis, and forecasting, as the next step in developing a single integrated DSN scheduling tool suite to cover all time ranges.
scheduling↗
Multi-Objective Scheduling for the Cluster II Constellation
No abstract available
space science observations↗
Multi-Objective Scheduling for the Cluster II Constellation
This paper describes the application of the MUSE multiobjecctive scheduling framework to the Cluster II WBD scheduling domain. Cluster II is an ESA four-spacecraft constellation designed to study the plasma environment of the Earth and it's magnetosphere. One of the instruments on each of the four spacecraft is the Wide Band Data (WBD) plasma wave experiment. We have applied the MUSE evolutionary algorithm to the scheduling problem represented by this instrument, and the result has been adopted and utilized by the WBD schedulers for nearly a year. This paper describes the WBD scheduling problem, its representation in MUSE, and some of the visualization elements that provide insight into objective value tradeoffs.
observatory scheduilng↗
Developer Tools for Evaluating Multi-Objective Algorithms
Multi-objective algorithms for scheduling offer many advantages over the more conventional single objective approach. By keeping user objectives separate instead of combined, more information is available to the end user to make trade-offs between competing objectives. Unlike single objective algorithms, which produce a single solution, multi-objective algorithms produce a set of solutions, called a Pareto surface, where no solution is strictly dominated by another solution for all objectives. From the end-user perspective a Pareto-surface provides a tool for reasoning about trade-offs between competing objectives. From the perspective of a software developer multi-objective algorithms provide an additional challenge. How can you tell if one multi-objective algorithm is better than another? This paper presents formal and visual tools for evaluating multi-objective algorithms and shows how the developer process of selecting an algorithm parallels the end-user process of selecting a solution for execution out of the Pareto-Surface.
multi-objective optimization↗
Automated scheduling for NASA’s Deep Space Network
This paper describes the DSN Scheduling Engine (DSE) component of a new scheduling system being deployed for NASA’s Deep Space Network. The DSE provides core automation functionality for scheduling the network, including the interpretation of scheduling requirements expressed by users, their elaboration into tracking passes, and resolving conflicts and constraint violations. The DSE incorporates both systematic search and repair-based algorithms, used for different phases and purposes in the overall system. It has been integrated in with a web application which provides its functionality to all DSN users through a standard web browser. The system is in the process of deployment to operational status.
Tran, Daniel↗
Request-Driven Schedule Automation for the Deep Space Network
The DSN Scheduling Engine (DSE) has been developed to increase the level of automated scheduling support available to users of NASA s Deep Space Network (DSN). We have adopted a request-driven approach to DSN scheduling, in contrast to the activity-oriented approach used up to now. Scheduling requests allow users to declaratively specify patterns and conditions on their DSN service allocations, including timing, resource requirements, gaps, overlaps, time linkages among services, repetition, priorities, and a wide range of additional factors and preferences. The DSE incorporates a model of the key constraints and preferences of the DSN scheduling domain, along with algorithms to expand scheduling requests into valid resource allocations, to resolve schedule conflicts, and to repair unsatisfied requests. We use time-bounded systematic search with constraint relaxation to return nearby solutions if exact ones cannot be found, where the relaxation options and order are under user control. To explore the usability aspects of our approach we have developed a graphical user interface incorporating some crucial features to make it easier to work with complex scheduling requests. Among these are: progressive revelation of relevant detail, immediate propagation and visual feedback from a user s decisions, and a meeting calendar metaphor for repeated patterns of requests. Even as a prototype, the DSE has been deployed and adopted as the initial step in building the operational DSN schedule, thus representing an important initial validation of our overall approach. The DSE is a core element of the DSN Service Scheduling Software (S(sup 3)), a web-based collaborative scheduling system now under development for deployment to all DSN users.
Johnston, Mark D.↗