Autonomous driving trajectory planning solution for U-Turn scenario

Implementation of Elementary Algorithms (infix-prefix-postfix-evaluation-to-longest-common-increasing-sub-sequence-activity-selection-balance-kd-binary-heap-binomial-tree-breath-depth-first-search-max-flow-shortest-path-topological-sort-calculus-derivative-integration-forward-interpolation-simpson-rule-intersecting-area-non-linear-equation-jacob…

Jump Point Search, public domain, single .h -- OBSOLETE! See tinypile repo for a better version.

Dijkstra's Shortest Path for 6, 18, and 26-Connected 3D (Volumetric) Image Volumes

Highway driving at 50 mph with traffic using A* for path planning.

A route planner using the A* algorithm (uses Open Street Map data)

Based on David Silver's paper "Cooperative Pathfinding"

A* algorithm with dynamic window implemented as move_base plugins for ROS.

C++ General Purpose Goal Oriented Action Planning framework for Unreal Engine

A Hybrid-A* planner with early stopping for efficient path planning and extended motion primitives to account for the motion capabilities of the U-Shift II vehicle. Author: Oliver Schumann

Basic graph algorithms + Qt GUI

C++ Motion Planning Library for 2D Grid Maps

Pathfinder and A* solver (astar or a-star) native extension for Defold Engine build on MicroPather.

A simple graph library with single-agent pathfinding algorithms for research use

An extension of micro mouse on WEBOTS using the flood filled algorithm, A star, Dijkstra’s and Breadth first search algorithm for moving the E-puck robot from start to goal in an NxM sized maze whose map was unknown to the robot (mapping and path planning). Further, leveraged Error Correction for accurate turning and recursive Backtracking algor…

This work proposes an anytime iterative system to concurrently solve the multi-objective path planning problem and determine the visiting order of destinations. The paper has been uploaded to arXiv at https://arxiv.org/abs/2205.14853

Best practices for implementing A* with a focus on four- and eight-connected grid worlds.

This repository contains code for the motion planning project where 3 different algorithms tested in 3 different Gazebo worlds.

A sliding block puzzle, whose solution is found using A* Search.

Solving a brick puzzle with different search algorithms