Author
|
Conference
|
Journal
|
Organization
|
Year
|
DOI
Look for results that meet for the following criteria:
since
equal to
before
between
and
Search in all domains
Limit my searches in the following domains
Agriculture Science
Arts & Humanities
Biology
Chemistry
Computer Science
Economics & Business
Engineering
Environmental Sciences
Geosciences
Material Science
Mathematics
Medicine
Physics
Social Science
Multidisciplinary
Keywords
(3)
Conceptual Framework
Graph Search
Search Strategy
Related Publications
(77)
Depth-First Iter...
A note on two problems in connection with graphs
Geometric SpeedUp Techniques for Finding Shortest Paths in Large Sparse Graphs
Heuristics - intelligent search strategies for computer problem solving
A shortest path algorithm for grid graphs
Subscribe
Academic
Publications
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
Edit
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
(
Citations: 1274
)
BibTex
|
RIS
|
RefWorks
Download
Peter Hart
,
Nils Nilsson
,
Bertram Raphael
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.
Journal:
IEEE Transactions on Systems, Man and Cybernetics, Part A: Systems and Humans - TSMCA
, vol. 4, no. 2, pp. 100-107, 1968
DOI:
10.1109/TSSC.1968.300136
Cumulative
Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
(
ieeexplore.ieee.org
)
Citation Context
(695)
...Goal-directed search, also called A ∗ [
20
], has been adapted to the time-dependent scenario [14]; an efficient version (called ALT) for the static case has been presented in [16, 17]...
Daniel Delling
.
Time-Dependent SHARC-Routing
...One of the most known and efficient optimum algorithm is the A� [
10
]...
...Four algorithms are compared: 1) hill; 2) beam (k = 5 cm); 3) optimal A�, with classical heuristic h(x) = ||x xg|| [
10
]; 4) suboptimal A*, with amplified heuristic h(x) = 1.5||x xg|| (quicker than the previous, [18])...
C. Loconsole
,
et al.
An online trajectory planning method for visually guided assisted reac...
...In the dynamic program and in the heuristic approach, all shortest paths are computed using the A ∗ algorithm (
Hart et al. 1968
), which has proved...
Alessandro Agnetis
,
et al.
A job-shop problem with one additional resource type
...For the initial path search, the A* algorithm [
18
] is applied to the initially sampled road map...
Franz Andert
,
et al.
Mapping and path planning in complex environments: An obstacle avoidan...
...Exact methods generally involve branch and bound and A ¤ -search [
28
]...
G. Battistelli
,
et al.
Optimal Flow Models for Multiscan Data Association
References
(1)
Realization of a geometry theorem proving machine
(
Citations: 140
)
H. Gelernter
Conference:
World Computer Congress - IFIP
, pp. 273-281, 1959
Order by:
Citations
(1274)
Similarity of business process models: Metrics and evaluation
(
Citations: 13
)
Remco M. Dijkman
,
Marlon Dumas
,
Boudewijn F. van Dongen
,
Reina Käärik
,
Jan Mendling
Journal:
Information Systems - IS
, vol. 36, no. 2, pp. 498-516, 2011
Efficient Routing on Large Road Networks Using Hierarchical Communities
(
Citations: 2
)
Qing Song
,
Xiaofan Wang
Journal:
IEEE Transactions on Intelligent Transportation Systems - TITS
, vol. 12, no. 1, pp. 132-140, 2011
Time-Dependent SHARC-Routing
(
Citations: 2
)
Daniel Delling
Journal:
Algorithmica
, vol. 60, no. 1, pp. 60-94, 2011
An online trajectory planning method for visually guided assisted reaching through a rehabilitation robot
(
Citations: 2
)
C. Loconsole
,
R. Bartalucci
,
A. Frisoli
,
M. Bergamasco
Conference:
International Conference on Robotics and Automation - ICRA
, pp. 1445-1450, 2011
A job-shop problem with one additional resource type
(
Citations: 1
)
Alessandro Agnetis
,
Marta Flamini
,
Gaia Nicosia
,
Andrea Pacifici
Journal:
Journal of Scheduling - SCHEDULING
, vol. 14, no. 3, pp. 225-237, 2011