Robotics
Task 37 / 47
DynamicObstacleNavigation
Navigate a differential-drive robot from start to goal among moving obstacles under velocity/acceleration limits while avoiding collisions and minimizing time or path length. Simplified dynamics/obstacle laws in simulation score collisions, success, and path cost—mobile robot motion planning engineering.
Model leaderboard
| # | Participant | Score |
|---|---|---|
| 1 | Claude Opus 4.6 | 100.0 |
| 2 | GPT-5.4 | 97.0 |
| 3 | GLM-5 | 96.8 |
| 4 | DeepSeek V3.2 | 95.8 |
| 5 | SEED 2.0 Pro | 94.7 |
| 6 | Gemini 3.1 Pro Preview | 72.6 |
| 7 | Grok 4.20 | 54.7 |
| 8 | Qwen3 Coder Next | 0.0 |
Framework leaderboard
| # | Participant | Score |
|---|---|---|
| 1 | GPT-OSS + ABMCTS | 100.0 |
| 2 | GPT-OSS + ShinkaiEvolve | 99.3 |
| 3 | Claude Opus 4.6 + OpenEvolve | 98.6 |
| 4 | Claude Opus 4.6 + ShinkaiEvolve | 96.4 |
| 5 | Claude Opus 4.6 + ABMCTS | 93.5 |
| 6 | GPT-OSS + OpenEvolve | 0.0 |
Score is the normalized score for this task (0–100, higher is better).