Fuzzy rrDFCSP and Planning

Research output: Contribution to journalArticlepeer-review

29 Citations (Scopus)

Abstract

Constraint satisfaction is a fundamental Artificial Intelligence technique for knowledge representation and inference. However, the formulation of a static constraint satisfaction problem (CSP) with hard, imperative constraints is insufficient to model many real problems. Fuzzy constraint satisfaction provides a more graded viewpoint. Priorities and preferences are placed on individual constraints and aggregated via fuzzy conjunction to obtain a satisfaction degree for a solution to the problem. This paper examines methods for solving an important instance of dynamic flexible constraint satisfaction (DFCSP) combining fuzzy CSP and restriction/relaxation based dynamic CSP: fuzzy rrDFCSP. This allows the modelling of complex situations where both the set of constraints may change over time and there is flexibility inherent in the definition of the problem. This paper also presents a means by which classical planning can be extended via fuzzy sets to enable flexible goals and preferences to be placed on the use of planning operators. A range of plans can be produced, trading compromises made versus the length of the plan. The flexible planning operators are close in definition to fuzzy constraints. Hence, through a hierarchical decomposition of the planning graph, the work shows how flexible planning reduces to the solution of a set of fuzzy rrDFCSPs. (C) 2003 Elsevier B.V. All rights reserved.

Original languageEnglish
Pages (from-to)11-52
Number of pages42
JournalArtificial Intelligence
Volume148
Issue number1-2
DOIs
Publication statusPublished - Aug 2003

Keywords

  • constraint satisfaction
  • dynamic CSP
  • flexible CSP
  • AI planning
  • flexible planning
  • CONSTRAINT SATISFACTION PROBLEMS
  • DYNAMIC FLEXIBLE CONSTRAINT
  • GRAPH

Fingerprint

Dive into the research topics of 'Fuzzy rrDFCSP and Planning'. Together they form a unique fingerprint.

Cite this