An Investigation of Opportunistic Constraint Satisfaction in Space Planning
نویسندگان
چکیده
We are investigating constraint directed heuristic search as a means for performing design in the field of space planning. Space planning is selecting, dimensioning, locating and shaping design units to create two dimensional layouts based on functional, topological and geometrical considerations. Search is carried out using operators at different abstraction levels and design objects at different levels of detail. Constraints are used to represent domain knowledge, to define the search space by specifying operators in means ends analysis manner, and to rate the partial candidate solutions using importances associated with each constraint Search is carried out opportunistically. The philosophy behind opportunism is that understanding the approximate topology of the search space wil l lead to efficient search. Uncertainty associated with constraints is derived and used to identify islands of certainty in the search space, which are used as starting points and anchors for search. The knowledge that enables us to identify opportunistic decisions are interactions between constraints and the usefulness of a constraint in different situations. The resulting uncertainty measure wi l l be tested by observing the problem solving behavior it causes in different search spaces.
منابع مشابه
A weighted CSP approach to cost-optimal planning
For planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This paper describes an optimal-cost planner which guarantees global optimality whenever the planning problem has a solution. We code the extraction of an optimal plan, from a planning graph with a fixed number k of levels, as a weighted constraint satisfaction problem (WCSP). The speci...
متن کاملConstraint Satisfaction Using A Hybrid Evolutionary Hill-Climbing Algorithm That Performs Opportunistic Arc and Path Revision
This paper introduces a hybrid evolutionary hillclimbing algorithm that quickly solves (!onstraint, Satisfaction Problems (CSPs). This hybrid uses opportunistic arc and path revision in an interleaved fashion to reduce the size of the search space and to realize when to quit if a CSP is based on an inconsistent, constraint network. This hybrid out,performs a well known hill-climbing algorithm, ...
متن کاملPlanification de coût optimal basée sur les CSP pondérés. (A weighted CSP approach to cost-optimal planning)
For planning to come of age, plans must be judged by a measure of quality, such as the total cost of actions. This report describes an optimal-cost planner which guarantees global optimality whenever the planning problem has a solution. We code the extraction of an optimal plan, from a planning graph with a fixed number k of levels, as a weighted constraint satisfaction problem (WCSP). The spec...
متن کاملSolving Space Planning Problems Using Constraint Technology
Constraint programming techniques have proven their eeciency in solving high combinatory problems. In this paper, we study the adaptation , the extension and the limits of those techniques in the space planning problem which consists in nding the locations and the sizes of several objects under geometric constraints in a location space. For all that, we deene the formalism of Geometric Constrai...
متن کاملCPlan: A Constraint Programming Approach to Planning
Constraint programming, a methodology for solving difficult combinatorial problems by representing them as constraint satisfaction problems, has shown that a general purpose search algorithm based on constraint propagation combined with an emphasis on modeling can solve large, practical scheduling problems. Given the success of constraint programming on scheduling problems and the similarity of...
متن کامل