English
Related papers

Related papers: Interactive Movement Primitives: Planning to Push …

200 papers

This paper presents Latent Sampling-based Motion Planning (L-SBMP), a methodology towards computing motion plans for complex robotic systems by learning a plannable latent representation. Recent works in control of robotic systems have…

Robotics · Computer Science 2018-11-07 Brian Ichter , Marco Pavone

Motion prediction in unstructured environments is a difficult problem and is essential for safe and efficient human-robot space sharing and collaboration. In this work, we focus on manipulation movements in environments such as homes,…

Robotics · Computer Science 2020-07-21 Philipp Kratzer , Niteesh Balachandra Midlagajni , Marc Toussaint , Jim Mainprice

Motion planning under differential constraints, kinodynamic motion planning, is one of the canonical problems in robotics. Currently, state-of-the-art methods evolve around kinodynamic variants of popular sampling-based algorithms, such as…

Robotics · Computer Science 2016-01-26 Oktay Arslan , Karl Berntorp , Panagiotis Tsiotras

In this paper we propose an approach for efficient grasp selection for manipulation tasks of unknown objects. Even for simple tasks such as pick-and-place, a unique solution is rare to occur. Rather, multiple candidate grasps must be…

Robotics · Computer Science 2016-03-15 Ana Huaman Quispe , Heni Ben Amor , Henrik Christensen , Mike Stilman

Motion planning in the presence of multiple dynamic obstacles is an important research problem from the perspective of autonomous vehicles as well as space-constrained multi-robot work environment. In this paper, we address the motion…

Systems and Control · Electrical Eng. & Systems 2019-12-30 Trishant Roy , Anindya Harchowdhury , Leena Vachhani

A striking observation about iterative magnitude pruning (IMP; Frankle et al. 2020) is that $\unicode{x2014}$ after just a few hundred steps of dense training $\unicode{x2014}$ the method can find a sparse sub-network that can be trained to…

Machine Learning · Computer Science 2022-06-06 Mansheej Paul , Brett W. Larsen , Surya Ganguli , Jonathan Frankle , Gintare Karolina Dziugaite

Efficient tabletop rearrangement planning seeks to find high-quality solutions while minimizing total cost. However, the task is challenging due to object dependencies and limited buffer space for temporary placements. The complexity…

Robotics · Computer Science 2025-05-27 Jiaming Hu , Jiawei Wang , Henrik I Christensen

Robotic pick and place stands at the heart of autonomous manipulation. When conducted in cluttered or complex environments robots must jointly reason about the selected grasp and desired placement locations to ensure success. While several…

Robotics · Computer Science 2024-02-15 Mohanraj Devendran Shanthi , Tucker Hermans

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. Its efficiency comes from minimizing the number of collision…

Robotics · Computer Science 2021-06-02 Daniel Rakita , Bilge Mutlu , Michael Gleicher

This paper explores the Navigation Among Movable Obstacles (NAMO) problem and proposes joint path and push planning: which path to take and in what direction the obstacles should be pushed at, given a start and goal position. We present a…

Robotics · Computer Science 2020-10-29 Victor Emeli , Akansel Cosgun

Robotic pick-and-place tasks in convenience stores pose challenges due to dense object arrangements, occlusions, and variations in object properties such as color, shape, size, and texture. These factors complicate trajectory planning and…

Robotics · Computer Science 2025-08-13 Muhammad A. Muttaqien , Tomohiro Motoda , Ryo Hanai , Yukiyasu Domae

Manipulation of objects by exploiting their contact with the environment can enhance both the dexterity and payload capability of robotic manipulators. A common way to manipulate heavy objects beyond the payload capability of a robot is to…

Robotics · Computer Science 2021-04-27 Amin Fakhari , Aditya Patankar , Nilanjan Chakraborty

Sampling-based motion planners (SBMPs) are widely used to compute dynamically feasible robot paths. However, their reliance on uniform sampling often leads to poor efficiency and slow planning in complex environments. We introduce a novel…

Robotics · Computer Science 2025-11-10 Shubham Natraj , Bruno Sinopoli , Yiannis Kantaros

Robotic tree pruning requires highly precise manipulator control in order to accurately align a cutting implement with the desired pruning point at the correct angle. Simultaneously, the robot must avoid applying excessive force to rigid…

Robotics · Computer Science 2021-09-28 Alexander You , Hannah Kolano , Nidhi Parayil , Cindy Grimm , Joseph R. Davidson

Autonomous mobile robots must maintain safety, but should not sacrifice performance, leading to the classical reach-avoid problem: find a trajectory that is guaranteed to reach a goal and avoid obstacles. This paper addresses the near…

Robotics · Computer Science 2024-10-28 Long Kiu Chung , Wonsuhk Jung , Chuizheng Kong , Shreyas Kousik

The paper presents Maximal Ellipsoid Backward Reachable Trees MAXELLIPSOID BRT, which is a multi-query algorithm for planning of dynamic systems under stochastic motion uncertainty and constraints on the control input. In contrast to…

Systems and Control · Electrical Eng. & Systems 2024-09-17 Naman Aggarwal , Jonathan P. How

Mobile manipulation robots are continuously advancing, with their grasping capabilities rapidly progressing. However, there are still significant gaps preventing state-of-the-art mobile manipulators from widespread real-world deployments,…

In recent years, industrial robots have been installed in various industries to handle advanced manufacturing and high precision tasks. However, further integration of industrial robots is hampered by their limited flexibility, adaptability…

Robotics · Computer Science 2020-10-27 Oren Spector , Miriam Zacksenhouse

This paper presents Contact Mode Guided Manipulation Planning (CMGMP) for 3D quasistatic and quasidynamic rigid body motion planning in dexterous manipulation. The CMGMP algorithm generates hybrid motion plans including both continuous…

Robotics · Computer Science 2022-06-06 Xianyi Cheng , Eric Huang , Yifan Hou , Matthew T. Mason

The performance of optimization-based robot motion planning algorithms is highly dependent on the initial solutions, commonly obtained by running a sampling-based planner to obtain a collision-free path. However, these methods can be slow…

Robotics · Computer Science 2025-08-15 J. Carvalho , A. Le , P. Kicki , D. Koert , J. Peters
‹ Prev 1 8 9 10 Next ›