{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/parallelized-planning-acting-for-efficient","title":"Parallelized Planning-Acting for Efficient LLM-based Multi-Agent Systems","arxiv_id":"2503.03505","date":"2025-03-05","proceeding":null,"authors":["Yaoru Li","Shunyu Liu","Tongya Zheng","Mingli Song"],"abstract":"Recent advancements in Large Language Model(LLM)-based Multi-Agent Systems(MAS) have demonstrated remarkable potential for tackling complex decision-making tasks. However, existing frameworks inevitably rely on serialized execution paradigms, where agents must complete sequential LLM planning before taking action. This fundamental constraint severely limits real-time responsiveness and adaptation, which is crucial in dynamic environments with ever-changing scenarios. In this paper, we propose a novel parallelized planning-acting framework for LLM-based MAS, featuring a dual-thread architecture with interruptible execution to enable concurrent planning and acting. Specifically, our framework comprises two core threads:(1) a planning thread driven by a centralized memory system, maintaining synchronization of environmental states and agent communication to support dynamic decision-making; and (2) an acting thread equipped with a comprehensive skill library, enabling automated task execution through recursive decomposition. Extensive experiments on challenging Minecraft demonstrate the effectiveness of the proposed framework.","url_abs":"https://arxiv.org/abs/2503.03505v1","url_pdf":"https://arxiv.org/pdf/2503.03505v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"parallelized-planning-acting-for-efficient","repo_url":"https://github.com/zju-vipa/odyssey","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"decision-making","task_name":"Decision Making"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"large-language-model","task_name":"Large Language Model"},{"task_slug":"minecraft","task_name":"Minecraft"}],"methods":[{"method_slug":"mas","method_name":"MAS"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2503.03505","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.03505"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/zju-vipa/odyssey","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":4},"by_repo_kind":{"official":{"samples":4,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"4e41a7d3b6a4223d","entry":"extract_json_list","repo":"zju-vipa/odyssey","repo_kind":"official","path":"Multi-Agent/odyssey/utils/experiment.py","file_url":"https://github.com/zju-vipa/odyssey/blob/HEAD/Multi-Agent/odyssey/utils/experiment.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4e41a7d3b6a4223d"}},{"code_sha256_prefix":"377feaa4a69f18d2","entry":"is_sequence","repo":"zju-vipa/odyssey","repo_kind":"official","path":"Multi-Agent/odyssey/utils/file_utils.py","file_url":"https://github.com/zju-vipa/odyssey/blob/HEAD/Multi-Agent/odyssey/utils/file_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"377feaa4a69f18d2"}},{"code_sha256_prefix":"4926aacb60add226","entry":"pack_varargs","repo":"zju-vipa/odyssey","repo_kind":"official","path":"Multi-Agent/odyssey/utils/file_utils.py","file_url":"https://github.com/zju-vipa/odyssey/blob/HEAD/Multi-Agent/odyssey/utils/file_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"4926aacb60add226"}},{"code_sha256_prefix":"edd852217838fe9c","entry":"utf_open","repo":"zju-vipa/odyssey","repo_kind":"official","path":"Multi-Agent/odyssey/utils/file_utils.py","file_url":"https://github.com/zju-vipa/odyssey/blob/HEAD/Multi-Agent/odyssey/utils/file_utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"edd852217838fe9c"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}