Expand description
fleet-coordinate — Geometric constraint satisfaction for fleet coordination
Unifies three mathematical results: Zero Holonomy Consensus (ZHC), Beam Joint Equilibrium, and Pythagorean48 trust topology.
Key theorem: A fleet with Laman-rigid constraint topology (2V-3 edges, no over-constrained cycles) is provably self-coordinating without voting.
Re-exports§
pub use zhc::ZhcConsensus;pub use zhc::ConsensusResult;pub use beam::BeamSolver;pub use beam::JointEquilibrium;pub use beam::MultiSegmentBeam;pub use beam::JointState;pub use pythagorean48::TrustTopology;pub use pythagorean48::TrustVector;pub use graph::FleetGraph;pub use graph::RigidityResult;pub use tile::FleetTile;pub use tile::TileCoordination;pub use emergence::EmergenceDetector;pub use emergence::EmergenceResult;pub use integration::FleetCoordinate;pub use integration::Config;
Modules§
- beam
- Beam Joint Equilibrium — spline-physics Phase D, re-exported for fleet-coordinate
- emergence
- H¹ Emergence Detection Detects over-constrained fleet graphs via Betti number β₁ = E-V+1.
- graph
- Fleet Constraint Graph — Laman Rigidity + H¹ Cohomology
- integration
- Fleet Coordinate Integration — the unified API
- pythagorean48
- Pythagorean48 Trust Topology — Maximum Information Per Bit
- tile
- PLATO Tile Integration — fleet coordination via tile forwarding
- zhc
- Zero Holonomy Consensus — ZHC from holonomy-consensus, re-exported for fleet-coordinate
Constants§
- MAX_
RIGID_ NEIGHBORS - Maximum neighbors for rigidity (Laman’s theorem: 2V-3)
- TRUST_
BITS_ PER_ VECTOR - Information content per trust vector (log₂ 48 ≈ 5.585 bits)