集体反事实规划：表征约束下的协调、同意与验证
Collective Counterfactual Planning: Coordination, Consent, and Verification under Representational Constraints
浏览论文内容
中文总结 AI 辅助
该研究提出集体反事实规划（CCP）形式化模型，分析表征约束下群体规划的可行性，揭示正负二元性，给出四步可解性方案，解释群体协作的几何机制。
中文摘要 AI 辅助
群体通常能完成单个成员无法单独规划、执行或验证的项目。我们针对这一现象提出了形式化模型：集体反事实规划（Collective Counterfactual Planning, CCP），其中每个智能体的核心限制并非能力、知识或可观测性，而是表征几何：每个智能体仅通过向共同任务空间中自身特有的子空间投影，感知状态、构想行动、同意动作并认证目标要求。四个“门”共同决定团队能否达成合取目标并合法确认已达成：执行每个动作所需的外生实施联盟，以及三个表征门——构想门、同意门和任务相对验证资格门。我们定义了集体反事实可解性（Collective Counterfactual Solvability, CCS）问题，将几何可行性、可执行达成与已验证完成分离开来。结果揭示了正负二元性：迭代跨智能体接力可解锁单次个体计划汇集无法包含的解决方案，但任何本质上依赖于整个团队不可见子空间的目标要求均无法验证，因此无法合法完成，即便轨迹偶然达到该目标。无记忆且经审核的同意进一步约束不同对象——行动方向与累积轨迹状态，且二者互不支配。在接力闭合的精确表征下，四步穷尽有界视界可解性方案是可靠且完备的；受限实施对返回计划保持可靠，但未必完备。该模型为以下场景提供了几何框架：顺序相互赋能、执行者无法知晓目的的步骤的胜任执行、专业边界处的强制子团队划分，以及无法合法声明的完成。
英文摘要
Groups routinely complete projects that no single member can plan, execute, or verify alone. We propose a formal model of this phenomenon, Collective Counterfactual Planning (CCP), in which the binding limitation on each agent is neither capability, knowledge, nor observability, but representational geometry: each agent perceives the state, conceives moves, consents to actions, and certifies goal requirements only through a projection onto an agent-specific subspace of a common task space. Four gates jointly determine whether a team can reach a conjunctive goal and legitimately recognize that it has done so: the exogenous implementation coalitions required to perform each action, together with three representational gates -- conception, consent, and task-relative verification qualification. We define the Collective Counterfactual Solvability (CCS) problem, separating geometric feasibility, executable attainment, and validated completion. The results expose a positive-negative duality. Iterated cross-agent relay can unlock a solution that no one-shot pooling of individual plans contains, but any goal requirement depending essentially on the subspace dark to the entire team is unverifiable and therefore not validly completable, even when the trajectory accidentally attains it. Memoryless and audited consent further constrain different objects -- action directions versus cumulative trajectory states -- and neither dominates the other. A four-step exhaustive horizon-bounded solvability scheme is sound and complete under exact representation of the relay closure; restricted implementations remain sound on returned plans but need not be complete. The model gives one geometry for sequential mutual enabling, competent execution of steps whose purpose is invisible to the executor, forced sub-teaming at expertise boundaries, and completion that cannot be validly declared.
发表机构
- National Electronics and Computer Technology Center (NECTEC)（国家电子与计算机技术中心（NECTEC））
机构由 AI 辅助整理，请以论文原文为准。
