Skip to content
forked from yingkunwu/FastSLAM

This project implements grid-based FastSLAM1.0 and FastSLAM2.0 algorithms to solve SLAM problem in a simulated environment.

Notifications You must be signed in to change notification settings

damtle/FastSLAM

 
 

Repository files navigation

FastSLAM

Final project for UMN CSCI 5512 Artificial Intelligence II course

Introduction

The purpose of this project is to simulate a Simultaneously Localization and Mapping problem by allowing a robot with beam sensors to navigate in a 2D grid map. In this project, I implemented both the famous particle filter based SLAM algorithm, FastSLAM1.0 and FastSLAM2.0, in python. The program is able to work in any given grid map as long as the environment is static and each grid is either free (0) or occupied (1).

Usage

Run the following command to run FastSLAM1.0:

python fastslam1.py -m [given map] -p [number of particles]

Similarly, run the following command to run FastSLAM2.0:

python fastslam2.py -m [given map] -p [number of particles]

For now the given map should be either 'scene-1' or 'scene-2', and the number of particles should be a integer.

Result

FastSLAM 1.0

result

result

FastSLAM 2.0

result

result

References

About

This project implements grid-based FastSLAM1.0 and FastSLAM2.0 algorithms to solve SLAM problem in a simulated environment.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%