← Back to all news
arXiv AI By Chainarong Amornbunchornvej

Collective Counterfactual Planning: Coordination, Consent, and Verification under Representational Constraints

Read the original on arXiv AI →

The paper introduces Collective Counterfactual Planning (CCP), a formal model describing how teams coordinate tasks that no single member can handle alone, constrained not by capability but by representational geometry. CCP defines four critical gates—exogenous implementation coalitions, conception, consent, and task-relative verification—that determine whether a team can achieve and legitimately recognize a conjunctive goal. The authors present the Collective Counterfactual Solvability (CCS) problem, separating geometric feasibility, executable attainment, and validated completion, and provide a sound and complete four-step solvability scheme under exact representation of relay closure.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

Related stories

arXiv AI
Sep 18

Coding Agents with an Obstacle-Aware Harness for Safe Robot Manipulation

The paper introduces SafeHarness, an obstacle‑aware framework that improves the safety of coding agents for robot manipulation. By decomposing tasks into route planning and contact execution, the harness enables the agent to prioritize collision avoidance, achieving 71.9% task success and 87.5% collision avoidance—significantly better than prior methods. The study demonstrates that safety constraints can be effectively integrated into language‑model‑driven robot controllers.

By Bingxin Xu, Yuzhang Shang, Zhen Dong, Emilio Ferrara
llmsagentsroboticsbenchmarkssafety
More like this →
arXiv Machine Learning
Sep 11

Topological Necessities: Mechanism-Invariant Strategic Subgoals for Cross-Embodiment Goal-Conditioned Control

The paper introduces topological necessities—mechanism‑invariant subgoals derived from the topology of successful trajectories—used to guide long‑horizon goal‑conditioned reinforcement learning. By computing homology in dimensions 0 and 1 over a transport‑weighted carrier, the authors obtain an enumerable gate set that forms a recursive topological gate hierarchy. These certified gates transfer across different embodiments (e.g., from PointMaze to Ant and Humanoid) without retraining, achieving state‑of‑the‑art performance on several benchmark tasks.

By Hao Shi, Xi Li
reinforcement-learning
More like this →