Kaushik Shivakumar

Kaushik Shivakumar

Auto-generated profile, based on publicly available information

Kaushik Shivakumar

University of California, Berkeley, Berkeley, CA, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 June 2022
Verified
Conference Paper
Open access
VVVainavi Viswanath
Vainavi Viswanath
KSKaushik Shivakumar
Kaushik Shivakumar
JKJustin Kerr
Justin Kerr
BTBrijen Thananjeyan
Brijen Thananjeyan
ENEllen Novoseller
Ellen Novoseller
KGKen Goldberg
Ken Goldberg

12 March 2024 in Proceedings of the ACM on Management of Data
Verified
Journal Article
Open access
DCDavid C.Y. Chu
David C.Y. Chu
RPRithvik Panchapakesan
Rithvik Panchapakesan
SLShadaj Laddad
Shadaj Laddad
LKLucky E. Katahanas
Lucky E. Katahanas
CLChris Liu
Chris Liu
HHHeidi Howard
Heidi Howard
Distributed protocols such as 2PC and Paxos lie at the core of many systems in the cloud, but standard implementations do not scale. New scalable distributed protocols are developed through careful analysis and rewrites, but this process is ad hoc and error-prone. This paper presents an approach for scaling any distributed protocol by applying rule-driven rewrites, borrowing from query optimization. Distributed protocol rewrites entail a new burden: reasoning about spatiotemporal correctness. We leverage order-insensitivity and data dependency analysis to systematically identify correct coordination-free scaling opportunities. We apply this analysis to create preconditions and mechanisms for coordination-free decoupling and partitioning, two fundamental vertical and horizontal scaling techniques. Manual rule-driven applications of decoupling and partitioning improve the throughput of 2PC by 5× and Paxos by 3×, and match state-of-the-art throughput in recent work. These results point the way toward automated optimizers for distributed protocols based on correct-by-construction rewrite rules.

21 April 2022 in arXiv
Verified
Preprint
Open access
PDF file
RHRyan Hoque
Ryan Hoque
KSKaushik Shivakumar
Kaushik Shivakumar
SAShrey Aeron
Shrey Aeron
GDGabriel Deza
Gabriel Deza
AGAditya Ganapathi
Aditya Ganapathi
KGKen Goldberg
Ken Goldberg
Autonomous fabric manipulation is a longstanding challenge in robotics, but evaluating progress is difficult due to the cost and diversity of robot hardware. Using Reach, a cloud robotics platform that enables low-latency remote execution of control policies on physical robots, we present the first systematic benchmarking of fabric manipulation algorithms on physical hardware. We develop 4 novel learning-based algorithms that model expert actions, keypoints, reward functions, and dynamic motions, and we compare these against 4 learning-free and inverse dynamics algorithms on the task of folding a crumpled T-shirt with a single robot arm. The entire lifecycle of data collection, model training, and policy evaluation is performed remotely without physical access to the robot workcell. Results suggest a new algorithm combining imitation learning with analytic methods achieves 84% of human-level performance on the folding task. See https://sites.google.com/berkeley.edu/cloudfolding for all data, code, models, and supplemental material.

31 July 2022 in arXiv
Verified
Preprint
Open access
PDF file
VVVainavi Viswanath
Vainavi Viswanath
KSKaushik Shivakumar
Kaushik Shivakumar
JKJustin Kerr
Justin Kerr
BTBrijen Thananjeyan
Brijen Thananjeyan
ENEllen Novoseller
Ellen Novoseller
KGKen Goldberg
Ken Goldberg
Cables are ubiquitous in many settings and it is often useful to untangle them. However, cables are prone to self-occlusions and knots, making them difficult to perceive and manipulate. The challenge increases with cable length: long cables require more complex slack management to facilitate observability and reachability. In this paper, we focus on autonomously untangling cables up to 3 meters in length using a bilateral robot. We develop RGBD perception and motion primitives to efficiently untangle long cables and novel gripper jaws specialized for this task. We present Sliding and Grasping for Tangle Manipulation (SGTM), an algorithm that composes these primitives to iteratively untangle cables with success rates of 67% on isolated overhand and figure-eight knots and 50% on more complex configurations. Supplementary material, visualizations, and videos can be found at https://sites.google.com/view/rss-2022-untangling/home.

3 April 2024 in arXiv
Verified
Preprint
Open access
PDF file
DCDavid Chu
David Chu
RPRithvik Panchapakesan
Rithvik Panchapakesan
SLShadaj Laddad
Shadaj Laddad
LKLucky Katahanas
Lucky Katahanas
CLChris Liu
Chris Liu
HHHeidi Howard
Heidi Howard
Distributed protocols such as 2PC and Paxos lie at the core of many systems in the cloud, but standard implementations do not scale. New scalable distributed protocols are developed through careful analysis and rewrites, but this process is ad hoc and error-prone. This paper presents an approach for scaling any distributed protocol by applying rule-driven rewrites, borrowing from query optimization. Distributed protocol rewrites entail a new burden: reasoning about spatiotemporal correctness. We leverage order-insensitivity and data dependency analysis to systematically identify correct coordination-free scaling opportunities. We apply this analysis to create preconditions and mechanisms for coordination-free decoupling and partitioning, two fundamental vertical and horizontal scaling techniques. Manual rule-driven applications of decoupling and partitioning improve the throughput of 2PC by $5\times$ and Paxos by $3\times$, and match state-of-the-art throughput in recent work. These results point the way toward automated optimizers for distributed protocols based on correct-by-construction rewrite rules.

29 October 2023 in arXiv
Verified
Preprint
Open access
PDF file
VVVainavi Viswanath
Vainavi Viswanath
KSKaushik Shivakumar
Kaushik Shivakumar
JAJainil Ajmera
Jainil Ajmera
MPMallika Parulekar
Mallika Parulekar
JKJustin Kerr
Justin Kerr
KGKen Goldberg
Ken Goldberg
Tracing - estimating the spatial state of - long deformable linear objects such as cables, threads, hoses, or ropes, is useful for a broad range of tasks in homes, retail, factories, construction, transportation, and healthcare. For long deformable linear objects (DLOs or simply cables) with many (over 25) crossings, we present HANDLOOM (Heterogeneous Autoregressive Learned Deformable Linear Object Observation and Manipulation), a learning-based algorithm that fits a trace to a greyscale image of cables. We evaluate HANDLOOM on semi-planar DLO configurations where each crossing involves at most 2 segments. HANDLOOM makes use of neural networks trained with 30,000 simulated examples and 568 real examples to autoregressively estimate traces of cables and classify crossings. Experiments find that in settings with multiple identical cables, HANDLOOM can trace each cable with 80% accuracy. In single-cable images, HANDLOOM can trace and identify knots with 77% accuracy. When HANDLOOM is incorporated into a bimanual robot system, it enables state-based imitation of knot tying with 80% accuracy, and it successfully untangles 64% of cable configurations across 3 levels of difficulty. Additionally, HANDLOOM demonstrates generalization to knot types and materials (rubber, cloth rope) not present in the training dataset with 85% accuracy. Supplementary material, including all code and an annotated dataset of RGB-D images of cables along with ground-truth traces, is at https://sites.google.com/view/cable-tracing.