Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Daniel J. Klein

dblp:29/824 · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
2since 2021 · last 2024
0000-0003-0437-7916ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 3 first-authorApplied, interdisciplinary, general and emerging computing · 3 · 2 since 2021Artificial intelligence and machine learning · 2Systems, 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
3 papers
Motion planning and robot control · 30% Legged, aerial and field robots · 24% Autonomous driving · 17%
Computer networks
2 papers
Internet of things and sensor networks · 74% Wireless networking · 26%

Topics — the 13 heaviest of 13, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Internet of things and sensor networks › delay tolerant networks
epidemic routing
0.112010
A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs · INFOCOM 2010
Robotics › Autonomous driving
multi-vehicle coordination
0.112008
Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networks · IEEE J. Sel. Areas Commun. 2008
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
gaussian process dynamical model
0.112007
Gaussian Processes and Reinforcement Learning for Identification and Control of an Autonomous Blimp · ICRA 2007
Machine learning › Reinforcement learning
policy learning
0.112007
Gaussian Processes and Reinforcement Learning for Identification and Control of an Autonomous Blimp · ICRA 2007
Robotics › Motion planning and robot control
system identification
0.112007
Gaussian Processes and Reinforcement Learning for Identification and Control of an Autonomous Blimp · ICRA 2007
Robotics › Motion planning and robot control › robot control
trajectory tracking
0.112007
Geometric Methods for Modeling and Control of Free-Swimming Fin-Actuated Underwater Vehicles · IEEE Trans. Robotics 2007
Robotics › Legged, aerial and field robots › underwater robotics
underwater vehicle control
0.112007
Geometric Methods for Modeling and Control of Free-Swimming Fin-Actuated Underwater Vehicles · IEEE Trans. Robotics 2007
Internet of things and sensor networks
delay tolerant networks
0.012010
A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs · INFOCOM 2010
Wireless networking
mobile ad hoc networks
0.012010
A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs · INFOCOM 2010
Wireless networking › broadcast
broadcast network
0.012008
Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networks · IEEE J. Sel. Areas Commun. 2008
Internet of things and sensor networks › wireless sensor network
energy-efficient communication
0.012008
Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networks · IEEE J. Sel. Areas Commun. 2008
Robotics › Legged, aerial and field robots
aerial robots
0.012007
Gaussian Processes and Reinforcement Learning for Identification and Control of an Autonomous Blimp · ICRA 2007
Robotics › Legged, aerial and field robots
underwater robotics
0.012007
Geometric Methods for Modeling and Control of Free-Swimming Fin-Actuated Underwater Vehicles · IEEE Trans. Robotics 2007

Methods — techniques the papers use, named apart from their topics

