Applies hierarchical augmented Lagrangian to infeasible constrained imitation learning, driving policies to closest feasible solutions when constraints conflict.
arXiv preprint arXiv:2210.11796 , year=
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.RO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Infeasible optimization problems and the hierarchical augmented Lagrangian method in imitation learning
Applies hierarchical augmented Lagrangian to infeasible constrained imitation learning, driving policies to closest feasible solutions when constraints conflict.