{"payload":{"pageCount":1,"repositories":[{"type":"Public","name":"MPPI-Collision-Avoidance","owner":"PathPlanning","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":4,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-05-04T07:28:13.854Z"}},{"type":"Public","name":"Continuous-CBS","owner":"PathPlanning","isFork":false,"description":"Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.","allTopics":["pathfinding","multi-agent","cbs","mapf","pathplanning","conflict-based-search"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":2,"starsCount":181,"forksCount":50,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-29T21:26:42.026Z"}},{"type":"Public","name":"ORCA-algorithm","owner":"PathPlanning","isFork":false,"description":"Implementation of ORCA algorithm","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":103,"forksCount":17,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-03-27T10:03:58.873Z"}},{"type":"Public","name":"LIAN","owner":"PathPlanning","isFork":false,"description":"Heuristic search algorithm for generating smooth paths for single-shot grid-based 2D path finding. ","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":1,"issueCount":0,"starsCount":3,"forksCount":4,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2024-01-24T10:20:45.417Z"}},{"type":"Public","name":"AMAPF-MF-BS","owner":"PathPlanning","isFork":false,"description":"Algorithm to solve Anonymous Multi Agent Path Finding problem with Maximum Flow reduction and fast Bulk search.","allTopics":[],"primaryLanguage":{"name":"Makefile","color":"#427819"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2023-12-19T13:34:20.667Z"}},{"type":"Public","name":"SIPP-IP","owner":"PathPlanning","isFork":false,"description":"Safe Interval Path Planning with Intervals Projection (SIPP-IP) - a SIPP-based planner capable of handling non-instantaneous accelerations/decelerations of an agent (kinodynamic constraints).","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":10,"forksCount":5,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-12-01T08:06:19.840Z"}},{"type":"Public","name":"Push-and-Rotate--CBS--PrioritizedPlanning","owner":"PathPlanning","isFork":false,"description":"3 algorithms for classical MAPF on 4 connected grid in one project","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":1,"issueCount":0,"starsCount":25,"forksCount":9,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2022-06-30T03:12:03.279Z"}},{"type":"Public","name":"AA-SIPP-m","owner":"PathPlanning","isFork":false,"description":"Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried…","allTopics":["pathfinding","multi-agent","sipp","pathplanning","any-angle","mapf"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":4,"starsCount":96,"forksCount":37,"license":"MIT License","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-12-05T16:11:02.870Z"}},{"type":"Public","name":"SuboptimalSIPP","owner":"PathPlanning","isFork":false,"description":"Implementation of different versions of Safe Interval Path Planning algorithm that can find bounded-suboptimal solutions.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":27,"forksCount":10,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-11-02T09:30:18.997Z"}},{"type":"Public","name":"TO-AA-SIPP","owner":"PathPlanning","isFork":false,"description":"Time-Optimal Any-Angle Safe Interval Path Planning","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":7,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-13T19:10:01.793Z"}},{"type":"Public","name":"AStar-JPS-ThetaStar","owner":"PathPlanning","isFork":false,"description":"Basic algorithms for single-shot grid-based 2D path finding: BFS, Dijkstra, A*, Jump Point Search (JPS), Theta*","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":61,"forksCount":28,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-03-09T16:46:21.953Z"}},{"type":"Public","name":"CBS--PrioritizedPlanning--MP","owner":"PathPlanning","isFork":false,"description":"","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2021-02-09T11:16:47.647Z"}},{"type":"Public","name":"GAN-Path-Finder","owner":"PathPlanning","isFork":false,"description":"Generative Adversarial Networks for Path Planning in 2D","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":20,"forksCount":4,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-12-14T08:13:39.496Z"}},{"type":"Public","name":"ORCAStarROS","owner":"PathPlanning","isFork":false,"description":"Decentralized navigation system based on ORCA and Theta* algorithms and implemented as ROS nodes","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":16,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-07-15T13:22:59.002Z"}},{"type":"Public","name":"3D-AStar-ThetaStar","owner":"PathPlanning","isFork":false,"description":"Basic algorithms for height map based 3D path planning: BFS, Dijkstra, A*, Theta*","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":76,"forksCount":20,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2020-04-20T08:39:15.297Z"}},{"type":"Public","name":"CBS-SIPP","owner":"PathPlanning","isFork":false,"description":"C++ implementation of CBS with using SIPP as a low-level planner","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":8,"forksCount":3,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-11-27T13:21:05.489Z"}},{"type":"Public","name":"ASearchTestUtility","owner":"PathPlanning","isFork":false,"description":"A small utility for testing a performance of path planning algorithms","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-11-02T19:46:30.885Z"}},{"type":"Public","name":"AStar-DCO","owner":"PathPlanning","isFork":false,"description":"Path planning as heuristic search","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-08-23T13:47:08.896Z"}},{"type":"Public","name":"LPLian","owner":"PathPlanning","isFork":false,"description":"Lifelong Planning version of LIAN algorithm","allTopics":["grid-search","dynamic-search","pathplanning","lian"],"primaryLanguage":{"name":"Jupyter Notebook","color":"#DA5B0B"},"pullRequestCount":0,"issueCount":0,"starsCount":3,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-08-23T12:20:44.175Z"}},{"type":"Public","name":"ASearchVisualizer","owner":"PathPlanning","isFork":false,"description":"Program for visualization of detailed logs of path planning algorithms","allTopics":["astar","pathfinding","visualizer","pathplanning"],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":"GNU General Public License v3.0","participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2018-03-02T12:04:24.155Z"}},{"type":"Public","name":"MultiRobotPathFinding-ROS-Gazebo-Demo","owner":"PathPlanning","isFork":false,"description":"Will appear soon.","allTopics":[],"primaryLanguage":{"name":"Python","color":"#3572A5"},"pullRequestCount":0,"issueCount":0,"starsCount":5,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-11-29T10:39:57.428Z"}},{"type":"Public","name":"LIAN-old","owner":"PathPlanning","isFork":false,"description":"Algorithm for planning with turn angle limitation on grid maps.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":1,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-11-23T11:25:27.037Z"}},{"type":"Public","name":"LPAstar","owner":"PathPlanning","isFork":false,"description":"Lifelong Planning A* (LPA*) is a replanning method that is an incremental version of A* algorithm for single-shot grid-based 2D path finding.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":20,"forksCount":5,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-11-02T14:55:45.155Z"}},{"type":"Public","name":"DstarLite","owner":"PathPlanning","isFork":false,"description":"Repository provides an implementation of D*Lite algorithm adapted for single-shot grid-based 2D environment.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":18,"forksCount":6,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-10-26T14:12:05.317Z"}},{"type":"Public","name":"RectsToGridConverter","owner":"PathPlanning","isFork":false,"description":"Converts a set of polygons (defined as a sequences of (x,y) coordinates), placed inside a rectangular workspace, to square grid.","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":1,"starsCount":0,"forksCount":0,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-10-23T14:43:56.563Z"}},{"type":"Public","name":"LPA-Dlite-nw","owner":"PathPlanning","isFork":false,"description":"Implementation of LPA and D*-lite algorithms, used for search in dynamics grid graphs (NON-WORKING)","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":2,"forksCount":1,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-08-17T13:58:39.746Z"}},{"type":"Public","name":"GrB","owner":"PathPlanning","isFork":false,"description":"GridBug + A* path finding ","allTopics":[],"primaryLanguage":{"name":"C++","color":"#f34b7d"},"pullRequestCount":0,"issueCount":0,"starsCount":0,"forksCount":2,"license":null,"participation":null,"lastUpdated":{"hasBeenPushedTo":true,"timestamp":"2017-04-26T11:52:00.780Z"}}],"repositoryCount":27,"userInfo":null,"searchable":true,"definitions":[],"typeFilters":[{"id":"all","text":"All"},{"id":"public","text":"Public"},{"id":"source","text":"Sources"},{"id":"fork","text":"Forks"},{"id":"archived","text":"Archived"},{"id":"template","text":"Templates"}],"compactMode":false},"title":"Repositories"}