Searcharxiv⌕ Search

arXiv subjects

Jona Schulz

Publications and source records attributed to Jona Schulz.

2 recordsLinked to original sources

KlaskTron: An Open-Source Platform for Physical Adversarial Multi-Agent RL

Progress in robot learning, particularly physical multi-agent reinforcement learning (MARL), is currently challenged by a limited availability of accessible, standardized benchmarks. While simulation-based MARL has produced remarkable emergent behaviors, from coordinated team play to complex tool use, translating these advances to physical systems remains difficult. A key barrier is infrastructural: physical platforms are often prohibitively expensive, require specialized facilities, or lack open mechanisms and designs for reproducibility. We introduce KlaskTron, an open-source, low-cost (<\$2500 USD), desktop-scale robotic testbed for adversarial MARL based on the dynamic tabletop game KLASK. The platform features dual CoreXY gantries with high-torque brushless motors, enabling the high-speed, precise manipulation required for competitive play. Crucially, we provide a complete ecosystem: hardware designs (CAD, BOM), a GPU-native digital twin in NVIDIA Isaac Lab for high-fidelity modeling and simulation, and a validated sim-to-real baseline using a learned neural actuator model. We demonstrate that this baseline enables zero-shot policy transfer, with trained agents exhibiting emergent adversarial behaviors. To ensure full reproducibility of our results, all project assets are released publicly: hardware CAD/BOM and assembly documentation at [https://idscethzurich.github.io/klask_hardware], inference software stack at [https://github.com/IDSCETHZurich/klask_software] and the simulation and MARL setup at [https://github.com/IDSCETHZurich/klask_rl].

cs.RO↗

On normal approximations to symmetric hypergeometric laws

The Kolmogorov distances between a symmetric hypergeometric law with standard deviation $σ$ and its usual normal approximations are computed and shown to be less than $1/(\sqrt{8π}\,σ)$, with the order $1/σ$ and the constant $1/\sqrt{8π}$ being optimal. The results of Hipp and Mattner (2007) for symmetric binomial laws are obtained as special cases. Connections to Berry-Esseen type results in more general situations concerning sums of simple random samples or Bernoulli convolutions are explained. Auxiliary results of independent interest include rather sharp normal distribution function inequalities, a simple identifiability result for hypergeometric laws, and some remarks related to Lévy's concentration-variance inequality.

math.PR↗