TL;DR
This paper introduces a novel two-step Positive-Unlabeled Constraint Learning algorithm that infers complex nonlinear constraints from expert demonstrations without prior knowledge, improving safety and accuracy in robotic planning.
Contribution
The proposed method uniquely infers continuous nonlinear constraints from demonstrations without requiring prior constraint parameterization or environmental models.
Findings
Successfully infers nonlinear constraints in four environments
Outperforms baseline methods in accuracy and safety
Does not misclassify feasible demonstrations as infeasible
Abstract
Planning for diverse real-world robotic tasks necessitates to know and write all constraints. However, instances exist where these constraints are either unknown or challenging to specify accurately. A possible solution is to infer the unknown constraints from expert demonstration. This paper presents a novel two-step Positive-Unlabeled Constraint Learning (PUCL) algorithm to infer a continuous constraint function from demonstrations, without requiring prior knowledge of the true constraint parameterization or environmental model as existing works. We treat all data in demonstrations as positive (feasible) data, and learn a control policy to generate potentially infeasible trajectories, which serve as unlabeled data. The proposed two-step learning framework first identifies reliable infeasible data using a distance metric, and secondly learns a binary feasibility classifier (i.e.,…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
