Approximate linear programming (ALP) offers a promising framework for solving large factored Markov decision processes (MDPs) with both discrete and continuous states. Successful ...
Abstract. In the context of situated and embodied cognition, we evaluate an information-theoretic approach to the construction of the Umwelt of an artificial agent. We make the ass...
Philippe Capdepuy, Daniel Polani, Chrystopher L. N...
This paper describes a novel and competitive complete conformant planner. Key to the enhanced performance is an efficient encoding of belief states as disjunctive normal form form...
Abstract. Hopcroft’s algorithm for minimizing a deterministic automaton has complexity O(n log n). We show that this complexity bound is tight. More precisely, we provide a famil...
: This paper proposes the notion of problem templates (PTs), a concept based on theories of memory and expertise. These mental constructs allow experts to quickly recognise problem...