activity
20182022
most citedCorrective Shared Autonomy for Addressing Task Variability

39 citations · 107 across the 11 of their papers we have counts for

collaborators
Showing cs.ROShow all

9 papers · 1 filter

cs.RO202125 cited

Task-Level Authoring for Remote Robot Teleoperation

Emmanuel Senft, Michael Hagenow, Kevin Welsh +4

Remote teleoperation of robots can broaden the reach of domain specialists across a wide range of industries such as home maintenance, health care, light manufacturing, and constru…

cs.RO2021

Recognizing Orientation Slip in Human Demonstrations

Michael Hagenow, Bolun Zhang, Bilge Mutlu +2

Manipulations of a constrained object often use a non-rigid grasp that allows the object to rotate relative to the end effector. This orientation slip strategy is often present in…

cs.RO202119 cited

Situated Live Programming for Human-Robot Collaboration

Emmanuel Senft, Michael Hagenow, Robert Radwin +3

We present situated live programming for human-robot collaboration, an approach that enables users with limited programming experience to program collaborative applications for hum…

cs.RO202115 cited

Informing Real-time Corrections in Corrective Shared Autonomy Through Expert Demonstrations

Michael Hagenow, Emmanuel Senft, Robert Radwin +3

Corrective Shared Autonomy is a method where human corrections are layered on top of an otherwise autonomous robot behavior. Specifically, a Corrective Shared Autonomy system lever…

cs.RO2021

Strobe: An Acceleration Meta-algorithm for Optimizing Robot Paths using Concurrent Interleaved Sub-Epoch Pods

Daniel Rakita, Bilge Mutlu, Michael Gleicher

In this paper, we present a meta-algorithm intended to accelerate many existing path optimization algorithms. The central idea of our work is to strategically break up a waypoint p…

cs.RO2021

Single-query Path Planning Using Sample-efficient Probability Informed Trees

Daniel Rakita, Bilge Mutlu, Michael Gleicher

In this work, we present a novel sampling-based path planning method, called SPRINT. The method finds solutions for high dimensional path planning problems quickly and robustly. It…