{"paper":{"title":"Precomputing Multi-Agent Path Replanning Using Temporal Flexibility","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Precomputing temporal flexibility allows efficient replanning of multi-agent paths after single-agent delays without cascades.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Devin Wild Thomas, Eric Kemmeren, Issa Hanou, Mathijs de Weerdt","submitted_at":"2026-01-08T12:30:36Z","abstract_excerpt":"Executing a multi-agent plan can be challenging when an agent is delayed, because this typically creates conflicts with other agents. So, we need to quickly find a new safe plan. Replanning only the delayed agent often does not yield an efficient plan, and sometimes cannot even yield a feasible one. On the other hand, replanning other agents may lead to a cascade of changes and delays, and it is computationally expensive. We show how to efficiently replan a single delayed agent by tracking and using the temporal flexibility of other agents while avoiding cascading delays. This flexibility is t"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our algorithm, FlexSIPP, precomputes all possible plans for the delayed agent and returns the changes to the other agents for any single-agent delay within the given scenario.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That precomputing flexibility for all possible single delays is computationally feasible and that single-agent delays do not require simultaneous multi-agent adjustments in the target domains.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FlexSIPP precomputes all possible plans for a delayed agent and returns minimal changes to others using temporal flexibility to handle single delays efficiently.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Precomputing temporal flexibility allows efficient replanning of multi-agent paths after single-agent delays without cascades.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"4bd7158c6f44a11498cc92722b5241bd7544a1747164c10a5024ebb83fdfc327"},"source":{"id":"2601.04884","kind":"arxiv","version":3},"verdict":{"id":"14a6214f-0791-4c2e-81f7-e1c4f3392737","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T16:15:30.941103Z","strongest_claim":"Our algorithm, FlexSIPP, precomputes all possible plans for the delayed agent and returns the changes to the other agents for any single-agent delay within the given scenario.","one_line_summary":"FlexSIPP precomputes all possible plans for a delayed agent and returns minimal changes to others using temporal flexibility to handle single delays efficiently.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That precomputing flexibility for all possible single delays is computationally feasible and that single-agent delays do not require simultaneous multi-agent adjustments in the target domains.","pith_extraction_headline":"Precomputing temporal flexibility allows efficient replanning of multi-agent paths after single-agent delays without cascades."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2601.04884/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"7e6eba95d5578256d07aaeb5e26334ec884b6fc589d183b7665bad0f985c7b94"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}