Search NASA⌕ Search

Engineering topics

Maillard, Adrien H

Publications and source records attributed to Maillard, Adrien H.

5 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2021

Sailing Towards an Expressive Scheduling Language for Europa Clipper

The mission planners for NASA's Europa Clipper deep-space mission use automated scheduling software to generate activity plans and command sequences for multiple instruments and subsystems before sending the sequences for execution on board. Both science and engineering planners must translate their intents into expressions of mission constraints, goals, and preferences that the scheduling engine understands. This paper describes the ongoing development of a dedicated domain-specific java-embedded language that can efficiently and accurately capture such concerns for the Europa Clipper mission, along with a user-interface companion for the language.

Schaffer, Steve↗
NASA NTRS2020

A Novel Parsing-based Approach for Verification of Hierarchical Plans

Hierarchical Task Networks were proposed as amethod to describe plans by decomposition of tasks to subtasksuntil primitive tasks, actions, are obtained. Valid plans –sequences of actions – must adhere both to causal dependenciesbetween the actions and to the structure given by the decompositionof the goal task. Plan verification aims at finding if a givenplan is valid, that is, if it is causally consistent and it can beobtained by decomposition of some task. The paper describes anovel parsing-based approach for hierarchical plan verificationthat is orders of magnitude faster than existing methods.

Bercher, Pascal↗
NASA NTRS2020

Scheduling the Mapping of a planet under geometrical constraints

Scheduling the coverage of a planet by scientific instruments on board spacecrafts under observational constraints is central in a significant number of current and future missions for the exploration of the solar system. In this paper, we describe the components and algorithms of a software used to study early-phase mission design or to schedule daily operations of currently in-flight spacecraft. The scheduling problem at hand is usually a large combinatorial problem. A discretization process is described and several ordering algorithms are designed and compared. Experiments show that high-quality schedules can be produced by approaches combining reasoning about rolling, coverage and priorities.

Wells, Christopher↗