nodegraphsearch
graphsearch 时间:2021-05-25 阅读:()
CS347–IntroductiontoArtificialIntelligenceDr.
DanielTauritz(Dr.
T)DepartmentofComputerSciencetauritzd@mst.
eduhttp://web.
mst.
edu/~tauritzd/CS347coursewebsite:http://web.
mst.
edu/~tauritzd/courses/cs347/WhatisAISystemsthat…actlikehumans(TuringTest)thinklikehumansthinkrationallyactrationallyPlayUltimatumGameKeyhistoricaleventsforAI4thcenturyBCAristotlepropositionallogic1600'sDescartesmind-bodyconnection1805FirstprogrammablemachineMid1800'sCharlesBabbage's"differenceengine"&"analyticalengine"LadyLovelace'sObjection1847GeorgeBoolepropositionallogic1879GottlobFregepredicatelogicKeyhistoricaleventsforAI1931KurtGodel:IncompletenessTheoremInanylanguageexpressiveenoughtodescribenaturalnumberproperties,thereareundecidable(incomputable)truestatements1943McCulloch&Pitts:NeuralComputation1956Term"AI"coined1976Newell&Simon's"PhysicalSymbolSystemHypothesis"Aphysicalsymbolsystemhasthenecessaryandsufficientmeansforgeneralintelligentaction.
HowdifficultisittoachieveAIThreeSistersPuzzleRationalAgentsEnvironmentSensors(percepts)Actuators(actions)AgentFunctionAgentProgramPerformanceMeasuresRationalBehaviorDependson:Agent'sperformancemeasureAgent'spriorknowledgePossibleperceptsandactionsAgent'sperceptsequenceRationalAgentDefinition"Foreachpossibleperceptsequence,arationalagentselectsanactionthatisexpectedtomaximizeitsperformancemeasure,giventheevidenceprovidedbytheperceptsequenceandanypriorknowledgetheagenthas.
"TaskEnvironmentsPEASdescription&properties:Fully/PartiallyObservableDeterministic,Stochastic,StrategicEpisodic,SequentialStatic,Dynamic,Semi-dynamicDiscrete,ContinuousSingleagent,MultiagentCompetitive,CooperativeProblem-solvingagentsAdefinition:Problem-solvingagentsaregoalbasedagentsthatdecidewhattodobasedonanactionsequenceleadingtoagoalstate.
Problem-solvingstepsProblem-formulation(actions&states)Goal-formulation(states)Search(actionsequences)ExecutesolutionWell-definedproblemsInitialstateActionsetTransitionmodel:RESULT(s,a)GoaltestPathcostSolution/optimalsolutionExampleproblemsVacuumworldTic-tac-toe8-puzzle8-queensproblemSearchtreesRootcorrespondswithinitialstateVacuumstatespacevs.
searchtreeSearchalgorithmsiteratethroughgoaltestingandexpandingastateuntilgoalfoundOrderofstateexpansioniscritical!
Searchnodedatastructuren.
STATEn.
PARENT-NODEn.
ACTIONn.
PATH-COSTStatesareNOTsearchnodes!
FrontierFrontier=SetofleafnodesImplementedasaqueuewithops:EMPTY(queue)POP(queue)INSERT(element,queue)Queuetypes:FIFO,LIFO(stack),andpriorityqueueProblem-solvingperformanceCompletenessOptimalityTimecomplexitySpacecomplexityComplexityinAIb–branchingfactord–depthofshallowestgoalnodem–maxpathlengthinstatespaceTimecomplexity:#generatednodesSpacecomplexity:max#nodesstoredSearchcost:time+spacecomplexityTotalcost:search+pathcostTreeSearchBreadthFirstTreeSearch(BFTS)UniformCostTreeSearch(UCTS)Depth-FirstTreeSearch(DFTS)Depth-LimitedTreeSearch(DLTS)Iterative-DeepeningDepth-FirstTreeSearch(ID-DFTS)Examplestatespace#1BreadthFirstTreeSearch(BFTS)Frontier:FIFOqueueComplete:ifbanddarefiniteOptimal:ifpath-costisnon-decreasingfunctionofdepthTimecomplexity:O(b^d)Spacecomplexity:O(b^d)UniformCostTreeSearch(UCTS)Frontier:priorityqueueorderedbyg(n)DepthFirstTreeSearch(DFTS)Frontier:LIFOqueue(a.
k.
a.
stack)Complete:noOptimal:noTimecomplexity:O(bm)Spacecomplexity:O(bm)BacktrackingversionofDFTShasaspacecomplexityof:O(m)Depth-LimitedTreeSearch(DLTS)Frontier:LIFOqueue(a.
k.
a.
stack)Complete:notwhenl=βPruneiffail-lowforMin-playerPruneiffail-highforMax-playerDLMw/Alpha-BetaPruningTimeComplexityWorst-case:O(bd)Best-case:O(bd/2)[Knuth&Moore,1975]Average-case:O(b3d/4)MoveOrderingHeuristicsKnowledgebasedKillerMove:thelastmoveatagivendepththatcausedAB-pruningorhadbestminimaxvalueHistoryTableExamplegametreeExamplegametreeSearchDepthHeuristicsTimebased/StatebasedHorizonEffect:thephenomenonofdecidingonanon-optimalprincipalvariantbecauseanultimatelyunavoidabledamagingmoveseemstobeavoidedbyblockingittillpassedthesearchdepthSingularExtensions/QuiescenceSearchTimePerMoveConstantPercentageofremainingtimeStatedependentHybridQuiescenceSearchWhensearchdepthreached,computequiescencestateevaluationheuristicIfstatequiescent,thenproceedasusual;otherwiseincreasesearchdepthifquiescencesearchdepthnotyetreachedCallformat:QSDLM(root,depth,QSdepth),QSABDLM(root,depth,QSdepth,α,β),etc.
QSgametreeEx.
1QSgametreeEx.
2ForwardpruningBeamSearch(nbestmoves)ProbCut(forwardpruningversionofalpha-betapruning)TranspositionTables(1)HashtableofpreviouslycalculatedstateevaluationheuristicvaluesSpeedupisparticularlyhugeforiterativedeepeningsearchalgorithms!
GoodforchessbecauseoftenrepeatedstatesinsamesearchTranspositionTables(2)Datastructure:HashtableindexedbypositionElement:StateevaluationheuristicvalueSearchdepthofstoredvalueHashkeyofposition(toeliminatecollisions)(optional)BestmovefrompositionTranspositionTables(3)ZobristhashkeyGenerate3d-arrayofrandom64-bitnumbers(piecetype,locationandcolor)Startwitha64-bithashkeyinitializedto0Loopthroughcurrentposition,XOR'inghashkeywithZobristvalueofeachpiecefound(note:onceakeyhasbeenfound,useanincrementalapporachthatXOR'sthe"from"locationandthe"to"locationtomoveapiece)MTD(f)MTDf(root,guess,depth){lower=-∞;upper=∞;do{beta=guess+(guess==lower);guess=ABMaxV(root,depth,beta-1,beta);if(guessExtendedFutilityPruningRazoringState-SpaceSearchComplete-stateformulationObjectivefunctionGlobaloptimaLocaloptima(don'tusetextbook'sdefinition!
)Ridges,plateaus,andshouldersRandomsearchandlocalsearchSteepest-AscentHill-ClimbingGreedyAlgorithm-makeslocallyoptimalchoicesExample8queensproblemhas88≈17MstatesSAHCfindsglobaloptimumfor14%ofinstancesinonaverage4steps(3stepswhenstuck)SAHCw/upto100consecutivesidewaysmoves,findsglobaloptimumfor94%ofinstancesinonaverage21steps(64stepswhenstuck)StochasticHill-ClimbingChoosesatrandomfromamonguphillmovesProbabilityofselectioncanvarywiththesteepnessoftheuphillmoveOnaverageslowerconvergence,butalsolesschanceofprematureconvergenceMoreLocalSearchAlgorithmsFirst-choicehill-climbingRandom-restarthill-climbingSimulatedAnnealingPopulationBasedLocalSearchDeterministiclocalbeamsearchStochasticlocalbeamsearchEvolutionaryAlgorithmsParticleSwarmOptimizationAntColonyOptimizationParticleSwarmOptimizationPSOisastochasticpopulation-basedoptimizationtechniquewhichassignsvelocitiestopopulationmembersencodingtrialsolutionsPSOupdaterules:PSOdemo:http://www.
borgelt.
net//psopt.
htmlAntColonyOptimizationPopulationbasedPheromonetrailandstigmergeticcommunicationShortestpathsearchingStochasticmovesOnlineSearchOfflinesearchvs.
onlinesearchInterleavingcomputation&actionExplorationproblems,safelyexplorableAgentshaveaccessto:ACTIONS(s)c(s,a,s')GOAL-TEST(s)OnlineSearchOptimalityCR–CompetitiveRatioTAPC–TotalActualPathCostC*-OptimalPathCostBestcase:CR=1Worstcase:CR=∞OnlineSearchAlgorithmsOnline-DFS-AgentRandomWalkLearningReal-TimeA*(LRTA*)OnlineSearchExampleGraph1OnlineSearchExampleGraph2OnlineSearchExampleGraph3AIcoursesatS&TCS345ComputationalRoboticManipulation(SP2012)CS347IntroductiontoArtificialIntelligence(SP2012)CS348EvolutionaryComputing(FS2011)CS434DataMining&KnowledgeDiscovery(FS2011)CS447AdvancedTopicsinAI(SP2013)CS448AdvancedEvolutionaryComputing(SP2012)CpE358ComputationalIntelligence(FS2011)SysEng378IntrotoNeuralNetworks&Applications
DanielTauritz(Dr.
T)DepartmentofComputerSciencetauritzd@mst.
eduhttp://web.
mst.
edu/~tauritzd/CS347coursewebsite:http://web.
mst.
edu/~tauritzd/courses/cs347/WhatisAISystemsthat…actlikehumans(TuringTest)thinklikehumansthinkrationallyactrationallyPlayUltimatumGameKeyhistoricaleventsforAI4thcenturyBCAristotlepropositionallogic1600'sDescartesmind-bodyconnection1805FirstprogrammablemachineMid1800'sCharlesBabbage's"differenceengine"&"analyticalengine"LadyLovelace'sObjection1847GeorgeBoolepropositionallogic1879GottlobFregepredicatelogicKeyhistoricaleventsforAI1931KurtGodel:IncompletenessTheoremInanylanguageexpressiveenoughtodescribenaturalnumberproperties,thereareundecidable(incomputable)truestatements1943McCulloch&Pitts:NeuralComputation1956Term"AI"coined1976Newell&Simon's"PhysicalSymbolSystemHypothesis"Aphysicalsymbolsystemhasthenecessaryandsufficientmeansforgeneralintelligentaction.
HowdifficultisittoachieveAIThreeSistersPuzzleRationalAgentsEnvironmentSensors(percepts)Actuators(actions)AgentFunctionAgentProgramPerformanceMeasuresRationalBehaviorDependson:Agent'sperformancemeasureAgent'spriorknowledgePossibleperceptsandactionsAgent'sperceptsequenceRationalAgentDefinition"Foreachpossibleperceptsequence,arationalagentselectsanactionthatisexpectedtomaximizeitsperformancemeasure,giventheevidenceprovidedbytheperceptsequenceandanypriorknowledgetheagenthas.
"TaskEnvironmentsPEASdescription&properties:Fully/PartiallyObservableDeterministic,Stochastic,StrategicEpisodic,SequentialStatic,Dynamic,Semi-dynamicDiscrete,ContinuousSingleagent,MultiagentCompetitive,CooperativeProblem-solvingagentsAdefinition:Problem-solvingagentsaregoalbasedagentsthatdecidewhattodobasedonanactionsequenceleadingtoagoalstate.
Problem-solvingstepsProblem-formulation(actions&states)Goal-formulation(states)Search(actionsequences)ExecutesolutionWell-definedproblemsInitialstateActionsetTransitionmodel:RESULT(s,a)GoaltestPathcostSolution/optimalsolutionExampleproblemsVacuumworldTic-tac-toe8-puzzle8-queensproblemSearchtreesRootcorrespondswithinitialstateVacuumstatespacevs.
searchtreeSearchalgorithmsiteratethroughgoaltestingandexpandingastateuntilgoalfoundOrderofstateexpansioniscritical!
Searchnodedatastructuren.
STATEn.
PARENT-NODEn.
ACTIONn.
PATH-COSTStatesareNOTsearchnodes!
FrontierFrontier=SetofleafnodesImplementedasaqueuewithops:EMPTY(queue)POP(queue)INSERT(element,queue)Queuetypes:FIFO,LIFO(stack),andpriorityqueueProblem-solvingperformanceCompletenessOptimalityTimecomplexitySpacecomplexityComplexityinAIb–branchingfactord–depthofshallowestgoalnodem–maxpathlengthinstatespaceTimecomplexity:#generatednodesSpacecomplexity:max#nodesstoredSearchcost:time+spacecomplexityTotalcost:search+pathcostTreeSearchBreadthFirstTreeSearch(BFTS)UniformCostTreeSearch(UCTS)Depth-FirstTreeSearch(DFTS)Depth-LimitedTreeSearch(DLTS)Iterative-DeepeningDepth-FirstTreeSearch(ID-DFTS)Examplestatespace#1BreadthFirstTreeSearch(BFTS)Frontier:FIFOqueueComplete:ifbanddarefiniteOptimal:ifpath-costisnon-decreasingfunctionofdepthTimecomplexity:O(b^d)Spacecomplexity:O(b^d)UniformCostTreeSearch(UCTS)Frontier:priorityqueueorderedbyg(n)DepthFirstTreeSearch(DFTS)Frontier:LIFOqueue(a.
k.
a.
stack)Complete:noOptimal:noTimecomplexity:O(bm)Spacecomplexity:O(bm)BacktrackingversionofDFTShasaspacecomplexityof:O(m)Depth-LimitedTreeSearch(DLTS)Frontier:LIFOqueue(a.
k.
a.
stack)Complete:notwhenl=βPruneiffail-lowforMin-playerPruneiffail-highforMax-playerDLMw/Alpha-BetaPruningTimeComplexityWorst-case:O(bd)Best-case:O(bd/2)[Knuth&Moore,1975]Average-case:O(b3d/4)MoveOrderingHeuristicsKnowledgebasedKillerMove:thelastmoveatagivendepththatcausedAB-pruningorhadbestminimaxvalueHistoryTableExamplegametreeExamplegametreeSearchDepthHeuristicsTimebased/StatebasedHorizonEffect:thephenomenonofdecidingonanon-optimalprincipalvariantbecauseanultimatelyunavoidabledamagingmoveseemstobeavoidedbyblockingittillpassedthesearchdepthSingularExtensions/QuiescenceSearchTimePerMoveConstantPercentageofremainingtimeStatedependentHybridQuiescenceSearchWhensearchdepthreached,computequiescencestateevaluationheuristicIfstatequiescent,thenproceedasusual;otherwiseincreasesearchdepthifquiescencesearchdepthnotyetreachedCallformat:QSDLM(root,depth,QSdepth),QSABDLM(root,depth,QSdepth,α,β),etc.
QSgametreeEx.
1QSgametreeEx.
2ForwardpruningBeamSearch(nbestmoves)ProbCut(forwardpruningversionofalpha-betapruning)TranspositionTables(1)HashtableofpreviouslycalculatedstateevaluationheuristicvaluesSpeedupisparticularlyhugeforiterativedeepeningsearchalgorithms!
GoodforchessbecauseoftenrepeatedstatesinsamesearchTranspositionTables(2)Datastructure:HashtableindexedbypositionElement:StateevaluationheuristicvalueSearchdepthofstoredvalueHashkeyofposition(toeliminatecollisions)(optional)BestmovefrompositionTranspositionTables(3)ZobristhashkeyGenerate3d-arrayofrandom64-bitnumbers(piecetype,locationandcolor)Startwitha64-bithashkeyinitializedto0Loopthroughcurrentposition,XOR'inghashkeywithZobristvalueofeachpiecefound(note:onceakeyhasbeenfound,useanincrementalapporachthatXOR'sthe"from"locationandthe"to"locationtomoveapiece)MTD(f)MTDf(root,guess,depth){lower=-∞;upper=∞;do{beta=guess+(guess==lower);guess=ABMaxV(root,depth,beta-1,beta);if(guess
)Ridges,plateaus,andshouldersRandomsearchandlocalsearchSteepest-AscentHill-ClimbingGreedyAlgorithm-makeslocallyoptimalchoicesExample8queensproblemhas88≈17MstatesSAHCfindsglobaloptimumfor14%ofinstancesinonaverage4steps(3stepswhenstuck)SAHCw/upto100consecutivesidewaysmoves,findsglobaloptimumfor94%ofinstancesinonaverage21steps(64stepswhenstuck)StochasticHill-ClimbingChoosesatrandomfromamonguphillmovesProbabilityofselectioncanvarywiththesteepnessoftheuphillmoveOnaverageslowerconvergence,butalsolesschanceofprematureconvergenceMoreLocalSearchAlgorithmsFirst-choicehill-climbingRandom-restarthill-climbingSimulatedAnnealingPopulationBasedLocalSearchDeterministiclocalbeamsearchStochasticlocalbeamsearchEvolutionaryAlgorithmsParticleSwarmOptimizationAntColonyOptimizationParticleSwarmOptimizationPSOisastochasticpopulation-basedoptimizationtechniquewhichassignsvelocitiestopopulationmembersencodingtrialsolutionsPSOupdaterules:PSOdemo:http://www.
borgelt.
net//psopt.
htmlAntColonyOptimizationPopulationbasedPheromonetrailandstigmergeticcommunicationShortestpathsearchingStochasticmovesOnlineSearchOfflinesearchvs.
onlinesearchInterleavingcomputation&actionExplorationproblems,safelyexplorableAgentshaveaccessto:ACTIONS(s)c(s,a,s')GOAL-TEST(s)OnlineSearchOptimalityCR–CompetitiveRatioTAPC–TotalActualPathCostC*-OptimalPathCostBestcase:CR=1Worstcase:CR=∞OnlineSearchAlgorithmsOnline-DFS-AgentRandomWalkLearningReal-TimeA*(LRTA*)OnlineSearchExampleGraph1OnlineSearchExampleGraph2OnlineSearchExampleGraph3AIcoursesatS&TCS345ComputationalRoboticManipulation(SP2012)CS347IntroductiontoArtificialIntelligence(SP2012)CS348EvolutionaryComputing(FS2011)CS434DataMining&KnowledgeDiscovery(FS2011)CS447AdvancedTopicsinAI(SP2013)CS448AdvancedEvolutionaryComputing(SP2012)CpE358ComputationalIntelligence(FS2011)SysEng378IntrotoNeuralNetworks&Applications
- nodegraphsearch相关文档
- resultsgraphsearch
- reciprocatedgraphsearch
- memorygraphsearch
- graphgraphsearch
- swappedgraphsearch
- annotategraphsearch
百驰云（19/月），高性能服务器，香港三网CN2 2核2G 10M 国内、香港、美国、日本、VPS、物理机、站群全站7.5折，无理由退换，IP免费换！
百驰云成立于2017年，是一家新国人IDC商家，且正规持证IDC/ISP/CDN，商家主要提供数据中心基础服务、互联网业务解决方案，及专属服务器租用、云服务器、云虚拟主机、专属服务器托管、带宽租用等产品和服务。百驰云提供源自大陆、香港、韩国和美国等地骨干级机房优质资源，包括BGP国际多线网络，CN2点对点直连带宽以及国际顶尖品牌硬件。专注为个人开发者用户,中小型,大型企业用户提供一站式核心网络云端...
阿里云金秋上云季,云服务器秒杀2C2G5M年付60元起
阿里云(aliyun)在这个月又推出了一个金秋上云季活动，到9月30日前，每天两场秒杀活动，包括轻量应用服务器、云服务器、云数据库、短信包、存储包、CDN流量包等等产品，其中Aliyun轻量云服务器最低60元/年起，还可以99元续费3次！活动针对新用户和没有购买过他们的产品的老用户均可参与，每人限购1件。关于阿里云不用多说了，国内首屈一指的云服务器商家，无论建站还是学习都是相当靠谱的。活动地址：h...
HostKvm - 夏季云服务器七折优惠 香港和韩国机房月付5.95美元起
HostKvm，我们很多人都算是比较熟悉的国人服务商，旗下也有多个品牌，差异化多占位策略营销的，商家是一个创建于2013年的品牌，有提供中国香港、美国、日本、新加坡区域虚拟化服务器业务，所有业务均对中国大陆地区线路优化，已经如果做海外线路的话，竞争力不够。今天有看到HostKvm夏季优惠发布，主要针对香港国际和韩国VPS提供7折优惠，折后最低月付5.95美元，其他机房VPS依然是全场8折。第一、夏...
graphsearch为你推荐
-
combininggoogletracerouteLinux 下traceroute的工作原理是什么 ！ipadwifiIPAD连上了WIFI，但是无法上网，急！！css下拉菜单html+css下拉菜单怎么制作联通版iphone4s怎么知道到苹果4s是联通版，还是移动版googleadsense10分钟申请Google Adsense是一种怎样的体验chromeframe我的Chrome Frame为什么不能使用?firefoxflash插件火狐浏览器怎么安装flash联通合约机iphone5想咨询一下联通iphone5合约机和裸机的区别？routeaddroute add 命令后，本地连接的ipv4默认网关会被自动清除。这个默认网关应该怎么设置？