Evidence map›Paper›PMID 37705633›Full record

ArticlePeerJ. Computer science2023

Consensus-based clustering and data aggregation in decentralized network of multi-agent systems.

Joshua Julian Damanik, Ming Chong Lim, Hyeon-Mun Jeong, Ho-Yeon Kim, Han-Lim Choi

Abstract read
In one paragraph

Article in PeerJ. Computer science, 2023. 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.

Joshua Julian DamanikAerospace Engineering Department, Korea Advanced Institute of Science & Technology, Daejeon, South Korea.ORCID 0000-0002-7002-9891
Ming Chong LimAerospace Engineering Department, Korea Advanced Institute of Science & Technology, Daejeon, South Korea.
Hyeon-Mun JeongAerospace Engineering Department, Korea Advanced Institute of Science & Technology, Daejeon, South Korea.
Ho-Yeon KimAerospace Engineering Department, Korea Advanced Institute of Science & Technology, Daejeon, South Korea.
Han-Lim ChoiAerospace Engineering Department, Korea Advanced Institute of Science & Technology, Daejeon, South Korea.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Multi-agent systems are promising for applications in various fields. However, they require optimization algorithms that can handle large number of agents and heterogeneously connected networks in clustered environments. Planning algorithms performed in the decentralized communication model and clustered environment require precise knowledge about cluster information by compensating noise from other clusters. This article proposes a decentralized data aggregation algorithm using consensus method to perform COUNT and SUM aggregation in a clustered environment. The proposed algorithm introduces a trust value to perform accurate aggregation on cluster level. The correction parameter is used to adjust the accuracy of the solution and the computation time. The proposed algorithm is evaluated in simulations with large and sparse networks and small bandwidth. The results show that the proposed algorithm can achieve convergence on the aggregated data with reasonable accuracy and convergence time. In the future, the proposed tools will be useful for developing a robust decentralized task assignment algorithm in a heterogeneous multi-agent multi-task environment.

Indexed as

AggregationClusteringConsensusDistributedMulti-agent systemsOptimizationSituational awareness

Identifiers

PMID37705633
PMCPMC10496004

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.