{"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/llm-a-large-language-model-enhanced","title":"LLM-A*: Large Language Model Enhanced Incremental Heuristic Search on Path Planning","arxiv_id":"2407.02511","date":"2024-06-20","proceeding":null,"authors":["Silin Meng","Yiwei Wang","Cheng-Fu Yang","Nanyun Peng","Kai-Wei Chang"],"abstract":"Path planning is a fundamental scientific problem in robotics and autonomous navigation, requiring the derivation of efficient routes from starting to destination points while avoiding obstacles. Traditional algorithms like A* and its variants are capable of ensuring path validity but suffer from significant computational and memory inefficiencies as the state space grows. Conversely, large language models (LLMs) excel in broader environmental analysis through contextual understanding, providing global insights into environments. However, they fall short in detailed spatial and temporal reasoning, often leading to invalid or inefficient routes. In this work, we propose LLM-A*, an new LLM based route planning method that synergistically combines the precise pathfinding capabilities of A* with the global reasoning capability of LLMs. This hybrid approach aims to enhance pathfinding efficiency in terms of time and space complexity while maintaining the integrity of path validity, especially in large-scale scenarios. By integrating the strengths of both methodologies, LLM-A* addresses the computational and memory limitations of conventional algorithms without compromising on the validity required for effective pathfinding.","url_abs":"https://arxiv.org/abs/2407.02511v2","url_pdf":"https://arxiv.org/pdf/2407.02511v2.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":"llm-a-large-language-model-enhanced","repo_url":"https://github.com/SilinMeng0510/llm-astar","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"autonomous-navigation","task_name":"Autonomous Navigation"},{"task_slug":"heuristic-search","task_name":"Heuristic Search"},{"task_slug":"language-modeling","task_name":"Language Modeling"},{"task_slug":"language-modelling","task_name":"Language Modelling"},{"task_slug":"large-language-model","task_name":"Large Language Model"}],"methods":[],"datasets_introduced":[{"slug":"ppft","name":"PPFT","full_name":"Path Planning on Fifty x Thirty"}],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2407.02511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.02511"}},"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/SilinMeng0510/llm-astar","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":6},"by_repo_kind":{"official":{"samples":6,"ran":6,"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":0,"samples":[{"code_sha256_prefix":"1b5155b0b089faae","entry":"filter_collision_path","repo":"SilinMeng0510/llm-astar","repo_kind":"official","path":"llmastar/utils/filter.py","file_url":"https://github.com/SilinMeng0510/llm-astar/blob/HEAD/llmastar/utils/filter.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"1b5155b0b089faae"}},{"code_sha256_prefix":"6c78dde4a6590ded","entry":"line_circle","repo":"SilinMeng0510/llm-astar","repo_kind":"official","path":"llmastar/utils/filter.py","file_url":"https://github.com/SilinMeng0510/llm-astar/blob/HEAD/llmastar/utils/filter.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"6c78dde4a6590ded"}},{"code_sha256_prefix":"ae5529e4c3e3ea6f","entry":"list_parse","repo":"SilinMeng0510/llm-astar","repo_kind":"official","path":"llmastar/utils/utils.py","file_url":"https://github.com/SilinMeng0510/llm-astar/blob/HEAD/llmastar/utils/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ae5529e4c3e3ea6f"}},{"code_sha256_prefix":"e4695eb63c674f80","entry":"parse","repo":"SilinMeng0510/llm-astar","repo_kind":"official","path":"llmastar/utils/utils.py","file_url":"https://github.com/SilinMeng0510/llm-astar/blob/HEAD/llmastar/utils/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e4695eb63c674f80"}},{"code_sha256_prefix":"07de23c8e65814a8","entry":"parse_search","repo":"SilinMeng0510/llm-astar","repo_kind":"official","path":"llmastar/utils/utils.py","file_url":"https://github.com/SilinMeng0510/llm-astar/blob/HEAD/llmastar/utils/utils.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"07de23c8e65814a8"}},{"code_sha256_prefix":"273b786cb316ba47","entry":"point_circle","repo":"SilinMeng0510/llm-astar","repo_kind":"official","path":"llmastar/utils/filter.py","file_url":"https://github.com/SilinMeng0510/llm-astar/blob/HEAD/llmastar/utils/filter.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"273b786cb316ba47"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}