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

Matthew Klingensmith

dblp:117/9346 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2017
0000-0002-8419-2649ORCID · corroborated

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

Artificial intelligence and machine learning · 3Systems, architecture and hardware · 3

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
2 papers
Robot manipulation · 47% Robot navigation and mapping · 20% Probabilistic and Bayesian machine learning · 20%
Theoretical computer science
1 paper
Mathematical optimization · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › tactile sensing › contact sensing
contact state estimation
0.312017
The manifold particle filter for state estimation on high-dimensional implicit manifolds · ICRA 2017
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › sequential monte carlo
particle filtering
0.312017
The manifold particle filter for state estimation on high-dimensional implicit manifolds · ICRA 2017
Robotics › Robot navigation and mapping
state estimation
0.312017
The manifold particle filter for state estimation on high-dimensional implicit manifolds · ICRA 2017
Robotics › Robot manipulation
tactile sensing
0.312017
The manifold particle filter for state estimation on high-dimensional implicit manifolds · ICRA 2017
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
information gathering
0.212013
Efficient touch based localization through submodularity · ICRA 2013
Mathematical optimization › submodular optimization
adaptive submodularity
0.212013
Efficient touch based localization through submodularity · ICRA 2013
Mathematical optimization
submodular optimization
0.212013
Efficient touch based localization through submodularity · ICRA 2013
Robotics › Robot manipulation › robotic hand
underactuated hand
0.112017
The manifold particle filter for state estimation on high-dimensional implicit manifolds · ICRA 2017

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

shannon entropy · 0.3greedy algorithm · 0.3adaptive submodularity · 0.3signed distance field · 0.3implicit manifold sampling · 0.3
YearPublicationVenuePosition
2017 The manifold particle filter for state estimation on high-dimensional implicit manifolds
abstract
We estimate the state of a noisy robot arm and underactuated hand using an implicit Manifold Particle Filter (MPF) informed by contact sensors. As the robot touches the world, its state space collapses to a contact manifold that we represent implicitly using a signed distance field. This allows us to extend the MPF to higher (six or more) dimensional state spaces. Earlier work, which explicitly represents the contact manifold, was only capable of scaling to three dimensions. Through a series of experiments, we show that the implicit MPF converges faster and is more accurate than a conventional particle filter during periods of persistent contact. We present three methods of drawing samples from an implicit contact manifold, and compare them in experiments.
Michael C. Koval, Matthew Klingensmith, Siddhartha S. Srinivasa, Nancy S. Pollard, Michael Kaess
ICRA2
2013 Efficient touch based localization through submodularity
abstract
Many robotic systems deal with uncertainty by performing a sequence of information gathering actions. In this work, we focus on the problem of efficiently constructing such a sequence by drawing an explicit connection to submodularity. Ideally, we would like a method that finds the optimal sequence, taking the minimum amount of time while providing sufficient information. Finding this sequence, however, is generally intractable. As a result, many well-established methods select actions greedily. Surprisingly, this often performs well. Our work first explains this high performance - we note a commonly used metric, reduction of Shannon entropy, is submodular under certain assumptions, rendering the greedy solution comparable to the optimal plan in the offline setting. However, reacting online to observations can increase performance. Recently developed notions of adaptive submodularity provide guarantees for a greedy algorithm in this online setting. In this work, we develop new methods based on adaptive submodularity for selecting a sequence of information gathering actions online. In addition to providing guarantees, we can capitalize on submodularity to attain additional computational speedups. We demonstrate the effectiveness of these methods in simulation and on a robot.
Shervin Javdani, Matthew Klingensmith, J. Andrew Bagnell, Nancy S. Pollard, Siddhartha S. Srinivasa
ICRA2
2012 An integrated system for autonomous robotics manipulation
abstract
We describe the software components of a robotics system designed to autonomously grasp objects and perform dexterous manipulation tasks with only high-level supervision. The system is centered on the tight integration of several core functionalities, including perception, planning and control, with the logical structuring of tasks driven by a Behavior Tree architecture. The advantage of the implementation is to reduce the execution time while integrating advanced algorithms for autonomous manipulation. We describe our approach to 3-D perception, real-time planning, force compliant motions, and audio processing. Performance results for object grasping and complex manipulation tasks of in-house tests and of an independent evaluation team are presented.
J. Andrew Bagnell, Felipe Cavalcanti, Lei Cui 0005, Thomas Galluzzo, Martial Hebert, Moslem Kazemi, Matthew Klingensmith, Jacqueline Libby, Tian Yu Liu, Nancy S. Pollard, Mihail Pivtoraiko, Jean-Sebastien Valois, Ranqi Zhu
IROS7