EDBT 2026 Demo / reviewers in the wild / expert
Daniel Vickery
dblp:06/1526
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2009
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 1Systems, architecture and hardware · 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.
| Computer networks
1 paper |
Internet of things and sensor networks · 77% Wireless networking · 23% | |
| Artificial intelligence
1 paper |
Multi-agent systems · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems
swarm robotics |
0.1 | 1 | 2009 | Ad-hoc wireless network coverage with networked robots that cannot localize · ICRA 2009 |
Internet of things and sensor networks › iot networks › iot deployment
distributed deployment |
0.1 | 1 | 2009 | Ad-hoc wireless network coverage with networked robots that cannot localize · ICRA 2009 |
Wireless networking
mobile ad hoc networks |
0.0 | 1 | 2009 | Ad-hoc wireless network coverage with networked robots that cannot localize · ICRA 2009 |
Methods — techniques the papers use, named apart from their topics
random walk · 0.2probabilistic macroscopic model · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | Fast Self-stabilization for Gradients
Jacob Beal, Jonathan Bachrach, Daniel Vickery, Mark M. Tobenkin |
DCOSS | 3 |
| 2009 | Ad-hoc wireless network coverage with networked robots that cannot localizeabstractWe study a fully distributed, reactive algorithm for deployment and maintenance of a mobile communication backbone that provides an area around a network gateway with wireless network access for higher-level agents. Possible applications of such a network are distributed sensor networks as well as communication support for disaster or military operations. The algorithm has minimalist requirements on the individual robotic node and does not require any localization. This makes the proposed solution suitable for deployment of large numbers of comparably cheap mobile communication nodes and as a backup solution for more capable systems in GPS-denied environments. Robots keep exploring the configuration space by random walk and stop only if their current location satisfies user-specified constraints on connectivity (number of neighbors). Resulting deployments are robust and convergence is analyzed using both kinematic simulation with a simplified collision and communication model as well as a probabilistic macroscopic model. The approach is validated on a team of 9 iRobot Create robots carrying wireless access points in an indoor environment. Nikolaus Correll, Jonathan Bachrach, Daniel Vickery, Daniela Rus |
ICRA | 3 |