arxiv: 2605.13006 · v1 · submitted 2026-05-13 · 💻 cs.RO · cs.MA

Recognition: 2 theorem links

· Lean Theorem

Occlusion-Based Object Transportation Around Obstacles With a Swarm of Miniature Robots

Breno Cunha Queiroz , Daniel MacRae

Authors on Pith no claims yet

Pith reviewed 2026-05-14 19:17 UTC · model grok-4.3

classification 💻 cs.RO cs.MA

keywords swarm roboticsobject transportationocclusion-baseddecentralizedfinite-state machineobstaclesminiature robots

0 comments

The pith

Finite-state machines enable swarms to transport objects around blocking obstacles by forming local sub-goal chains without communication.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

Previous occlusion-based methods for swarm object transport fail when obstacles block the direct view from object to goal. This work adds a simple state machine so robots can locally detect occlusion and create sub-goals that chain together to restore effective visibility. The approach stays fully decentralised and works in clear scenarios too. Simulations across five experiment sets confirm it handles different obstacle shapes and starting conditions provided the swarm is large enough to sustain the chain. If correct, this removes a major barrier to using simple swarm strategies in realistic cluttered spaces.

Core claim

Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal while preserving the fully decentralised and communication-free nature of the original strategy. Robots use local sensing to establish sub-goals that form a chain, and the method remains effective without obstacles and across varied positions and convex or concave shapes, as shown in five sets of simulated experiments.

What carries the argument

A finite-state machine enabling local detection of occlusion and establishment of sub-goals to form a visibility chain to the goal.

If this is right

Swarms succeed with obstacles blocking direct line-of-sight by using sub-goal chains.
Performance stays consistent in obstacle-free environments.
The strategy works with varied starting positions of the swarm.
Both concave and convex obstacles can be handled.
A large enough swarm is required to keep the chain from breaking.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

Reliable local sensing for occlusion would be essential for deployment on physical robots.
The sub-goal chain idea could apply to other decentralised swarm tasks like navigation or assembly.
The system might adapt to moving obstacles if chains can reform dynamically.
Swarm size requirements could be quantified to predict success thresholds.

Load-bearing premise

Robots using only local sensing can accurately detect occlusions and set sub-goals that connect into a stable chain, and the swarm is always large enough to prevent breaks.

What would settle it

A test where the swarm is large but transport fails around an obstacle due to incorrect local sub-goal placement or chain breakage from sensing errors.

read the original abstract

Swarm robotics utilises decentralised self-organising systems to form complex collective behaviours built from the bottom-up using individuals that have limited capabilities. Previous work has shown that simple occlusion-based strategies can be effective in using swarm robotics for the task of transporting objects to a goal position. However, this strategy requires a clear line-of-sight between the object and the goal. In this paper, we extend this strategy by allowing robots to form sub-goals; enabling any member of the swarm to establish a wider range of visibility of the goal, ultimately forming a chain of sub-goals between the object and the goal position. We do so while preserving the fully decentralised and communication-free nature of the original strategy, while maintaining performance in object-free scenarios. In five sets of simulated experiments, we demonstrate the generalisability of our proposed strategy. Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal. The method is robust to varying starting positions and can handle both concave and convex shapes.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The sub-goal chain via local FSM is a clean fix for blocked line-of-sight in occlusion transport, but the work stays simulation-only with perfect-sensing assumptions.

read the letter

The main point is that this paper adds a finite-state machine letting individual robots create sub-goals when an obstacle blocks direct sight to the goal, so the swarm can still push the object around it. The FSM keeps everything decentralized and communication-free, and the authors say it does not degrade performance in obstacle-free cases. That directly solves the line-of-sight limit from earlier occlusion work without adding parameters or central control. The five simulation sets test varying start positions plus concave and convex obstacles, which shows the chain forms reliably when the swarm is large enough. The approach is straightforward and stays faithful to the original strategy's constraints. What works well is the independent definition of the rules and the coverage of different obstacle shapes in simulation. The central claim holds up on its own terms because the FSM is not circular and the experiments are parameter-free. The soft spot is the complete lack of hardware results. All validation assumes perfect local detection of occlusions and positions, which miniature robots rarely deliver in practice due to sensor limits, noise, and pushing variability. If sub-goal accuracy slips, the chain breaks even with many robots. The abstract also gives no numbers on success rates or measurement details, so the quantitative backing is light. This is useful incremental work for people already doing decentralized swarm transport or occlusion methods. A reader focused on practical extensions would get value from the FSM design and the sim cases. It deserves a serious referee to press on the sensing assumptions and ask for hardware validation next. I would send it for review rather than desk reject.

