Discretizing Dynamics for Maximum Likelihood Constraint Inference
Kaylene C. Stocking, David L. McPherson, Robert P. Matthew, Claire J., Tomlin

TL;DR
This paper introduces a method to perform maximum likelihood constraint inference in continuous systems by discretizing dynamics, enabling accurate constraint detection in nonlinear systems and human demonstrations.
Contribution
It presents a novel approach to approximate continuous dynamics with a tabular state-action space for constraint inference, extending the technique beyond discrete settings.
Findings
Accurately infers constraints on nonlinear pendulum systems.
Robust performance across various hyperparameters.
Effective even with limited demonstration coverage.
Abstract
Maximum likelihood constraint inference is a powerful technique for identifying unmodeled constraints that affect the behavior of a demonstrator acting under a known objective function. However, it was originally formulated only for discrete state-action spaces. Continuous dynamics are more useful for modeling many real-world systems of interest, including the movements of humans and robots. We present a method to generate a tabular state-action space that approximates continuous dynamics and can be used for constraint inference on demonstrations that obey the true system dynamics. We then demonstrate accurate constraint inference on nonlinear pendulum systems with 2- and 4-dimensional state spaces, and show that performance is robust to a range of hyperparameters. The demonstrations are not required to be fully optimal with respect to the objective, and the most likely constraints can…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAI-based Problem Solving and Planning
