Eight-QueenS Problem: Fuzzy Constraint Satisfaction Problem Using Soar

Slides:



Advertisements
Similar presentations
Polynomial Time Algorithms for the N-Queen Problem Rok sosic and Jun Gu.
Advertisements

Local Search Jim Little UBC CS 322 – CSP October 3, 2014 Textbook §4.8
Local Search Algorithms Chapter 4. Outline Hill-climbing search Simulated annealing search Local beam search Genetic algorithms Ant Colony Optimization.
PROLOG 8 QUEENS PROBLEM.
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
1 Finite Constraint Domains. 2 u Constraint satisfaction problems (CSP) u A backtracking solver u Node and arc consistency u Bounds consistency u Generalized.
ICS-271:Notes 5: 1 Lecture 5: Constraint Satisfaction Problems ICS 271 Fall 2008.
Section 3 CS182 Intelligent Machines: Reasoning, Actions and Plans.
Multi-agent Oriented Constraint Satisfaction Authors: Jiming Liu, Han Jing and Y.Y. Tang Speaker: Lin Xu CSCE 976, May 1st 2002.
Artificial Intelligence Constraint satisfaction Chapter 5, AIMA.
Ryan Kinworthy 2/26/20031 Chapter 7- Local Search part 1 Ryan Kinworthy CSCE Advanced Constraint Processing.
Constraint Satisfaction Problems (CSPs) CPSC 322 – CSP 1 Poole & Mackworth textbook: Sections § Lecturer: Alan Mackworth September 28, 2012.
CS 484 – Artificial Intelligence1 Announcements Homework 2 due today Lab 1 due Thursday, 9/20 Homework 3 has been posted Autumn – Current Event Tuesday.
CSCI 5582 Fall 2006 CSCI 5582 Artificial Intelligence Fall 2006 Jim Martin.
Solving Problems by searching Well defined problems A probem is well defined if it is easy to automatically asses the validity (utility) of any proposed.
Chapter 5 Constraint Satisfaction Problems
1 Constraint Satisfaction Problems Chapter 5 Section 1 – 3 Grand Challenge:
Backtracking & Brute Force Optimization Intro2CS – weeks
© 2006 Pearson Addison-Wesley. All rights reserved 6-1 Chapter 6 Recursion as a Problem- Solving Technique.
The n queens problem Many solutions to a classic problem: On an n x n chess board, place n queens so no queen threatens another.
Chapter 5. Advanced Search Fall 2011 Comp3710 Artificial Intelligence Computing Science Thompson Rivers University.
N-queens problem Original problem: How to place 8 queens on an 8x8 chessboard so that no two queens attack each other N-queen problem: Generalization for.
Chapter 5 Team Teaching AI (created by Dewi Liliana) PTIIK Constraint Satisfaction Problems.
Constraint Propagation Artificial Intelligence CMSC January 22, 2002.
Lecture 5: Constraint Satisfaction Problems
1 CSC 384 Lecture Slides (c) , C. Boutilier and P. Poupart CSC384: Lecture 16  Last time Searching a Graphplan for a plan, and relaxed plan heuristics.
1 Constraint Satisfaction Problems (CSP). Announcements Second Test Wednesday, April 27.
1 Hojjat Ghaderi [Courtesy of Fahiem Bacchus], University of Toronto, Fall 2006 CSC384: Intro to Artificial Intelligence Backtracking Search I ● Announcements.
Constraints Satisfaction Edmondo Trentin, DIISM. Constraint Satisfaction Problems: Local Search In many optimization problems, the path to the goal is.
Cse 150, Fall 2012Gary Cottrell: Many slides borrowed from David Kriegman! Constraint Satisfaction Problems Introduction to Artificial Intelligence CSE.
Tabu Search for Solving Personnel Scheduling Problem
CSG3F3/ Desain dan Analisis Algoritma
School of Computer Science & Engineering
Constraint Programming
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
ECE 448, Lecture 7: Constraint Satisfaction Problems
Constraint Satisfaction Problems (CSPs)
Introduction to Artificial Intelligence
Local Search Algorithms
Instructor: Vincent Conitzer
Constraint Satisfaction Problem
Lecture 7 Constraint Satisfaction Problems
Computer Science cpsc322, Lecture 14
Artificial Intelligence Problem solving by searching CSC 361
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Back Tracking.
Computer Science cpsc322, Lecture 14
Announcements Homework 3 due today (grace period through Friday)
Analysis and design of algorithm
Chapter 3: Finite Constraint Domains
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Constraint Satisfaction Problems
Lecture 13: Tree Traversals Algorithms on Trees.
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Constraint satisfaction problems
Constraint Satisfaction Problems. A Quick Overview
Chapter 5. Advanced Search
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Constraint Satisfaction
Local Search Algorithms
Constraint Satisfaction Problems
CS 8520: Artificial Intelligence
Intelligent Backtracking Algorithms: A Theoretical Evaluation
Constraint Satisfaction Problems
Constraint satisfaction problems
Constraint Satisfaction Problems (CSP)
Backtracking, Search, Heuristics
Presentation transcript:

