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

Craig Hardgrove

dblp:135/8352 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2013
—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.

Artificial intelligence
1 paper
Probabilistic and Bayesian machine learning · 77% Legged, aerial and field robots · 23%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Emerging computing paradigms · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.212013
Adaptive sensing of time series with application to remote exploration · ICRA 2013
Emerging computing paradigms
adaptive sampling
0.212013
Adaptive sensing of time series with application to remote exploration · ICRA 2013
Robotics › Legged, aerial and field robots › space robotics
planetary rover exploration
0.012013
Adaptive sensing of time series with application to remote exploration · ICRA 2013

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

online optimization · 0.3gaussian process · 0.3
YearPublicationVenuePosition
2013 Adaptive sensing of time series with application to remote exploration
abstract
We address the problem of adaptive information-optimal data collection in time series. Here a remote sensor or explorer agent throttles its sampling rate in order to track anomalous events while obeying constraints on time and power. This problem is challenging because the agent has limited visibility - all collected datapoints lie in the past, but its resource allocation decisions require predicting far into the future. Our solution is to continually fit a Gaussian process model to the latest data and optimize the sampling plan on line to maximize information gain. We compare the performance characteristics of stationary and nonstationary Gaussian process models. We also describe an application based on geologic analysis during planetary rover exploration. Here adaptive sampling can improve coverage of localized anomalies and potentially benefit mission science yield of long autonomous traverses.
David R. Thompson 0001, Nathalie Cabrol, P. Michael Furlong, Craig Hardgrove, Kian Hsiang Low, Jeffrey Moersch, David Wettergreen
ICRA4