MRRT: Multiple Rapidly-Exploring Random Trees for Fast Online Replanning in Dynamic Environments

by   Zongyuan Shen, et al.

This paper presents a novel algorithm, called MRRT, which uses multiple rapidly-exploring random trees for fast online replanning of autonomous vehicles in dynamic environments with moving obstacles. The proposed algorithm is built upon the RRT algorithm with a multi-tree structure. At the beginning, the RRT algorithm is applied to find the initial solution based on partial knowledge of the environment. Then, the robot starts to execute this path. At each iteration, the new obstacle configurations are collected by the robot's sensor and used to replan the path. This new information can come from unknown static obstacles (e.g., seafloor layout) as well as moving obstacles. Then, to accommodate the environmental changes, two procedures are adopted: 1) edge pruning, and 2) tree regrowing. Specifically, the edge pruning procedure checks the collision status through the tree and only removes the invalid edges while maintaining the tree structure of already-explored regions. Due to removal of invalid edges, the tree could be broken into multiple disjoint trees. As such, the RRT algorithm is applied to regrow the trees. Specifically, a sample is created randomly and joined to all the disjoint trees in its local neighborhood by connecting to the nearest nodes. Finally, a new solution is found for the robot. The advantages of the proposed MRRT algorithm are as follows: i) retains the maximal tree structure by only pruning the edges which collide with the obstacles, ii) guarantees probabilistic completeness, and iii) is computational efficient for fast replanning since all disjoint trees are maintained for future connections and expanded simultaneously.


page 1

page 2


SMART: Self-Morphing Anytime Replanning Tree

The paper presents an algorithm, called Self- Morphing Anytime Replannin...

SMARRT: Self-Repairing Motion-Reactive Anytime RRT for Dynamic Environments

This paper addresses the fast replanning problem in dynamic environments...

Two-Step Online Trajectory Planning of a Quadcopter in Indoor Environments with Obstacles

This paper presents a two-step algorithm for online trajectory planning ...

Single-Agent On-line Path Planning in Continuous, Unpredictable and Highly Dynamic Environments

This document is a thesis on the subject of single-agent on-line path pl...

Multi-Risk-RRT: An Efficient Motion Planning Algorithm for Robotic Autonomous Luggage Trolley Collection at Airports

Robots have become increasingly prevalent in dynamic and crowded environ...

Information-driven Path Planning for Hybrid Aerial Underwater Vehicles

This paper presents a novel Rapidly-exploring Adaptive Sampling Tree (RA...

Probabilistic Analysis of RRT Trees

This thesis presents analysis of the properties and run-time of the Rapi...

Please sign up or login with your details

Forgot password? Click here to reset