{"type":"ScholarlyArticle","title":"An Approximation Algorithm for the Subpath Planning Problem","authors":[{"name":"Masoud Safilian","slug":"masoud-safilian","given":"Masoud","family":"Safilian","affiliation":""},{"name":"S. Mehdi Hashemi","slug":"s-mehdi-hashemi","given":"S. Mehdi","family":"Hashemi","affiliation":""},{"name":"Sepehr Eghbali","slug":"sepehr-eghbali","given":"Sepehr","family":"Eghbali","affiliation":""},{"name":"Aliakbar Safilian","slug":"aliakbar-safilian","given":"Aliakbar","family":"Safilian","affiliation":""}],"abstract":"The subpath planning problem (SPP) is a branch of path planning problem, which has widespread applications in automated manufacturing process as well as vehicle and robot navigation. This problem aims to find the shortest path or tour subject to covering a set of given subpaths. By casting SPP to a graph routing problem, we propose a deterministic 2-approximation algorithm finding near optimal solutions, which runs in O(n3) time.","doi":null,"url":"https://ijcai.org/proceedings/2016/101","pdf":"https://ijcai.org/proceedings/2016/0101.pdf","markdown":"https://ijcai.org/proceedings/2016/101.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/101","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":101,"pages":{"first":669,"last":674},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}