9,620 research outputs found
Conditional constraint satisfaction and configuration: A win-win proposition
Over the years, a whole sector of AI dealing with configuration problems has emerged, and since 1996, an annual configuration workshop has been held in affiliation with a major AI conference. This installment of Trends & Controversies presents essays from the configuration workshop held in August 2006 as part of ECAI in Riva del Garda, Italy
Combining constraint satisfaction and local improvement algorithms to construct anaesthetists' rotas
A system is described which was built to compile weekly rotas for the anaesthetists in a large hospital. The rota compilation problem is an optimization problem (the number of tasks which cannot be assigned to an anaesthetist must be minimized) and was formulated as a constraint satisfaction problem (CSP). The forward checking algorithm is used to find a feasible rota, but because of the size of the problem, it cannot find an optimal (or even a good enough) solution in an acceptable time. Instead, an algorithm was devised which makes local improvements to a feasible solution. The algorithm makes use of the constraints as expressed in the CSP to ensure that feasibility is maintained, and produces very good rotas which are being used by the hospital involved in the project. It is argued that formulation as a constraint satisfaction problem may be a good approach to solving discrete optimization problems, even if the resulting CSP is too large to be solved exactly in an acceptable time. A CSP algorithm may be able to produce a feasible solution which can then be improved, giving a good, if not provably optimal, solution
Advanced periodic maintenance scheduling methods for aircraft lifecycle management
This paper reviews existing methods and techniques addressing the problem of maintenance support throughout the life cycle for high value manufacturing products such as aircrafts. As part of this doctorate research the analysis of current methods of maintenance scheduling was conducted. In order to contribute to a more comprehensive solution, an advanced approach (algorithm) of periodic maintenance is presented. The authors believe that this approach will reduce the cost of maintenance of high value manufacturing products. The algorithm based on constraint programming methods is briefly presented and the future research directions are discussed
Recommended from our members
Experimental evaluation of preprocessing algorithms for constraint satisfaction problems
This paper presents an experimental evaluation of two orthogonal schemes for preprocessing constraint satisfaction problems (CSPs). The first of these schemes involves a class of local consistency techniques that includes directional arc consistency, directional path consistency, and adaptive consistency. The other scheme concerns the prearrangement of variables in a linear order to facilitate an efficient search. In the first series of experiments, we evaluated the effect of each of the local consistency techniques on backtracking and its common enhancement, backjumping. Surprizingly, although adaptive consistency has the best worst-case complexity bounds, we have found that it exhibits the worst performance, unless the constraint graph was very sparse. Directional arc consistency (followed by either backjumping or backtracking) and backjumping (without any pre-processing) outperformed all other techniques; moreover, the former dominated the latter in computationally intensive situations. The second series of experiments suggests that maximum cardinality and minimum width arc the best pre-ordering (i.e., static ordering) strategies, while dynamic search rearrangement is superior to all the preorderings studied
The GRT Planning System: Backward Heuristic Construction in Forward State-Space Planning
This paper presents GRT, a domain-independent heuristic planning system for
STRIPS worlds. GRT solves problems in two phases. In the pre-processing phase,
it estimates the distance between each fact and the goals of the problem, in a
backward direction. Then, in the search phase, these estimates are used in
order to further estimate the distance between each intermediate state and the
goals, guiding so the search process in a forward direction and on a best-first
basis. The paper presents the benefits from the adoption of opposite directions
between the preprocessing and the search phases, discusses some difficulties
that arise in the pre-processing phase and introduces techniques to cope with
them. Moreover, it presents several methods of improving the efficiency of the
heuristic, by enriching the representation and by reducing the size of the
problem. Finally, a method of overcoming local optimal states, based on domain
axioms, is proposed. According to it, difficult problems are decomposed into
easier sub-problems that have to be solved sequentially. The performance
results from various domains, including those of the recent planning
competitions, show that GRT is among the fastest planners
High performance constraint satisfaction problem solving: State-recomputation versus state-copying.
Constraint Satisfaction Problems (CSPs) in Artificial Intelligence have been an important focus of research and have been a useful model for various applications such as scheduling, image processing and machine vision. CSPs are mathematical problems that try to search values for variables according to constraints. There are many approaches for searching solutions of non-binary CSPs. Traditionally, most CSP methods rely on a single processor. With the increasing popularization of multiple processors, parallel search methods are becoming alternatives to speed up the search process. Parallel search is a subfield of artificial intelligence in which the constraint satisfaction problem is centralized whereas the search processes are distributed among the different processors. In this thesis we present a forward checking algorithm solving non-binary CSPs by distributing different branches to different processors via message passing interface and execute it on a high performance distributed system called SHARCNET. However, the problem is how to efficiently communicate the state of the search among processors. Two communication models, namely, state-recomputation and state-copying via message passing, are implemented and evaluated. This thesis investigates the behaviour of communication from one process to another. The experimental results demonstrate that the state-recomputation model with tighter constraints obtains a better performance than the state-copying model, but when constraints become looser, the state-copying model is a better choice.Dept. of Computer Science. Paper copy at Leddy Library: Theses & Major Papers - Basement, West Bldg. / Call Number: Thesis2004 .Y364. Source: Masters Abstracts International, Volume: 44-01, page: 0417. Thesis (M.Sc.)--University of Windsor (Canada), 2005
Towards more efficient solution of conditional constraint satisfaction problems
The focus of the thesis is on improving solving constraint satisfaction problems (CSPs) that change with certain conditions. This special class of problems, which we call conditional CSPs, has proved very useful in modeling important applications, such product configuration and design, and distributed software diagnosis and network management. The problem conditions model choices customers make to configure a product, or they are installation settings or actual observations of a running system that is monitored for diagnosis purpose.
The key, novel contribution of this thesis are two approaches for improving solving methods and the use of random conditional CSPs to evaluate the performance of these methods. With the first approach we propose new algorithms for solving conditional CSPs. These algorithms propagate problem constraints and conditions. The second approach explores the feasibility of reformulating the problem into a standard CSP and introduces new reformulation algorithms.
The implementation results have been evaluated experimentally. The experimental design has extensive test suites of randomly generated standard and conditional CSPs for which general problem parameters, such as density and satisfiability, were varied, as well as specialized parameters that characterize the representation of problem conditions.
The significance of the work lies in the advance of problem resolution for the class of conditional CSPs and the experimental analysis for the proposed new algorithms. The limited solving developments known in the literature of the class of conditional CSPs, a backtrack search algorithm tested on a handful of small problem examples, have been taken an important step further and aligned with efforts reported for standard and other special classes of CSPs
- …