In this paper, we describe trajectory planning and state estimation algorithms for aggressive flight of micro aerial vehicles in known, obstacle-dense environments. Finding aggressive but dynamically feasible and coll...
详细信息
In this paper, we describe trajectory planning and state estimation algorithms for aggressive flight of micro aerial vehicles in known, obstacle-dense environments. Finding aggressive but dynamically feasible and collision-free trajectories in cluttered environments requires trajectory optimization and state estimation in the full state space of the vehicle, which is usually computationally infeasible on realistic timescales for real vehicles and sensors. We first build on previous work of van Nieuwstadt and Murray and Mellinger and Kumar, to show how a search process can be coupled with optimization in the output space of a differentially flat vehicle model to find aggressive trajectories that utilize the full maneuvering capabilities of a quadrotor. We further extend this work to vehicles with complex, Dubins-type dynamics and present a novel trajectory representation called a Dubins-Polynomial trajectory, which allows us to optimize trajectories for fixed-wing vehicles. To provide accurate state estimation for aggressive flight, we show how the Gaussian particle filter can be extended to allow laser rangefinder localization to be combined with a Kalman filter. This formulation allows similar estimation accuracy to particle filtering in the full vehicle state but with an order of magnitude more efficiency. We conclude with experiments demonstrating the execution of quadrotor and fixed-wing trajectories in cluttered environments. We show results of aggressive flight at speeds of up to 8m/s for the quadrotor and 11m/s for the fixed-wing aircraft.
We introduce a new geometric robot-routing problem which arises in data-muling applications where a mobile robot is charged with collecting data from stationary sensors. The objective is to compute the robot's tra...
详细信息
We introduce a new geometric robot-routing problem which arises in data-muling applications where a mobile robot is charged with collecting data from stationary sensors. The objective is to compute the robot's trajectory and download sequence so as to minimize the time to collect data from all of the sensors. The total data collection time has two components: the robot's travel time and the download time. The time to download data from a sensor s is a function of the location of the robot and s: if the robot is a distance r(in) away from s, it can download the sensor's data in T-in units of time. If the distance is greater than r(in) but less than r(out), the download time is T-out > T-in. Otherwise, the robot can not download the data from s. Here, r(in), r(out), T-in and T-out are input parameters. We refer to this model, which is based on recently developed experimental models for sensor network deployments, as the two-ring model, and the problem of downloading data from a given set of sensors in minimum amount of time under this model as the two-ring tour (TRT) problem. We present approximation algorithms for the general case which uses solutions to the traveling salesperson with neighborhoods (TSPN) Problem as subroutines. We also present efficient solutions to special, but practically important versions of the problem such as grid-based and sparse deployments. The approach is validated in outdoor experiments.
Multi-robot coverage and exploration are fundamental problems in robotics. A widely used, efficient and distributable algorithm for achieving coverage of a convex environment with Euclidean metrics is that proposed by...
详细信息
Multi-robot coverage and exploration are fundamental problems in robotics. A widely used, efficient and distributable algorithm for achieving coverage of a convex environment with Euclidean metrics is that proposed by Cortes which is based on the discrete-time Lloyd's algorithm. This algorithm is not directly applicable to general Riemannian manifolds with boundaries that are non-convex and are intrinsically non-Euclidean. In this paper we generalize the control law based on minimization of the coverage functional to such non-Euclidean spaces punctured by obstacles. We also propose a practical discrete implementation based on standard graph search-based algorithms. We demonstrate the applicability of the proposed algorithm by solving efficient coverage problems on a sphere and a torus with obstacles, and exploration problems in non-convex indoor environments.
In recent years, sonar systems for surface and underwater vehicles have increased in resolution and become significantly less expensive. As such, these systems are viable at a wide range of price points and are approp...
详细信息
In recent years, sonar systems for surface and underwater vehicles have increased in resolution and become significantly less expensive. As such, these systems are viable at a wide range of price points and are appropriate for a broad set of applications on surface and underwater vehicles. However, to take full advantage of these high-resolution sensors for seafloor mapping tasks an adequate navigation solution is also required. In GPS-denied environments this usually necessitates a simultaneous localization and mapping (slam) technique to maintain good accuracy with minimal error accumulation. Acoustic positioning systems such as ultra short baseline (USBL) and long baseline (LBL) are sometimes deployed to provide additional bounds on the navigation solution, but the positional uncertainty of these systems is often much greater than the resolution of modern multibeam or interferometric side scan sonars. As such, subsurface vehicles often lack the means to adequately ground-truth navigation solutions and the resulting bathymetic maps. In this article, we present a dataset with four separate surveys designed to test bathymetric slam algorithms using two modern sonars, typical underwater vehicle navigation sensors, and high-precision (2 cm horizontal, 10 cm vertical) real-time kinematic (RTK) GPS ground truth. In addition, these data can be used to refine and improve other aspects of multibeam sonar mapping such as ray-tracing, gridding techniques, and time-varying attitude corrections.
This paper introduces a dataset gathered entirely in urban scenarios with a car equipped with one stereo camera and five laser scanners, among other sensors. One distinctive feature of the present dataset is the exist...
详细信息
This paper introduces a dataset gathered entirely in urban scenarios with a car equipped with one stereo camera and five laser scanners, among other sensors. One distinctive feature of the present dataset is the existence of high-resolution stereo images grabbed at a high rate (20 fps) during a 36.8 km trajectory, which allows the benchmarking of a variety of computer vision techniques. We describe the sensors employed and highlight some applications which could be benchmarked using the present work. Both plain text and binary files are provided, as well as open-source tools for working with the binary versions. The dataset is available for download at http://***/MalagaUrbanDataset.
Robot localization systems typically assume that the environment is static, ignoring the dynamics inherent in most real-world settings. Corresponding scenarios include households, offices, warehouses and parking lots,...
详细信息
Robot localization systems typically assume that the environment is static, ignoring the dynamics inherent in most real-world settings. Corresponding scenarios include households, offices, warehouses and parking lots, where the location of certain objects such as goods, furniture or cars can change over time. These changes typically lead to inconsistent observations with respect to previously learned maps and thus decrease the localization accuracy or even prevent the robot from globally localizing itself. In this paper we present a sound probabilistic approach to lifelong localization in changing environments using a combination of a Rao-Blackwellized particle filter with a hidden Markov model. By exploiting several properties of this model, we obtain a highly efficient map management approach for dynamic environments, which makes it feasible to run our algorithm online. Extensive experiments with a real robot in a dynamically changing environment demonstrate that our algorithm reliably adapts to changes in the environment and also outperforms the popular Monte-Carlo localization approach.
In this paper we describe a data set collected by an autonomous ground vehicle testbed, based upon a modified Ford F-250 pickup truck. The vehicle is outfitted with a professional (Applanix POS-LV) and consumer (Xsens...
详细信息
In this paper we describe a data set collected by an autonomous ground vehicle testbed, based upon a modified Ford F-250 pickup truck. The vehicle is outfitted with a professional (Applanix POS-LV) and consumer (Xsens MTi-G) inertial measurement unit, a Velodyne three-dimensional lidar scanner, two push-broom forward-looking Riegl lidars, and a Point Grey Ladybug3 omnidirectional camera system. Here we present the time-registered data from these sensors mounted on the vehicle, collected while driving the vehicle around the Ford Research Campus and downtown Dearborn, MI, during November-December 2009. The vehicle path trajectory in these data sets contains several large-and small-scale loop closures, which should be useful for testing various state-of-the-art computer vision and simultaneous localization and mapping algorithms.
This paper reports on a fast multiresolution scan matcher for local vehicle localization of self-driving cars. State-of-theart approaches to vehicle localization rely on observing road surface reflectivity with a 3D l...
详细信息
This paper reports on a fast multiresolution scan matcher for local vehicle localization of self-driving cars. State-of-theart approaches to vehicle localization rely on observing road surface reflectivity with a 3D light detection and ranging (LIDAR) scanner to achieve centimeter-level accuracy. However, these approaches can often fail when faced with adverse weather conditions that obscure the view of the road paint (e.g. puddles and snowdrifts), poor road surface texture, or when road appearance degrades over time. We present a generic probabilistic method for localizing an autonomous vehicle equipped with a three-dimensional (3D) LIDAR scanner. This proposed algorithm models the world as a mixture of several Gaussians, characterizing the z-height and reflectivity distribution of the environment-which we rasterize to facilitate fast and exact multiresolution inference. Results are shown on a collection of datasets totaling over 500 km of road data covering highway, rural, residential, and urban roadways, in which we demonstrate our method to be robust through heavy snowfall and roadway repavements.
Inspection of ship hulls and marine structures using autonomous underwater vehicles has emerged as a unique and challenging application of robotics. The problem poses rich questions in physical design and operation, p...
详细信息
Inspection of ship hulls and marine structures using autonomous underwater vehicles has emerged as a unique and challenging application of robotics. The problem poses rich questions in physical design and operation, perception and navigation, and planning, driven by difficulties arising from the acoustic environment, poor water quality and the highly complex structures to be inspected. In this paper, we develop and apply algorithms for the central navigation and planning problems on ship hulls. These divide into two classes, suitable for the open, forward parts of a typical monohull, and for the complex areas around the shafting, propellers and rudders. On the open hull, we have integrated acoustic and visual mapping processes to achieve closed-loop control relative to features such as weld-lines and biofouling. In the complex area, we implemented new large-scale planning routines so as to achieve full imaging coverage of all the structures, at a high resolution. We demonstrate our approaches in recent operations on naval ships.
The problem of quantifying robot localization safety in the presence of undetected sensor faults is critical when preparing for future applications where robots may interact with humans in life-critical situations;how...
详细信息
The problem of quantifying robot localization safety in the presence of undetected sensor faults is critical when preparing for future applications where robots may interact with humans in life-critical situations;however, the topic is only sparsely addressed in the robotics literature. In response, this work leverages prior work in aviation integrity monitoring to tackle the more challenging case of evaluating localization safety in Global Navigation Satellite System (GNSS)-denied environments. Localization integrity risk is the probability that a robot's pose estimate lies outside pre-defined acceptable limits while no alarm is triggered. In this article, the integrity risk (i.e., localization safety) is rigorously upper bounded by accounting for both nominal sensor noise and other non-nominal sensor faults. An extended Kalman filter is employed to estimate the robot state, and a sequence of innovations is used for fault detection. The novelty of the work includes (1) the use of a time window to limit the number of monitored fault hypotheses while still guaranteeing safety with respect to previously occurring faults and (2) a new method to account for faults in the data association process.
暂无评论