Coding Agents for Generalized Task and Motion Planning Problems
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…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
