Reproduce “D-ITAGS: A Dynamic Interleaved Approach to Resilient Task Allocation, Scheduling, and Motion Planning” on OpenResearch

Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.

Universal app for Apple silicon and Intel. Requires macOS 11 or later.

About this paper

Glen Neville, Sonia Chernova, Harish Ravichandar

D-ITAGS jointly searches assignments, timings, and feasible routes for heterogeneous robot teams. When circumstances change, it reuses valid search work and repairs affected parts rather than recomputing from scratch. Across 500 simulated repair problems, it reduced computation time versus an otherwise identical full-recomputation baseline, with generally similar makespan. After a new robot arrives, however, repair can produce a worse-makespan schedule.

Summary by alphaXiv.

Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.