no code implementations • 14 Feb 2022 • Boling Yang, Patrick E. Lancaster, Siddhartha S. Srinivasa, Joshua R. Smith
Benchmarks for robot manipulation are crucial to measuring progress in the field, yet there are few benchmarks that demonstrate critical manipulation skills, possess standardized metrics, and can be attempted by a wide array of robot platforms.
no code implementations • 3 Aug 2021 • Ryan Rowe, Shivam Singhal, Daqing Yi, Tapomayukh Bhattacharjee, Siddhartha S. Srinivasa
We examine the problem of desk organization: learning how humans spatially position different objects on a planar surface according to organizational ''preference''.
no code implementations • 2 Apr 2021 • Matthew Schmittle, Sanjiban Choudhury, Siddhartha S. Srinivasa
A key challenge in Imitation Learning (IL) is that optimal state actions demonstrations are difficult for the teacher to provide.
1 code implementation • 8 Nov 2020 • Junha Roh, Christoforos Mavrogiannis, Rishabh Madan, Dieter Fox, Siddhartha S. Srinivasa
Our key insight is that the geometric structure of the intersection and the incentive of agents to move efficiently and avoid collisions (rationality) reduces the space of likely behaviors, effectively relaxing the problem of trajectory prediction.
no code implementations • 5 Nov 2020 • Ethan K. Gordon, Sumegh Roychowdhury, Tapomayukh Bhattacharjee, Kevin Jamieson, Siddhartha S. Srinivasa
Our key insight is that we can leverage the haptic context we collect during and after manipulation (i. e., "post hoc") to learn some of these properties and more quickly adapt our visual model to previously unseen food.
no code implementations • 10 Apr 2020 • Christoforos Mavrogiannis, Jonathan A. DeCastro, Siddhartha S. Srinivasa
Often, the structure of these domains constrains multiagent trajectories to belong to a finite set of modes.
no code implementations • 7 Feb 2020 • Gilwoo Lee, Brian Hou, Sanjiban Choudhury, Siddhartha S. Srinivasa
We first obtain an ensemble of experts, one for each latent MDP, and fuse their advice to compute a baseline policy.
no code implementations • 14 Sep 2019 • Gilwoo Lee, Christoforos Mavrogiannis, Siddhartha S. Srinivasa
Our goal is to guide human users towards optimal task performance while keeping their cognitive load as low as possible.
no code implementations • 19 Aug 2019 • Ethan K. Gordon, Xiang Meng, Matt Barnes, Tapomayukh Bhattacharjee, Siddhartha S. Srinivasa
A successful robot-assisted feeding system requires bite acquisition of a wide variety of food items.
no code implementations • 6 Oct 2018 • Gilwoo Lee, Sanjiban Choudhury, Brian Hou, Siddhartha S. Srinivasa
We present the first PAC optimal algorithm for Bayes-Adaptive Markov Decision Processes (BAMDPs) in continuous state and action spaces, to the best of our knowledge.
no code implementations • ICLR 2019 • Gilwoo Lee, Brian Hou, Aditya Mandalika, Jeongseok Lee, Sanjiban Choudhury, Siddhartha S. Srinivasa
Addressing uncertainty is critical for autonomous systems to robustly adapt to the real world.
1 code implementation • 10 Nov 2017 • Shushman Choudhury, Oren Salzman, Sanjiban Choudhury, Christopher M. Dellin, Siddhartha S. Srinivasa
We propose an algorithmic framework for efficient anytime motion planning on large dense geometric roadmaps, in domains where collision checks and therefore edge evaluations are computationally expensive.
Robotics
no code implementations • 11 Oct 2017 • Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa
The Lazy Shortest Path (LazySP) class consists of motion-planning algorithms that only evaluate edges along shortest paths between the source and target.
Robotics Data Structures and Algorithms
1 code implementation • 9 Sep 2016 • Jeongseok Lee, C. Karen Liu, Frank C. Park, Siddhartha S. Srinivasa
Our key contribution is to derive a recursive algorithm that evaluates DEL equations in $O(n)$, which scales up well for complex multibody systems such as humanoid robots.
Robotics
no code implementations • 22 May 2014 • Jonathan D. Gammell, Siddhartha S. Srinivasa, Timothy D. Barfoot
In this paper, we present Batch Informed Trees (BIT*), a planning algorithm based on unifying graph- and sampling-based planning techniques.
Robotics
1 code implementation • 8 Apr 2014 • Jonathan D. Gammell, Siddhartha S. Srinivasa, Timothy D. Barfoot
We present the algorithm as a simple modification to RRT* that could be further extended by more advanced path-planning algorithms.
Robotics