Evidence map›Paper›PMID 38947931›Full record

ArticleArXiv2025

Temporal network restructuring improves control of indecisive collectives.

Tuhin Chakrabortty, Saad Bhamla

Abstract readPreprint
In one paragraph

Article in ArXiv, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

5 · Who and what money

Authors and funding

2 authors.

Tuhin ChakraborttyGeorgia Institute of Technology, USA.
Saad BhamlaGeorgia Institute of Technology, USA.

Funding

Biophysical mechanism and synthetic engineering of optically-controlled Ca2+-powered supramolecular enginesR35GM142588 · NIGMS · UNIVERSITY OF COLORADO · PI SAAD BHAMLA · 2021 to 2026
$4.4M
NIGMS NIH HHS R35 GM142588
6 · The paper itself

Abstract

Controlling stochastic temporal networks remains an open challenge in control theory. While predictable temporal networks with known future dynamics enhance controllability, real-world networks often exhibit stochasticity and unpredictability, making control harder. Here, we investigate control mechanisms for stochastic temporal networks by analyzing how biological controllers, such as shepherd dogs, manage panicked flocks of sheep. We studied a century-old shepherding competition, the sheepdog trials, where small groups of sheep unpredictably switch between fleeing and following behaviors-effectively forming stochastic temporal networks. Unlike large, cohesive flocks, these small, indecisive flocks are difficult to control, yet skilled dog-handler teams excel at both herding and splitting them (shedding) on demand. Using a stochastic choice model to describe the sheep's behavioral shifts, we found that trained dogs exploit stochastic indecisiveness, typically seen as an obstacle, as a control tool, enabling both herding and splitting of noisy groups of sheep. Building on these insights, we developed the Indecisive Swarm Algorithm (ISA) for artificial agents and benchmarked its performance against standard approaches, including the Averaging-Based Swarm Algorithm (ASA) and the Leader-Follower Swarm Algorithm (LFSA). ISA minimizes control energy in trajectory-following tasks and outperforms alternatives under noisy conditions. By framing these results within a stochastic temporal network perspective, we demonstrate that even probabilistic knowledge of future dynamics can enhance control efficiency in specific scenarios. These findings establish a framework for managing stochastic temporal networks with applications in noisy, behavior-switching animal collectives, swarm robotics, and opinion dynamics.

Identifiers

PMID38947931
PMCPMC11213128

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.