{
  "id": 9689989,
  "title": "Coding Agents for Generalized Task and Motion Planning Problems",
  "url": "https://urgent.news/2026/09/24/coding-agents-for-generalized-task-and-motion-planning-problems",
  "topic": "ai",
  "section": "AI",
  "published": "2026-09-24T17:53:35.000Z",
  "source": {
    "name": "arXiv cs.AI",
    "slug": "arxiv-cs-ai",
    "url": "https://arxiv.org/abs/2609.30233v1"
  },
  "original_language": "en",
  "account": null,
  "summary": "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…",
  "key_points": [],
  "editors_take": null,
  "illustration": null,
  "coverage": {
    "outlets": 1,
    "also_reported_by": []
  },
  "ai_generated": true,
  "disclaimer": "Summaries, key points and the editor’s take are written by software from other outlets’ reporting and may contain errors — always check the linked original."
}