In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.

In this article we address the problem of realizing a service-providing reasoning infrastructure for pro-active humanassistance in intelligent environments. We propose SAM, an architecture which leverages temporal knowledge represented asrelations in Allen’s interval algebra and constraint-based temporal planning techniques. SAM provides two key capabilities forcontextualized service provision: human activity recognition and planning for controlling pervasive actuation devices. Whiledrawing inspiration from several state-of-the-art approaches, SAM provides a unique feature which has thus far not been addressed in the literature, namely the seamless integration of these two key capabilities. It does so by leveraging a constraint-basedreasoning paradigm whereby both requirements for recognition and for planning/execution are represented as constraints andreasoned upon continuously.

This is a summary of the journal article published by Journal on Computing entitled "An Optimal Constraint Programming Approach to the Open-Shop Problem." The article presents an optimal constraint programming approach for the Open-Shop scheduling problem, which integrates recent constraint propagation and branching techniques with new upper bound heuristics. Randomized restart policies combined with nogood recording allow to search diversification and learning from restarts. This approach is compared with the best-known metaheuristics and exact algorithms, and shows better results on a wide range of benchmark instances.

In this paper, we consider the problem of designing personalised museum visits. Given a set of preferences and constraints a visitor might express on her visit, the aim is to compute the tour that best matches her requirements. The museum visits problem can be expressed as a planning problem, with cost optimization. We show how to bound the number of steps required to find an optimal solution, via the resolution of an instance of the shortest complete walk problem. We also point out an alternative encoding of the museum visits problem as an optimization problem with pseudo-Boolean constraints and a linear objective function. We have evaluated several constraints solvers, a planner and a tailored solver on a number of benchmarks, representing various instances of the museum visits problem corresponding to real museums. Our empirical results show the feasibility of both the planning and the constraint programming approaches. Optimal solutions can be computed for short visits and ``practically good'' solutions for much longer visits.

Sequential decision-making under uncertainty often uses an approach in which a plan is built over a given horizon ahead using a deterministic model, the first decisions in this plan are applied, new information is acquired, the plan is adapted or rebuilt from scratch over a sliding horizon, and so on. This paper introduces a generic local search library that can be used in this context to quickly build and rebuild good quality plans. This library is built upon the notion of invariant used in constraint-based local search. Invariants allow temporal constraints, resource constraints, and criteria to be very quickly evaluated from a variable assignment and re-evaluated from a small change in this assignment. The paper also shows how the library can be used to reason on dynamic problem instances using a unique static problem model, without dynamic memory allocation. The approach is illustrated on a problem of data download under uncertainty about the volume of data, coming from the space domain.

Sequence optimization is an important problem in many production automation scenarios involving industrial robots. Mostly, this is done by reducing it to Traveling Salesman Problem (TSP). However, in many industrial scenarios optimization potential is not only hidden in optimizing a sequence of operations but also in optimizing the individual operations themselves. From a formal point of view, this leads to the Traveling Salesman Problem with Neighborhoods (TSPN). TSPN is a generalization of TSP where areas should be visited instead of points. In this paper we propose a new method for solving TSPN efficiently. We compare the new method to the related approaches using existing test benchmarks from the literature. According to the evaluation on instances with known optimal values, our method is able to obtain a solution close to the optimum.