Conference Paper

Cost based planning with RRT in outdoor environments

Center for Robot. & Intell. Machines, Georgia Inst. of Technol., Atlanta, GA
DOI: 10.1109/IROS.2008.4651052 Conference: Intelligent Robots and Systems, 2008. IROS 2008. IEEE/RSJ International Conference on
Source: IEEE Xplore

ABSTRACT The Rapidly Exploring Random Tree (RRT) algorithm can be applied to the robotic path planning problem and performs well in challenging, dynamic domains. Traditional RRT methods use a binary cost function and they select portions of the tree for expansion based on the Euclidean distance to the target. However, in outdoor navigation, the relative cost of terrain can also provide useful input to a planning algorithm that traditional RRT methods cannot take advantage of. We present the Metric Adaptive RRT (MA-RRT), which integrates planning and fast execution for generating paths over a cost map. The MA-RRT algorithm considers underlying cost of a path when calculating the distance function for tree expansion. A heuristic value is also used for determining distance from a point to the target and an adaptive mechanism is employed for adjusting the heuristic on-line. We have implemented our approach in offline simulations and in outdoor robot experiments, and show that the MA-RRT algorithm can improve upon the quality of the path returned when cost is considered. The trade off between cost consideration and runtime performance is also presented.

0 Bookmarks
 · 
120 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The Transition-based RRT (T-RRT) algorithm enables to solve motion planning problems involving configuration spaces over which cost functions are defined, or cost spaces for short. T-RRT has been successfully applied to diverse problems in robotics and structural biology. In this paper, we aim at enhancing T-RRT to solve ever more difficult problems involving larger and more complex cost spaces. We compare several variants of T-RRT by evaluating them on various motion planning problems involving different types of cost functions and different levels of geometrical complexity. First, we explain why applying as such classical extensions of RRT to T-RRT is not helpful, both in a mono-directional and in a bidirectional context. Then, we propose an efficient Bidirectional T-RRT, based on a bidirectional scheme tailored to cost spaces. Finally, we illustrate the new possibilities offered by the Bidirectional T-RRT on an industrial inspection problem.
    IEEE International Conference on Robotics and Automation, ICRA 2013; 05/2013
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Mapping, real-time localization, and path planning are prerequisites for autonomous robot navigation. These functions also facilitate situation awareness of remote operators. In this paper, we propose methods for e�cient 3D mapping and real-time 6D pose tracking of autonomous robots using a continuously rotating 2D laser scanner. We have developed our approach in the context of the DLR SpaceBot Cup robotics challenge. Multi-resolution surfel representations allow for compact maps and e�cient Registration of local maps. Real-time pose tracking is performed by a particle �lter observing individual laser scan lines. Terrain drivability is assessed within a global environment map and used for planning feasible paths. Our approach is evaluated using challenging real environments.
    German Journal on Artificial Intelligence. 04/2014; 28(2):93-99.
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose a cost-aware path planning algorithm for mobile robots. As a robot moves from one location to another, the robot is penalized by the cost at its current location. The overall cost of the robot is determined by the trajectory of the robot over the cost map. The goal of the proposed cost-aware path planning algorithm is to find the trajectory with the minimal cost. The cost map of a field can represent environmental parameters, such as temperature, humidity, chemical concentration, wireless signal strength, and stealthiness. For example, if the cost map represents packet drop rates at different locations, the minimum cost path between two locations is the path with the best possible communication, which is desirable when a robot operates under the environment with weak wireless signals. The proposed cost-aware path planning algorithm extends the rapidly-exploring random tree (RRT) algorithm by applying the cross entropy (CE) method for extending motion segments. We show that the proposed algorithm finds a path which is close to the near-optimal cost path and gives an outstanding performance compared to RRT and CE-based path planning methods through extensive simulation.
    Intelligent Robots and Systems (IROS), 2012 IEEE/RSJ International Conference on; 01/2012