Corpus ID: 235755497

Minimum Constraint Removal Problem for Line Segments is NP-hard

  title={Minimum Constraint Removal Problem for Line Segments is NP-hard},
  author={Bahram Sadeghi Bigham},
In the minimum constraint removal (MCR), there is no feasible path to move from the 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… Expand

Figures from this paper


A polynomial time algorithm for big data in a special case of minimum constraint removal problem
This paper presents a deterministic (not approximation) algorithm that solve the minimum constraint removal problem in a polynomial time and proposes an algorithm for this variant of the problem which can be used for big data. Expand
Computational Tradeoffs of Search Methods for Minimum Constraint Removal Paths
This work investigates alternatives in this context and evaluates their performance in terms of such tradeoffs, finding solutions that provide a good balance between minimizing constraints, computational cost and path length. Expand
The Minimum Constraint Removal Problem with Three Robotics Applications
A probabilistic roadmap motion planner for MCR in continuous configuration spaces that operates by constructing increasingly refined roadmaps, and efficiently solves discrete MCR problems on these networks. Expand
A Simple, but NP-Hard, Motion Planning Problem
It is demonstrated that the minimum constraint removal problem is NP-hard for navigation in the plane even when the obstacles are all convex polygons, a case where the path existence problem is very easy. Expand
Solving minimum constraint removal (MCR) problem using a social-force-model-based ant colony algorithm
The social force model was used to improve the ant colony algorithm, such that it would not easily fall into local extreme and became suitable for solving the MCR problem, and the algorithm was superior to the exact algorithm and greedy algorithm in terms of solution quality and running time. Expand
Minimum Constraint Displacement Motion Planning
A sampling-based planner that asymptotically approaches the globally optimal solution as more time is spent planning is presented, and key developments are efficient data structures that allow the planner to select small subsets of obstacles and their displacements that are candidates for improving the current best solution. Expand
Disconnection proofs for motion planning
This work proposes to attack the motion planning problem from the other end, focusing on disconnection proofs, or proofs showing that there exists no solution to the posed motion planner problem, to resolve the existence of a path, except in truly delicate border-line situations. Expand
Navigation among Movable Obstacles: Real-Time Reasoning in Complex Environments
This paper presents a resolution complete planner for a subclass of NAMO problems that takes advantage of the navigational structure through state-space decomposition and heuristic search, and presents a practical framework for single-agent search that can be used in algorithmic reasoning about this domain. Expand
Near-pole polar diagram of objects and duality
The near-pole polar diagram NPPD for a set of points is presented and can be considered as a generalization of the polar diagram and has applications in several communication systems and robotics problems. Expand
Approximating Barrier Resilience in Wireless Sensor Networks
This paper revisits a notion of redundant barrier coverage known as k-barrier coverage and demonstrates that any (Euclidean) shortest path from S to T that intersects a fixed number of distinct sensors, never intersects any one sensor more than three times. Expand