Journal ArticleDOI
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Reads0
Chats0
TLDR
How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.Abstract:
Although the problem of determining the minimum cost path through a graph arises naturally in a number of interesting applications, there has been no underlying theory to guide the development of efficient search procedures. Moreover, there is no adequate conceptual framework within which the various ad hoc search strategies proposed to date can be compared. This paper describes how heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching and demonstrates an optimality property of a class of search strategies.read more
Citations
More filters
Book
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
TL;DR: Probabilistic Reasoning in Intelligent Systems as mentioned in this paper is a complete and accessible account of the theoretical foundations and computational methods that underlie plausible reasoning under uncertainty, and provides a coherent explication of probability as a language for reasoning with partial belief.
Journal ArticleDOI
A multi-modal parcellation of human cerebral cortex
Matthew F. Glasser,Timothy S. Coalson,Emma C. Robinson,Emma C. Robinson,Carl D. Hacker,John W. Harwell,Essa Yacoub,Kamil Ugurbil,Jesper L. R. Andersson,Christian F. Beckmann,Mark Jenkinson,Stephen Smith,David C. Van Essen +12 more
TL;DR: Using multi-modal magnetic resonance images from the Human Connectome Project and an objective semi-automated neuroanatomical approach, 180 areas per hemisphere are delineated bounded by sharp changes in cortical architecture, function, connectivity, and/or topography in a precisely aligned group average of 210 healthy young adults.
Journal ArticleDOI
An algorithm for planning collision-free paths among polyhedral obstacles
TL;DR: A collision avoidance algorithm for planning a safe path for a polyhedral object moving among known polyhedral objects that transforms the obstacles so that they represent the locus of forbidden positions for an arbitrary reference point on the moving object.
Journal ArticleDOI
Depth-first iterative-deepening: an optimal admissible tree search
TL;DR: This heuristic depth-first iterative-deepening algorithm is the only known algorithm that is capable of finding optimal solutions to randomly generated instances of the Fifteen Puzzle within practical resource limits.
Book
Multiagent Systems
TL;DR: This second edition has been completely revised, capturing the tremendous developments in multiagent systems since the first edition appeared in 1999.
References
More filters
Journal ArticleDOI
Solutions of the shortest-route problem-a review
Maurice Pollack,Walter Wiebenson +1 more
TL;DR: Several methods are available for determining the shortest route through a network and these methods are described in some detail with added remarks as to their relative merits.