Referee Report

2 major / 2 minor

Summary. The paper extends prior occlusion-based decentralized swarm strategies for object transportation by introducing a finite-state machine that lets individual robots detect occlusions and establish local sub-goals, thereby forming chains that route the object around obstacles blocking direct line-of-sight to the goal. The approach remains fully communication-free and parameter-free. Validation consists of five sets of simulated experiments demonstrating robustness to initial conditions and both concave and convex obstacle shapes while preserving performance in obstacle-free cases.

Significance. If the local-sensing assumptions hold, the work meaningfully widens the applicability of simple occlusion-based swarms to cluttered environments without sacrificing decentralization or introducing communication, offering a scalable alternative to centralized planners for miniature-robot collectives.

major comments (2)

[Experimental evaluation] The experimental evaluation (five simulated experiment sets) assumes perfect local detection of object, goal, and occlusions with no modeled sensor noise, limited field-of-view, or actuation variability. This assumption is load-bearing for the sub-goal chain claim; without it the FSM may fail to maintain connectivity even for large swarms.
[Experimental evaluation] No quantitative metrics (success rates, transport times, chain-breakage frequency) with error bars or statistical tests are reported, nor is there a direct comparison against the original occlusion strategy on the same obstacle scenarios. This weakens the claim that performance is maintained in object-free cases and that the extension is generalizable.

minor comments (2)

[Abstract] The abstract states the method is 'robust' and 'generalizable' but supplies no numerical results; adding at least one key performance figure would improve readability.
[Method] Notation for the finite-state machine states and transitions is introduced without an accompanying diagram or explicit transition table, making the decentralized rules harder to follow.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the constructive feedback and positive assessment of the significance of our work. We address each major comment below and will revise the manuscript to strengthen the experimental evaluation.

read point-by-point responses

Referee: [Experimental evaluation] The experimental evaluation (five simulated experiment sets) assumes perfect local detection of object, goal, and occlusions with no modeled sensor noise, limited field-of-view, or actuation variability. This assumption is load-bearing for the sub-goal chain claim; without it the FSM may fail to maintain connectivity even for large swarms.

Authors: We acknowledge that the current simulations assume ideal sensing to focus on validating the core algorithmic contribution of the finite-state machine for sub-goal chain formation. This is a standard approach for initial evaluation of decentralized strategies in swarm robotics. We agree that real-world sensor noise, limited field-of-view, and actuation variability could affect chain connectivity. In the revised manuscript, we will add a new subsection explicitly discussing these assumptions and their implications for the sub-goal claim. We will also incorporate additional simulation results with moderate Gaussian noise applied to occlusion detection and robot positioning to show basic robustness, while noting that comprehensive noisy-sensor and hardware experiments remain future work. revision: partial
Referee: [Experimental evaluation] No quantitative metrics (success rates, transport times, chain-breakage frequency) with error bars or statistical tests are reported, nor is there a direct comparison against the original occlusion strategy on the same obstacle scenarios. This weakens the claim that performance is maintained in object-free cases and that the extension is generalizable.

Authors: We agree that quantitative metrics and a direct baseline comparison are needed to support the claims of maintained performance and generalizability. In the revised manuscript, we will add tables and plots reporting success rates, mean transport times with standard deviations, and chain-breakage frequencies across 50 independent trials per scenario, including error bars and t-test results for statistical significance. We will also include a new comparison subsection against the original occlusion strategy on identical obstacle scenarios, demonstrating that our extension enables successful transport where the baseline fails due to occlusion, while showing no statistically significant degradation in obstacle-free cases. revision: yes

Circularity Check

0 steps flagged

Finite-state machine rules defined independently; no reduction to inputs by construction

full rationale

