English
Related papers

Related papers: Dynamic Buffers: Cost-Efficient Planning for Table…

200 papers

This paper addresses non-prehensile rearrangement planning problems where a robot is tasked to rearrange objects among obstacles on a planar surface. We present an efficient planning algorithm that is designed to impose few assumptions on…

Robotics · Computer Science 2019-01-14 Joshua A. Haustein , Isac Arnekvist , Johannes Stork , Kaiyu Hang , Danica Kragic

Stable dynamical systems are a flexible tool to plan robotic motions in real-time. In the robotic literature, dynamical system motions are typically planned without considering possible limitations in the robot's workspace. This work…

Robotics · Computer Science 2020-03-26 Matteo Saveriano , Dongheui Lee

Recent research has shown that optimal picker tours in rectangular warehouses exhibit deterministic travel patterns within each aisle, and that certain previously considered traversals are unnecessary. Using these insights, this paper…

Optimization and Control · Mathematics 2026-01-19 George Dunn , Elizabeth Stojanovski , Bishnu Lamichhane , Hadi Charkhgard , Ali Eshragh

Collision-free navigation in cluttered environments with static and dynamic obstacles is essential for many multi-robot tasks. Dynamic obstacles may also be interactive, i.e., their behavior varies based on the behavior of other entities.…

Robotics · Computer Science 2024-05-21 Baskın Şenbaşlar , Gaurav S. Sukhatme

In warehouse and manufacturing environments, manipulation platforms are frequently deployed at conveyor belts to perform pick and place tasks. Because objects on the conveyor belts are moving, robots have limited time to pick them up. This…

Robotics · Computer Science 2021-01-19 Fahad Islam , Oren Salzman , Aditya Agarwal , Maxim Likhachev

We present progress on the problem of reconfiguring a 2D arrangement of building material by a cooperative group of robots. These robots must avoid collisions, deadlocks, and are subjected to the constraint of maintaining connectivity of…

Complex manipulation tasks, such as rearrangement planning of numerous objects, are combinatorially hard problems. Existing algorithms either do not scale well or assume a great deal of prior knowledge about the environment, and few offer…

Robotics · Computer Science 2021-03-25 Vasileios Vasilopoulos , Yiannis Kantaros , George J. Pappas , Daniel E. Koditschek

The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. Therefore, dynamic solutions, where scheduling decisions are made at runtime have…

Distributed, Parallel, and Cluster Computing · Computer Science 2014-04-16 Olivier Beaumont , Loris Marchal

This paper considers the problem of completing assemblies of passive objects in nonconvex environments, cluttered with convex obstacles of unknown position, shape and size that satisfy a specific separation assumption. A differential drive…

This thesis presents novel algorithms to advance robotic object rearrangement, a critical task for autonomous systems in applications like warehouse automation and household assistance. Addressing challenges of high-dimensional planning,…

Robotics · Computer Science 2025-05-15 Baichuan Huang

Solving storage problem: where objects must be accurately placed into containers with precise orientations and positions, presents a distinct challenge that extends beyond traditional rearrangement tasks. These challenges are primarily due…

Robotics · Computer Science 2024-09-04 Haonan Chang , Kowndinya Boyalakuntla , Yuhan Liu , Xinyu Zhang , Liam Schramm , Abdeslam Boularias

Object rearrangement is important for many applications but remains challenging, especially in confined spaces, such as shelves, where objects cannot be accessed from above and they block reachability to each other. Such constraints require…

Robotics · Computer Science 2022-10-14 Rui Wang , Kai Gao , Jingjin Yu , Kostas Bekris

Many real-world tasks, from house-cleaning to cooking, can be formulated as multi-object rearrangement problems -- where an agent needs to get specific objects into appropriate goal states. For such problems, we focus on the setting that…

Robotics · Computer Science 2023-01-25 Engin Tekin , Elaheh Barati , Nitin Kamra , Ruta Desai

Motivated by our collaboration with a major refugee resettlement agency in the U.S., we study a dynamic matching problem where each new arrival (a refugee case) must be matched immediately and irrevocably to one of the static resources (a…

Data Structures and Algorithms · Computer Science 2025-07-03 Kirk Bansak , Soonbong Lee , Vahideh Manshadi , Rad Niazadeh , Elisabeth Paulson

Obstacle avoidance for Unmanned Aerial Vehicles (UAVs) in cluttered environments is significantly challenging. Existing obstacle avoidance for UAVs either focuses on fully static environments or static environments with only a few dynamic…

Robotics · Computer Science 2023-12-15 Minghao Lu , Xiyu Fan , Han Chen , Peng Lu

We present an algorithm determining where to relocate objects inside a cluttered and confined space while rearranging objects to retrieve a target object. Although methods that decide what to remove have been proposed, planning for the…

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

Buffer zones are essential in production systems to decouple sequential processes. In dense floor storage environments, such as space-constrained brownfield facilities, manual operation is increasingly challenged by severe labor shortages…

Robotics · Computer Science 2026-03-31 Max Disselnmeyer , Thomas Bömer , Laura Dörr , Bastian Amberg , Anne Meyer

Safe UAV navigation is challenging due to the complex environment structures, dynamic obstacles, and uncertainties from measurement noises and unpredictable moving obstacle behaviors. Although plenty of recent works achieve safe navigation…

Robotics · Computer Science 2022-03-15 Zhefan Xu , Di Deng , Yiping Dong , Kenji Shimada

Grasping in cluttered environments is a fundamental but challenging robotic skill. It requires both reasoning about unseen object parts and potential collisions with the manipulator. Most existing data-driven approaches avoid this problem…

Robotics · Computer Science 2020-05-22 Adithyavairavan Murali , Arsalan Mousavian , Clemens Eppner , Chris Paxton , Dieter Fox

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