Coordination of two robotic manipulators for object retrieval in clutter
Jeeho Ahn, ChangHwan Kim, Changjoo Nam

TL;DR
This paper presents a coordination method for two robotic manipulators to efficiently retrieve objects from cluttered spaces by maximizing robot turn-taking, reducing mission completion time.
Contribution
It introduces an optimal coordination algorithm based on uniform-cost search and a greedy variant to improve retrieval efficiency in cluttered environments.
Findings
Method reduces mission time by at least 22.9%.
Optimal coordination maximizes robot turn-taking.
Proposed approach outperforms non-coordination methods.
Abstract
We consider the problem of retrieving a target object from a confined space by two robotic manipulators where overhand grasps are not allowed. If other movable obstacles occlude the target, more than one object should be relocated to clear the path to reach the target object. With two robots, the relocation could be done efficiently by simultaneously performing relocation tasks. However, the precedence constraint between the tasks (e.g, some objects at the front should be removed to manipulate the objects in the back) makes the simultaneous task execution difficult. We propose a coordination method that determines which robot relocates which object so as to perform tasks simultaneously. Given a set of objects to be relocated, the objective is to maximize the number of turn-takings of the robots in performing relocation tasks. Thus, one robot can pick an object in the clutter while the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · Optimization and Search Problems