The paper's central extension is a finite-state machine whose state transitions and sub-goal formation rules are specified explicitly from local occlusion sensing. These rules do not reference fitted parameters, self-referential equations, or prior results by the same authors in a load-bearing way. The base occlusion strategy is cited as prior work, but the new chain-forming behavior is introduced directly without uniqueness theorems or ansatzes smuggled via self-citation. The derivation therefore remains self-contained as a rule-based system rather than tautological.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The approach rests on standard swarm-robotics assumptions about local sensing and decentralized control; no free parameters or new entities are introduced in the abstract.

axioms (2)

domain assumption Robots possess limited local sensing sufficient to detect occlusion and relative positions of object and goal
Required for the occlusion-based decision rules to function without communication.
domain assumption A sufficiently large swarm is available to maintain sub-goal chains
Explicitly stated as necessary for the method to succeed around obstacles.

pith-pipeline@v0.9.0 · 5478 in / 1221 out tokens · 31517 ms · 2026-05-14T19:17:24.353510+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Foundation/RealityFromDistinction.lean reality_from_one_distinction unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

Our finite-state machine allows a sufficiently large swarm to transport objects around obstacles that block the goal while preserving the fully decentralised and communication-free nature of the original strategy.
IndisputableMonolith/Cost/FunctionalEquation.lean washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

the robots push the object whenever it occludes the direct line-of-sight towards the goal

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

55 extracted references · 4 canonical work pages

[1]

Cooperative object transport with a swarm of e-puck robots: robustness and scalability of evolved collective strategies , volume =

M H M Alkilabi and Aparajit Narayan and Elio Tuci , doi =. Cooperative object transport with a swarm of e-puck robots: robustness and scalability of evolved collective strategies , volume =. Swarm Intelligence , month =
[2]

A review of swarm robotics tasks , volume =

Levent Bayindir , doi =. A review of swarm robotics tasks , volume =. Neurocomputing , keywords =
[3]

Experimental Study and Modeling of Group Retrieval in Ants as an Approach to Collective Transport in Swarm Robotic Systems , volume =

Spring Berman and Quentin Lindsey and Mahmut Selman Sakar and Vijay Kumar and Stephen C Pratt , doi =. Experimental Study and Modeling of Group Retrieval in Ants as an Approach to Collective Transport in Swarm Robotic Systems , volume =. Proceedings of the IEEE , pages =
[4]

Autonomous transportation and deployment with aerial robots for search and rescue missions , volume =

Markus Bernard and Konstantin Kondak and Ivan Maza and Anibal Ollero , doi =. Autonomous transportation and deployment with aerial robots for search and rescue missions , volume =. Journal of Field Robotics , pages =
[5]

A pusher/steerer model for strongly cooperative mobile robot manipulation , volume =

R G Brown and J S Jennings , doi =. A pusher/steerer model for strongly cooperative mobile robot manipulation , volume =. Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots , pages =

1995
[6]

Frontiers in Robotics and AI , title =

Daniel Carrillo-Zapata and Emma Milner and Julian Hird and Georgios Tzoumas and Paul J Vardanega and Mahesh Sooriyabandara and Manuel Giuliani and Alan F T Winfield and Sabine Hauert , doi =. Frontiers in Robotics and AI , title =
[7]

A Strategy for Transporting Tall Objects with a Swarm of Miniature Mobile Robots , year =

Jianing Chen and Melvin Gauci and Roderich Groß , doi =. A Strategy for Transporting Tall Objects with a Swarm of Miniature Mobile Robots , year =. 2013 IEEE International Conference on Robotics and Automation , pages =

2013
[8]

Occlusion-Based Cooperative Transport with a Swarm of Miniature Mobile Robots , volume =

Jianing Chen and Melvin Gauci and Wei Li and Andreas Kolling and Roderich Groß , doi =. Occlusion-Based Cooperative Transport with a Swarm of Miniature Mobile Robots , volume =. IEEE Transactions on Robotics , pages =
[9]

Decentralized sliding mode control for autonomous collective transport by multi-robot systems , year =

Hamed Farivarnejad and Sean Wilson and Spring Berman , doi =. Decentralized sliding mode control for autonomous collective transport by multi-robot systems , year =. 2016 IEEE 55th Conference on Decision and Control (CDC) , pages =

2016
[10]

