PDF4PRO ⚡AMP

Modern search engine that looking for books and documents around the web

Example: biology

The Optimality of A*

The Optimality of A*Presented byJarrell Waggoner&Jimmy Cleveland12/09/08 Overview1 IntroductionBasics ofA and definitions that will be used throughout thispresentation2 Dimensions of AnalysisThe contenders withA , the scoring system, and the problemsthat will be compared3 AnalysisExploration of two theorems that show the power, andlimitations ofA 4A A reformulation that solves some of the shortcomings ofA 5 ConclusionOverview of some of the other finding of this paper, andreferencesIntroductionDimensions of AnalysisAnalysisA ConclusionInformed SearchUninformed search:no information about the goal state,other than if it has been reached yetInformed search:some heuristic information about the goalstate is available at each node in the graphUninformed Search Informed SearchDepth-firstBest-firstBreadth-first A DijkstraPresented by Jarrell Waggoner & Jimmy ClevelandThe Optimality of A*IntroductionDimensions of AnalysisAnalysisA ConclusionIntroduction to A*Historical NotesA :Created in 1968 A Formal Basis for the Heuristic Determination ofMinimum Cost Paths Authored by Peter Hart, Nils Nilsson, and BertramRaphaelIn the original paper, the algorithm we now know asA wassimply labeled Algorithm A.

Dec 09, 2008 · Overview 1 Introduction Basics of A∗ and definitions that will be used throughout this presentation 2 Dimensions of Analysis The “contenders” with A∗, the scoring system, and the problems that will be compared 3 Analysis Exploration of two theorems that show the power, and limitations of A∗ 4 A∗∗ A reformulation that solves some of the shortcomings of A∗

Loading..

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Spam in document Broken preview Other abuse

Transcription of The Optimality of A*

Related search queries