{"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/path-planning-for-robotic-mobile-fulfillment","title":"Path planning for Robotic Mobile Fulfillment Systems","arxiv_id":"1706.09347","date":"2017-06-28","proceeding":null,"authors":["Marius Merschformann","Lin Xie","Daniel Erdmann"],"abstract":"This paper presents a collection of path planning algorithms for real-time\nmovement of multiple robots across a Robotic Mobile Fulfillment System (RMFS).\nRobots are assigned to move storage units to pickers at working stations\ninstead of requiring pickers to go to the storage area. Path planning\nalgorithms aim to find paths for the robots to fulfill the requests without\ncollisions or deadlocks. The state-of-the-art path planning algorithms,\nincluding WHCA*, FAR, BCP, OD&ID and CBS, were adapted to suit path planning in\nRMFS and integrated within a simulation tool to guide the robots from their\nstarting points to their destinations during the storage and retrieval\nprocesses. Ten different layouts with a variety of numbers of robots, floors,\npods, stations and the sizes of storage areas were considered in the simulation\nstudy. Performance metrics of throughput, path length and search time were\nmonitored. Simulation results demonstrate the best algorithm based on each\nperformance metric.","url_abs":"http://arxiv.org/abs/1706.09347v2","url_pdf":"http://arxiv.org/pdf/1706.09347v2.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":"path-planning-for-robotic-mobile-fulfillment","repo_url":"https://github.com/merschformann/RAWSim-O","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"retrieval","task_name":"Retrieval"},{"task_slug":"robot-navigation","task_name":"Robot Navigation"}],"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":"merschformann/RAWSim-O","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":"bbc0c5c020ac8523375b681cec51b779e085e533aa84dd41b1221500771eaceb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}