Search has been vital to artificial intelligence from the very beginning as a core technique in
problem solving. The authors present a thorough overview of heuristic search with a balance …

In this paper, we present the partitioning of mutual-exclusion (mutex) constraints in temporal
planning problems and its implementation in the SGPlan4 planner. Based on the strong …

A decision process in which rewards depend on history rather than merely on the current
state is called a decision process with non-Markovian rewards (NMRDP). In decision …

In a field of research about general reasoning mechanisms, it is essential to have
appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the …

Abstract The Model Checking Integrated Planning System (MIPS) is a temporal least
commitment heuristic search planner based on a flexible object-oriented workbench …

Many real world problems involve hybrid systems, subject to (continuous) physical effects
and controlled by (discrete) digital equipments. Indeed, many efforts are being made to …

In this paper, we study the partitioning of constraints in temporal planning problems
formulated as mixed-integer nonlinear programming (MINLP) problems. Constraint …

In this article, we present a framework called state-set branching that combines symbolic
search based on reduced ordered Binary Decision Diagrams (BDDs) with best-first search …

ABSTRACT Cyber Red Teaming (CRT) is an important exercise to conduct for Defence
agencies built on large technological infrastructures. Their size and relative importance may …

We study in this paper the partitioning of the constraints of a temporal planning problem by
subgoals, their sequential evaluation before parallelizing the actions, and the resolution of …