A Mechanical Threshold and Divergence Law for Collective Transport: Closed-Form Theory, Rigid-Body Simulation, and Decentralized Reinforcement Learning

We study collective transport, in which N simple robots jointly push a rigid body toward a goal. From elementary rigid-body dynamics and Coulomb friction we derive a closed-form mechanical threshold N * = µmg/F max below which the body cannot leave rest, and show that the time to reach a goal at distance d diverges as T (N) ∼ (N − N *) −1/2. A Newton–Euler simulation with stick–slip friction recovers α = 0.500 to within 0.1% in five physical regimes, with errors that decrease roughly in proportion to the time step. We then test whether the law survives decentralized, communication-free control with noisy local sensing, and derive a closed-form noise-coherence correction N * eff = N * e σ 2 /2 for controllers that do not compensate their sensing errors. In the simple setting, the central methodological finding is a control: an untrained identity policy (applied force direction equal to the sensed goal direction) already attains 100% success, α ≈ 0.49 and N 0 ≈ 29.8. Consequently, in that setting success and exponent recovery by a trained policy are not evidence of learning. With the goal direction randomized, 20 independently trained policies converge to this identity map (sensitivity slope 1.00 ± 0.00) and the correction matches the observed threshold within 0.5% at every noise level tested (σ step ∈ [0, 0.5] rad); with a fixed goal, trained policies instead partly memorize the goal and fall below the correction. Masked-input negative controls behave as controls only when the goal is randomized. Rotational dynamics do not alter the translational law. Finally, where learning has something to learn, i.e. in a harder task with large sensing error and an offset centre of mass, we train decentralized policies with MAPPO (residual-angle action, threshold curriculum, recurrent memory); they far exceed standard MARL baselines and slightly exceed tuned designed controllers at the training condition (success 0.813 ± 0.025 over 10 seeds versus 0.758 and 0.781), but are worse than those controllers at low noise, and the margin over the strongest learned baselines is not significant on fresh seeds. All results are simulation-only.

Authors

Institutions

Publication Details

Journal
Research Square
Published
2026-11-18
DOI
https://doi.org/10.21203/rs.3.rs-11415783/v1
Primary Topic
Reinforcement Learning in Robotics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

A Mechanical Threshold and Divergence Law for Collective Transport: Closed-Form Theory, Rigid-Body Simulation, and Decentralized Reinforcement Learning

Milad Tahavor, Mohsen Rabdoost Motlagh
Research Square
Reinforcement Learning in Robotics
preprint

A Mechanical Threshold and Divergence Law for Collective Transport: Closed-Form Theory, Rigid-Body Simulation, and Decentralized Reinforcement Learning

Milad Tahavor, Mohsen Rabdoost Motlagh
preprint en

Abstract

We study collective transport, in which N simple robots jointly push a rigid body toward a goal. From elementary rigid-body dynamics and Coulomb friction we derive a closed-form mechanical threshold N * = µmg/F max below which the body cannot leave rest, and show that the time to reach a goal at distance d diverges as T (N) ∼ (N − N *) −1/2. A Newton–Euler simulation with stick–slip friction recovers α = 0.500 to within 0.1% in five physical regimes, with errors that decrease roughly in proportion to the time step. We then test whether the law survives decentralized, communication-free control with noisy local sensing, and derive a closed-form noise-coherence correction N * eff = N * e σ 2 /2 for controllers that do not compensate their sensing errors. In the simple setting, the central methodological finding is a control: an untrained identity policy (applied force direction equal to the sensed goal direction) already attains 100% success, α ≈ 0.49 and N 0 ≈ 29.8. Consequently, in that setting success and exponent recovery by a trained policy are not evidence of learning. With the goal direction randomized, 20 independently trained policies converge to this identity map (sensitivity slope 1.00 ± 0.00) and the correction matches the observed threshold within 0.5% at every noise level tested (σ step ∈ [0, 0.5] rad); with a fixed goal, trained policies instead partly memorize the goal and fall below the correction. Masked-input negative controls behave as controls only when the goal is randomized. Rotational dynamics do not alter the translational law. Finally, where learning has something to learn, i.e. in a harder task with large sensing error and an offset centre of mass, we train decentralized policies with MAPPO (residual-angle action, threshold curriculum, recurrent memory); they far exceed standard MARL baselines and slightly exceed tuned designed controllers at the training condition (success 0.813 ± 0.025 over 10 seeds versus 0.758 and 0.781), but are worse than those controllers at low noise, and the margin over the strongest learned baselines is not significant on fresh seeds. All results are simulation-only.

Research Square
Imam Hossein University (IR), Iran University of Science and Technology (IR)
Reinforcement Learning in Robotics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon