{"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/end-to-end-sketch-guided-path-planning","title":"End-to-end Sketch-Guided Path Planning through Imitation Learning for Autonomous Mobile Robots","arxiv_id":null,"date":"2025-03-21","proceeding":"IEEE 6th International Conference on Image Processing, Applications and Systems (IPAS) 2025 3","authors":["Anthony Rizk","Charbel Abi Hana","Youssef Bakouny","Flavia Khatounian"],"abstract":"Path planning is crucial for Autonomous Mobile Robots applications. Traditionally, path planning based on human input and preferences has relied on hard to define reward-based learning or costly techniques requiring additional hardware. This work introduces a more accessible and flexible approach through sketch-guided imitation learning, where nontechnical users can simply draw the desired navigational path on a provided 2D map, which is then used to teach U-net models path planning behaviors. Additionally, the work draws on metrics from the fields of image generation and robotics to provide a novel evaluation framework. The approach is integrated into an end-to-end robotics stack to demonstrate its usability. The dataset and code are provided on https://github.com/charbel-a-hC/SKIPP.","url_abs":"https://ieeexplore.ieee.org/document/10924509","url_pdf":"https://ieeexplore.ieee.org/document/10924509","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":"end-to-end-sketch-guided-path-planning","repo_url":"https://github.com/charbel-a-hC/SKIPP","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-generation","task_name":"Image Generation"},{"task_slug":"imitation-learning","task_name":"Imitation Learning"}],"methods":[{"method_slug":"concatenated-skip-connection","method_name":"Concatenated Skip Connection"},{"method_slug":"convolution","method_name":"Convolution"},{"method_slug":"max-pooling","method_name":"Max Pooling"},{"method_slug":"relu","method_name":"ReLU"},{"method_slug":"u-net","method_name":"U-Net"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"no_arxiv_id","checked_against":null,"by_repo":[{"repo":"charbel-a-hC/SKIPP","kind":"named_in_paper","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":"2eb0b29847c9cbbcb9f52245413941513c1ec003f5841bb1a2e0161c30d8c97b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}