Fully Decentralized Controller for Multi-Robot Collective Transport in Space Applications , year =

Hamed Farivarnejad and Amir Salimi Lafmejani and Spring Berman , doi =. Fully Decentralized Controller for Multi-Robot Collective Transport in Space Applications , year =. 2021 IEEE Aerospace Conference (50100) , pages =

2021
[11]

Multirobot Control Strategies for Collective Transport , volume =

Hamed Farivarnejad and Spring Berman , doi =. Multirobot Control Strategies for Collective Transport , volume =. Annual Review of Control, Robotics, and Autonomous Systems , pages =
[12]

Emergent oscillations assist obstacle negotiation during ant cooperative transport , volume =

Aviram Gelblum and Itai Pinkoviezky and Ehud Fonio and Nir S Gov and Ofer Feinerman , doi =. Emergent oscillations assist obstacle negotiation during ant cooperative transport , volume =. Proceedings of the National Academy of Sciences , pages =
[13]

Group Transport of an Object to a Target That Only Some Group Members May Sense , volume =

Roderich Groß and Marco Dorigo , doi =. Group Transport of an Object to a Target That Only Some Group Members May Sense , volume =. Lecture Notes in Computer Science , month =
[14]

Towards Group Transport by Swarms of Robots , volume =

Roderich Groß and Marco Dorigo , doi =. Towards Group Transport by Swarms of Robots , volume =. International Journal of Bio-Inspired Computation , month =
[15]

Simulating collective transport of virtual ants , volume =

Shihui Guo and Meili Wang and Gabriel Notman and Jian Chang and Jianjun Zhang and Minghong Liao , doi =. Simulating collective transport of virtual ants , volume =. Computer Animation and Virtual Worlds , keywords =
[16]

Distributed path planning for collective transport using homogeneous multi-robot systems , volume =

Golnaz Habibi and William Xie and Mathew Jellins and James McLurkin , doi =. Distributed path planning for collective transport using homogeneous multi-robot systems , volume =. Springer Tracts in Advanced Robotics , pages =

work page
[17]

Ishii and Aaron T

Wenqi Hu and Kelly S. Ishii and Aaron T. Ohta , doi =. Micro-assembly using optically controlled bubble microrobots , volume =. Applied Physics Letters , month =
[18]

Schenker , title =

Terry Huntsberger and Guillermo Rodriguez and Paul S. Schenker , title =. Robotics 2000 , chapter =. doi:10.1061/40476(299)45 , editor =

work page doi:10.1061/40476(299)45 2000
[19]

Collective transport of arbitrarily shaped objects using robot swarms , volume =

Marius Jurt and Emma Milner and Mahesh Sooriyabandara and Sabine Hauert , doi =. Collective transport of arbitrarily shaped objects using robot swarms , volume =. Artificial Life and Robotics , keywords =
[20]

Transportation of a single object by two decentralized-controlled nonholonomic mobile robots , volume =

K Kosuge and T Oosumi and M Satou and K Chiba and K Takeo , doi =. Transportation of a single object by two decentralized-controlled nonholonomic mobile robots , volume =. Proceedings. 1998 IEEE International Conference on Robotics and Automation (Cat. No.98CH36146) , pages =

1998
[21]

Decentralized control of multiple robots handling an object , volume =

K Kosuge and T Oosumi , doi =. Decentralized control of multiple robots handling an object , volume =. Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS '96 , pages =
[22]

Cooperative transport by ants and robots , volume =

C Ronald Kube and Eric Bonabeau , journal =. Cooperative transport by ants and robots , volume =. 2000 , doi =

2000
[23]

Ronald Kube and Hong Zhang , doi =

C. Ronald Kube and Hong Zhang , doi =. Task Modelling in Collective Robotics , volume =. Autonomous Robots , keywords =
[24]

Automatic modular design of robot swarms using behavior trees as a control architecture , volume =

Antoine Ligot and Jonas Kuckling and Darko Bozhinoski and Mauro Birattari , doi =. Automatic modular design of robot swarms using behavior trees as a control architecture , volume =. PeerJ Computer Science , month =
[25]

Cooperative manipulation and transportation with aerial robots , volume =

