{"about":{"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.","site":"https://codewithpapers.app","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","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/cost-adaptation-for-robust-decentralized","title":"Cost Adaptation for Robust Decentralized Swarm Behaviour","arxiv_id":"1709.07114","date":"2017-09-21","proceeding":null,"authors":["Peter Henderson","Matthew Vertescher","David Meger","Mark Coates"],"abstract":"Decentralized receding horizon control (D-RHC) provides a mechanism for\ncoordination in multi-agent settings without a centralized command center.\nHowever, combining a set of different goals, costs, and constraints to form an\nefficient optimization objective for D-RHC can be difficult. To allay this\nproblem, we use a meta-learning process -- cost adaptation -- which generates\nthe optimization objective for D-RHC to solve based on a set of human-generated\npriors (cost and constraint functions) and an auxiliary heuristic. We use this\nadaptive D-RHC method for control of mesh-networked swarm agents. This\nformulation allows a wide range of tasks to be encoded and can account for\nnetwork delays, heterogeneous capabilities, and increasingly large swarms\nthrough the adaptation mechanism. We leverage the Unity3D game engine to build\na simulator capable of introducing artificial networking failures and delays in\nthe swarm. Using the simulator we validate our method on an example coordinated\nexploration task. We demonstrate that cost adaptation allows for more efficient\nand safer task completion under varying environment conditions and increasingly\nlarge swarm sizes. We release our simulator and code to the community for\nfuture work.","url_abs":"http://arxiv.org/abs/1709.07114v2","url_pdf":"http://arxiv.org/pdf/1709.07114v2.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":"cost-adaptation-for-robust-decentralized","repo_url":"https://github.com/Breakend/SocraticSwarm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"meta-learning","task_name":"Meta-Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"Breakend/SocraticSwarm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"e3b7b7019177a46c31a507c3701bd2a58300aaef27216d4b3813730a083cfb8e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}