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

Albert H. Li

dblp:271/3345 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 4 first-author · 4 since 2021Systems, architecture and hardware · 4 · 4 first-author · 4 since 2021

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 · 49% Motion planning and robot control · 40% Probabilistic and Bayesian machine learning · 11%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
dexterous manipulation
0.912025
DROP: Dexterous Reorientation via Online Planning · ICRA 2025
Robotics › Robot manipulation › dexterous manipulation
in-hand reorientation
0.912025
DROP: Dexterous Reorientation via Online Planning · ICRA 2025
Robotics › Motion planning and robot control
motion planning
0.912025
DROP: Dexterous Reorientation via Online Planning · ICRA 2025
Robotics › Motion planning and robot control › robot control › model predictive control
sampling-based model predictive control
0.912025
DROP: Dexterous Reorientation via Online Planning · ICRA 2025
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
latent dynamics learning
0.512021
Replay Overshooting: Learning Stochastic Latent Dynamics with the Extended Kalman Filter · ICRA 2021
Robotics › Robot manipulation
contact-rich manipulation
0.312025
DROP: Dexterous Reorientation via Online Planning · ICRA 2025

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

vision-based pose estimation · 0.9sampling-based predictive control · 0.9reinforcement learning · 0.9variational learning objective · 0.5replay overshooting · 0.5extended kalman filter · 0.5
YearPublicationVenuePosition
2025 DROP: Dexterous Reorientation via Online Planning
abstract
Achieving human-like dexterity is a longstanding challenge in robotics, in part due to the complexity of planning and control for contact-rich systems. In reinforcement learning (RL), one popular approach has been to use massively-parallelized, domain-randomized simulations to learn a policy offline over a vast array of contact conditions, allowing robust sim-to-real transfer. Inspired by recent advances in real-time parallel simulation, this work considers instead the viability of online planning methods for contact-rich manipulation by studying the well-known in-hand cube reorientation task. We propose a simple architecture that employs a sampling-based predictive controller and vision-based pose estimator to search for contact-rich control actions online. We conduct thorough experiments to assess the real-world performance of our method, architectural design choices, and key factors for robustness, demonstrating that our simple sampling-based approach achieves performance comparable to prior RL-based works. Supplemental material: https://caltech-amber.github.io/drop.
Albert H. Li, Preston Culbertson, Vincent Kurtz, Aaron D. Ames
ICRA1
2024 Toward An Analytic Theory of Intrinsic Robustness for Dexterous Grasping
abstract
Conventional approaches to grasp planning re- quire perfect knowledge of an object’s pose and geometry. Uncertainties in these quantities induce uncertainties in the quality of planned grasps, which can lead to failure. Classically, grasp robustness refers to the ability to resist external disturbances after grasping an object. In contrast, this work studies robustness to intrinsic sources of uncertainty like object pose or geometry affecting grasp planning before execution. To do so, we develop a novel analytic theory of grasping that reasons about this intrinsic robustness by characterizing the effect of friction cone uncertainty on a grasp’s force closure status. We apply this result in two ways. First, we analyze the theoretical guarantees on intrinsic robustness of two grasp metrics in the literature, the classical Ferrari-Canny metric and more recent min-weight metric. We validate these results with hardware trials that compare grasps synthesized with and without robustness guarantees, showing a clear improvement in success rates. Second, we use our theory to develop a novel analytic notion of probabilistic force closure, which we show can generate unique, uncertainty-aware grasps in simulation.
Albert H. Li, Preston Culbertson, Aaron D. Ames
IROS1
2023 FRoGGeR: Fast Robust Grasp Generation via the Min-Weight Metric
abstract
Many approaches to grasp synthesis optimize analytic quality metrics that measure grasp robustness based on finger placements and local surface geometry. However, generating feasible dexterous grasps by optimizing these metrics is slow, often taking minutes. To address this issue, this paper presents FRoGGeR: a method that quickly generates robust precision grasps using the min-weight metric, a novel, almost-everywhere differentiable approximation of the classical$\epsilon$grasp metric. The min-weight metric is simple and interpretable, provides a reasonable measure of grasp robustness, and admits numerically efficient gradients for smooth optimization. We leverage these properties to rapidly synthesize collision-free robust grasps-typically in less than a second. FRoGGeR can refine the candidate grasps generated by other methods (heuristic, data-driven, etc.) and is compatible with many object representations (SDFs, meshes, etc.), We study FRoGGeR's performance on over 40 objects drawn from the YCB dataset, outperforming a competitive baseline in computation time, feasibility rate of grasp synthesis, and picking success in simulation. We conclude that FRoGGeR is fast: it has a median synthesis time of 0.834s over hundreds of experiments.
Albert H. Li, Preston Culbertson, Joel W. Burdick, Aaron D. Ames
IROS1
2021 Replay Overshooting: Learning Stochastic Latent Dynamics with the Extended Kalman Filter
abstract
This paper presents replay overshooting (RO), an algorithm that uses properties of the extended Kalman filter (EKF) to learn nonlinear stochastic latent dynamics models suitable for long-horizon prediction. We build upon overshooting methods used to train other prediction models and recover a novel variational learning objective. Further, we use RO to extend another objective that acts as a surrogate for the true log-likelihood, and show that this objective empirically yields better models than the variational one. We evaluate RO on two tasks: prediction of synthetic video frames of a swinging motorized pendulum and prediction of the planar position of various objects being pushed by a real manipulator (MIT Push Dataset). Our model outperforms several other prediction models on both quantitative and qualitative metrics.
Albert H. Li, Philipp Wu, Monroe Kennedy III
ICRA1