250 research outputs found
A novel coordination framework for multi-robot systems
Having made great progress tackling the basic problems concerning single-robot systems, many researchers shifted their focus towards the study of multi-robot systems (MRS). MRS were shortly found to be a perfect t for tasks considered to be hard, complex or even impossible for a single robot to perform, e.g. spatially separate tasks. One core research problem of MRS is robots' coordinated motion planning and control. Arti cial potential elds (APFs) and virtual spring-damper bonds are among the most commonly used models to attack the trajectory planning problem of MRS coordination. However, although mathematically sound, these approaches fail to guarantee inter-robot collision-free path generation. This is particularly the case when robots' dynamics, nonholonomic constraints and complex geometry are taken into account. In this thesis, a novel bio-inspired collision avoidance framework via virtual shells is proposed and augmented into the high-level trajectory planner. Safe trajectories can hence be generated for the low-level controllers to track. Motion control is handled by the design of hierarchical controllers which utilize virtual inputs. Several distinct coordinated task scenarios for 2D and 3D environments are presented as a proof of concept. Simulations are conducted with groups of three, four, ve and ten nonholonomic mobile robots as well as groups of three and ve quadrotor UAVs. The performance of the overall improved coordination structure is veri ed with very promising result
Multilevel Motion Planning: A Fiber Bundle Formulation
Motion planning problems involving high-dimensional state spaces can often be
solved significantly faster by using multilevel abstractions. While there are
various ways to formally capture multilevel abstractions, we formulate them in
terms of fiber bundles, which allows us to concisely describe and derive novel
algorithms in terms of bundle restrictions and bundle sections. Fiber bundles
essentially describe lower-dimensional projections of the state space using
local product spaces. Given such a structure and a corresponding admissible
constraint function, we can develop highly efficient and optimal search-based
motion planning methods for high-dimensional state spaces. Our contributions
are the following: We first introduce the terminology of fiber bundles, in
particular the notion of restrictions and sections. Second, we use the notion
of restrictions and sections to develop novel multilevel motion planning
algorithms, which we call QRRT* and QMP*. We show these algorithms to be
probabilistically complete and almost-surely asymptotically optimal. Third, we
develop a novel recursive path section method based on an L1 interpolation over
path restrictions, which we use to quickly find feasible path sections. And
fourth, we evaluate all novel algorithms against all available OMPL algorithms
on benchmarks of eight challenging environments ranging from 21 to 100 degrees
of freedom, including multiple robots and nonholonomic constraints. Our
findings support the efficiency of our novel algorithms and the benefit of
exploiting multilevel abstractions using the terminology of fiber bundles.Comment: Submitted to IJR
Probabilistic motion planning for non-Euclidean and multi-vehicle problems
Trajectory planning tasks for non-holonomic or collaborative systems are
naturally modeled by state spaces with non-Euclidean metrics. However, existing
proofs of convergence for sample-based motion planners only consider the
setting of Euclidean state spaces. We resolve this issue by formulating a
flexible framework and set of assumptions for which the widely-used PRM*, RRT,
and RRT* algorithms remain asymptotically optimal in the non-Euclidean setting.
The framework is compatible with collaborative trajectory planning: given a
fleet of robotic systems that individually satisfy our assumptions, we show
that the corresponding collaborative system again satisfies the assumptions and
therefore has guaranteed convergence for the trajectory-finding methods. Our
joint state space construction builds in a coupling parameter , which interpolates between a preference for minimizing total energy at
one extreme and a preference for minimizing the travel time at the opposite
extreme. We illustrate our theory with trajectory planning for simple coupled
systems, fleets of Reeds-Shepp vehicles, and a highly non-Euclidean fractal
space.Comment: 12 pages, 8 figures. Substantial revision
Dynamic Vehicle Routing for Robotic Systems
Recent years have witnessed great advancements in the science and technology of autonomy, robotics, and networking. This paper surveys recent concepts and algorithms for dynamic vehicle routing (DVR), that is, for the automatic planning of optimal multivehicle routes to perform tasks that are generated over time by an exogenous process. We consider a rich variety of scenarios relevant for robotic applications. We begin by reviewing the basic DVR problem: demands for service arrive at random locations at random times and a vehicle travels to provide on-site service while minimizing the expected wait time of the demands. Next, we treat different multivehicle scenarios based on different models for demands (e.g., demands with different priority levels and impatient demands), vehicles (e.g., motion constraints, communication, and sensing capabilities), and tasks. The performance criterion used in these scenarios is either the expected wait time of the demands or the fraction of demands serviced successfully. In each specific DVR scenario, we adopt a rigorous technical approach that relies upon methods from queueing theory, combinatorial optimization, and stochastic geometry. First, we establish fundamental limits on the achievable performance, including limits on stability and quality of service. Second, we design algorithms, and provide provable guarantees on their performance with respect to the fundamental limits.United States. Air Force Office of Scientific Research (Award FA 8650-07-2-3744)United States. Army Research Office. Multidisciplinary University Research Initiative (Award W911NF-05-1-0219)National Science Foundation (U.S.) (Award ECCS-0705451)National Science Foundation (U.S.) (Award CMMI-0705453)United States. Army Research Office (Award W911NF-11-1-0092
- …