Publication details
Collided path replanning in dynamic environments using RRT and Cell decomposition algorithms
| Authors | |
|---|---|
| Year of publication | 2015 |
| Type | Article in Proceedings |
| Conference | Modelling and Simulation for Autonomous Systems, |
| MU Faculty or unit | |
| Citation | |
| Web | http://dx.doi.org/10.1007/978-3-319-22383-4_9 |
| Doi | http://dx.doi.org/10.1007/978-3-319-22383-4_9 |
| Field | Informatics |
| Keywords | path re-planning; motion planning; RRT; cell decomposition; Multi RRT |
| Attached files | |
| Description | The motion planning is an important part of robots’ models. It is responsible for robot’s movements. In this work, the cell decomposition algorithm is used to find a spatial path on preliminary static workspaces, and then, the rapidly exploring random tree algorithm (RRT) is used to validate this path on the actual workspace. Two methods have been proposed to enhance the omnidirectional robot’s navigation on partially changed workspace. First, the planner creates a RRT tree and biases its growth toward the path’s points in ordered form. The planner reduces the probability of choosing the next point when a collision is detected, which in turn increases the RRT’s expansion on the free space. The second method uses a straight planner to connect path’s points. If a collision is detected, the planner places RRTs on both sides of the collided segment. The proposed methods are compared with the others approaches, and the simulation shows better results in term of efficiency and completeness. |