Within the last year
Within the past 3 years
1 - 8 of 8 articles
Despite the significant advances in path planning methods, highly constrained problems are still challenging. In some situations, the presence of constraints defines a configuration space that is a non-parametrizable manifold embedded in a high-dimensional ambient space. In these cases, the use...
We present a novel data structure, the Bayes tree, that provides an algorithmic foundation enabling a better understanding of existing graphical model inference algorithms and their connection to sparse matrix factorization methods. Similar to a clique tree, a Bayes tree encodes a factored...
This paper introduces a principle to guide the design of finger form: invariance of contact geometry over some continuum of varying shape and/or pose of the grasped object in the plane. Specific applications of this principle include scale-invariant and pose-invariant grasps. Under specific...
Many problems in robot motion planning involve collision testing a set of local paths. In this paper we propose a novel solution to this problem by exploiting the structure of paths and the outcome of previous collision tests. Our approach circumvents expensive collision tests on a given path by...
We consider the problem of autonomous robotic laundry folding, and propose a solution to the perception and manipulation challenges inherent to the task. At the core of our approach is a quasi-static cloth model which allows us to neglect the complex dynamics of cloth under significant parts of...
When multiple robots operate in the same environment, it is desirable for scalability purposes to coordinate their motion in a distributed fashion while providing guarantees about their safety. If the robots have to respect second-order dynamics, this becomes a challenging problem, even for...
In this paper we develop an algorithmic framework allowing for fast and elegant path correction exploiting Lie group symmetries and operating without the need for explicit control strategies such as cross-track regulation. These systems occur across the gamut of robotics, notably in locomotion,...
We present parallel algorithms to accelerate collision queries for sample-based motion planning. Our approach is designed for current many-core GPUs and exploits data-parallelism and multi-threaded capabilities. In order to take advantage of the high number of cores, we present a clustering...
Read and print from thousands of top scholarly journals.
Sign up with Facebook
Sign up with Google
Already have an account? Log in
Save this article to read later. You can see your Read Later on your DeepDyve homepage.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.