Structural Propagation Bound
Abstract
We show that instantaneous global propagation of admissibility updates is incompatible with structured persistence in spatially differentiated state spaces. As a consequence, any admissibility-based architecture must admit a finite upper bound on the propagation of admissibility non-equivalence. This bound is defined as a structural propagation bound.
Fields of Study & Subjects
Constraint Satisfaction and Optimization
AI-based Problem Solving and Planning
Robotic Path Planning Algorithms
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 17 January 2026
- Document type
- Preprint