{"paper":{"title":"Decoupled Planning for Multiple Omega-Regular Objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Agents satisfy multiple omega-regular objectives on a graph through independent local policies composed by a scheduler if they follow pre-agreed conventions specific to each objective class.","cross_cats":["cs.MA"],"primary_cat":"cs.FL","authors_text":"Guy Avni, Kaushik Mallik, K. S. Thejaswini, Suman Sadhukhan, Thomas A. Henzinger","submitted_at":"2026-05-13T08:42:51Z","abstract_excerpt":"We study the problem of generating paths on a graph that satisfy a collection of {\\omega}-regular objectives. We propose a decoupled framework in which each objective is assigned to an independent agent that selects a local policy, while a scheduler -- oblivious to the graph and objective -- dynamically composes these policies into a single path. We ask when such a composition satisfies all objectives, assuming their conjunction is realizable. The framework enables modular policy design but raises fundamental compositional challenges. We show that even extremely fair deterministic schedulers d"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Büchi objectives admit universal composition of finite-memory policies without scheduler communication; co-Büchi objectives require only knowledge of whether the agent was scheduled; and parity objectives additionally require knowledge of which agent was scheduled.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The conjunction of objectives is realizable on the graph, and all agents agree in advance on the conventions before the graph or objectives are revealed.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A decoupled agent framework with a priori conventions enables reliable composition of policies for multiple omega-regular objectives on graphs, with specific minimal conventions characterized for Buchi, co-Buchi, and parity classes.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Agents satisfy multiple omega-regular objectives on a graph through independent local policies composed by a scheduler if they follow pre-agreed conventions specific to each objective class.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"2692c211f238d2ca006ea70385fa472f1e6563a697229a07dd1084700fcc2095"},"source":{"id":"2605.13185","kind":"arxiv","version":1},"verdict":{"id":"385b2a1c-cfbc-4633-a374-b1d26a2c7e0a","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T01:35:07.269893Z","strongest_claim":"Büchi objectives admit universal composition of finite-memory policies without scheduler communication; co-Büchi objectives require only knowledge of whether the agent was scheduled; and parity objectives additionally require knowledge of which agent was scheduled.","one_line_summary":"A decoupled agent framework with a priori conventions enables reliable composition of policies for multiple omega-regular objectives on graphs, with specific minimal conventions characterized for Buchi, co-Buchi, and parity classes.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The conjunction of objectives is realizable on the graph, and all agents agree in advance on the conventions before the graph or objectives are revealed.","pith_extraction_headline":"Agents satisfy multiple omega-regular objectives on a graph through independent local policies composed by a scheduler if they follow pre-agreed conventions specific to each objective class."},"references":{"count":29,"sample":[{"doi":"","year":1987,"title":"Distributed comput- ing2(3), 117–126 (1987)","work_id":"87e0e057-da8c-47be-b654-559a9c3b4c24","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"In: International Conference on Computer Aided Verification","work_id":"bb43223a-21c6-4090-ba5f-62ab63045f80","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"Avni, G., Henzinger, T.A., Chonev, V.: Infinite-duration bidding games. J. ACM 66(4), 31:1–31:29 (2019)","work_id":"5731ea3f-85f0-4a06-90f7-9a60110431c3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","work_id":"b240e5bc-35c0-40da-9af7-b0ddb7538120","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems","work_id":"28f5f4f2-153a-4c03-8b2c-46ecd64663af","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":29,"snapshot_sha256":"cce4275efb1404c3e85b6421b178435703ea49a2f62844c81a3dbf8f613997f5","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}