AtsushiSakai/PythonRobotics — a UI/UX project — sits at 30.6k GitHub stars in the UI / UX space. Python sample codes and textbook for robotics algorithms.
Snapshot summary built from the project's own GitHub metadata — there's no written TopGit review yet. The page will update automatically when a full review is published.
WHY NO REVIEW YET
TopGit writes full reviews for the most-starred, most-requested repositories. This page is a snapshot until then — see the READ ME tab for the original README in full.
This is a sensor fusion localization with Particle Filter(PF).
The blue line is true trajectory, the black line is dead reckoning trajectory,
and the red line is an estimated trajectory with PF.
It is assumed that the robot can measure a distance from landmarks (RFID).
These measurements are used for PF localization.
Reference
PROBABILISTIC ROBOTICS
Histogram filter localization
This is a 2D localization example with Histogram filter.
The red cross is true position, black points are RFID positions.
The blue grid shows a position probability of histogram filter.
In this simulation, x,y are unknown, yaw is known.
The filter integrates speed input and range observations from RFID for localization.
Initial position is not needed.
Reference
PROBABILISTIC ROBOTICS
Mapping
Gaussian grid map
This is a 2D Gaussian grid mapping example.
Ray casting grid map
This is a 2D ray casting grid mapping example.
Lidar to grid map
This example shows how to convert a 2D range measurement to a grid map.
k-means object clustering
This is a 2D object clustering with k-means algorithm.
Rectangle fitting
This is a 2D rectangle fitting for vehicle detection.
SLAM
Simultaneous Localization and Mapping(SLAM) examples
Iterative Closest Point (ICP) Matching
This is a 2D ICP matching example with singular value decomposition.
It can calculate a rotation matrix, and a translation vector between points and points.
Reference
Introduction to Mobile Robotics: Iterative Closest Point Algorithm
FastSLAM 1.0
This is a feature based SLAM example using FastSLAM 1.0.
The blue line is ground truth, the black line is dead reckoning, the red line is the estimated trajectory with FastSLAM.
The red points are particles of FastSLAM.
Black points are landmarks, blue crosses are estimated landmark positions by FastSLAM.
Reference
PROBABILISTIC ROBOTICS
SLAM simulations by Tim Bailey
Path Planning
Dynamic Window Approach
This is a 2D navigation sample code with Dynamic Window Approach.
The Dynamic Window Approach to Collision Avoidance
Grid based search
Dijkstra algorithm
This is a 2D grid based the shortest path planning with Dijkstra's algorithm.
In the animation, cyan points are searched nodes.
A* algorithm
This is a 2D grid based the shortest path planning with A star algorithm.
In the animation, cyan points are searched nodes.
Its heuristic is 2D Euclid distance.
D* algorithm
This is a 2D grid based the shortest path planning with D star algorithm.
The animation shows a robot finding its path avoiding an obstacle using the D* search algorithm.
Reference
D* Algorithm Wikipedia
D* Lite algorithm
This algorithm finds the shortest path between two points while rerouting when obstacles are discovered. It has been implemented here for a 2D grid.
The animation shows a robot finding its path and rerouting to avoid obstacles as they are discovered using the D* Lite search algorithm.
Refs:
D* Lite
Improved Fast Replanning for Robot Navigation in Unknown Terrain
Potential Field algorithm
This is a 2D grid based path planning with Potential Field algorithm.
In the animation, the blue heat map shows potential value on each grid.
Reference
Robotic Motion Planning:Potential Functions
Grid based coverage path planning
This is a 2D grid based coverage path planning simulation.
Particle Swarm Optimization (PSO)
This is a 2D path planning simulation using the Particle Swarm Optimization algorithm.
PSO is a metaheuristic optimization algorithm inspired by bird flocking behavior. In path planning, particles explore the search space to find collision-free paths while avoiding obstacles.
The animation shows particles (blue dots) converging towards the optimal path (yellow line) from start (green area) to goal (red star).
References
Particle swarm optimization - Wikipedia
Kennedy, J.; Eberhart, R. (1995). "Particle Swarm Optimization"
State Lattice Planning
This script is a path planning code with state lattice planning.
This code uses the model predictive trajectory generator to solve boundary problem.
Reference
Optimal rough terrain trajectory generation for wheeled mobile robots
State Space Sampling of Feasible Motions for High-Performance Mobile Robot Navigation in Complex Environments
Biased polar sampling
Lane sampling
Probabilistic Road-Map (PRM) planning
This PRM planner uses Dijkstra method for graph search.
In the animation, blue points are sampled points,
Cyan crosses means searched points with Dijkstra method,
The red line is the final path of PRM.
Reference
Probabilistic roadmap - Wikipedia
Rapidly-Exploring Random Trees (RRT)
RRT*
This is a path planning code with RRT*
Black circles are obstacles, green line is a searched tree, red crosses are start and goal positions.
Reference
Incremental Sampling-based Algorithms for Optimal Motion Planning
Sampling-based Algorithms for Optimal Motion Planning
RRT* with reeds-shepp path
Path planning for a car robot with RRT* and reeds shepp path planner.
LQR-RRT*
This is a path planning simulation with LQR-RRT*.
A double integrator motion model is used for LQR local planner.
Reference
LQR-RRT*: Optimal Sampling-Based Motion Planning with Automatically Derived Extension Heuristics
MahanFathi/LQR-RRTstar: LQR-RRT* method is used for random motion planning of a simple pendulum in its phase plot
Quintic polynomials planning
Motion planning with quintic polynomials.
It can calculate a 2D path, velocity, and acceleration profile based on quintic polynomials.
Reference
Local Path Planning And Motion Control For Agv In Positioning
Reeds Shepp planning
A sample code with Reeds Shepp path planning.
Reference
15.3.2 Reeds-Shepp Curves
optimal paths for a car that goes both forwards and backwards
ghliu/pyReedsShepp: Implementation of Reeds Shepp curve.
LQR based path planning
A sample code using LQR based path planning for double integrator model.
Optimal Trajectory in a Frenet Frame
This is optimal trajectory generation in a Frenet Frame.
The cyan line is the target course and black crosses are obstacles.
The red line is the predicted path.
Reference
Optimal Trajectory Generation for Dynamic Street Scenarios in a Frenet Frame
Optimal trajectory generation for dynamic street scenarios in a Frenet Frame
Path Tracking
move to a pose control
This is a simulation of moving to a pose control
Reference
P. I. Corke, "Robotics, Vision and Control" | SpringerLink p102
Stanley control
Path tracking simulation with Stanley steering control and PID speed control.
Reference
Stanley: The robot that won the DARPA grand challenge
Automatic Steering Methods for Autonomous Automobile Path Tracking
Rear wheel feedback control
Path tracking simulation with rear wheel feedback steering control and PID speed control.
Reference
A Survey of Motion Planning and Control Techniques for Self-driving Urban Vehicles
Linear–quadratic regulator (LQR) speed and steering control
Path tracking simulation with LQR speed and steering control.
Reference
Towards fully autonomous driving: Systems and algorithms - IEEE Conference Publication
Model predictive speed and steering control
Path tracking simulation with iterative linear model predictive speed and steering control.
Reference
documentation
Real-time Model Predictive Control (MPC), ACADO, Python | Work-is-Playing
Nonlinear Model predictive control with C-GMRES
A motion planning and path tracking simulation with NMPC of C-GMRES
Reference
documentation
Arm Navigation
N joint arm to point control
N joint arm to a point control simulation.
This is an interactive simulation.
You can set the goal position of the end effector with left-click on the plotting area.
In this simulation N = 10, however, you can change it.
Arm navigation with obstacle avoidance
Arm navigation with obstacle avoidance simulation.
Aerial Navigation
drone 3d trajectory following
This is a 3d trajectory following simulation for a quadrotor.
rocket powered landing
This is a 3d trajectory generation simulation for a rocket powered landing.
Reference
documentation
Bipedal
bipedal planner with inverted pendulum
This is a bipedal planner for modifying footsteps for an inverted pendulum.
You can set the footsteps, and the planner will modify those automatically.
License
MIT
Use-case
If this project helps your robotics project, please let me know with creating an issue.
Your robot's video, which is using PythonRobotics, is very welcome!!
This is a list of user's comment and references:users_comments
Contribution
Any contribution is welcome!!
Please check this document:How To Contribute — PythonRobotics documentation
Citing
If you use this project's code for your academic work, we encourage you to cite our papers
If you use this project's code in industry, we'd love to hear from you as well; feel free to reach out to the developers directly.
Supporting this project
If you or your company would like to support this project, please consider:
Sponsor @AtsushiSakai on GitHub Sponsors
Become a backer or sponsor on Patreon
One-time donation via PayPal
If you would like to support us in some other way, please contact with creating an issue.
Sponsors
JetBrains
They are providing a free license of their IDEs for this OSS development.
1Password
They are providing a free license of their 1Password team license for this OSS project.
How active is development on AtsushiSakai/PythonRobotics?
The most recent commit recorded on AtsushiSakai/PythonRobotics was 1 month ago, based on the GitHub push timestamp. The repository has 7.4k forks — one of the better signals of community interest.
How does AtsushiSakai/PythonRobotics compare to other UI / UX projects?
AtsushiSakai/PythonRobotics is tracked by TopGit in the UI / UX category, with 30.6k GitHub stars and written in Python. Browse the UI / UX topic page on TopGit to compare it against similar projects by stars and activity.
How many stars does AtsushiSakai/PythonRobotics have?
AtsushiSakai/PythonRobotics has 30.6k GitHub stars — refresh the page for the live number, or check github.com/AtsushiSakai/PythonRobotics. TopGit mirrors GitHub's count but does not claim minute-by-minute accuracy.
What is AtsushiSakai/PythonRobotics?
AtsushiSakai/PythonRobotics (AtsushiSakai/PythonRobotics) is a Python project on GitHub. From the project's own README: Python sample codes and textbook for robotics algorithms.
What language is AtsushiSakai/PythonRobotics written in?
AtsushiSakai/PythonRobotics is written primarily in Python. GitHub's language field is based on the largest share of bytes in the default branch.
What topics is AtsushiSakai/PythonRobotics associated with?
Why is AtsushiSakai/PythonRobotics categorized under UI / UX?
TopGit places AtsushiSakai/PythonRobotics in the UI / UX category based on its GitHub topics and description (tagged: "algorithm", "animation", "autonomous-driving"). Categories are assigned from real repository metadata, not editorial guesswork.
Read full README in the tab above.
Still deciding about PythonRobotics?
One click hands the question to an AI along with this page — see what it says about PythonRobotics.