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

轻云互联-618钜惠秒杀,香港CN2大宽带KVM架构云服务器月付22元,美国圣何塞精品云月付19元爆款!海量产品好货超值促销进行中!

官方网站:点击访问青云互联活动官网优惠码:终身88折扣优惠码:WN789-2021香港测试IP:154.196.254美国测试IP:243.164.1活动方案:用户购买任意全区域云服务器月付以上享受免费更换IP服务;限美国区域云服务器凡是购买均可以提交工单定制天机防火墙高防御保护端口以及保护模式;香港区域购买季度、半年付、年付周期均可免费申请额外1IP;使用优惠码购买后续费周期终身同活动价,价格不...

2021年7月最新洛杉矶CN2/香港CN2 vps套餐及搬瓦工优惠码 循环终身优惠6.58%

搬瓦工怎么样?2021年7月最新vps套餐推荐及搬瓦工优惠码整理,搬瓦工优惠码可以在购买的时候获取一些优惠,一般来说力度都在 6% 左右。本文整理一下 2021 年 7 月最新的搬瓦工优惠码,目前折扣力度最大是 6.58%,并且是循环折扣,续费有效,可以一直享受优惠价格续费的。搬瓦工优惠码基本上可能每年才会更新一次,大家可以收藏本文,会保持搬瓦工最新优惠码更新的。点击进入:搬瓦工最新官方网站搬瓦工...

GeorgeDatacenter:洛杉矶/达拉斯/芝加哥/纽约vps云服务器;2核/8GB/250GB/2TB流量/1Gbps端口,$84/年

georgedatacenter怎么样?GeorgeDatacenter是一家2017年成立的美国商家,正规注册公司(REG: 10327625611),其实是oneman。现在有优惠,有几款特价VPS,基于Vmware。支持Paypal付款。GeorgeDatacenter目前推出的一款美国vps,2核/8GB内存/250GB NVMe空间/2TB流量/1Gbps端口/Vmware/洛杉矶/达拉...

graphsearch为你推荐
支持route内存nod32支持ipad支持ipad支持ipad重庆宽带测速重庆云阳电信宽带测速网址谁知道,帮个忙?win10445端口怎么样打开电脑10800端口重庆电信网速测试电信100M下载速度多少M,为什么我家里电信100M下载速度最快5M美妙,是不是严重缩水fusionchartsFusionCharts连接数据库你是怎么解决的,能告诉我吗?谢谢啦重庆电信宽带测速重庆电信光纤宽带网络,内外网络和电脑等设备都没发生变化的情况下,办理了从20M提速到100M业务。
域名邮箱 域名解析文件 美国主机推荐 Dedicated 台湾谷歌地址 毫秒英文 jsp空间 hktv 怎么建立邮箱 沈阳主机托管 韩国代理ip 秒杀品 lamp兄弟连 深圳域名 存储服务器 广州主机托管 nnt godaddy中文 免费网站加速 ubuntu安装教程 更多