Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

A* search algorithm · Vinony

EntityQ277680· pop 32· linked from 104 articles

A* search algorithm

Sign in to save

algorithm used for pathfinding and graph traversal

Connections

search algorithm

Bellman–Ford algorithm

Nils John Nilsson

Artificial intelligence

computer science

International Standard Book Number

digital object identifier

International Standard Serial Number

Princeton University

natural language processing

Dijkstra's algorithm

Categories

Combinatorial optimization Game artificial intelligence Graph algorithms Graph distance Greedy algorithms Heuristic algorithms Routing algorithms Search algorithms

Sources

wikipedia.externallinksexternallink

What links here104 pages

Dijkstra's algorithm

iterative deepening depth-first search

branch and bound

admissible heuristic

shortest path problem

Johnson's algorithm

route planning software

Nils John Nilsson

outline of artificial intelligence

navigation mesh

Viterbi algorithm

bidirectional search

symbolic artificial intelligence

knowledge representation and reasoning

Eurocopter AS350 Écureuil

breadth-first search

Simplified Memory-Bounded A*

graph traversal

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.29

jump point search

Entitydist 0.46

Entitydist 0.56

Entitydist 0.57

distance-vector routing protocol

Entitydist 0.59

Entitydist 0.60

Entitydist 0.61

Path MTU Discovery

Entitydist 0.61

treasure hunting

Entitydist 0.63

West Highland Way

Entitydist 0.63

Entitydist 0.65

particle swarm optimization

Entitydist 0.65