5 CONSTRAINT SATISFACTION PROBLEMS
5CONSTRAINTSATISFACTIONPROBLEMSInwhich weseehowtreatingstatesasmore thanjustlittleblack boxesleadsto theinventionofa range ofpowerfulnew search methodsanda deeperunderstandingofproblemstructure and4 exploredtheideathatproblemscanbesolvedby searchinginaspaceofstates. Thesestatescanbeevaluatedbydomain-specif icheuristicsandtestedtoseewhetherthey ,however,eachstateis is representedbyanarbi-BLACKBOXtrarydatastr ucturethatcanbeaccessedonlybytheproblem- specificroutines thesuccessorfunction,heuristicfunction, , whosestatesandgoaltestconformtoa standard,structured,andverysimplereprese ntation( ).Searchal-REPRESENTATIONgorithmscanbede finedthattake advantageofthestructureofstatesandusegen eral-purposeratherthanproblem-specifiche uristicsto enablethesolutionoflargeproblems( ).
Furthermore, we can develop effective, generic heuristics that require no additional, domain-specific expertise. Finally, the structure of the constraint graph can be used to sim-plify the solution process, in some cases giving an exponential reduction in complexity. The
Download 5 CONSTRAINT SATISFACTION PROBLEMS
Information
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document: