{"id":13463664,"url":"https://github.com/BaselAriqat/RRTM","last_synced_at":"2025-03-25T09:30:58.620Z","repository":{"id":217419651,"uuid":"64029479","full_name":"BaselAriqat/RRTM","owner":"BaselAriqat","description":"Rapidly exploring random trees simulator (school project)","archived":false,"fork":false,"pushed_at":"2016-07-29T18:28:51.000Z","size":126,"stargazers_count":2,"open_issues_count":1,"forks_count":1,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-10-29T16:19:22.570Z","etag":null,"topics":["motion-planning","rrt","simulator"],"latest_commit_sha":null,"homepage":"","language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/BaselAriqat.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2016-07-23T18:18:26.000Z","updated_at":"2022-10-17T13:37:23.000Z","dependencies_parsed_at":null,"dependency_job_id":"53cd9ef4-0eae-4731-b5eb-5aa664834ee6","html_url":"https://github.com/BaselAriqat/RRTM","commit_stats":null,"previous_names":["baselariqat/rrtm"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaselAriqat%2FRRTM","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaselAriqat%2FRRTM/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaselAriqat%2FRRTM/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/BaselAriqat%2FRRTM/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/BaselAriqat","download_url":"https://codeload.github.com/BaselAriqat/RRTM/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245435066,"owners_count":20614822,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["motion-planning","rrt","simulator"],"created_at":"2024-07-31T14:00:25.945Z","updated_at":"2025-03-25T09:30:58.608Z","avatar_url":"https://github.com/BaselAriqat.png","language":"C#","funding_links":[],"categories":["C#"],"sub_categories":[],"readme":"# RRT\nRRTM is a program written in C# that simulates the classic RRT ( Rapidly Exploring Random Trees ) and its variation RRTConnect (or RRTExtend), in a workspace that the user can change and modify.\n\n#### This project provides:\n\n* two motion planning algorithms:\n  1. RRT.\n  2. RRTConnect.\n\n\n* Two nearest neighbor search algorithms:\n  1. Linear nearest neighbor.\n  2. KDTree nearest neighbor.\n\n\n* Two robot configurations:\n  1. ‘Point’ Robot (2 dimensional robot) consist of (x, y).\n  2. ‘Stick’ Robot (3 dimensional robot) consist of (x, y, θ).\n\n  \n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FBaselAriqat%2FRRTM","html_url":"https://awesome.ecosyste.ms/projects/github.com%2FBaselAriqat%2FRRTM","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2FBaselAriqat%2FRRTM/lists"}