Search Results for author: Siddhartha S. Srinivasa

Found 16 papers, 4 papers with code

Benchmarking Robot Manipulation with the Rubik's Cube

no code implementations14 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.

Benchmarking Robot Manipulation +1

Desk Organization: Effect of Multimodal Inputs on Spatial Relational Learning

no code implementations3 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''.

Position Relational Reasoning

Learning Online from Corrective Feedback: A Meta-Algorithm for Robotics

no code implementations2 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.

Imitation Learning

Multimodal Trajectory Prediction via Topological Invariance for Navigation at Uncontrolled Intersections

1 code implementation8 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.

Trajectory Prediction

Leveraging Post Hoc Context for Faster Learning in Bandit Settings with Applications in Robot-Assisted Feeding

no code implementations5 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.

Towards Effective Human-AI Teams: The Case of Collaborative Packing

no code implementations14 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.

Decision Making

Bayes-CPACE: PAC Optimal Exploration in Continuous Space Bayes-Adaptive Markov Decision Processes

no code implementations6 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.

Anytime Motion Planning on Large Dense Roadmaps with Expensive Edge Evaluations

1 code implementation10 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

The Provable Virtue of Laziness in Motion Planning

no code implementations11 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

A Linear-Time Variational Integrator for Multibody Systems

1 code implementation9 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

Batch Informed Trees (BIT*): Sampling-based Optimal Planning via the Heuristically Guided Search of Implicit Random Geometric Graphs

no code implementations22 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

Informed RRT*: Optimal Sampling-based Path Planning Focused via Direct Sampling of an Admissible Ellipsoidal Heuristic

1 code implementation8 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

Cannot find the paper you are looking for? You can Submit a new open access paper.