Graph-Based Planning
Overview
Graph-based planning represents places, actions, task dependencies, or possible system states as nodes and connections, then searches the graph for a sequence that meets goals and constraints. Classical approaches include A*, Dijkstra, hybrid and any-angle search, and optimization over graphs of convex sets; they are used in robot navigation, multi-agent pathfinding, and task execution. Newer methods add sparse or topological maps, learned heuristics and graph neural networks, world models, and task graphs for language-model agents. A central challenge is balancing speed and scalability with optimality, safety, and reliable behavior when maps or conditions change.
Latest papers
99 papers15 papers in the last four weeks, up 7% on the four weeks before. 0.1% of all new papers.