{"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/prioritized-planning-algorithms-for","title":"Prioritized Planning Algorithms for Trajectory Coordination of Multiple Mobile Robots","arxiv_id":"1409.2399","date":"2014-09-08","proceeding":null,"authors":["Michal Čáp","Peter Novák","Alexander Kleiner","Martin Selecký"],"abstract":"An important capability of autonomous multi-robot systems is to prevent\ncollision among the individual robots. One approach to this problem is to plan\nconflict-free trajectories and let each of the robots follow its pre-planned\ntrajectory. A widely used practical method for multi-robot trajectory planning\nis prioritized planning, which has been shown to be effective in practice, but\nis in general incomplete. Formal analysis of instances that are provably\nsolvable by prioritized planning is still missing. Moreover, prioritized\nplanning is a centralized algorithm, which may be in many situations\nundesirable.\n  In this paper we a) propose a revised version of prioritized planning and\ncharacterize the class of instances that are provably solvable by the algorithm\nand b) propose an asynchronous decentralized variant of prioritized planning,\nwhich maintains the desirable properties of the centralized version and in the\nsame time exploits the distributed computational power of the individual\nrobots, which in most situations allows to find the joint trajectories faster.\n  The experimental evaluation performed on real-world indoor maps shows that a)\nthe revised version of prioritized planning reliably solves a wide class of\ninstances on which both classical prioritized planning and popular reactive\ntechnique ORCA fail and b) the asynchronous decentralized algorithm provides\nsolution faster than the previously proposed synchronized decentralized\nalgorithm.","url_abs":"http://arxiv.org/abs/1409.2399v1","url_pdf":"http://arxiv.org/pdf/1409.2399v1.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":"prioritized-planning-algorithms-for","repo_url":"https://github.com/mcapino/adpp-journal","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null},{"paper_slug":"prioritized-planning-algorithms-for","repo_url":"https://github.com/PathPlanning/Push-and-Rotate--CBS--PrioritizedPlanning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"prioritized-planning-algorithms-for","repo_url":"https://github.com/kylevedder/Push-and-Rotate","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"trajectory-planning","task_name":"Trajectory Planning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1409.2399","atlas_url":"https://app.syntology.ai/?focus=1409.2399","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1409.2399"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1409.2399\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1409.2399"},"call":"get_concepts_for_paper(arxiv_id=\"1409.2399\")"}],"by_repo":[{"repo":"mcapino/adpp-journal","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"PathPlanning/Push-and-Rotate--CBS--PrioritizedPlanning","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"kylevedder/Push-and-Rotate","kind":"listed","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":"4eb60334ff22f9da5d1b2651749c95d92434f7d7851e9c186d8033f03faa6d50","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}