15,289 research outputs found
Reducing the Barrier to Entry of Complex Robotic Software: a MoveIt! Case Study
Developing robot agnostic software frameworks involves synthesizing the
disparate fields of robotic theory and software engineering while
simultaneously accounting for a large variability in hardware designs and
control paradigms. As the capabilities of robotic software frameworks increase,
the setup difficulty and learning curve for new users also increase. If the
entry barriers for configuring and using the software on robots is too high,
even the most powerful of frameworks are useless. A growing need exists in
robotic software engineering to aid users in getting started with, and
customizing, the software framework as necessary for particular robotic
applications. In this paper a case study is presented for the best practices
found for lowering the barrier of entry in the MoveIt! framework, an
open-source tool for mobile manipulation in ROS, that allows users to 1)
quickly get basic motion planning functionality with minimal initial setup, 2)
automate its configuration and optimization, and 3) easily customize its
components. A graphical interface that assists the user in configuring MoveIt!
is the cornerstone of our approach, coupled with the use of an existing
standardized robot model for input, automatically generated robot-specific
configuration files, and a plugin-based architecture for extensibility. These
best practices are summarized into a set of barrier to entry design principles
applicable to other robotic software. The approaches for lowering the entry
barrier are evaluated by usage statistics, a user survey, and compared against
our design objectives for their effectiveness to users
Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons
We consider the following motion-planning problem: we are given unit
discs in a simple polygon with vertices, each at their own start position,
and we want to move the discs to a given set of target positions. Contrary
to the standard (labeled) version of the problem, each disc is allowed to be
moved to any target position, as long as in the end every target position is
occupied. We show that this unlabeled version of the problem can be solved in
time, assuming that the start and target positions are at
least some minimal distance from each other. This is in sharp contrast to the
standard (labeled) and more general multi-robot motion-planning problem for
discs moving in a simple polygon, which is known to be strongly NP-hard
k-Color Multi-Robot Motion Planning
We present a simple and natural extension of the multi-robot motion planning
problem where the robots are partitioned into groups (colors), such that in
each group the robots are interchangeable. Every robot is no longer required to
move to a specific target, but rather to some target placement that is assigned
to its group. We call this problem k-color multi-robot motion planning and
provide a sampling-based algorithm specifically designed for solving it. At the
heart of the algorithm is a novel technique where the k-color problem is
reduced to several discrete multi-robot motion planning problems. These
reductions amplify basic samples into massive collections of free placements
and paths for the robots. We demonstrate the performance of the algorithm by an
implementation for the case of disc robots and polygonal robots translating in
the plane. We show that the algorithm successfully and efficiently copes with a
variety of challenging scenarios, involving many robots, while a simplified
version of this algorithm, that can be viewed as an extension of a prevalent
sampling-based algorithm for the k-color case, fails even on simple scenarios.
Interestingly, our algorithm outperforms a well established implementation of
PRM for the standard multi-robot problem, in which each robot has a distinct
color.Comment: 2
- …