mirror of
https://github.com/AtsushiSakai/PythonRobotics.git
synced 2026-01-13 19:08:06 -05:00
update README
This commit is contained in:
16
README.md
16
README.md
@@ -17,6 +17,7 @@ Python codes for robotics algorithm.
|
||||
* [Ray casting grid map](#ray-casting-grid-map)
|
||||
* [SLAM](#slam)
|
||||
* [Iterative Closest Point (ICP) Matching](#iterative-closest-point-icp-matching)
|
||||
* [EKF SLAM](#ekf-slam)
|
||||
* [Path Planning](#path-planning)
|
||||
* [Dynamic Window Approach](#dynamic-window-approach)
|
||||
* [Grid based search](#grid-based-search)
|
||||
@@ -153,6 +154,20 @@ Ref:
|
||||
- [Introduction to Mobile Robotics: Iterative Closest Point Algorithm](https://cs.gmu.edu/~kosecka/cs685/cs685-icp.pdf)
|
||||
|
||||
|
||||
## EKF SLAM
|
||||
|
||||
This is a Extended Kalman Filter based SLAM example.
|
||||
|
||||
The blue line is ground truth, the black line is dead reckoning, the red line is estimated trajectory with EKF SLAM.
|
||||
|
||||
The green cross are estimated landmarks.
|
||||
|
||||

|
||||
|
||||
Ref:
|
||||
|
||||
- [PROBABILISTIC\-ROBOTICS\.ORG](http://www.probabilistic-robotics.org/)
|
||||
|
||||
# Path Planning
|
||||
|
||||
## Dynamic Window Approach
|
||||
@@ -536,3 +551,4 @@ Atsushi Sakai ([@Atsushi_twi](https://twitter.com/Atsushi_twi))
|
||||
|
||||
|
||||
|
||||
|
||||
|
||||
Reference in New Issue
Block a user