Demo Data from VLDB 2026 / reviewers in the wild / expert
Ryan Skeele
dblp:164/8427 · also Ryan C. Skeele
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 3 · 1 first-authorSystems, architecture and hardware · 2
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 |
Reinforcement learning · 77% Legged, aerial and field robots · 23% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Reinforcement learning › exploration
multi-robot exploration |
0.2 | 1 | 2015 | Multi-UAV exploration with limited communication and battery · ICRA 2015 |
Robotics › Legged, aerial and field robots › aerial robots
multi-UAV systems |
0.1 | 1 | 2015 | Multi-UAV exploration with limited communication and battery · ICRA 2015 |
Methods — techniques the papers use, named apart from their topics
frontier-based exploration · 0.2adaptive coordination · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2016 | Risk-Aware Graph Search with Dynamic Edge Cost Discovery
Ryan Skeele, Jen Jen Chung, Geoffrey A. Hollinger |
WAFR | 1 |
| 2015 | Multi-UAV exploration with limited communication and batteryabstractWe propose a multi-robot exploration algorithm that uses adaptive coordination to provide heterogeneous behavior. The key idea is to maximize the efficiency of exploring and mapping an unknown environment when a team is faced with unreliable communication and limited battery life (e.g., with aerial rotorcraft). The proposed algorithm utilizes four states: explore, meet, sacrifice, and relay. The explore state uses a frontier-based exploration algorithm, the meet state returns to the last known location of communication to share data, the sacrifice state sends the robot out to explore without consideration of remaining battery, and the relay state lands the robot until a meeting occurs. This approach allows robots to take on the role of a relay to improve communication between team members. In addition, the robots can “sacrifice” themselves by continuing to explore even when they do not have sufficient battery to return to the base station. We compare the performance of the proposed approach to state-of-the-art frontier-based exploration, and results show gains in explored area. The feasibility of components of the proposed approach is also demonstrated on a team of two custom-built quadcopters exploring an office environment. Kyle Cesare, Ryan Skeele, Soo-Hyun Yoo, Geoffrey A. Hollinger |
ICRA | 2 |
| 2015 | Learning to trick cost-based planners into cooperative behaviorabstractIn this paper we consider the problem of routing autonomously guided robots by manipulating the cost space to induce safe trajectories in the work space. Specifically, we examine the domain of UAV traffic management in urban airspaces. Each robot does not explicitly coordinate with other vehicles in the airspace. Instead, the robots execute their own individual internal cost-based planner to travel between locations. Given this structure, our goal is to develop a high-level UAV traffic management (UTM) system that can dynamically adapt the cost space to reduce the number of conflict incidents in the airspace without knowing the internal planners of each robot. We propose a decentralized and distributed system of high-level traffic controllers that each learn appropriate costing strategies via a neuro-evolutionary algorithm. The policies learned by our algorithm demonstrated a 16.4% reduction in the total number of conflict incidents experienced in the airspace while maintaining throughput performance. Carrie Rebhuhn, Ryan Skeele, Jen Jen Chung, Geoffrey A. Hollinger, Kagan Tumer |
IROS | 2 |