Paper recorded by Signals 4 on 2026-09-24 in cs.AI. Abstract reproduced from arXiv; link to the original below.
Published 2026-09-24 on arXiv · recorded by Signals 4 on 2026-09-25
Category: cs.AI · 人工智能 · first seen 2026-09-25
Task and motion planning (TAMP) problems remain difficult even with full observability and object-centric states because discrete decisions are tightly coupled to geometric, kinematic, and dynamic constraints. Generalized TAMP addresses this difficulty by exploiting regularities across problem instances to reduce planning effort on new instances. However, existing methods require substantial TAMP-