https://github.com/addy1997/fast_rrt-ros

RRT-ROS implementation.
https://github.com/addy1997/fast_rrt-ros

motion-planning ros-kinetic rrt

Last synced: 6 months ago
JSON representation

RRT-ROS implementation.

• Host: GitHub
• URL: https://github.com/addy1997/fast_rrt-ros
• Owner: addy1997
• License: mit
• Archived: true
• Created: 2020-02-22T11:53:02.000Z (over 5 years ago)
• Default Branch: master
• Last Pushed: 2022-06-27T18:14:56.000Z (over 3 years ago)
• Last Synced: 2025-03-29T20:44:38.491Z (6 months ago)
• Topics: motion-planning, ros-kinetic, rrt
• Language: C++
• Homepage:
• Size: 10.7 MB
• Stars: 19
• Watchers: 0
• Forks: 2
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

          
### RRT implementation in Rviz

[![Software License](https://img.shields.io/badge/license-MIT-brightgreen.svg)](LICENSE) [![Safety](https://img.shields.io/badge/safety-secure-brightgreen.svg)](https://app.gitguardian.com) [![Stars](https://img.shields.io/github/stars/addy1997/Kinodynamic-Fast_RRT-ROS.svg?style=flat&label=Star&maxAge=86400)](STARS)

[![Contributions](https://img.shields.io/github/commit-activity/m/addy1997/Kinodynamic-Fast_RRT-ROS.svg?color=%09%2346c018)](https://github.com/addy1997/Kinodynamic-Fast_RRT-ROS/graphs/commit-activity) [![Lines Of Code](https://tokei.rs/b1/github/addy1997/Kinodynamic-Fast_RRT-ROS?category=code)](https://github.com/addy1997/Kinodynamic-Fast_RRT-ROS) [![Total alerts](https://img.shields.io/lgtm/alerts/g/addy1997/Kinodynamic-Fast_RRT-ROS.svg?logo=lgtm&logoWidth=18)](https://lgtm.com/projects/g/addy1997/Kinodynamic-Fast_RRT-ROS/alerts/) [![Code](https://img.shields.io/badge/code%20style-black-000000.svg)](https://github.com/ambv/black) [![Build Status](https://travis-ci.com/addy1997/Kinodynamic-Fast_RRT-ROS.svg?branch=master)](https://travis-ci.com/addy1997/Kinodynamic-Fast_RRT-ROS)

 

  

In this project, we implemented RRT with holonomic constraints in 3D environment using Rviz. 

RRT is a sampling based motion planning algorithm in which tree sprouts randomly in all the possible directions from a start node given by the user and grows continuously until it reaches the goal node. 




### Results

  RRT in action  


### Documentation

after cloning the repository into your system.

Go into the docs->build->html->index.html