In this article, we present the main results of the feasibility study we have carried out about
autonomous decision making on board an Earth‐observing agile satellite, equipped with a …

The CNT framework (Constraint Network on Timelines) has been designed to model
discrete event dynamic systems and the properties one knows, one wants to verify, or one …

如何利用有限的星上资源执行复杂繁重的空间任务长期以来备受关注, 随着卫星载荷能力不断
提升, 响应时间要求不断缩短, 卫星自主与协同任务调度规划研究的重要性逐渐增大 …

Many optimisation problems are of an online—also called dynamic—nature, where new
information is expected to arrive and the problem must be resolved in an ongoing fashion to …

Classical constraint satisfaction problems (CSPs) are commonly defined on finite domains.
In real life, constrained variables can evolve over time. A variable can actually take an …

Satellite hardware has reached a level of development that enables imaging satellites to
realize applications in the area of meteorology and environmental monitoring. As the …

Abstract Standard Planning Domain Definition Language (PDDL) planning problem
definitions may be reformulated and solved using alternative techniques. One such …

This paper presents a generic anytime forward-search constraint-based algorithm for solving
planning problems expressed in the CNT framework (Constraint Network on Timelines). It is …

To be properly controlled, dynamic systems need plans or policies. Plans are sequences of
actions to be performed, whereas policies associate an action to be performed with each …

In most of the constraint-based approaches to planning, the problem is unfolded over a
given number of steps. Because this unfolded CSP encoding is very time and memory …