6

BLG521E - Lecture 4
Outline BLG521E AdvancedArtificialIntelligence

Lecture4:Constraint SatisfactionProblems
CSPproblemformulation CSPexamples BacktrackingsearchforCSPs Problemstructureandproblemdecomposition LocalsearchforCSPs
AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay
ConstraintSatisfactionProblems
Search algorithmssofar:
stateisablackbox domainspecificheuristics statesareaccessiblebyproblemspecificroutines
ConstraintSatisfactionProblem
Definedby
nvariablesXi whichdefineastate
EachvariablehasadomainDi ofpossiblevalues
mconstraintsCj
Eachconstraintinvolvessomesubsetofvariables Specifiestheallowablecombinationsofvalues
CSP:
stucturedandsimplerepresentation generalpurposealgorithms
Astateoftheproblem:assignmentofvaluestosome orallofXi s
ConstraintSatisfactionProblem
Consistentorlegalassignmentdoesnotviolate constraints Completeassignmentthatsatisfiesallconstraintsisa solution Acomplementaryobjectivefunctionmaybedefined
Example:MapColoring
BLG521E - Lecture 4
Example:MapColoring
Constraintgraph
Constraintgraph:nodesarevariables,arcsshow constraints GeneralpurposeCSPalgorithmsusethegraph structure
to speed up search e g Tasmania tospeedupsearch.e.g.,Tasmania
Standardsearchformulation
Statesaredefinedbythevaluesassignedsofar
Initialstate:theemptyassignment,{} Successorfunction:assignavaluetoanunassigned variablethatdoesnotconflictwiththecurrentassignment
failifnolegalassignments(notfixable!)
Standardsearchformulation
ThesearchformulationisthesameforallCSPs! Whatisthedepthofsolution?
Whichtypeofsearch?
Goaltest:thecurrentassignmentiscomplete Pathcost:aconstantcostforeverystep
Pathisirrelevant,socanalsousecompletestate formulation
Whichtypeofsearch?
Thenumberofleaves!vspossibleassignments
AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay 9 AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay 10
VarietiesofCSPs
Discretevariables
finitedomains;sized O(dn)completeassignments
e.g.,BooleanCSPsincluding Booleansatisfiability(NPcomplete)
VarietiesofCSPs
Continuousvariables
e.g.,start/endtimesforHubbleTelescopeobservations linearconstraintssolvableinpolynomial timebyLP methods
infinitedomains(integers,strings,etc.)
e.g.,jobscheduling,variablesarestart/enddaysforeachjob needaconstraintlanguage,e.g.,StartJob1 + 5 StartJob3 linearconstraintssolvable,nonlinearundecidable
11
12
BLG521E - Lecture 4
Varietiesofconstraints
Unaryconstraintsinvolveasinglevariable
SA green
Varietiesofconstraints
Higherorderconstraintsinvolve3ormorevariables: cryptarithmeticcolumnconstraints
constrainthypergraph canbereducedtobinaryconstraints
Binaryconstraintsinvolvepairsofvariables
SA WA SA
Preferences (soft constraints) Preferences(softconstraints)

redisbetterthangreen oftenencodedusing costsagaintstheoverallobjective function constrainedoptimizationproblems
AbinaryCSPhasonlybinaryconstraints,constraint graphs
13
14
Example:Cryptarithmetic
RealworldCSPs
Assignmentproblems
whoteacheswhatclass
Timetablingproblems
whichclassisofferedwhenandwhere?

AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay 15
Hardwareconfiguration Hardware configuration Spreadsheets Transportationscheduling Factoryscheduling Floorplanning

AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay 16
BenefitsofmodelingasaCSP
Representationofstatesconformstoastandard pattern Thesuccessorfunctionandgoaltestcanbewritten inagenericway Devising generic heuristics Devisinggenericheuristics Thestructureoftheconstraintgraphcanbeusedto simplifythesolutionprocess
Backtrackingsearch
Variableassignmentsarecommutative
[WA=redthenNT=green]sameas[NT=greenthen WA=red]
Only need to consider assignments to a single Onlyneedtoconsiderassignmentstoasingle variableateachnode