Nathan Michael and Jonathan Fink and Vijay Kumar , doi =. Cooperative manipulation and transportation with aerial robots , volume =. Autonomous Robots , pages =
[26]

Object Manipulation through Explicit Force Control Using Cooperative Mobile Multi-Robot Systems , volume =

Michael Neumann and Matthew Chin and C Kitts , journal =. Object Manipulation through Explicit Force Control Using Cooperative Mobile Multi-Robot Systems , volume =
[27]

Path formation in a robot swarm , volume =

Shervin Nouyan and Alexandre Campo and Marco Dorigo , doi =. Path formation in a robot swarm , volume =. Swarm Intelligence , pages =
[28]

Collective Robotic Site Preparation , volume =

Chris A C Parker and Hong Zhang , doi =. Collective Robotic Site Preparation , volume =. Adaptive Behavior , pages =
[29]

Adaptive distributed fetching and retrieval of goods by a swarm-bot , year =

G C Pettinaro and L M Gambardella and A Ramirez-Serrano , doi =. Adaptive distributed fetching and retrieval of goods by a swarm-bot , year =. ICAR '05. Proceedings., 12th International Conference on Advanced Robotics, 2005. , pages =

2005
[30]

Cooperative Micromanipulation Using the Independent Actuation of Fifty Microrobots in Parallel , volume =

M Arifur Rahman and Julian Cheng and Zhidong Wang and Aaron T Ohta , doi =. Cooperative Micromanipulation Using the Independent Actuation of Fifty Microrobots in Parallel , volume =. Scientific Reports , pages =
[31]

MeWBots: Mecanum-Wheeled Robots for Collaborative Manipulation in an Obstacle-Clustered Environment Without Communication , volume =

Aditya Rauniyar and Hem Chandra Upreti and Aman Mishra and Prabhu Sethuramalingam , doi =. MeWBots: Mecanum-Wheeled Robots for Collaborative Manipulation in an Obstacle-Clustered Environment Without Communication , volume =. Journal of Intelligent & Robotic Systems , pages =
[32]

A survey of literature on automated storage and retrieval systems , volume =

Kees Jan Roodbergen and Iris F A Vis , doi =. A survey of literature on automated storage and retrieval systems , volume =. European Journal of Operational Research , keywords =
[33]

On the Scalability of Vision-Based Drone Swarms in the Presence of Occlusions , volume =

Fabian Schilling and Enrica Soria and Dario Floreano , doi =. On the Scalability of Vision-Based Drone Swarms in the Presence of Occlusions , volume =. IEEE Access , month =
[34]

Balancing robot swarm cost and interference effects by varying robot quantity and size , volume =

Adam Schroeder and Brian Trease and Alessandro Arsie , doi =. Balancing robot swarm cost and interference effects by varying robot quantity and size , volume =. Swarm Intelligence , pages =
[35]

The I-SWARM Project: Intelligent Small World Autonomous Robots for Micro-manipulation , volume =

Jörg Seyfried and Marc Szymanski and Natalie Bender and Ramon Estaña and Michael Thiel and Heinz Wörn , doi =. The I-SWARM Project: Intelligent Small World Autonomous Robots for Micro-manipulation , volume =. undefined , pages =
[36]

Object manipulation and position control using a swarm with global inputs , year =

Shiva Shahrokhi and Aaron T Becker , doi =. Object manipulation and position control using a swarm with global inputs , year =. 2016 IEEE International Conference on Automation Science and Engineering (CASE) , pages =

2016
[37]

Placing objects with multiple mobile robots-mutual help using intention inference , volume =

H Sugie and Y Inagaki and S Ono and H Aisu and T Unemi , doi =. Placing objects with multiple mobile robots-mutual help using intention inference , volume =. Proceedings of 1995 IEEE International Conference on Robotics and Automation , pages =

1995
[38]

Collision Avoidance Algorithm for Two Tracked Mobile Robots Transporting a Single Object in Coordination Based on Function Allocation Concept , year =

Hiroki Takeda and Yasuhisa Hirata and Zhi-Dong Wang and Kazuhiro Kosuge , doi =. Collision Avoidance Algorithm for Two Tracked Mobile Robots Transporting a Single Object in Coordination Based on Function Allocation Concept , year =. Distributed Autonomous Robotic Systems 5 , pages =
[39]

