REVIEW 2 cited by
Discrete-Time Hybrid Automata Learning: Legged Locomotion Meets Skateboarding
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Hybrid dynamical systems, which include continuous flow and discrete mode switching, can model robotics tasks like legged robot locomotion. Model-based methods usually depend on predefined gaits, while model-free approaches lack explicit mode-switching knowledge. Current methods identify discrete modes via segmentation before regressing continuous flow, but learning high-dimensional complex rigid body dynamics without trajectory labels or segmentation is a challenging open problem. This paper introduces Discrete-time Hybrid Automata Learning (DHAL), a framework to identify and execute mode-switching without trajectory segmentation or event function learning. Besides, we embedded it in reinforcement learning pipeline and incorporates a beta policy distribution and a multi-critic architecture to model contact-guided motions, exemplified by a challenging quadrupedal robot skateboard task. We validate our method through sufficient real-world tests, demonstrating robust performance and mode identification consistent with human intuition in hybrid dynamical systems.
Forward citations
Cited by 2 Pith papers
-
Max Entropy Moment Kalman Filter for Polynomial Systems with Arbitrary Noise
MEM-KF approximates the Bayes filter for polynomial systems by propagating moments and recovering max-entropy distributions, with point estimates extracted via semidefinite relaxation.
-
Quantifying and Visualizing Sim-to-Real Gaps: Physics-Guided Regularization for Reproducibility
A gain-regularized, parameter-conditioned RNN balances a low-cost 110:1 gearbox robot with matching simulated and real settling times, while naive domain randomization oscillates.
Discussion (0). Continue with ORCID to comment.