An improved approximation algorithm for the subpath planning problem and its generalization

Hanna Sumita, Yuma Yonebayashi, Naonori Kakimura, Ken Ichi Kawarabayashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

This paper focuses on a generalization of the traveling salesman problem (TSP), called the subpath planning problem (SPP). Given 2n vertices and n independent edges on a metric space, we aim to find a shortest tour that contains all the edges. SPP is one of the fundamental problems in both artificial intelligence and robotics. Our main result is to design a 1.5-approximation algorithm that runs in polynomial time, improving the currently best approximation algorithm. The idea is direct use of techniques developed for TSP. In addition, we propose a generalization of SPP called the subgroup planning problem (SGPP). In this problem, we are given a set of disjoint groups of vertices, and we aim to find a shortest tour such that all the vertices in each group are traversed sequentially. We propose a 3-approximation algorithm for SGPP. We also conduct numerical experiments. Compared with previous algorithms, our algorithms improve the solution quality by more than 10% for large instances with more than 10,000 vertices.

Original languageEnglish
Title of host publication26th International Joint Conference on Artificial Intelligence, IJCAI 2017
PublisherInternational Joint Conferences on Artificial Intelligence
Pages4412-4418
Number of pages7
ISBN (Electronic)9780999241103
Publication statusPublished - 2017
Event26th International Joint Conference on Artificial Intelligence, IJCAI 2017 - Melbourne, Australia
Duration: 2017 Aug 192017 Aug 25

Other

Other26th International Joint Conference on Artificial Intelligence, IJCAI 2017
CountryAustralia
CityMelbourne
Period17/8/1917/8/25

    Fingerprint

ASJC Scopus subject areas

  • Artificial Intelligence

Cite this

Sumita, H., Yonebayashi, Y., Kakimura, N., & Kawarabayashi, K. I. (2017). An improved approximation algorithm for the subpath planning problem and its generalization. In 26th International Joint Conference on Artificial Intelligence, IJCAI 2017 (pp. 4412-4418). International Joint Conferences on Artificial Intelligence.