ArticlePloS one2024
Adaptive connectivity control in networked multi-agent systems: A distributed approach.
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.
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.
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.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
Effective communication is crucial for the performance and collaboration within cooperative networked multi-agent systems. However, existing literature lacks comprehensive solutions for dynamically monitoring and adjusting communication topologies to balance connectivity and energy efficiency. This study addresses this gap by proposing a distributed approach for estimating and controlling system connectivity over time. We introduce a modified consensus protocol where agents exchange local assessments of communication link quality, enabling the estimation of a global weighted adjacency matrix without requiring centralized information. The system's connectivity is measured using the second smallest eigenvalue of the communication graph Laplacian, commonly referred to as algebraic connectivity. Additionally, we enhance the consensus protocol with an adaptive mechanism to expedite convergence, irrespective of system size or structure. Furthermore, we present an analytical method for connectivity control based on the Fiedler vector approximation, facilitating the addition or removal of communication links. This method adjusts control parameters to accommodate minor variations in link quality while reconfiguring the network in response to significant changes. Notably, it identifies and eliminates energy-consuming yet non-contributory links, improving long-term connectivity efficiency. Simulation experiments across diverse scenarios and the number of agents validate the efficacy of our proposed algebraic connectivity estimation and tracking strategy. Results demonstrate robust connectivity maintenance against external disturbances and agent failures, underscoring the practical utility of our approach for real-world multi-agent systems.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
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.