This paper describes SRIPPs, structured reactive image processing plans, that are tailored for the needs of autonomous service robots. SRIPPs are implemented on top of a modular, d...
Michael Beetz, Tom Arbuckle, Armin B. Cremers, M. ...
Abstract: Lazy computation is not new in model-based diagnosis of active systems (and of discreteevent systems in general). Up to a decade ago, diagnosis methods for discrete-event...
Pietro Baroni, Gianfranco Lamperti, Paolo Pogliano...
A physically based system of interacting polyhedral objects is used to model self-assembly and spontaneous organization of complex structures. The surfaces of the polyhedra in the ...
We use a local search method we term Large Neighbourhood Search (LNS) for solving vehicle routing problems. LNS meshes well with constraint programming technology and is analogous...
Abstract. We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of pr...
The constraint paradigm provides powerful concepts to represent and solve different kinds of planning problems, e. g. factory scheduling. Factory scheduling is a demanding optimiz...
Abstract. We study the experimental consequences of a recent theoretical result by Achlioptas et al. that shows that conventional models of random problems are trivially insoluble ...
Ewan MacIntyre, Patrick Prosser, Barbara M. Smith,...
In this paper we will show how constraint solving methods can be applied for the recognition of buildings in aerial images. Object models are transformed to constraint representati...
A well-studied problem in the electric power industry is that of optimally scheduling preventative maintenance of power generating units within a power plant. We show how these pr...
In this paper we describe a paradigm for contentfocused matchmaking, based on a recently proposed model for constraint acquisition-and-satisfaction. Matchmaking agents are conceiv...