English
Related papers

Related papers: Optimal Shelf Arrangement to Minimize Robot Retrie…

200 papers

This research concerns a type of configuration optimization problems frequently encountered in engineering design and manufacturing, where the envelope volume in space occupied by a number of components needs to be minimized along with…

Computational Engineering, Finance, and Science · Computer Science 2017-06-13 Pei Cao , Zhaoyan Fan , Robert X. Gao , Jiong Tang

Modern lightweight dual-arm robots bring the physical capabilities to quickly take over tasks at typical industrial workplaces designed for workers. In times of mass-customization, low setup times including the instructing/specifying of new…

Robotics · Computer Science 2024-03-22 Jan Kristof Behrens , Ralph Lange , Masoumeh Mansouri

The Multi-mode Resource Availability Cost Problem (MRACP) optimizes resource availability to minimize usage costs and is a recent project scheduling problem variant. The Multi-Mode On-Site Workshop Availability Cost Problem (MOSWACP)…

Optimization and Control · Mathematics 2025-01-07 Niloufar Mirzavand Boroujeni , Nima Moradi

Our research deals with the optimization version of the set partition problem, where the objective is to minimize the absolute difference between the sums of the two disjoint partitions. Although this problem is known to be NP-hard and…

Data Structures and Algorithms · Computer Science 2023-03-16 Kaan Gokcesu , Hakan Gokcesu

We examine the problem of allocating a given total storage budget in a distributed storage system for maximum reliability. A source has a single data object that is to be coded and stored over a set of storage nodes; it is allowed to store…

Information Theory · Computer Science 2016-11-15 Derek Leong , Alexandros G. Dimakis , Tracey Ho

In this letter, we consider the Multi-Robot Efficient Search Path Planning (MESPP) problem, where a team of robots is deployed in a graph-represented environment to capture a moving target within a given deadline. We prove this problem to…

Robotics · Computer Science 2021-01-14 Beatriz A. Asfora , Jacopo Banfi , Mark Campbell

Robotic pick-and-place (PnP) operations on moving conveyors find a wide range of industrial applications. In practice, simple greedy heuristics (e.g., prioritization based on the time to process a single object) are applied that achieve…

Robotics · Computer Science 2019-12-18 Shuai D. Han , Si Wei Feng , Jingjin Yu

In this paper, a novel robotic grasping system is established to automatically pick up objects in cluttered scenes. A composite robotic hand composed of a suction cup and a gripper is designed for grasping the object stably. The suction cup…

Robotics · Computer Science 2023-02-22 Yuhong Deng , Xiaofeng Guo , Yixuan Wei , Kai Lu , Bin Fang , Di Guo , Huaping Liu , Fuchun Sun

This paper focuses on vision-based pose estimation for multiple rigid objects placed in clutter, especially in cases involving occlusions and objects resting on each other. Progress has been achieved recently in object recognition given…

Robotics · Computer Science 2019-04-04 Chaitanya Mitash , Abdeslam Boularias , Kostas Bekris

Multiple sequence alignment (MSA) is a ubiquitous problem in computational biology. Although it is NP-hard to find an optimal solution for an arbitrary number of sequences, due to the importance of this problem researchers are trying to…

Artificial Intelligence · Computer Science 2011-09-29 S. Schroedl

Robots performing tasks in warehouses provide the first example of wide-spread adoption of autonomous vehicles in transportation and logistics. The efficiency of these operations, which can vary widely in practice, are a key factor in the…

Manipulation in cluttered environments is challenging due to spatial dependencies among objects, where an improper manipulation order can cause collisions or blocked access. Existing approaches often overlook these spatial relationships,…

Robotics · Computer Science 2026-01-01 Yuxiang Yan , Zhiyuan Zhou , Xin Gao , Guanghao Li , Shenglin Li , Jiaqi Chen , Qunyan Pu , Jian Pu

We use soft heaps to obtain simpler optimal algorithms for selecting the $k$-th smallest item, and the set of~$k$ smallest items, from a heap-ordered tree, from a collection of sorted lists, and from $X+Y$, where $X$ and $Y$ are two…

Data Structures and Algorithms · Computer Science 2018-02-21 Haim Kaplan , László Kozma , Or Zamir , Uri Zwick

For rearranging objects on tabletops with overhand grasps, temporarily relocating objects to some buffer space may be necessary. This raises the natural question of how many simultaneous storage spaces, or "running buffers", are required so…

Robotics · Computer Science 2023-04-05 Kai Gao , Si Wei Feng , Baichuan Huang , Jingjin Yu

This paper develops intelligent algorithms for robots to reorient objects. Given the initial and goal poses of an object, the proposed algorithms plan a sequence of robot poses and grasp configurations that reorient the object from its…

Robotics · Computer Science 2017-05-29 Weiwei Wan , Kensuke Harada

The increasing use of autonomous robot systems in hazardous environments underscores the need for efficient search and rescue operations. Despite significant advancements, existing literature on object search often falls short in overcoming…

Robotics · Computer Science 2024-04-08 Matthew Collins , Jared J. Beard , Nicholas Ohi , Yu Gu

In recent years, the usage of ensemble learning in applications has grown significantly due to increasing computational power allowing the training of large ensembles in reasonable time frames. Many applications, e.g., malware detection,…

Machine Learning · Computer Science 2021-11-18 Peter Domanski , Dirk Pflüger , Jochen Rivoir , Raphaël Latty

Warehouses play a central role in industrial logistics, functioning as critical hubs for storing and organizing inventory to support efficient production. Optimizing item allocation within these facilities is essential for reducing…

In (fully) dynamic set cover, the goal is to maintain an approximately optimal solution to a dynamically evolving instance of set cover, where in each step either an element is added to or removed from the instance. The two main desiderata…

Data Structures and Algorithms · Computer Science 2025-11-12 Sayan Bhattacharya , Ruoxu Cen , Debmalya Panigrahi

We present a centralized algorithmic framework for solving multi-robot path planning problems in general, two-dimensional, continuous environments while minimizing globally the task completion time. The framework obtains high levels of…

Robotics · Computer Science 2015-07-14 Jingjin Yu , Daniela Rus