— Probabilistic sampling-based motion planners are unable to detect when no feasible path exists. A common heuristic is to declare a query infeasible if a path is not found in a ...
Kris K. Hauser, Timothy Bretl, Jean-Claude Latombe
AI Planning is concerned with the selection of actions towards achieving a goal. Research on cellular automata (CA) is concerned with the question how global behaviours arise from ...
A memory-based heuristic is a heuristic function that is stored in a lookup table. Very accurate heuristics have been created by building very large lookup tables, sometimes calle...
We discuss two experiments in which requirements engineering techniques has been used and evaluated. In the first experiment a technique called Executable Use Cases is applied in t...
We present a case study in confronting the GPT generalpurpose planner with the challenging power supply restoration (PSR) benchmark for contingent planning. PSR is derived from a ...