Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Siddhartha Srinivasa
    This technical report presents an anytime algorithm for solving the multi-robot guaranteed search problem. Guaranteed search requires a team of robots to clear an environment of a po- tentially adversarial target. In other words, a team... more
    This technical report presents an anytime algorithm for solving the multi-robot guaranteed search problem. Guaranteed search requires a team of robots to clear an environment of a po- tentially adversarial target. In other words, a team of searchers must generate a search strategy guaranteed to flnd a target. This problem is known to be NP-complete on arbitrary graphs but
    We present an efficient approach to generating paths for humanoids and other robotic manipulators that uses the Task Space Region (TSR) framework to specify manipulation tasks. TSRs can define acceptable goal poses of an end-effector or... more
    We present an efficient approach to generating paths for humanoids and other robotic manipulators that uses the Task Space Region (TSR) framework to specify manipulation tasks. TSRs can define acceptable goal poses of an end-effector or constraints on the end-effector's pose during the path, or both. First presented as a method for goal-specification, TSRs are a straightforward representation of sets
    ABSTRACT In human relationships, responsiveness---behaving in a sensitive manner that is supportive of another person's needs---plays a major role in any interaction that involves effective communication, caregiving, and social... more
    ABSTRACT In human relationships, responsiveness---behaving in a sensitive manner that is supportive of another person's needs---plays a major role in any interaction that involves effective communication, caregiving, and social support. Perceiving one's partner ...
    ABSTRACT A key requirement for seamless human-robot collaboration is for the robot to make its intentions clear to its human collaborator. A collaborative robot's motion must be legible, or intent-expressive. Legibility is often... more
    ABSTRACT A key requirement for seamless human-robot collaboration is for the robot to make its intentions clear to its human collaborator. A collaborative robot's motion must be legible, or intent-expressive. Legibility is often described in the literature as and effect of predictable, unsurprising, or expected motion. Our central insight is that predictability and legibility are fundamentally different and often contradictory properties of motion. We develop a formalism to mathematically define and distinguish predictability and legibility of motion. We formalize the two based on inferences between trajectories and goals in opposing directions, drawing the analogy to action interpretation in psychology. We then propose mathematical models for these inferences based on optimizing cost, drawing the analogy to the principle of rational action. Our experiments validate our formalism's prediction that predictability and legibility can contradict, and provide support for our models. Our findings indicate that for robots to seamlessly collaborate with humans, they must change the way they plan their motion.
    ABSTRACT How should a human user and a robot collaborate during teleoperation? The user understands the full semantics of the task: they know, for example, what the robot should search for in a cupboard, or that it should be more careful... more
    ABSTRACT How should a human user and a robot collaborate during teleoperation? The user understands the full semantics of the task: they know, for example, what the robot should search for in a cupboard, or that it should be more careful when moving near a glass of water than near a box of tissues. Since the robot might not have this knowledge, allowing it to operate fully autonomously may be risky; its model is incomplete and its policy might be wrong. On the other hand, teleoperating the robot through every motion is slow and tiresome, especially on difficult tasks. Between these two extremes lies a spectrum, from almost no assistance at all (very timid) to full autonomy (very aggressive). So what is the appropriate level of assistance? And how do factors like task difficulty and policy correctness affect this decision?
    We present a manipulation planning framework that allows robots to plan in the presence of constraints on end-effector pose, as well as other common constraints. The framework has three main components: constraint representation,... more
    We present a manipulation planning framework that allows robots to plan in the presence of constraints on end-effector pose, as well as other common constraints. The framework has three main components: constraint representation, constraint-satisfaction strategies, and a general planning algorithm. These components come together to create an efficient and probabilistically complete manipulation planning algorithm called the Constrained BiDirectional Rapidly-exploring Random
    ABSTRACT In assistive teleoperation, the robot helps the user accomplish the desired task, making teleoperation easier and more seamless. Rather than simply executing the user's input, which is hindered by the inadequacies of the... more
    ABSTRACT In assistive teleoperation, the robot helps the user accomplish the desired task, making teleoperation easier and more seamless. Rather than simply executing the user's input, which is hindered by the inadequacies of the interface, the robot attempts to predict the user's intent, and assists in ac-complishing it. In this work, we are interested in the scientific underpinnings of assistance: we formalize assistance under the general framework of policy blending, show how previous work methods instantiate this formalism, and provide a principled analysis of its main components: prediction of user intent and its arbitration with the user input. We define the prediction problem, with foundations in Inverse Reinforcement Learning, discuss simplifying assumptions that make it tractable, and test these on data from users teleoperating a robotic manipulator under various circumstances. We propose that arbitration should be moderated by the confidence in the prediction. Our user study analyzes the effect of the arbitration type, together with the prediction correctness and the task difficulty, on the performance of assistance and the preferences of users.
    For successful deployment, personal robots must adapt to ever-changing indoor environments. While dealing with novel objects is a largely unsolved challenge in AI, it is easy for people. In this paper we present a framework for robot... more
    For successful deployment, personal robots must adapt to ever-changing indoor environments. While dealing with novel objects is a largely unsolved challenge in AI, it is easy for people. In this paper we present a framework for robot supervision through Amazon Mechanical Turk. Unlike traditional models of teleoperation, people provide semantic information about the world and subjective judgements. The robot then
    * Available as a photocopy reprint only. Allow two weeks reprinting time plus standard delivery time. No discounts or returns apply. ... Standard delivery in the US is 7 to 10 business days and outside the US delivery is 4 to 6 weeks or... more
    * Available as a photocopy reprint only. Allow two weeks reprinting time plus standard delivery time. No discounts or returns apply. ... Standard delivery in the US is 7 to 10 business days and outside the US delivery is 4 to 6 weeks or longer. For further details, please see shipping policy. ... Listed below are the papers found in this volume. Click the paper title to view an abstract or to order an individual paper. ... Sign up for monthly alerts of new titles released.
    We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot cover-age algorithm, a boustrophedon approach, which di-vides the target two-dimensional... more
    We introduce a new algorithm to cover an unknown space with a homogeneous team of circular mobile robots. Our approach is based on a single robot cover-age algorithm, a boustrophedon approach, which di-vides the target two-dimensional space into regions called cells, ...
    We present a planning algorithm called BiSpace that produces fast plans to complex high-dimensional problems by simultaneously exploring multiple spaces. We specifically focus on finding robust solutions to manipulation and grasp planning... more
    We present a planning algorithm called BiSpace that produces fast plans to complex high-dimensional problems by simultaneously exploring multiple spaces. We specifically focus on finding robust solutions to manipulation and grasp planning problems by using BiSpace's special characteristics to explore the work and configuration spaces of the environment and robot. Furthermore, we present a number of techniques for constructing informed
    ABSTRACT The ability of a perception system to discern what is important in a scene and what is not is an invaluable asset, with multiple applications in object recognition, people detection and SLAM, among others. In this paper, we aim... more
    ABSTRACT The ability of a perception system to discern what is important in a scene and what is not is an invaluable asset, with multiple applications in object recognition, people detection and SLAM, among others. In this paper, we aim to analyze all sensory data available to separate a scene into a few physically meaningful parts, which we term structure, while discarding background clutter. In particular, we consider the combination of image and range data, and base our decision in both appearance and 3D shape. Our main contribution is the development of a framework to perform scene segmentation that preserves physical objects using multi-modal data. We combine image and range data using a novel mid-level fusion technique based on the concept of regions that avoids any pixel-level correspondences between data sources. We associate groups of pixels with 3D points into multi-modal regions that we term regionlets, and measure the structure-ness of each regionlet using simple, bottom-up cues from image and range features. We show that the highest-ranked regionlets correspond to the most prominent objects in the scene. We verify the validity of our approach on 105 scenes of household environments.
    Research Interests:
    Research Interests:
    Abstract—We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goals in the... more
    Abstract—We present an approach to path planning for manipulators that uses Workspace Goal Regions (WGRs) to specify goal end-effector poses. Instead of specifying a discrete set of goals in the manipulator's configuration space, we specify goals more intuitively as volumes in ...
    The latency of a perception system is crucial for a robot performing interactive tasks in dynamic human environments. We present MOPED, a fast and scalable perception system for object recognition and pose estimation. MOPED builds on... more
    The latency of a perception system is crucial for a robot performing interactive tasks in dynamic human environments. We present MOPED, a fast and scalable perception system for object recognition and pose estimation. MOPED builds on POSESEQ, a state of the art object recognition algorithm, demonstrating a massive improvement in scalability and latency without sacrificing robustness. We achieve this with
    We add to a manipulator's capabilities a new primitive motion which we term a push-grasp. While significant progress has been made in robotic grasping of objects and geometric path planning for manipulation, such work treats... more
    We add to a manipulator's capabilities a new primitive motion which we term a push-grasp. While significant progress has been made in robotic grasping of objects and geometric path planning for manipulation, such work treats the world and the object being grasped as immovable, often declaring failure when simple motions of the object could produce success. We analyze the mechanics
    Abstract—We present a sampling-based path planning al-gorithm capable of efficiently generating solutions for high-dimensional manipulation problems involving challenging inverse kinematics and complex obstacles. Our algorithm extends the... more
    Abstract—We present a sampling-based path planning al-gorithm capable of efficiently generating solutions for high-dimensional manipulation problems involving challenging inverse kinematics and complex obstacles. Our algorithm extends the Rapidly-exploring Random Tree (RRT) ...
    Handing over objects to humans is an essential capability for assistive robots. While there are infinite ways to hand an object, robots should be able to choose the one that is best for the human. In this paper we focus on choosing the... more
    Handing over objects to humans is an essential capability for assistive robots. While there are infinite ways to hand an object, robots should be able to choose the one that is best for the human. In this paper we focus on choosing the robot and object configuration at which the transfer of the object occurs, ie the hand-over configuration. We advocate the incorporation of user preferences in choosing hand-over configurations. We present a user study in which we collect data on human preferences and a human-robot interaction ...
    * Available as a photocopy reprint only. Allow two weeks reprinting time plus standard delivery time. No discounts or returns apply. ... Standard delivery in the US is 7 to 10 business days and outside the US delivery is 4 to 6 weeks or... more
    * Available as a photocopy reprint only. Allow two weeks reprinting time plus standard delivery time. No discounts or returns apply. ... Standard delivery in the US is 7 to 10 business days and outside the US delivery is 4 to 6 weeks or longer. For further details, please see shipping policy. ... Listed below are the papers found in this volume. Click the paper title to view an abstract or to order an individual paper. ... Sign up for monthly alerts of new titles released.
    ABSTRACT In this paper, we present CHOMP (covariant Hamiltonian optimization for motion planning), a method for trajectory optimization invariant to reparametrization. CHOMP uses functional gradient techniques to iteratively improve the... more
    ABSTRACT In this paper, we present CHOMP (covariant Hamiltonian optimization for motion planning), a method for trajectory optimization invariant to reparametrization. CHOMP uses functional gradient techniques to iteratively improve the quality of an initial trajectory, optimizing a functional that trades off between a smoothness and an obstacle avoidance component. CHOMP can be used to locally optimize feasible trajectories, as well as to solve motion planning queries, converging to low-cost trajectories even when initialized with infeasible ones. It uses Hamiltonian Monte Carlo to alleviate the problem of convergence to high-cost local minima (and for probabilistic completeness), and is capable of respecting hard constraints along the trajectory. We present extensive experiments with CHOMP on manipulation and locomotion tasks, using seven-degree-of-freedom manipulators and a rough-terrain quadruped robot.