Cognition · Data store
State-Space Graph
Data storeCognitionCognition & Memoryarc:StateSpaceGraph
A persistent graph of reachable states (e.g., grid cells, intersections, waypoints) and weighted transitions whose edge costs and blocked edges planners search over.
Responsibility. Holds the navigable states and current edge costs used for path search.
Also known as: Navigation mesh, Road network graph, Search graph, Map
Relationships
is read by dependency
- Graph Search Planner abstract Ch5.6
- Heuristic Estimator abstract Ch5.6
- Incremental Search Replanner Ch5.6
is written by dependency
Design guidance
- SHOULD record blocked edges as infinite cost so dependent plans can be invalidated and repaired.
Quantitative guidance
As stated by the sources; verify before use.
- Examples: 50,000-node warehouse navigation mesh; 2 million-intersection city road network; 1000x1000 grid warehouse (Ch5.6).
Classification
- Patterns
- Weighted graphOccupancy grid
Sources
- Ch5.6: T. Nguyen, "A* Search and Replaning," in Mastering Agentic AI Systems: Guide for the NVIDIA NCP-AAI Exam, 1st ed. 2026, ch. 5.6. ISBN: 9798244538229.