Imagen de Portada

Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	MIT Gadgets Group, Bosboom, Jeffrey, Demaine, Erik D., Diomidova, Jenny, Hendrickson, Dylan, Layers, Hayashi, Lynch, Jayson
Formato:	Preprint
Publicado:	2020
Materias:	Computational Complexity Robotics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Pushing Blocks via Checkable Gadgets: PSPACE-completeness of Push-1F and Block/Box Dude
por: Ani, Hayashi, et al.
Publicado: (2024)

PSPACE-Hard 2D Super Mario Games: Thirteen Doors
por: MIT Hardness Group, et al.
Publicado: (2024)

Pushing Blocks without Fixed Walls via Checkable Gizmos: Push-1 is PSPACE-Complete
por: MIT Hardness Group, et al.
Publicado: (2025)

Planar Graph Orientation Frameworks, Applied to KPlumber and Polyomino Tiling
por: MIT Hardness Group, et al.
Publicado: (2026)

ASP-Completeness of Hamiltonicity in Grid Graphs, with Applications to Loop Puzzles
por: MIT Hardness Group, et al.
Publicado: (2024)

Tetris is Hard with Just One Piece Type
por: MIT Hardness Group, et al.
Publicado: (2026)

Undecidability of Tiling with a Tromino
por: ULB CompGeom Group, et al.
Publicado: (2025)

Complexity of Planar Graph Orientation Consistency, Promise-Inference, and Uniqueness, with Applications to Minesweeper Variants
por: MIT Hardness Group, et al.
Publicado: (2024)

All Polyhedral Manifolds are Connected by a 2-Step Refolding
por: Chung, Lily, et al.
Publicado: (2024)

All Polyhedral Manifolds are Connected by a 2-Step Refolding
por: Chung, Lily, et al.
Publicado: (2025)

Who Needs Crossings?: Noncrossing Linkages are Universal, and Deciding (Global) Rigidity is Hard
por: Abel, Zachary, et al.
Publicado: (2025)

Tetris with Few Piece Types
por: MIT Hardness Group, et al.
Publicado: (2024)

You Can't Solve These Super Mario Bros. Levels: Undecidable Mario Games
por: MIT Hardness Group, et al.
Publicado: (2024)

Super Guarding and Dark Rays in Art Galleries
por: MIT CompGeom Group, et al.
Publicado: (2024)

Misère Partizan Arc Kayles is PSPACE-complete, even on Planar Graphs
por: Burke, Kyle, et al.
Publicado: (2025)

Door to Door: How to Get Your Library Moving ... Painlessly.
por: Kirby, Lynn
Publicado: (1995)

UniDoorManip: Learning Universal Door Manipulation Policy Over Large-scale and Diverse Door Manipulation Environments
por: Li, Yu, et al.
Publicado: (2024)

Deltahedral Domes over Equiangular Polygons
por: MIT CompGeom Group, et al.
Publicado: (2024)

DoorINet: Door Heading Prediction through Inertial Deep Learning
por: Zakharchenko, Aleksei, et al.
Publicado: (2024)

Medieval Wall Door
por: slls666
Publicado: (2021)

Cast Iron Door
por: digitalarch
Publicado: (2022)

Behind Office Doors
Publicado: (2026)

The Devil Next Door
por: Profit, Vera B.
Publicado: (2025)

Behind Office Doors
Publicado: (2026)

Through the Back Door
por: Kochanowski, Jerzy
Publicado: (2021)

China's Opening Door
Publicado: (1983)

Programs That Open Doors.
por: Schimmel, Judith
Publicado: (1993)

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints
por: NASA Space Robots Team, et al.
Publicado: (2024)

Biogenic Design of the Flexible, Resilient, and Hard Mineral Protector in Door Snails
por: Yuri Kurihara, et al.
Publicado: (2025)

Escaping a Polygon
por: Abel, Zachary, et al.
Publicado: (2020)

Folding One Polyhedral Metric Graph into Another
por: Chung, Lily, et al.
Publicado: (2024)

Causal Walk: Debiasing Multi-Hop Fact Verification with Front-Door Adjustment
por: Zhang, Congzhi, et al.
Publicado: (2024)

Complexity of 2D Snake Cube Puzzles
por: MIT Hardness Group, et al.
Publicado: (2024)

Watching the Barn Door Open—Timing CML Stem Cell Allografts
por: Jeffrey H. Lipton
Publicado: (2025)

Hive is PSPACE-Hard
por: Andel, Daniël, et al.
Publicado: (2025)

Door jamb of Senwosret 1
por: Scan-the-World
Publicado: (2026)

This Is the Door... A Cumulative Tale
por: Brown, Judy
Publicado: (2007)

A Review on CAE-Based Door Sag Analysis and Structural Optimization in Automotive Door Systems
por: Aditya Shahane, et al.
Publicado: (2026)

Open Loop Layout Optimization: Feasible Path Planning and Exact Door-to-Door Distance Calculation
por: Shavarani, Seyed Mahdi, et al.
Publicado: (2025)

DoorBot: Closed-Loop Task Planning and Manipulation for Door Opening in the Wild with Haptic Feedback
por: Wang, Zhi, et al.
Publicado: (2025)