Hart P.E., Nilsson N.J., Raphael B., A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Trans. SSC SSC-4, 1968, 100-107. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Fundamenta Informaticae 68 (2005) 47--102 47 IOS Press - Calculus Of Bounded (Correct)
No context found.
Hart P.E., Nilsson N.J., Raphael B., A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Trans. SSC SSC-4, 1968, 100-107.
Global Pairwise Sequence Alignments With Multiple Scoring - Matrices Changjin Hong (Correct)
No context found.
P. E. Hart, N. J. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Transactions on SSC4, 2:100-7, 1968
Behavior Planning for Character Animation - Lau, Kuffner (2005) (Correct)
No context found.
HART P., NILSSON N., RAFAEL B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. and Cyb. 4 (1968), 100--107. J. F.: Animating human athletics. In Proc. ACM SIGGRAPH 95 (Annual Conference Series) (1995), pp. 71--78.
A New Approach in Agent Path-Finding using State Mark - Gradients Florin Leon (Correct)
No context found.
Hart P. E., Nilsson N. J., Raphael B., A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on System Science and Cybernetics, 4, 100-107, 1968.
Is Bayesian Imitation Learning the Route to Believable.. - Thurau, Paczian, Bauckhage (2005) (Correct)
No context found.
Hart, P., Nilsson, N. & Raphael, B. (1968), `A Formal Basis for the Heuristic Determination of Minimum Cost Paths', IEEE Trans. on Systems Science and Cybernetics 4(2), 100--107.
Exploiting the Fascination: Video Games in Machine Learning.. - Bauckhage, Thurau (2003) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," EEE Trans. on Systems Science and Cybernetics, vol. 4, no. 2, pp. 100--107, 1968.
Heuristic-Guided Counterexample Search in FLAVERS - Tan, Avrunin, Clarke.. (2004) (Correct)
No context found.
P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100--107, 1968.
Heuristically Accelerated Q-Learning: a new approach to.. - Bianchi, Ribeiro, Costa (Correct)
No context found.
P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100--107, 1968.
Salient Closed Boundary Extraction with Ratio Contour - Wang, Kubota, Siskind, Wang (2005) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum-Cost Path," IEEE Trans. Systems, Man, and Cybernetics, vol. 4, pp. 100-107, 1968.
Conflict-directed A* and Its Role in Model-based Embedded.. - Williams, Ragno (Correct)
No context found.
P. E. Hart, N. J. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics SSC-4 (2) (1968) 100--107.
A Behavior Architecture for Autonomous Mobile Robots Based on.. - Laue, Röfer (2004) (1 citation) (Correct)
No context found.
Hart, P., Nilsson, N.J., Raphael, B.: A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs. IEEE Transactions on Systems Science and Cybernetics SSC-4 (1968) 100--107
Efficient Optimal Search of Euclidean-Cost Grids and Lattices - Kuffner (2004) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Rafael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Sys. Sci. and Cyb., vol. 4, pp. 100--107, 1968.
Impact of Realistic Workload in Peer-to-Peer Systems - A Case .. - Costa, Richard (2002) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics, 2:100 107, 1968.
Conflict-directed A* and Its Role in Model-based Embedded.. - Williams, Ragno (2003) (Correct)
No context found.
P. E. Hart, N. J. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics SSC-4 (2) (1968) 100--107.
Impact of Realistic Workload in Peer-to-Peer Systems - A Case .. - Costa, Richard (2003) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Raphael, A formal basis for the heuristic determination of minimum cost paths, IEEE Transactions on Systems Science and Cybernetics, 2 (1968), pp. 100-107.
Combining Ordered Best-First Search with Branch and.. - Ebendt, Günther.. (2004) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Raphael, "A formal basis for the heuristic determination of minimum cost paths," IEEE Trans. Syst. Sci. Cybern., Vol. 2, pp. 100-107, 1968.
Combining Speed-Up Techniques for Shortest-Path Computations - Holzer, Schulz, Willhalm (2004) (Correct)
No context found.
Hart, P., Nilsson, N.J., Raphael, B.A.: A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Sys. Sci. Cybernet. 2 (1968)
Planning Graph Based Heuristics for Automated Planning - Nigenda (2003) (Correct)
No context found.
N.J. Nilsson P.E. Hart and B. Raphael, A Formal Basis for the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics, vol. 2, 1968, pp. 100--107.
Search in Trees with Chance Nodes - Hauk (2004) (Correct)
No context found.
P. E. Hart, N. J. Nillson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, 4(2):100-107, 1968.
Computing the Shortest Path: A* Search Meets Graph Theory - Goldberg, Harrelson (2004) (Correct)
No context found.
P. E. Hart, N. J. Nilsson, and B. Raphael. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on System Science and Cybernetics, SSC-4(2), 1968.
RoboCup 2002 - Hans-Dieter Burkhard Uwe (2002) (Correct)
No context found.
P. E. Hart, N. J. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. In IEEE Transactions on Systems, Man, and Cybernetics, volume SSC-4:2, pages 100--107. Institute of Electrical and Electronics Engineers, Inc., 1968. 168 REFERENCES 169
Grid-based Path-finding - Yap (2002) (Correct)
No context found.
P. Hart, N. Nilsson, and B. Raphael. A formal basis for the heuristic determination of minimum cost paths. IEEE Trans. Syst. Sci. Cybernet., 4(2):100{ 107, 1968.
Real-Time Search for Autonomous Agents and Multiagent Systems - Ishida (1998) (3 citations) (Correct)
No context found.
P. E. Hart, N. J. Nilsson and B. Raphael, "A Formal Basis for the Heuristic Determination of Minimum Cost Paths," IEEE Trans. on Systems Science and Cybernetics, vol. 4#2, pp.100#107, 1968.
Controlling the Learning Process of Real-Time Heuristic Search - Shimbo, Ishida (2003) (1 citation) (Correct)
No context found.
P.E. Hart, N.J. Nilsson, B. Raphael, A formal basis for the heuristic determination of minimum cost path, IEEE Trans. Systems Sci. Cybernet. (SSC) 4 (2) (1968) 100--107.
Specification and Analysis of Real-time Problem Solvers - Hamidzadeh, Shekhar (1993) (2 citations) (Correct)
No context found.
P. E. Hart, N. J. Nilsson, and B. Raphael, A Formal Basis For the Heuristic Determination of Minimum Cost Paths, IEEE Transactions on Systems Science and Cybernetics SSC4 (2) pp. 100-107 (1968).
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC