scispace - formally typeset
Open AccessProceedings ArticleDOI

Pushing using compliance

TLDR
This paper presents an approach based on the rapidly-exploring random tree (RRT) algorithm that, besides paths through the open space, exploits the power of compliance.
Abstract
This paper addresses the problem of maneuvering an object by pushing it through an environment with obstacles. Instead of only pushing the object through open spaces, we also allow it to use compliance, e.g. allowing it to slide along obstacle boundaries. The advantage of using compliance is twofold: compliance does not only extend the number of situations in which a push plan can be found, it also allows for simpler (i.e. less complicated) paths in many cases. Here, we present an approach based on the rapidly-exploring random tree (RRT) algorithm that, besides paths through the open space, exploits the power of compliance

read more

Content maybe subject to copyright    Report

Figures
Citations
More filters
Journal ArticleDOI

Push-manipulation of complex passive mobile objects using experimentally acquired motion models

TL;DR: This work presents an experience-based push-manipulation approach that enables the robot to acquire experimental models regarding how pushable real world objects with complex 3D structures move in response to various pushing actions and demonstrates the superiority of the achievable planning and execution concept through safe and successful push- manipulation of a variety of passively mobile pushable objects.
Proceedings ArticleDOI

Automatic learning of pushing strategy for delivery of irregular-shaped objects

TL;DR: A learning-based approach for pushing objects of any irregular shape to user-specified goal locations by automatically collecting a set of data on how an irregular-shaped object moves given the robot's relative position and pushing direction.
Journal Article

Integer programming, lattices, and results in fixed dimension

TL;DR: In this article, various lattice basis reduction algorithms are used as auxiliary algorithms when solving integer feasibility and optimization problems, and three algorithms are described: binary search, a linear algorithm for a fixed number of constraints, and a randomized algorithm for different numbers of constraints.
Proceedings ArticleDOI

Achievable push-manipulation for complex passive mobile objects using past experience

TL;DR: The RRT algorithm is modified in such a way to use the recalled robot and object trajectories as building blocks to generate achievable and collision-free push plans that reliably transport the object to a desired 3 DoF pose.
Book ChapterDOI

Planning and Resilient Execution of Policies For Manipulation in Contact with Actuation Uncertainty

TL;DR: In this paper, a sampling-based motion planner is proposed for planning motion for robots with actuation uncertainty that incorporates contact with the environment and the compliance of the robot to reliably perform manipulation tasks.
References
More filters
Journal ArticleDOI

An efficient algorithm for one-step planar compliant motion planning with uncertainty

TL;DR: AnO(n2 logn) algorithm is given to find a single commanded motion direction that will guarantee a successful motion in the plane from a specified start to a specified goal whenever such a one-step motion is possible.
Proceedings ArticleDOI

Path planning for pushing a disk using compliance

TL;DR: This work considers the path planning problem for a robot that pushes a disk shaped object in an environment among obstacles and presents an exact algorithm that, given a path for the object consisting of k sections, preprocesses the environment consisting of n non-intersecting line segments in O(n/sup 2/ log n) time.
Journal ArticleDOI

Hierarchical Decompositions and Circular Ray Shooting in Simple Polygons

TL;DR: A hierarchical decomposition of a simple polygon is introduced that has logarithmic depth, linear size, and its regions have at most three neighbors and can be answered in O(log2 n) query time and O(n log n) space.
Proceedings ArticleDOI

Segment intersection searching problems in general settings

TL;DR: An efficient data structure for the triangular windowing problem, which is a generalization of triangular range searching, is obtained and the first substantially sub-quadratic algorithm for a red-blue intersection counting problem is derived.
Related Papers (5)