Please use this identifier to cite or link to this item:
|Title:||A Single-Query Manipulation Planner||Authors:||Lertkultanon, Puttichai
|Issue Date:||2015||Source:||Lertkultanon, P., & Pham, Q.-C. (2016). A Single-Query Manipulation Planner. IEEE Robotics and Automation Letters, 1(1), 198-205.||Series/Report no.:||IEEE Robotics and Automation Letters||Abstract:||In manipulation tasks, a robot interacts with movable object(s). The configuration space in manipulation planning is thus the Cartesian product of the configuration space of the robot with those of the movable objects. It is the complex structure of such a “composite configuration space” that makes manipulation planning particularly challenging. Previous works approximate the connectivity of the composite configuration space by means of discretization or by creating random roadmaps. Such approaches involve an extensive preprocessing phase, which furthermore has to be redone each time the environment changes. In this letter, we propose a high-level Grasp-Placement Table similar to that proposed by Tournassoud et al. (1987), but which does not require any discretization or heavy pre-processing. The table captures the potential connectivity of the composite configuration space while being specific only to the movable objects: in particular, it does not require to be recomputed when the environment changes. During the query phase, the table is used to guide a tree-based planner that explores the space systematically. Our simulations and experiments show that the proposed method enables improvements in both running time and trajectory quality as compared to existing approaches.||URI:||https://hdl.handle.net/10356/84985
|ISSN:||2377-3766||DOI:||10.1109/LRA.2015.2513731||Rights:||© 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: [http://dx.doi.org/10.1109/LRA.2015.2513731].||Fulltext Permission:||open||Fulltext Availability:||With Fulltext|
|Appears in Collections:||MAE Journal Articles|
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.