EDBT 2026 Demo / reviewers in the wild / expert
Andrew N. Kopeikin
dblp:00/11052
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Multi-agent systems · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems › task allocation
distributed task allocation |
0.1 | 1 | 2012 | Distributed Planning Strategies to Ensure Network Connectivity for Dynamic Heterogeneous Teams · IEEE J. Sel. Areas Commun. 2012 |
Knowledge, reasoning and agents › Multi-agent systems › formation control
connectivity maintenance |
0.0 | 1 | 2012 | Distributed Planning Strategies to Ensure Network Connectivity for Dynamic Heterogeneous Teams · IEEE J. Sel. Areas Commun. 2012 |
Methods — techniques the papers use, named apart from their topics
consensus-based bundle algorithm · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2012 | Distributed Planning Strategies to Ensure Network Connectivity for Dynamic Heterogeneous TeamsabstractThis paper presents a cooperative distributed planning algorithm that ensures network connectivity for a team of heterogeneous agents operating in dynamic and communication-limited environments. The algorithm, named CBBA with Relays, builds on the Consensus-Based Bundle Algorithm (CBBA), a distributed task allocation framework developed previously by the authors and their colleagues. Information available through existing consensus phases of CBBA is leveraged to predict the network topology and to propose relay tasks to repair connectivity violations. The algorithm ensures network connectivity during task execution while preserving the distributed and polynomial-time guarantees of CBBA. By employing under-utilized agents as communication relays, CBBA with Relays improves the range of the team without limiting the scope of the active agents, thus improving mission performance. The algorithm is validated through simulation trials and through experimental indoor and outdoor field tests, demonstrating the real-time applicability of the approach. Sameera S. Ponda, Luke B. Johnson, Andrew N. Kopeikin, Han-Lim Choi, Jonathan P. How |
IEEE J. Sel. Areas Commun. | 3 |