Pith. sign in

REVIEW 1 cited by

Differentiable Constrained Imitation Learning for Robot Motion Planning and Control

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

arxiv 2210.11796 v2 pith:J3AJTIQY submitted 2022-10-21 cs.RO cs.LG

classification cs.ROcs.LG
keywords controlrobotapplicationslearningplanningautomatedconstraintconstraints
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Motion planning and control are crucial components of robotics applications like automated driving. Here, spatio-temporal hard constraints like system dynamics and safety boundaries (e.g., obstacles) restrict the robot's motions. Direct methods from optimal control solve a constrained optimization problem. However, in many applications finding a proper cost function is inherently difficult because of the weighting of partially conflicting objectives. On the other hand, Imitation Learning (IL) methods such as Behavior Cloning (BC) provide an intuitive framework for learning decision-making from offline demonstrations and constitute a promising avenue for planning and control in complex robot applications. Prior work primarily relied on soft constraint approaches, which use additional auxiliary loss terms describing the constraints. However, catastrophic safety-critical failures might occur in out-of-distribution (OOD) scenarios. This work integrates the flexibility of IL with hard constraint handling in optimal control. Our approach constitutes a general framework for constraint robotic motion planning and control, as well as traffic agent simulation, whereas we focus on mobile robot and automated driving applications. Hard constraints are integrated into the learning problem in a differentiable manner, via explicit completion and gradient-based correction. Simulated experiments of mobile robot navigation and automated driving provide evidence for the performance of the proposed method.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Non-differentiable Reward Optimization for Diffusion-based Autonomous Motion Planning

    cs.RO 2025-07 conditional novelty 6.0 of 10

    A reinforcement learning fine-tuning method with dynamic reward thresholding lets diffusion motion planners directly optimize non-differentiable safety and goal-reaching metrics, improving collision rate and success r...

Pith tools