{"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/neural-graph-control-barrier-functions-guided","title":"Neural Graph Control Barrier Functions Guided Distributed Collision-avoidance Multi-agent Control","arxiv_id":"2311.13014","date":"2023-11-21","proceeding":null,"authors":["Songyuan Zhang","Kunal Garg","Chuchu Fan"],"abstract":"We consider the problem of designing distributed collision-avoidance multi-agent control in large-scale environments with potentially moving obstacles, where a large number of agents are required to maintain safety using only local information and reach their goals. This paper addresses the problem of collision avoidance, scalability, and generalizability by introducing graph control barrier functions (GCBFs) for distributed control. The newly introduced GCBF is based on the well-established CBF theory for safety guarantees but utilizes a graph structure for scalable and generalizable decentralized control. We use graph neural networks to learn both neural a GCBF certificate and distributed control. We also extend the framework from handling state-based models to directly taking point clouds from LiDAR for more practical robotics settings. We demonstrated the efficacy of GCBF in a variety of numerical experiments, where the number, density, and traveling distance of agents, as well as the number of unseen and uncontrolled obstacles increase. Empirical results show that GCBF outperforms leading methods such as MAPPO and multi-agent distributed CBF (MDCBF). Trained with only 16 agents, GCBF can achieve up to 3 times improvement of success rate (agents reach goals and never encountered in any collisions) on <500 agents, and still maintain more than 50% success rates for >1000 agents when other methods completely fail.","url_abs":"https://arxiv.org/abs/2311.13014v1","url_pdf":"https://arxiv.org/pdf/2311.13014v1.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":"neural-graph-control-barrier-functions-guided","repo_url":"https://github.com/MIT-REALM/gcbf-pytorch","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok"}}],"tasks":[{"task_slug":"collision-avoidance","task_name":"Collision Avoidance"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2311.13014","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.13014"}},"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/MIT-REALM/gcbf-pytorch","reach":{"status":"ok"}}],"summary":{"ran":2,"ran_draft_wrong":1},"by_repo_kind":{"official":{"samples":3,"ran":3,"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":3,"samples":[{"code_sha256_prefix":"d262b0c00582c1ce","entry":"calculate_log_pi","repo":"MIT-REALM/gcbf-pytorch","repo_kind":"official","path":"gcbf/controller/utils.py","file_url":"https://github.com/MIT-REALM/gcbf-pytorch/blob/HEAD/gcbf/controller/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"d262b0c00582c1ce"}},{"code_sha256_prefix":"f2cddb5460e2bc7e","entry":"init_param","repo":"MIT-REALM/gcbf-pytorch","repo_kind":"official","path":"gcbf/controller/utils.py","file_url":"https://github.com/MIT-REALM/gcbf-pytorch/blob/HEAD/gcbf/controller/utils.py","link_basis":"plan_row","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"f2cddb5460e2bc7e"}},{"code_sha256_prefix":"53cef5173a4c7f53","entry":"reparameterize","repo":"MIT-REALM/gcbf-pytorch","repo_kind":"official","path":"gcbf/controller/utils.py","file_url":"https://github.com/MIT-REALM/gcbf-pytorch/blob/HEAD/gcbf/controller/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"53cef5173a4c7f53"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}