Eight-QueenS Problem: Fuzzy Constraint Satisfaction Problem Using Soar Eight-QueenS Problem: Fuzzy Constraint Satisfaction Problem Using Soar. Neha Rajan 2018

Constraint Satisfaction Problem Classical Constraint Satisfaction Problem consider a set of hard constraints that every solution must satisfy. Drawbacks:- Some problems are too constrained and have no solutions. Time Consuming. Other problems lead to a large set of equally possible solutions. CSP procedures can pick random solution. In classical Constraint Satisfaction Problem(CSPs) knowledge is embedded in a set of hard constraints, each one restricting the possible values of a set of variables. However constraints in real world problems are seldom hard, and CSP's are often idealizations that do not account for the preference among feasible solutions.

How to overcome with these problems…? Fuzzy Constraint encompasses both preference relations among instantiations and priorities among constraints. Fuzzy Constraints are flexible.

FCSP provides two flexible ways such as:- Soft Constraints - which directly express preferences among solutions. (This is ranking of instantiations/attributes which are more or less acceptable for the satisfaction of a soft constraints). Prioritized Constraints – The flexibility lies in the ability to discard constraints involved in inconsistencies, provided that they are not too important. Generally, weight is associated with each constraints and the request is to minimize the greatest priority levels of the violated constraints.

Problem Statement Place 8 Queens on 8X8 chess board such that no queen can attack one another. We have:- Variables: Qi (i is the row) Domains: Di = {1,2,3,4,5,6,7,8} columns Constraints: Qi =! Qj cannot be in same column. | Qi – Qj | =! | I - j | cannot be in same diagonal.

State space Tree for 8-queens We have large search spaces depending on classical CSP which can be shortened by providing flexible constraints i.e. Prioritized Constraints.

Design approach in Soar Operator Proposal Constraint-Checking Substate Constraints No other Queen can place in same row. No other Queen can place in same column Evaluation Substate No other Queen can place in same diagonal Move, only with higher priority Operator Selection

Constraint-Checking Substate Operators are proposed for initializing chess board of 8*8 Operator Proposal Operators are proposed to move location from one to another Constraint-Checking Substate Operators are rejected because they do not figure out which next operator to get selected Evaluation Substate Resulting operator no-change impasse leads to constraint-checking substate Operator Selection

Constraint-Checking Substate Operator Proposal Operator check that no queen is placed in same row. Constraint-Checking Substate Operator check that no queen is placed in same column. Evaluation Substate Operator check that no queen is placed in same diagonal. Operator Selection This will leads to evaluation substate

Constraint-Checking Substate For each location where next queen is placed, compare the priority Operator Proposal Constraint-Checking Substate If higher priority is selected then place queen else backtrack Record Outcome •Success if constraints weren’t violated •Failure if constraints were violated •Partial failure if outcome was unknown Evaluation Substate Operator Selection

Constraint-Checking Substate Operator Proposal Constraint-Checking Substate Evaluation Substate Agent selects among operators that do not violate constraints Operator Selection

Representation of chess board in SOAR 8-queens in Soar Representation of chess board in SOAR

How Fuzzy Logic will Help to make flexible constraints..? Fuzzy logic is a form of many-valued logic in which the truth values of variables may be any real number between 0 and 1. Fuzzy constraint Satisfaction provides the flexible way in Soar to decide :- What is the most preferred actions? Why do you prefer this action over other actions? These questions/ideas will help to provide more logics in constraints.

Constraints becoming flexible by providing priority so that next queen can identify which location is goal oriented. ^priority 8 represents that queen can choose to locate at this priority location. ^location 0/1 elaborates the concept of fuzzy. That means either queen be placed(true, value will be 1) or queen cannot be placed(false, value will be 0). ^move nil represents that next queen will not be placed in the same row.

In this code queen is moving from current location to new location

Flexible preference to move queen from one location to another by comparing the higher priority.

Result

Future Work To build more flexible constraints. Allow queen to pick random location to begin with. Will use Reinforcement Learning and expand the size of the problem . Will implement episodic memory and semantic memory.