Search Results for author:
Found 8 papers, 4 papers with code
On Computing Makespan-Optimal Solutions for Generalized Sliding-Tile Puzzles
In the $15$-puzzle game, $15$ labeled square tiles are reconfigured on a $4\times 4$ board through an escort, wherein each (time) step, a single tile neighboring it may slide into it, leaving the space previously occupied by the tile as the new escort.
ORLA*: Mobile Manipulator-Based Object Rearrangement with Lazy A*
Effectively performing object rearrangement is an essential skill for mobile manipulators, e. g., setting up a dinner table or organizing a desk.
Robot Motion Planning as Video Prediction: A Spatio-Temporal Neural Network-based Motion Planner
Despite the current development in this direction, the efficient capture and processing of important sequential and spatial information, in a direct and simultaneous way, is still relatively under-explored.
Toward Efficient Task Planning for Dual-Arm Tabletop Object Rearrangement
We investigate the problem of coordinating two robot arms to solve non-monotone tabletop multi-object rearrangement tasks.
Lazy Rearrangement Planning in Confined Spaces
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.
Uniform Object Rearrangement: From Complete Monotone Primitives to Efficient Non-Monotone Informed Search
DFSDP is extended to solve single-buffer, non-monotone instances, given a choice of an object and a buffer.
DIPN: Deep Interaction Prediction Network with Application to Clutter Removal
The high accuracy of DIPN allows direct integration with a grasp network, yielding a robotic manipulation system capable of executing challenging clutter removal tasks while being trained in a fully self-supervised manner.
Optimal Multi-Robot Path Planning on Graphs: Complete Algorithms and Effective Heuristics
Based on this equivalence and integer linear programming (ILP), we design novel and complete algorithms for optimizing over each of the four objectives.
Robotics
