{"url":"/method/4d-a","slug":"4d-a","name":"4D A*","full_name":"Four-dimensional A-star","full_name_withheld":false,"description_markdown":"The aim of 4D A* is to find the shortest path between two four-dimensional (4D) nodes of a 4D search space - a starting node and a target node - as long as there is a path. It achieves both optimality and completeness. The former is because the path is shortest possible, and the latter because if the solution exists the algorithm is guaranteed to find it.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Artificial Intelligence Control in 4D Cylindrical Space for Industrial Robotic Applications","paper":"/paper/artificial-intelligence-control-in-4d","first_author":"Andrea de Giorgio","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/artificial-intelligence-control-in-4d"},"source":{"url":"https://doi.org/10.1109/ACCESS.2020.3026193","title":"Artificial Intelligence Control in 4D Cylindrical Space for Industrial Robotic Applications","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Reinforcement Learning","area_id":"reinforcement-learning","collection":"Heuristic Search Algorithms","url":"/methods/category/heuristic-search-algorithms","pwc_aliases":[]}],"n_papers_tagged":1,"archive_num_papers":1,"papers_newest_first":[{"paper":"/paper/artificial-intelligence-control-in-4d","title":"Artificial Intelligence Control in 4D Cylindrical Space for Industrial Robotic Applications","date":"2020-09-23","arxiv_id":null,"n_code_links":1,"syntology":null}],"papers_shown":1,"tasks":[{"task":"/task/industrial-robots","name":"Industrial Robots","papers":1},{"task":"/task/motion-planning","name":"Motion Planning","papers":1},{"task":"/task/trajectory-planning","name":"Trajectory Planning","papers":1}],"tasks_shown":3,"n_tasks":3,"usage_by_year":[{"year":"2020","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/4d-a"},"syntology_read_at":"2026-09-24T18:15:14+00:00"}