Cooperative Transport of Unknown Objects by Distributed Effort Regulation in Multi-agent Systems

Tamzidul Mina, Shyam S. Kannan, Wonse Jo, Shaocheng Luo, Galen B. King, Byung-Cheol MinarXiv 2026 · arXiv

TL;DR

Researchers have developed a decentralized, "model-free" strategy that allows a team of robots to transport objects of completely unknown shape, size, and mass distribution. By sharing only their individual heading errors, robots dynamically adjust their pushing force and relocate around the object's boundary to ensure it moves steadily toward a goal, even when the object's center of mass shifts mid-transport.

What Problem Does This Paper Address?

Moving a heavy or awkward object with a team of robots is a classic challenge in swarm robotics. Traditional approaches usually fall into two camps: caging/grasping, which requires specific object geometries and high-torque grippers, or pushing, which is more versatile but notoriously difficult to control.

The "pushing" problem is hard because if you don't know the object's center of mass (CoM) or the friction of the floor, the object will drift or rotate unpredictably. Most existing solutions solve this by using a "model-based" approach—essentially giving the robots a digital map of the object beforehand. However, in real-world scenarios like search-and-rescue or warehouse debris clearing, you rarely have a CAD model of the junk you need to move. This paper tackles the challenge of cooperative transport with zero prior knowledge of the object’s physical properties.

Methods

The authors propose a distributed control framework that combines a Finite State Machine (FSM) for high-level behavior and a novel effort regulation law for low-level control.

  1. The FSM (The "Brain"): Each robot operates independently through six states: searching for the object, moving toward it, following its boundary, making contact, pushing, and re-acquiring the object if contact is lost.
  2. Boundary Following: Robots use a potential field approach to "orbit" the object. They look for a viable pushing surface—specifically, a spot where pushing will move the object generally toward the goal.
  3. Effort Regulation (The "Secret Sauce"): This is the core innovation. Instead of pushing with a constant force, robots adjust their "pushing effort" based on two variables:
  4. Individual Heading Error: How far off-course the robot thinks it is relative to the goal.
  5. Collective Heading Error ($\theta_{net}$): The sum of errors from all robots currently pushing. If a robot sees that the group is drifting in the same direction it is, it increases its pushing force to counter that drift. If the drift becomes too extreme to correct, the robot simply stops, relocates, and finds a better pushing spot.

Datasets

As a robotics research paper, the "datasets" consist of controlled experimental environments used to validate the algorithm:

  • Physical Experiments: Conducted using iRobot Create platforms and a VICON motion capture system. Objects included a uniform disk and a 3.5kg rectangular box.
  • Dynamic Weight Test: A 2.2kg weight was added to one side of the box during transport to simulate a sudden shift in the center of mass.
  • Simulation (V-Rep/CoppeliaSim): Used to test scalability and complex geometries. This included a large, non-convex "L-shaped" object with non-uniform mass distribution.
  • Scalability Study: Trials were run with robot counts ranging from $N=1$ to $N=20$.

Key Insights and Ideas

  • Model-Free is Possible: You don't need to know where the center of mass is if your robots can "feel" the drift and compensate for it in real-time.
  • Communication is Minimal: Robots don't need to share their positions or complex plans; they only need to broadcast a single value—their current heading error.
  • The "Pushing Surface" Bottleneck: The paper reveals that adding more robots doesn't always help. The speed of transport is limited by the "available pushing surfaces" of the object. If an object is small or has a complex shape, too many robots will just get in each other's way.
  • Self-Correction via Relocation: By setting a threshold for heading error ($\phi$), the system ensures that robots don't waste energy pushing from bad angles. They effectively "fire themselves" and go look for a better spot on the object's perimeter.

Key Results

  • High Efficiency: In disk transport trials, the system achieved a path efficiency of 96%. Even with complex rectangular boxes, efficiency remained above 71%.
  • Robustness to Shifts: When a 2.2kg weight was dropped onto the object mid-run, the robots successfully sensed the resulting rotation and adjusted their differential pushing force to straighten the path, maintaining 87.7% path efficiency.
  • Optimal Team Size: In simulations with an arbitrary shape, performance improved as the team grew to 10 robots. However, at 20 robots, the transport time actually increased because the robots spent too much time relocating to avoid collisions with one another.

Limitations and Future Work

While the system is robust, the authors note several areas for improvement:

  • 2D Constraints: The current work is strictly planar (2D). Moving objects over uneven terrain or in 3D space remains a future challenge.
  • Continuous Sensing: The model assumes robots can continuously estimate their heading toward the goal, which might be difficult in GPS-denied or highly occluded environments.
  • Wheel Slip: While the system is robust to some slip, the authors want to integrate "anti-slip awareness" directly into the effort regulation model to handle extremely slippery surfaces (like ice or oil).
  • Heterogeneous Teams: Future iterations could explore how robots with different strengths or sensor suites could collaborate using this same decentralized logic.

Summary updated

Abstract

A distributed multi-robot object transportation strategy is proposed for objects of unknown shape, size, geometry, mass and mass distribution without any prior knowledge about the object or number of robots involved in the transportation process. Robots follow the boundary of the object and dynamically determine viable pushing points. A novel object-model-free heading-error-driven pushing effort regulation method is proposed to promote goal-directed object motion; robots regulate their pushing effort using individual and collective heading errors. Robots dynamically relocate around the object boundary if a pushing point is lost or the required pushing effort exceeds its capability to correct its heading. The proposed method is validated using simple and complex shapes with convex and non-convex boundary regions and dynamically changing weight distribution of objects. Detailed analysis on the effects of robot distribution and initial object pose on the transportation performance in terms of required time and path efficiency is also presented. Scalability analysis revealed that object transportation time is dependent on the number of pushing surfaces available which in turn depends on the object size, shape, and set inter-robot safety distance. The proposed system yielded highly efficient object paths with consistent elapsed transport times over several trials robust to external disturbances such as non-uniform friction between contacting surfaces and robot wheel slip.
BibTeX
@misc{mina2026cooperative,
  author = {Tamzidul Mina and Shyam S. Kannan and Wonse Jo and Shaocheng Luo and Galen B. King and Byung-Cheol Min},
  title = {{Cooperative Transport of Unknown Objects by Distributed Effort Regulation in Multi-agent Systems}},
  year = {2026},
  eprint = {2611.19731},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2611.19731},
}
Figure