b=dandtherearedn leaves
17
18
BLG521E - Lecture 4
Backtrackingsearch
Depthfirstsearchwithsinglevariableassignments ThebasicuninformedalgorithmforCSPs Cansolvenqueensforn 25
Backtrackingsearch
19
20
Backtrackingexample
Backtrackingexample
21
22
Backtrackingexample
Backtrackingexample
23
24
BLG521E - Lecture 4
Improvingbacktrackingefficiency
Generalpurposemethodscangivehugegainsin speed:
Whichvariableshouldbeassignednext? Inwhatordershoulditsvaluesbetried? Canwedetectinevitablefailureearly? y Canwetakeadvantageofproblemstructure?
Minimumremainingvalues
Minimumremainingvalues(MRV):
choosethevariablewiththefewestlegalvalues
Mostconstrainedvariable,failfirstheuristic
25
26
Degreeheuristic
TiebreakeramongMRVvariables Degreeheuristic:
choosethevariablewiththemostconstraintson remainingvariables
Leastconstrainingvalue
Givenavariable,choosetheleastconstrainingvalue:
theonethatrulesoutthefewestvaluesintheremaining variables
Combiningtheseheuristicsmakes1000queens feasible
AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay 27 AdvancedArtificialIntelligence(BLG521E)@ITU::ComputerEngineeringDepartment,Dr.SanemSarelTalay 28
Forwardchecking
Idea:Keeptrackofremaininglegalvaluesfor unassignedvariables
Terminatesearchwhenanyvariablehasnolegalvalues
Forwardchecking
29
30
BLG521E - Lecture 4
Forwardchecking
Forwardchecking
31
32
Constraintpropagation
Forwardcheckingpropagatesinformationfrom assignedtounassignedvariables,butdoesn'tprovide earlydetectionforallfailures
Arcconsistency
Simplestformofpropagationmakeseacharc consistent
33
34
Arcconsistency
Arcconsistency
35
36
BLG521E - Lecture 4
Arcconsistency
Arcconsistencyalgorithm
37
38
kconsistency
Arcconsistencydoesnotrevealeverypossibleinconsistency kconsistency:
foranyk1variablesand foranyconsistentassignment Aconsistentvaluecanbeassignedtoanykth variable
Problemstructure
1consistency:nodeconsistency 1 it d it 2consistency:arcconsistency 3consistency:pathconsistency Agraphisstronglykconsistentifitiskconsistentandalso (k1)consistent,...1consistent
39
40
Problemstructure
TreestructuredCSPs
Theorem:iftheconstraintgraphhasnoloops,the CSPcanbesolvedinO(nd2)
41
42
BLG521E - Lecture 4
AlgorithmfortreestructuredCSPs
NearlytreestructuredCSPs
43
44
IterativealgorithmsforCSPs
Hillclimbing,simulatedannealingtypicallyworkwith completestates,i.e.,allvariablesassigned ToapplytoCSPs:
allowstateswithunsatisfiedconstraints operatorsreassignvariablevalues
Example:4Queens
V i bl Variableselection:randomlyselectanyconflictedvariable l ti d l l t fli t d i bl Valueselectionbyminconflictsheuristic:

choosevaluethatviolatesthefewestconstraints i.e.,hillclimbwithh(n)=totalnumberofviolatedconstraints
45
46

6

Загружено:

Сведения о документе

Исходное описание:

Авторское право

Доступные форматы

Поделиться этим документом

Поделиться или встроить документ

Параметры публикации

Этот документ был вам полезен?

Это неприемлемый материал?

Авторское право:

Доступные форматы

6

Загружено:

Авторское право:

Доступные форматы

BLG521E - Lecture 4

Outline BLG521E AdvancedArtificialIntelligence

Preferences (soft constraints) Preferences(softconstraints)

Hardwareconfiguration Hardware configuration Spreadsheets Transportationscheduling Factoryscheduling Floorplanning

Only need to consider assignments to a single Onlyneedtoconsiderassignmentstoasingle variableateachnode

1consistency:nodeconsistency 1 it d it 2consistency:arcconsistency 3consistency:pathconsistency Agraphisstronglykconsistentifitiskconsistentandalso (k1)consistent,...1consistent

V i bl Variableselection:randomlyselectanyconflictedvariable l ti d l l t fli t d i bl Valueselectionbyminconflictsheuristic:

Вам также может понравиться