4,910 research outputs found
Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning
We present a sampling-based framework for multi-robot motion planning which
combines an implicit representation of a roadmap with a novel approach for
pathfinding in geometrically embedded graphs tailored for our setting. Our
pathfinding algorithm, discrete-RRT (dRRT), is an adaptation of the celebrated
RRT algorithm for the discrete case of a graph, and it enables a rapid
exploration of the high-dimensional configuration space by carefully walking
through an implicit representation of a tensor product of roadmaps for the
individual robots. We demonstrate our approach experimentally on scenarios of
up to 60 degrees of freedom where our algorithm is faster by a factor of at
least ten when compared to existing algorithms that we are aware of.Comment: Kiril Solovey and Oren Salzman contributed equally to this pape
Human-Machine Interface for Remote Training of Robot Tasks
Regardless of their industrial or research application, the streamlining of
robot operations is limited by the proximity of experienced users to the actual
hardware. Be it massive open online robotics courses, crowd-sourcing of robot
task training, or remote research on massive robot farms for machine learning,
the need to create an apt remote Human-Machine Interface is quite prevalent.
The paper at hand proposes a novel solution to the programming/training of
remote robots employing an intuitive and accurate user-interface which offers
all the benefits of working with real robots without imposing delays and
inefficiency. The system includes: a vision-based 3D hand detection and gesture
recognition subsystem, a simulated digital twin of a robot as visual feedback,
and the "remote" robot learning/executing trajectories using dynamic motion
primitives. Our results indicate that the system is a promising solution to the
problem of remote training of robot tasks.Comment: Accepted in IEEE International Conference on Imaging Systems and
Techniques - IST201
Hypergraph-based Multi-robot Motion Planning with Topological Guidance
We present a multi-robot motion planning algorithm that efficiently finds
paths for robot teams up to ten times larger than existing methods in congested
settings with narrow passages in the environment. Narrow passages represent a
source of difficulty for sampling-based motion planning algorithms. This
problem is exacerbated for multi-robot systems where the planner must also
avoid inter-robot collisions within these congested spaces, requiring
coordination. Topological guidance, which leverages information about the
robot's environment, has been shown to improve performance for mobile robot
motion planning in single robot scenarios with narrow passages. Additionally,
our prior work has explored using topological guidance in multi-robot settings
where a high degree of coordination is required of the full robot group. This
high level of coordination, however, is not always necessary and results in
excessive computational overhead for large groups. Here, we propose a novel
multi-robot motion planning method that leverages topological guidance to
inform the planner when coordination between robots is necessary, leading to a
significant improvement in scalability.Comment: This work has been submitted for revie
On the Power of Manifold Samples in Exploring Configuration Spaces and the Dimensionality of Narrow Passages
We extend our study of Motion Planning via Manifold Samples (MMS), a general
algorithmic framework that combines geometric methods for the exact and
complete analysis of low-dimensional configuration spaces with sampling-based
approaches that are appropriate for higher dimensions. The framework explores
the configuration space by taking samples that are entire low-dimensional
manifolds of the configuration space capturing its connectivity much better
than isolated point samples. The contributions of this paper are as follows:
(i) We present a recursive application of MMS in a six-dimensional
configuration space, enabling the coordination of two polygonal robots
translating and rotating amidst polygonal obstacles. In the adduced experiments
for the more demanding test cases MMS clearly outperforms PRM, with over
20-fold speedup in a coordination-tight setting. (ii) A probabilistic
completeness proof for the most prevalent case, namely MMS with samples that
are affine subspaces. (iii) A closer examination of the test cases reveals that
MMS has, in comparison to standard sampling-based algorithms, a significant
advantage in scenarios containing high-dimensional narrow passages. This
provokes a novel characterization of narrow passages which attempts to capture
their dimensionality, an attribute that had been (to a large extent) unattended
in previous definitions.Comment: 20 page
- …