327 citations · 1.3k across the 66 of their papers we have counts for
13 papers · 1 filter
Certifying Bimanual RRT Motion Plans in a Second
Alexandre Amice, Peter Werner, Russ Tedrake
We present an efficient method for certifying non-collision for piecewise-polynomial motion plans in algebraic reparametrizations of configuration space. Such motion plans include…
Approximating Robot Configuration Spaces with few Convex Sets using Clique Covers of Visibility Graphs
Peter Werner, Alexandre Amice, Tobia Marcucci +2
Many computations in robotics can be dramatically accelerated if the robot configuration space is described as a collection of simple sets. For example, recently developed motion p…
Robot Fleet Learning via Policy Merging
Lirui Wang, Kaiqing Zhang, Allan Zhou +2
Fleets of robots ingest massive amounts of heterogeneous streaming data silos generated by interacting with their environments, far more than what can be stored or transmitted with…
Constrained Bimanual Planning with Analytic Inverse Kinematics
Thomas Cohn, Seiji Shaw, Max Simchowitz +1
In order for a bimanual robot to manipulate an object that is held by both hands, it must construct motion plans such that the transformation between its end effectors remains fixe…
Proximity and Visuotactile Point Cloud Fusion for Contact Patches in Extreme Deformation
Jessica Yin, Paarth Shah, Naveen Kuppuswamy +5
Visuotactile sensors are a popular tactile sensing strategy due to high-fidelity estimates of local object geometry. However, existing algorithms for processing raw sensor inputs t…
Fighting Uncertainty with Gradients: Offline Reinforcement Learning via Diffusion Score Matching
H. J. Terry Suh, Glen Chou, Hongkai Dai +3
Gradient-based methods enable efficient search capabilities in high dimensions. However, in order to apply them effectively in offline optimization paradigms such as offline Reinfo…
Non-Euclidean Motion Planning with Graphs of Geodesically-Convex Sets
Thomas Cohn, Mark Petersen, Max Simchowitz +1
Computing optimal, collision-free trajectories for high-dimensional systems is a challenging problem. Sampling-based planners struggle with the dimensionality, whereas trajectory o…
Fast Path Planning Through Large Collections of Safe Boxes
Tobia Marcucci, Parth Nobel, Russ Tedrake +1
We present a fast algorithm for the design of smooth paths (or trajectories) that are constrained to lie in a collection of axis-aligned boxes. We consider the case where the numbe…
Approximate Optimal Controller Synthesis for Cart-Poles and Quadrotors via Sums-of-Squares
Lujie Yang, Hongkai Dai, Alexandre Amice +1
Sums-of-squares (SOS) optimization is a promising tool to synthesize certifiable controllers for nonlinear dynamical systems. Building upon prior works, we demonstrate that SOS can…
Synthesizing Stable Reduced-Order Visuomotor Policies for Nonlinear Systems via Sums-of-Squares Optimization
Glen Chou, Russ Tedrake
We present a method for synthesizing dynamic, reduced-order output-feedback polynomial control policies for control-affine nonlinear systems which guarantees runtime stability to a…
Growing Convex Collision-Free Regions in Configuration Space using Nonlinear Programming
Mark Petersen, Russ Tedrake
One of the most difficult parts of motion planning in configuration space is ensuring a trajectory does not collide with task-space obstacles in the environment. Generating regions…
Certified Polyhedral Decompositions of Collision-Free Configuration Space
Hongkai Dai, Alexandre Amice, Peter Werner +2
Understanding the geometry of collision-free configuration space (C-free) in the presence of task-space obstacles is an essential ingredient for collision-free motion planning. Whi…
Smoothed Online Learning for Prediction in Piecewise Affine Systems
Adam Block, Max Simchowitz, Russ Tedrake
The problem of piecewise affine (PWA) regression and planning is of foundational importance to the study of online learning, control, and robotics, where it provides a theoreticall…