Path Planning with Objectives Minimum Length and Maximum Clearance - Topics in Theoretical Computer Science Access content directly
Conference Papers Year : 2020

Path Planning with Objectives Minimum Length and Maximum Clearance

Abstract

In this paper, we study the problem of bi-objective path planning with the objectives minimizing the length and maximizing the clearance of the path, that is, maximizing the minimum distance between the path and the obstacles. The goal is to find Pareto optimal paths. We consider the case that the first objective is measured using the Manhattan metric and the second one using the Euclidean metric, and propose an $$O(n^3 \log n)$$ time algorithm, where n is the total number of vertices of the obstacles. Also, we state that the algorithm results in a ($$\sqrt{2}, 1$$)-approximation solution when both the objectives are measured using the Euclidean metric.
Fichier principal
Vignette du fichier
495613_1_En_8_Chapter.pdf (510.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03165382 , version 1 (10-03-2021)

Licence

Attribution

Identifiers

Cite

Mansoor Davoodi, Arman Rouhani, Maryam Sanisales. Path Planning with Objectives Minimum Length and Maximum Clearance. 3rd International Conference on Topics in Theoretical Computer Science (TTCS), Jul 2020, Tehran, Iran. pp.101-115, ⟨10.1007/978-3-030-57852-7_8⟩. ⟨hal-03165382⟩
27 View
20 Download

Altmetric

Share

Gmail Facebook X LinkedIn More