Cooperative Object Transport in Multi-Robot Systems: A Review of the State-of-the-Art , volume =

Elio Tuci and Muhanad Alkilabi and Otar Akanyeti , doi =. Cooperative Object Transport in Multi-Robot Systems: A Review of the State-of-the-Art , volume =. Frontier in Robotics and AI , month =
[40]

Self-organized flocking in mobile robot swarms , volume =

Ali E Turgut and Hande Çelikkanat and Fatih Gökçe and Erol Şahin , doi =. Self-organized flocking in mobile robot swarms , volume =. Swarm Intelligence , pages =
[41]

Kinematic multi-robot manipulation with no communication using force feedback , year =

Zijian Wang and Mac Schwager , doi =. Kinematic multi-robot manipulation with no communication using force feedback , year =. 2016 IEEE International Conference on Robotics and Automation (ICRA) , pages =

2016
[42]

Cooperative Transportation by Multiple Robots with Machine Learning , year =

Ying Wang and C W de Silva , doi =. Cooperative Transportation by Multiple Robots with Machine Learning , year =. 2006 IEEE International Conference on Evolutionary Computation , pages =

2006
[43]

Design of ant-inspired stochastic control policies for collective transport by robotic swarms , volume =

Sean Wilson and Theodore P Pavlic and Ganesh P Kumar and Aurélie Buffin and Stephen C Pratt and Spring Berman , doi =. Design of ant-inspired stochastic control policies for collective transport by robotic swarms , volume =. Swarm Intelligence , pages =
[44]

The I-SWARM project , year =

Heinz Woern and Marc Szymanski and Joerg Seyfried , doi =. The I-SWARM project , year =. The 15th IEEE International Symposium on Robot and Human Interactive Communication , pages =
[45]

and Ponce, J

Sudsang, A. and Ponce, J. , journal=. A new approach to motion planning for disc-shaped robots manipulating a polygonal object in the plane , year=
[46]

and Kosuge, K

Zhidong Wang and Hirata, Y. and Kosuge, K. , journal=. Control multiple mobile robots for object caging and manipulation , year=
[47]

Teamwork in Self-Organized Robot Colonies , year=

Nouyan, Shervin and Gross, Roderich and Bonani, Michael and Mondada, Francesco and Dorigo, Marco , journal=. Teamwork in Self-Organized Robot Colonies , year=
[48]

and Kazama, T

Sugawara, K. and Kazama, T. and Watanabe, T. , journal=. Foraging behavior of interacting robots with virtual pheromone , year=
[49]

Biological Cybernetics , year=

Artificial pheromone for path selection by a foraging swarm of robots , author=. Biological Cybernetics , year=
[50]

2020 , note =

Breno Cunha Queiroz , title =. 2020 , note =

2020
[51]

2023 , note =

Breno Cunha Queiroz and Daniel MacRae , title =. 2023 , note =

2023
[52]

CoRR , volume =

Lin Zhang and Hao Xiong and Ou Ma and Zhaokui Wang , title =. CoRR , volume =. 2020 , url =. 2007.09243 , timestamp =

work page arXiv 2020
[53]

Evolving Group Transport Strategies for e-Puck Robots: Moving Objects Towards a Target Area

M H M Alkilabi and Narayan, Aparajit and Lu, Chuan and Tuci, Elio. Evolving Group Transport Strategies for e-Puck Robots: Moving Objects Towards a Target Area. Distributed Autonomous Robotic Systems: The 13th International Symposium. 2018. doi:10.1007/978-3-319-73008-0_35

work page doi:10.1007/978-3-319-73008-0_35 2018
[54]

Non-Prehensile Cooperative Object Transportation with Omnidirectional Mobile Robots: Organization, Control, Simulation, and Experimentation , year=

Ebel, Henrik and Eberhard, Peter , booktitle=. Non-Prehensile Cooperative Object Transportation with Omnidirectional Mobile Robots: Organization, Control, Simulation, and Experimentation , year=
[55]

2024 , eprint=

Do We Run Large-scale Multi-Robot Systems on the Edge? More Evidence for Two-Phase Performance in System Size Scaling , author=. 2024 , eprint=

2024