Home Projects dynaVINS
dynaVINS
C++

dynaVINS

DynaVINS : A Visual-Inertial SLAM for Dynamic Environments

by url-kaist · GitHub
Stars
Forks
License
Created
Last commit
Category
Language
roboticsslamvisual-inertial-slamGPL-3.0C++
View on GitHub
In plain words

Estimate the position and movement of objects in dynamic environments using visual and inertial data.

You maintain this project?

Claim its page: indexed whatever its rank, translated into six languages, and enriched with what you write yourself.

Claim this page →
dynaVINS — GitHub preview card
📈 Star history
441440
2026-07-202026-08-31
📈 Track dynaVINS

Get an email alert on its next release or when it starts trending — never miss the moment.

Free · no card · unsubscribe anytime
Get email alerts →
📄 About

DynaVINS : A Visual-Inertial SLAM for Dynamic Environments

dynaVINS has 440 stars on GitHub. It has been forked 59 times. dynaVINS is written mainly in C++. It has been in active development since 2022. dynaVINS is available under the GPL-3.0 license. Its main topics are robotics, slam, visual-inertial-slam.

Frequently asked questions

What is dynaVINS?

DynaVINS : A Visual-Inertial SLAM for Dynamic Environments

Is dynaVINS open source?

dynaVINS is an open-source project. It is released under the GPL-3.0 license.

Is dynaVINS free?

Yes. dynaVINS is free and open source — you can use, modify and self-host it. Its GPL-3.0 license is copyleft: if you distribute a modified version, it must remain under the same license.

What license does dynaVINS use?

dynaVINS is available under the GPL-3.0 license.

What language is dynaVINS written in?

dynaVINS is written mainly in C++.

🏅 Maintainer of this project?
olud.ai badge — dynaVINS

Add this live badge to your README — your GitHub stars and directory rank, refreshed daily.

[![olud.ai](https://olud.ai/badge.php?tool=url-kaist-dynavins)](https://olud.ai/project/url-kaist-dynavins.html)
More badge options →
🧬 Shares DNA with🧬 View the DNA map →

Measured from GitHub topics shared by both projects, weighted by how rare each topic is.