English
Related papers

Related papers: Persistent Homology for Effective Non-Prehensile M…

200 papers

We propose a human-operator guided planning approach to pushing-based manipulation in clutter. Most recent approaches to manipulation in clutter employs randomized planning. The problem, however, remains a challenging one where the planning…

Robotics · Computer Science 2020-04-06 Rafael Papallas , Mehmet R. Dogar

We propose a functorial framework for persistent homology based on finite topological spaces and their associated posets. Starting from a finite metric space, we associate a filtration of finite topologies whose structure maps are…

Algebraic Topology · Mathematics 2026-02-24 Selçuk Kayacan

Most object manipulation strategies for robots are based on the assumption that the object is rigid (i.e., with fixed geometry) and the goal's details have been fully specified (e.g., the exact target pose). However, there are many tasks…

Robotics · Computer Science 2022-09-14 Shengzeng Huo , Fangyuan Wang , Luyin Hu , Peng Zhou , Jihong Zhu , Hesheng Wang , David Navarro-Alarcon

This paper presents a task and motion planning (TAMP) framework for a robotic manipulator in order to retrieve a target object from clutter. We consider a configuration of objects in a confined space with a high density so no collision-free…

Robotics · Computer Science 2020-03-26 Changjoo Nam , Jinhwi Lee , Sang Hun Cheong , Brian Y. Cho , ChangHwan Kim

This paper presents an approach to in-hand manipulation planning that exploits the mechanics of alternating sticking contact. Particularly, we consider the problem of manipulating a grasped object using external pushes for which the pusher…

Robotics · Computer Science 2018-03-06 Nikhil Chavan-Dafle , Alberto Rodriguez

Persistent homology is a technique recently developed in algebraic and computational topology well-suited to analysing structure in complex, high-dimensional data. In this paper, we exposit the theory of persistent homology from first…

Applications · Statistics 2016-11-30 Matthew Pietrosanu

In topological data analysis, persistent homology is used to study the "shape of data". Persistent homology computations are completely characterized by a set of intervals called a bar code. It is often said that the long intervals…

Computational Geometry · Computer Science 2025-02-19 Peter Bubenik , Michael Hull , Dhruv Patel , Benjamin Whittle

Persistent homology is a mathematical tool used for studying the shape of data by extracting its topological features. It has gained popularity in network science due to its applicability in various network mining problems, including…

Algebraic Topology · Mathematics 2023-06-21 Mehmet Emin Aktas , Thu Nguyen , Rakin Riza , Muhammad Ifte Islam , Esra Akbas

This work proposes a robot task planning framework for retrieving a target object in a confined workspace among multiple stacked objects that obstruct the target. The robot can use prehensile picking and in-workspace placing actions. The…

Robotics · Computer Science 2023-03-28 Daniel Nakhimovich , Yinglong Miao , Kostas E. Bekris

Dexterous hands enable concurrent prehensile and nonprehensile manipulation, such as holding one object while interacting with another, a capability essential for everyday tasks yet underexplored in robotics. Learning such long-horizon,…

Robotics · Computer Science 2026-03-17 Hao Jiang , Yue Wu , Yue Wang , Gaurav S. Sukhatme , Daniel Seita

Persistent homology is a powerful mathematical tool that summarizes useful information about the shape of data allowing one to detect persistent topological features while one adjusts the resolution. However, the computation of such…

Quantum Physics · Physics 2022-03-01 Bernardo Ameneyro , Vasileios Maroulas , George Siopsis

Persistent homology is a topological feature used in a variety of applications such as generating features for data analysis and penalizing optimization problems. We develop an approach to accelerate persistent homology computations…

Algebraic Topology · Mathematics 2023-01-19 Yuan Luo , Bradley J. Nelson

Recognition of occluded objects in unseen and unstructured indoor environments is a challenging problem for mobile robots. To address this challenge, we propose a new descriptor, TOPS, for point clouds generated from depth images and an…

Computer Vision and Pattern Recognition · Computer Science 2023-12-22 Ekta U. Samani , Ashis G. Banerjee

We address prehensile pushing, the problem of manipulating a grasped object by pushing against the environment. Our solution is an efficient nonlinear trajectory optimization problem relaxed from an exact mixed integer non-linear trajectory…

Robotics · Computer Science 2025-03-19 Patrizio Perugini , Jens Lundell , Katharina Friedl , Danica Kragic

Prediction and discovery of new materials with desired properties are at the forefront of quantum science and technology research. A major bottleneck in this field is the computational resources and time complexity related to finding new…

For planning rearrangements of objects in a clutter, it is required to know the goal configuration of the objects. However, in real life scenarios, this information is not available most of the time. We introduce a novel method that…

Robotics · Computer Science 2019-06-21 Abdul Rahman Dabbour , Esra Erdem , Volkan Patoglu

In recent years, cosmic shear has emerged as a powerful tool to study the statistical distribution of matter in our Universe. Apart from the standard two-point correlation functions, several alternative methods like peak count statistics…

Cosmology and Nongalactic Astrophysics · Physics 2021-04-21 Sven Heydenreich , Benjamin Brück , Joachim Harnois-Déraps

Nonprehensile actions such as pushing are crucial for addressing multi-object rearrangement problems. Many traditional methods generate robot-centric actions, which differ from intuitive human strategies and are typically inefficient. To…

Robotics · Computer Science 2025-11-03 Kejia Ren , Gaotian Wang , Andrew S. Morgan , Lydia E. Kavraki , Kaiyu Hang

This paper addresses the problem of picking up only one object at a time avoiding any entanglement in bin-picking. To cope with a difficult case where the complex-shaped objects are heavily entangled together, we propose a topology-based…

Robotics · Computer Science 2022-03-02 Xinyi Zhang , Keisuke Koyama , Yukiyasu Domae , Weiwei Wan , Kensuke Harada

We present a method to apply heuristic search algorithms to solve rearrangement planning by pushing problems. In these problems, a robot must push an object through clutter to achieve a goal. To do this, we exploit the fact that contact…

Robotics · Computer Science 2016-03-30 Jennifer E. King , Siddhartha S. Srinivasa