Home Projects dart
dart
C++

dart

Research-focused C++23 physics engine for robotics, animation, and machine learning, with Python bindings

by dartsim · GitHub
Stars
Forks
Created
Last commit
Language
collision-detectioncomputer-animationcpp23BSD-2-ClauseC++
View on GitHub
In plain words

Simulate physics for robotics and animation projects using a research-focused engine with Python support.

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 →
dart — GitHub preview card
📈 Star history
1 1611 160
2026-07-202026-08-31
📈 Track dart

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

Research-focused C++23 physics engine for robotics, animation, and machine learning, with Python bindings

dart has 1.2k stars on GitHub. It has been forked 301 times. dart is written mainly in C++. It has been in active development since 2011. dart is available under the BSD-2-Clause license. Its main topics are collision-detection, computer-animation, cpp23, dynamics.

Frequently asked questions

What is dart?

Research-focused C++23 physics engine for robotics, animation, and machine learning, with Python bindings

Is dart open source?

dart is an open-source project. It is released under the BSD-2-Clause license.

Is dart free?

Yes. dart is free and open source — you can use, modify and self-host it.

What license does dart use?

dart is available under the BSD-2-Clause license.

What language is dart written in?

dart is written mainly in C++.

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

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

[![olud.ai](https://olud.ai/badge.php?tool=dartsim-dart)](https://olud.ai/project/dartsim-dart.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.