AI & ML
Panini- Feasible Grammar For Robot Designs
arXiv cs.RO0 views
arXiv:2611.23567v1 Announce Type: new Abstract: Symbolic methods make robot designs interpretable but often overlook continuous geometry; learned methods handle geometry but offer less transparent structure. We introduce a typed production grammar that uses case-role relations, parameter inheritance, and specificity-based rule arbitration to generate both manipulation skills and robot morphologies. A geometric realization map translates grammar composition into transformations in SE(3), behaving as a monoid homomorphism when inheritance is inactive and exhibiting a measurable defect when inheritance is enabled. The grammar provides a compact representation, and its arbitration decisions can be recovered from geometric containment (agreement 0.905 +/- 0.062 across 10 seeds, versus 0.611 +/- 0.090 for a Euclidean control). We also introduce PANINI, a cross-entropy search method over grammar-based morphology representations. Across 30 methods and 24 seeds, PANINI achieves the best mean rank but is not statistically distinguishable from strong generic optimizers. Its main demonstrated advantage is therefore structural rather than optimization performance: grammar-generated designs are legal by construction, and coordinated limb placement produces 95% jointly feasible edits, compared with 55% for range-constrained resampling and none for flat parameterization in 6,000 draws. These results show how typed grammars can make robot generation more interpretable and geometrically coordinated, without implying that every feasible design will locomote or that grammar-based search universally outperforms generic optimizers.
Source:https://arxiv.org/abs/2611.23567PreviousLearning the Dynamics of Deformable Linear Objects Through Coupled Oscillators for Bimanual Robotic ManipulationNextLuxTac: A Flexible, Scalable, and Open-Source Optical Taxel Array with Distributed Three-Axis Force Sensing for Tactile Robot Learning
Related posts
A Matching Lower Bound for Online Smooth Calibration
0arXiv stat.ML
How Path Integral Diffusion Decides a Finite Spin Glass
0arXiv stat.ML
Prescriptive Learning of Linear Policies with Feasibility Guarantees for Binary Decision-Making
0arXiv stat.ML
IQS-BO: In-Context Query Selection for Bayesian Optimisation
0arXiv stat.ML
Swiss-Knife: A Framework for Reconfigurable Externalised Multi-Objective Alignment at Decode Time
0arXiv stat.ML
Inverse Design for Conditional Distribution Matching
0arXiv stat.ML