How to Navigate Through Obstacles

DOI10.4230/LIPIcs.ICALP.2018.48zbMath1499.68364arXiv1712.04043OpenAlexW2963430450MaRDI QIDQ5002723

Eduard Eiben, Iyad A. Kanj

Publication date: 28 July 2021

Full work available at URL: https://arxiv.org/abs/1712.04043

zbMATH Keywords

motion planningplanar graphparameterized complexitybarrier coveragebarrier resiliencecolored pathminimum constraint removal

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

The Parameterized Complexity of Motion Planning for Snake-Like Robots

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Multi-path algorithms for minimum-colour path problems with applications to approximating barrier resilience
• Graph minors. III. Planar tree-width
• On the complexity of barrier resilience for fat regions and bounded ply
• Minimum Cell Connection in Line Segment Arrangements

This page was built for publication: How to Navigate Through Obstacles