Cognition · Software component
Plan Repairer
Software componentCognitionCognition & Memoryarc:PlanRepairer
A replanner that identifies the invalidated segment of the current plan and searches only for a patch reconnecting to its still-valid later segments.
Responsibility. Minimally modifies the invalidated segment of an existing plan while preserving valid segments.
Also known as: Plan repair, Local plan patcher
Variant of Replanner abstract
When to choose. Choose when discrepancies are localized, adaptation must be fast, and plan stability matters (multi-robot committed trajectories, user-communicated ETAs); good-enough solutions suffice.
Relationships
invokes dependency
- Graph Search Planner abstract Ch5.6
is routed to by dynamic
fails over to control
alternative to variability
Design guidance
- SHOULD be used when failures are localized, response time is tight, or other agents and users rely on plan continuity.
- MUST fall back to complete replanning when no feasible reconnection to the original plan exists.
Quantitative guidance
As stated by the sources; verify before use.
- Repaired delivery route preserved 40-50% of planned actions and the original arrival direction (Ch5.6).
Classification
- Patterns
- Plan repairSegment reconnection
- Quality attributes
- Reliability (ISO/IEC 25010 | NIST AI RMF: valid and reliable)Performance efficiency (ISO/IEC 25010)
- Risks mitigated
- Disruption to downstream agents relying on committed plans
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.