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
SugarHosts糖果主机商更换域名
昨天，遇到一个网友客户告知他的网站无法访问需要帮他检查到底是什么问题。这个同学的网站是我帮他搭建的，于是我先PING看到他的网站是不通的，开始以为是服务器是不是出现故障导致无法打开的。检查到他的服务器是有放在SugarHosts糖果主机商中，于是我登录他的糖果主机后台看到服务器是正常运行的。但是，我看到面板中的IP地址居然是和他网站解析的IP地址不同。看来官方是有更换域名。于是我就问 客服到底是什...
HostKvm新上联通CUVIP线路VPS,八折优惠后1G内存套餐$5.2/月起
最近上洛杉矶机房联通CUVIP线路主机的商家越来越多了，HostKvm也发来了新节点上线的邮件，适用全场8折优惠码，基于KVM架构，优惠后最低月付5.2美元起。HostKvm是一家成立于2013年的国人主机商，提供基于KVM架构的VPS主机，可选数据中心包括日本、新加坡、韩国、美国、中国香港等多个地区机房，君选择国内直连或优化线路，延迟较低，适合建站或者远程办公等。以洛杉矶CUVIP线路主机为例，...
bluehost32元/月，2核2G/20GB空间,独立ip，新一代VPS美国云主机!
bluehost怎么样?bluehost推出新一代VPS美国云主机!前几天，BlueHost也推出了对应的周年庆活动，全场海外虚拟主机月付2.95美元起，年付送免费的域名和SSL证书，通过活动进入BlueHost中文官网，购买虚拟主机、云虚拟主机和独立服务器参与限时促销。今天，云服务器网(yuntue.com)小编给大家介绍的是新一代VPS美国云主机，美国SSD云主机，2核2G/20GB空间,独立...
graphsearch为你推荐
-
centrescss恶意win7技术参数及要求:支持ipadipad如何上网如何用手机流量在IPAD上上网win10关闭445端口win10家庭版怎么禁用445端口ipad上网为什么我的ipad 显示无法连接到网络win7telnetwindows7旗舰版中telnet在哪用itunes备份如何使用itunes完整备份iPhone资料重庆电信宽带管家电信的宽带上网助手是什么？