The Triadic Cognitive Architecture: Bounding Autonomous Action via Spatio-Temporal and Epistemic Friction

arXiv cs.AI / 4/1/2026

💬 OpinionSignals & Early TrendsIdeas & Deep AnalysisModels & Research

Key Points

  • The paper argues that LLM-driven autonomous agents often lack intrinsic constraints on network topology, temporal pacing, and epistemic limits, leading to failure modes in interactive settings.
  • It introduces the Triadic Cognitive Architecture (TCA), grounding agent reasoning in continuous-time physics and combining nonlinear filtering, Riemannian routing geometry, and optimal control.
  • TCA formalizes “Cognitive Friction” as path-dependent, physically constrained information acquisition, replacing heuristic stop-tokens with an HJB-motivated stopping boundary.
  • The approach uses a rollout-based approximation of belief-dependent value-of-information and halts via a net-utility condition to avoid excessive deliberation.
  • In a simulated Emergency Medical Diagnostic Grid environment, the triadic policy reduces time-to-action and improves patient viability while maintaining diagnostic accuracy versus greedy baselines.

Abstract

Current autonomous AI agents, driven primarily by Large Language Models (LLMs), operate in a state of cognitive weightlessness: they process information without an intrinsic sense of network topology, temporal pacing, or epistemic limits. Consequently, heuristic agentic loops (e.g., ReAct) can exhibit failure modes in interactive environments, including excessive tool use under congestion, prolonged deliberation under time decay, and brittle behavior under ambiguous evidence. In this paper, we propose the Triadic Cognitive Architecture (TCA), a unified mathematical framework that grounds machine reasoning in continuous-time physics. By synthesizing nonlinear filtering theory, Riemannian routing geometry, and optimal control, we formally define the concept of Cognitive Friction. We map the agent's deliberation process to a coupled stochastic control problem where information acquisition is path-dependent and physically constrained. Rather than relying on arbitrary heuristic stop-tokens, the TCA uses an HJB-motivated stopping boundary and instantiates a rollout-based approximation of belief-dependent value-of-information with a net-utility halting condition. Through empirical validation in a simulated Emergency Medical Diagnostic Grid (EMDG), we demonstrate that while greedy baselines over-deliberate under latency and congestion costs, the triadic policy reduces time-to-action while improving patient viability without degrading diagnostic accuracy in this environment.