routing optimization · 0.2discrete time kuramoto model · 0.2traveling wave model · 0.1reaction-diffusion partial differential equation · 0.1state error feedback · 0.1reinforcement learning · 0.1geometric nonlinear control · 0.1geometric mechanics · 0.1gaussian process · 0.1ODE modeling · 0.1
YearPublicationVenuePosition
2024 HPVsim: An agent-based model of HPV transmission and cervical disease
abstract
In 2020, the WHO launched its first global strategy to accelerate the elimination of cervical cancer, outlining an ambitious set of targets for countries to achieve over the next decade. At the same time, new tools, technologies, and strategies are in the pipeline that may improve screening performance, expand the reach of prophylactic vaccines, and prevent the acquisition, persistence and progression of oncogenic HPV. Detailed mechanistic modelling can help identify the combinations of current and future strategies to combat cervical cancer. Open-source modelling tools are needed to shift the capacity for such evaluations in-country. Here, we introduce the Human papillomavirus simulator (HPVsim), a new open-source software package for creating flexible agent-based models parameterised with country-specific vital dynamics, structured sexual networks, and co-transmitting HPV genotypes. HPVsim includes a novel methodology for modelling cervical disease progression, designed to be readily adaptable to new forms of screening. The software itself is implemented in Python, has built-in tools for simulating commonly-used interventions, includes a comprehensive set of tests and documentation, and runs quickly (seconds to minutes) on a laptop. Performance is greatly enhanced by HPVsim's multiscale modelling functionality. HPVsim is open source under the MIT License and available via both the Python Package Index (via pip install) and GitHub (hpvsim.org).
Robyn M. Stuart, Jamie A. Cohen, Cliff C. Kerr, Prashant Mathur, Romesh G. Abeysuriya, Marita Zimmermann, Darcy W. Rao, Mariah C. Boudreau, Serin Lee, Luojun Yang, Daniel J. Klein
PLoS Comput. Biol.11
2021 Covasim: An agent-based model of COVID-19 dynamics and interventions
abstract
The COVID-19 pandemic has created an urgent need for models that can project epidemic trends, explore intervention scenarios, and estimate resource needs. Here we describe the methodology of Covasim (COVID-19 Agent-based Simulator), an open-source model developed to help address these questions. Covasim includes country-specific demographic information on age structure and population size; realistic transmission networks in different social layers, including households, schools, workplaces, long-term care facilities, and communities; age-specific disease outcomes; and intrahost viral dynamics, including viral-load-based transmissibility. Covasim also supports an extensive set of interventions, including non-pharmaceutical interventions, such as physical distancing and protective equipment; pharmaceutical interventions, including vaccination; and testing interventions, such as symptomatic and asymptomatic testing, isolation, contact tracing, and quarantine. These interventions can incorporate the effects of delays, loss-to-follow-up, micro-targeting, and other factors. Implemented in pure Python, Covasim has been designed with equal emphasis on performance, ease of use, and flexibility: realistic and highly customized scenarios can be run on a standard laptop in under a minute. In collaboration with local health agencies and policymakers, Covasim has already been applied to examine epidemic dynamics and inform policy decisions in more than a dozen countries in Africa, Asia-Pacific, Europe, and North America.
Cliff C. Kerr, Robyn M. Stuart, Dina Mistry, Romesh G. Abeysuriya, Katherine Rosenfeld, Gregory R. Hart, Rafael C. Núñez, Jamie A. Cohen, Prashanth Selvaraj, Brittany Hagedorn, Lauren George, Michal Jastrzebski, Amanda S. Izzo, Greer Fowler, Anna Palmér, Dominic Delport, Nick Scott, Sherrie L. Kelly, Caroline S. Bennette, Bradley G. Wagner, Stewart T. Chang, Assaf P. Oron, Edward A. Wenger, Jasmina Panovska-Griffiths, Michael Famulare, Daniel J. Klein
PLoS Comput. Biol.26
2013 Localization with sparse acoustic sensor network using UAVs as information-seeking data mules
abstract
We propose and demonstrate a novel architecture for on-the-fly inference while collecting data from sparse sensor networks. In particular, we consider source localization using acoustic sensors dispersed over a large area, with the individual sensors located too far apart for direct connectivity. An Unmanned Aerial Vehicle (UAV) is employed for collecting sensor data, with the UAV route adaptively adjusted based on data from sensors already visited, in order to minimize the time to localize events of interest. The UAV therefore acts as a information-seeking data mule, not only providing connectivity, but also making Bayesian inferences from the data gathered in order to guide its future actions. The system we demonstrate has a modular architecture, comprising efficient algorithms for acoustic signal processing, routing the UAV to the sensors, and source localization. We report on extensive field tests which not only demonstrate the effectiveness of our general approach, but also yield specific practical insights into GPS time synchronization and localization accuracy, acoustic signal and channel characteristics, and the effects of environmental phenomena.
Daniel J. Klein, Sriram Venkateswaran, Jason T. Isaacs, Jerry Burman, Tien Pham, João Pedro Hespanha, Upamanyu Madhow
ACM Trans. Sens. Networks1
2010 A Reaction-Diffusion Model for Epidemic Routing in Sparsely Connected MANETs
abstract
We propose and investigate a deterministic traveling wave model for the progress of epidemic routing in disconnected mobile ad hoc networks. In epidemic routing, broadcast or unicast is achieved by exploiting mobility: message-carrying nodes "infect" non message-carrying nodes when they come within communication range of them. Early probabilistic analyses of epidemic routing follow a "well-mixed" model which ignores the spatial distribution of the infected nodes, and hence do not provide good performance estimates unless the node density is very low. More recent work has pointed out that the infection exhibits wave-like characteristics, but does not provide a detailed model of the wave propagation. In this paper, we model message propagation using a reaction-diffusion partial differential equation that has a traveling wave solution, and show that the performance predictions made by the model closely match simulations in regimes where the well- mixed model breaks down. In particular, we show that well-mixed models are generally overly optimistic in regard to the scaling of the message delivery delay with problem parameters such as communication range, node density, and total area. In contrast to prior work, our model provides insight into the spatial distribution of the "infection," and reveals that the performance is sensitive to the geometry of the deployment region, not just its area.
Daniel J. Klein, João Pedro Hespanha, Upamanyu Madhow
INFOCOM1
2009 Cooperative Estimation for Coordinated Target Tracking in a Cluttered Environment
Benjamin I. Triplett, Daniel J. Klein, Kristi A. Morgansen
Mob. Networks Appl.2
2008 Integration of communication and control using discrete time Kuramoto models for multivehicle coordination over broadcast networks
abstract
This paper considers the integration of communication and control with respect to the task of coordinated heading control for a group of N vehicles with the energy efficiency of communications in mind. The heading control employed on each vehicle is a discretization of the well-known Kuramoto model of nonlinearly coupled oscillators over a sequence of logical graphs. Stability for both all-to-all and random one- to-all broadcasts is shown to be dependent on the coupling strength, K, and the time discretization, DeltaT. For desired system performance characteristics, DeltaT imposes a tight deadline by which the state information (M bits) must be propagated through the communication network. Routing optimization with respect to minimizing energy consumption is formulated considering the DeltaT deadline. Due to the tight time deadline, a one-to-all single- hop broadcasting scheme is shown to be more energy efficient for practical choices of M/DeltaT. The proposed modularization is illustrated via a set of simulations where the overall communication energy to reach alignment is optimized.
Daniel J. Klein, Phillip Lee, Kristi A. Morgansen, Tara Javidi
IEEE J. Sel. Areas Commun.1
2007 Gaussian Processes and Reinforcement Learning for Identification and Control of an Autonomous Blimp
abstract
Blimps are a promising platform for aerial robotics and have been studied extensively for this purpose. Unlike other aerial vehicles, blimps are relatively safe and also possess the ability to loiter for long periods. These advantages, however, have been difficult to exploit because blimp dynamics are complex and inherently non-linear. The classical approach to system modeling represents the system as an ordinary differential equation (ODE) based on Newtonian principles. A more recent modeling approach is based on representing state transitions as a Gaussian process (GP). In this paper, we present a general technique for system identification that combines these two modeling approaches into a single formulation. This is done by training a Gaussian process on the residual between the non-linear model and ground truth training data. The result is a GP-enhanced model that provides an estimate of uncertainty in addition to giving better state predictions than either ODE or GP alone. We show how the GP-enhanced model can be used in conjunction with reinforcement learning to generate a blimp controller that is superior to those learned with ODE or GP models alone.
Jonathan Ko, Daniel J. Klein, Dieter Fox, Dirk Hähnel
ICRA2
2007 GP-UKF: Unscented kalman filters with Gaussian process prediction and observationmodels
abstract
This paper considers the use of non-parametric system models for sequential state estimation. In particular, motion and observation models are learned from training examples using Gaussian process (GP) regression. The state estimator is an unscented Kalman filter (UKF). The resulting GP-UKF algorithm has a number of advantages over standard (parametric) UKFs. These include the ability to estimate the state of arbitrary nonlinear systems, improved tracking quality compared to a parametric UKF, and graceful degradation with increased model uncertainty. These advantages stem from the fact that GPs consider both the noise in the system and the uncertainty in the model. If an approximate parametric model is available, it can be incorporated into the GP; resulting in further performance improvements. In experiments, we show how the GP-UKF algorithm can be applied to the problem of tracking an autonomous micro-blimp.
Jonathan Ko, Daniel J. Klein, Dieter Fox, Dirk Hähnel
IROS2
2007 Geometric Methods for Modeling and Control of Free-Swimming Fin-Actuated Underwater Vehicles
abstract
In this paper, techniques from geometric mechanics and geometric nonlinear control theory are applied to modeling and construction of trajectory tracking algorithms for a free-swimming underwater vehicle that locomotes and maneuvers using a two-link actuated ldquotailrdquo and independently actuated ldquopectoral finrdquo bow planes. Restricting consideration of fluid forces to the simple effects of added mass and quasi-steady lift and drag, the resulting system model can be expressed in a control-affine structure. With particular choices of oscillatory actuation of the four system joints, maneuvers such as swimming forward, in and out of plane turning, surfacing, and diving can be constructed. Further, the vehicle and model can generate agile maneuvers such as snap turns. Trajectory tracking can then be produced using state error feedback. The methods are demonstrated both in simulation and in experiment using the University of Washington prototype fin-actuated underwater vehicle.
Kristi A. Morgansen, Benjamin I. Triplett, Daniel J. Klein
IEEE Trans. Robotics3