Cognition · Data store

Persistent Search Tree Store

Data storeCognitionCognition & Memoryarc:PersistentSearchTreeStore

A store retaining a search's per-node cost values, parent pointers and consistency information across planning cycles so later replans can reuse them.

Responsibility. Persists search-tree bookkeeping between planning cycles.

Also known as: LPA* search tree, g-value and parent-pointer cache

Direct neighbourhood (hover for relationship types)

Relationships

is read by dependency

Incremental Search Replanner Ch5.6

is written by dependency

Incremental Search Replanner Ch5.6

Design guidance

MUST be budgeted for: it consumes more memory than standard A*, which is wasted in environments that rarely change.

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.