A Novel Virtual Geometry Shadowing Approach For Multi-Robot Formation Control In Dynamic Environments

Abstract Existing multi-robot cooperative transport techniques suffer from continuous communication dependency to maintain load-supporting configurations. Leader-Follower schemes require constant communication between robots, while centralized virtual structure approaches demand continuous position feedback. As multi-robot fleets scale up in logistics automation and smart factory environments, continuous inter-robot communication loads the shared wireless channel with control-rate traffic and creates computational bottlenecks, posing critical risks to the stable transport of fragile payloads. This paper proposes the Shadowing technique to resolve this communication dependency. The key innovation is that robots maintain formation and continue transport during communication outages by following a pre-transmitted time-space trajectory of the virtual polygon framework. Each robot independently maintains its assigned position based on pre-stored timestamps. Communication is only required when dynamic obstacles are detected or positional errors exceed thresholds. Through experiments across 16, 200 trials per path planner (3 map types $$\times $$ × 4 obstacle densities $$\times $$ × 3 formation methods $$\times $$ × 3 formation sizes (2, 4, and 6 robots) $$\times $$ × 150 trials), using Anytime D* as the path planning backbone, Shadowing achieved an average reduction in communication message count of $$93.8\%$$ 93.8 % , $$94.3\%$$ 94.3 % , and $$95.5\%$$ 95.5 % relative to Leader-Follower for 2-, 4-, and 6-robot formations respectively, and $$97.8\%$$ 97.8 % , $$97.0\%$$ 97.0 % , and $$97.4\%$$ 97.4 % relative to Centralized-VS; these communication-reduction figures refer to message counts, and a complementary data-volume analysis is reported as well. In this quantitative campaign, each dynamic obstacle appears at a random time uniformly distributed over 1– $$2\,\textrm{s}$$ 2 s and remains static thereafter; continuously moving obstacles are evaluated separately in a physics-based Gazebo study. Shadowing completed missions $$25.0\%$$ 25.0 % , $$21.2\%$$ 21.2 % , and $$21.5\%$$ 21.5 % faster than Leader-Follower across the three formation sizes, while incurring only 4.6– $$10.0\%$$ 10.0 % longer mission time than Centralized-VS in exchange for a 42– $$48\%$$

Authors

Institutions

Publication Details

Journal
Journal of Intelligent & Robotic Systems
Published
2026-11-16
DOI
https://doi.org/10.1007/s10846-026-02488-5
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

A Novel Virtual Geometry Shadowing Approach For Multi-Robot Formation Control In Dynamic Environments

Hyunchul Tae, Donghyun Lee, Hoolark Jung
Journal of Intelligent & Robotic Systems
Distributed Control Multi-Agent Systems
article

A Novel Virtual Geometry Shadowing Approach For Multi-Robot Formation Control In Dynamic Environments

Hyunchul Tae, Donghyun Lee, Hoolark Jung
article en

Abstract

Abstract Existing multi-robot cooperative transport techniques suffer from continuous communication dependency to maintain load-supporting configurations. Leader-Follower schemes require constant communication between robots, while centralized virtual structure approaches demand continuous position feedback. As multi-robot fleets scale up in logistics automation and smart factory environments, continuous inter-robot communication loads the shared wireless channel with control-rate traffic and creates computational bottlenecks, posing critical risks to the stable transport of fragile payloads. This paper proposes the Shadowing technique to resolve this communication dependency. The key innovation is that robots maintain formation and continue transport during communication outages by following a pre-transmitted time-space trajectory of the virtual polygon framework. Each robot independently maintains its assigned position based on pre-stored timestamps. Communication is only required when dynamic obstacles are detected or positional errors exceed thresholds. Through experiments across 16, 200 trials per path planner (3 map types $$\times $$ × 4 obstacle densities $$\times $$ × 3 formation methods $$\times $$ × 3 formation sizes (2, 4, and 6 robots) $$\times $$ × 150 trials), using Anytime D* as the path planning backbone, Shadowing achieved an average reduction in communication message count of $$93.8\%$$ 93.8 % , $$94.3\%$$ 94.3 % , and $$95.5\%$$ 95.5 % relative to Leader-Follower for 2-, 4-, and 6-robot formations respectively, and $$97.8\%$$ 97.8 % , $$97.0\%$$ 97.0 % , and $$97.4\%$$ 97.4 % relative to Centralized-VS; these communication-reduction figures refer to message counts, and a complementary data-volume analysis is reported as well. In this quantitative campaign, each dynamic obstacle appears at a random time uniformly distributed over 1– $$2\,\textrm{s}$$ 2 s and remains static thereafter; continuously moving obstacles are evaluated separately in a physics-based Gazebo study. Shadowing completed missions $$25.0\%$$ 25.0 % , $$21.2\%$$ 21.2 % , and $$21.5\%$$ 21.5 % faster than Leader-Follower across the three formation sizes, while incurring only 4.6– $$10.0\%$$ 10.0 % longer mission time than Centralized-VS in exchange for a 42– $$48\%$$

Journal of Intelligent & Robotic Systems
Sogang University (KR), Korea Institute of Industrial Technology (KR), Texas A&M University (US)
Korea Institute of Industrial Technology
Industry, innovation and infrastructure
Distributed Control Multi-Agent Systems
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