Skip to content

Latest commit

 

History

History
109 lines (57 loc) · 3.58 KB

Algorithms.md

File metadata and controls

109 lines (57 loc) · 3.58 KB

Planning Algorithms

  1. Path Planning with Orientation-Aware Space Exploration Guided Heuristic Search for Autonomous Parking and Maneuvering
    Link : http://www.i6.in.tum.de/Main/Publications/ChenChao2015a.pdf

  2. Implementation of the Pure Pursuit Path Tracking Algorithm
    Link :

  3. Grassfire
    Link :

  4. Djkistra's algorithm
    Link :

  5. PRM - Probabilistic Road Map Path Planning
    Link :

  6. A* Algorthm
    Link :

  7. RRT : Rapidly Exploring Random Tree
    Link :

  8. Combined Search Graph - Tianyu gu
    Link : https://www.researchgate.net/profile/Tianyu_Gu4/publication/315067229_Improved_Trajectory_Planning_for_On-Road_Self-Driving_Vehicles_Via_Combined_Graph_Search_Optimization_Topology_Analysis/links/58c95c5caca2721e667bc799/Improved-Trajectory-Planning-for-On-Road-Self-Driving-Vehicles-Via-Combined-Graph-Search-Optimization-Topology-Analysis.pdf

  9. EM Planner
    Link :

  10. Lattice Planner
    Link :

From Python Robotics Github

  1. Dynamic Window Approach
    Link : https://www.ri.cmu.edu/pub_files/pub1/fox_dieter_1997_1/fox_dieter_1997_1.pdf

  2. Grid Based Search

    a. Dijkstra algorithm
    Link :

    b. A* algorithm
    Link :

    c. Potential Field algorithm
    Link : https://www.cs.cmu.edu/~motionplanning/lecture/Chap4-Potential-Field_howie.pdf

  3. Model Predictive Trajectory Generation
    Link : https://journals.sagepub.com/doi/pdf/10.1177/0278364906075328

    a. Path Optimization Sample

    b. Lookup table generation sample

  4. State Lattice Planning
    Link : https://journals.sagepub.com/doi/pdf/10.1177/0278364906075328
    www.frc.ri.cmu.edu/~alonzo/pubs/papers/JFR_08_SS_Sampling.pdf

    a. Uniform ploar sampling

    b. Biased polar sampling

    c. Lane sampling

  5. Probabilistic Road Map Planning (PRM)

  6. Voronoi Road Map Planning
    https://www.cs.cmu.edu/~motionplanning/lecture/Chap5-RoadMap-Methods_howie.pdf

  7. Rapidly Exploring Random Trees (RRT)

    a. Basic RRT

    b. RRT*
    Link : https://arxiv.org/pdf/1105.1186.pdf
    https://arxiv.org/abs/1005.0416

    c. RRT with dubins path

    d. RRT* with dubins path

    e. RRT* with reeds-sheep path
    Link :

    f. Informed RRT*
    Link : https://arxiv.org/pdf/1404.2334.pdf

    g. Batch informed RRT*
    Link : https://arxiv.org/abs/1405.5848

    h. Closed loop RRT*
    Link : http://acl.mit.edu/papers/KuwataGNC08.pdf
    http://acl.mit.edu/papers/KuwataTCST09.pdf
    https://arxiv.org/abs/1601.06326

    i. LQR-RRT*
    Link : http://lis.csail.mit.edu/pubs/perez-icra12.pdf
    https://github.com/MahanFathi/LQR-RRTstar

  8. Cubic spline planning

  9. B-spline planning
    Link :

  10. Eta^3 Spline path planning
    Link : https://ieeexplore.ieee.org/document/4339545/

  11. Bezier path planning
    Link : citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.294.6438&rep=rep1&type=pdf

  12. Quintic polynomials planning
    Link : ieeexplore.ieee.org/document/637936/

  13. Dubins path planning

  14. Reeds-Shepp planning
    Link : http://planning.cs.uiuc.edu/node822.html
    https://pdfs.semanticscholar.org/932e/c495b1d0018fd59dee12a0bf74434fac7af4.pdf
    https://github.com/ghliu/pyReedsShepp

  15. LQR based path planning

  16. Optimal Trajectory in Frenet Frame
    Link : https://www.researchgate.net/publication/224156269_Optimal_Trajectory_Generation_for_Dynamic_Street_Scenarios_in_a_Frenet_Frame

Prediction Algorithms