ft-fsd-path-planning

ft-fsd-path-planning

papalotis

Formula Student Driverless Path Planning Algorithm. Colorblind centerline calculation algorithm developed by FaSTTUBe. It introduces a novel approach that uses neither Delaunay Triangulation nor RRT.

algorithm
View on GitHub
101 Stars
22 Forks
101 Watchers
Python Language
mit License
100 SrcLog Score
Cost to Build
$445.6K
Market Value
$1.13M
How is this calculated?

Growth over time

3 data points  ·  2025-07-14 → 2026-04-19
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about ft-fsd-path-planning

Question copied to clipboard

What is the papalotis/ft-fsd-path-planning GitHub project? Description: "Formula Student Driverless Path Planning Algorithm. Colorblind centerline calculation algorithm developed by FaSTTUBe. It introduces a novel approach that uses neither Delaunay Triangulation nor RRT.". Written in Python. Explain what it does, its main use cases, key features, and who would benefit from using it.

Question is copied to clipboard — paste it after the AI opens.

How to clone ft-fsd-path-planning

Clone via HTTPS

git clone https://github.com/papalotis/ft-fsd-path-planning.git

Clone via SSH

[email protected]:papalotis/ft-fsd-path-planning.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the ft-fsd-path-planning issue tracker:

Open GitHub Issues

Similar to ft-fsd-path-planning

javascript-algorithms CS-Notes interviews tech-interview-handbook interactive-coding-challenges algorithms algorithm-visualizer cosmos WaveFunctionCollapse JCSprout Python LeetCode javascript-algorithms awesome-java-leetcode turf awesome-competitive-programming AlgoWiki algorithms Learn-Algorithms PythonRobotics illustrated-algorithms machine_learning_basics EKAlgorithms algorithms_and_data_structures java-algorithms-implementation LeetCode-Swift leet-code ngraph.path C-Sharp-Algorithms Lean