microduck-sock-heist-composite-v10
updated strategy for the Microduck Arena robotics simulation
2 min readupdated
This competitive checkpoint for the 6m Sock Heist simulation in Microduck Arena combines winning trajectories from other authors with targeted optimization of a key step. The model clocks an average runtime of 4.780 seconds across five official seeds, beating previous benchmarks by applying CMA-ES (Covariance Matrix Adaptation Evolution Strategy) search to the fourth seed. The remaining four trajectories are taken from the nov17-v3 model by HlibPlakhtii. This setup is built strictly for the x86-64 simulator and is not meant to be deployed on physical robots.
Key features
- Trajectory optimization: cuts seed 4 runtime down to 4.680 s using CMA-ES search.
- Hybrid setup: pairs four trajectories from nov17-v3 with one newly optimized trajectory.
- Reliable execution: clears all five official simulator seeds cleanly.
What you can do
- Run the simulation in Microduck Arena on an x86-64 machine to benchmark completion times.
- Inspect the recorded trajectories and lookup tables to look for further optimization opportunities.
- Use this configuration as a baseline to push for better scores in the robotics competition.
Example
Because the model consists of recorded trajectories and lookup tables for the simulator, standard inference code is replaced by direct evaluation in the Arena engine. Per-seed results:
Seed 1: 4.635 | Seed 2: 5.095 | Seed 3: 4.675 | Seed 4: 4.680 | Seed 5: 4.815
Read more
DetailsAverage completion time: 4.780 seconds across 5 seeds.
Hardware and environment requirements: x86-64 CPU, pinned versions of MuJoCo 3.10.0, onnxruntime 1.24.4, and numpy 2.4.1.
Limitations: runs in the simulator only; results on Mac or other hardware architectures may vary.
License: Apache-2.0 applies only to the modified parts and markup.










Comments