Evidence map›Paper›PMID 39661582›Full record

ArticlePloS one2024

Agent swarms: Cooperation and coordination under stringent communications constraint.

Paul Kinsler, Sean Holman, Andrew Elliott, Cathryn N Mitchell, R Eddie Wilson

Abstract read
In one paragraph

Article in PloS one, 2024. 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

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

5 authors.

Paul KinslerDepartment of Electronic & Electrical Engineering University of Bath, Bath, United Kingdom.ORCID 0000-0001-5744-8146
Sean HolmanDepartment of Mathematics, University of Manchester, Manchester, United Kingdom.
Andrew ElliottSchool of Mathematics and Statistics, University of Glasgow, Glasgow, United Kingdom.ORCID 0000-0002-4536-5244
Cathryn N MitchellDepartment of Electronic & Electrical Engineering University of Bath, Bath, United Kingdom.
R Eddie WilsonDepartment of Engineering Mathematics, University of Bristol, Bristol, United Kingdom.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Here we consider the communications tactics appropriate for a group of agents that need to "swarm" together in a challenging communications environment. Swarms are increasingly important in a number of applications, including land, air, sea and space exploration, and their constituent agents could be satellites, drones, or other autonomous vehicles. A particularly difficult problem is to autonomously connect a swarm of agents together in a situation where stringent communication constraints are present, whether due to a need for stealth, restricted on-board power, external requirements to avoid certain broadcast directions, or equipment & hardware limitations. Here we present a novel, discrete, geometry-free model applicable to multi-agent swarm communications where a group of agents need to connect together and where the constraints on the communications dominate the algorithmic outcomes. No global knowledge of the agent locations is held and hence our framework proposes agent-centric performance metrics. We demonstrate our model using a set of candidate connectivity tactics and we show how simulated outcome distributions, risks and connectivity depend on the ratio of information gain to information loss. We also show that checking for excessive round-trip-times can be an effective minimal-information filter for determining which agents to no longer target with messages. The framework and algorithms that are presented here have wider application in testing efficient communication tactics across agent swarms in designated scenarios and testing the connectivity outcomes for future systems and missions.

Indexed as

AlgorithmsCommunicationCooperative BehaviorHumansModels, Theoretical

Identifiers

PMID39661582
PMCPMC11633978

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.