Minimum constraint removal problem for line segments is NP-hard
Year: 2025
Type: article
Abstract: In the minimum constraint removal (MCR), there is no feasible path to move from a starting point towards the goal, and the minimum constraints should be removed in order to find a collision-free path. It has been proved that MCR problem is NP-hard when constraints have arbitrary shapes or even they are in shape of convex polygons. However, it has a simple linear solution when constraints are lines and the problem is open for other cases yet. In this paper, using a reduction from Subset Sum problem, in three steps, we show that the problem is NP-hard for both weighted and unweighted line segments.
Source: Figshare
Author: sadeghi bigham, bahram
Language: English
Subfield: Computer Vision and Pattern Recognition
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W6920962983
FWCI:
Cites:
Cited by:
Related to: