Image de couverture de livre

Optimal Motion Planning for Two Square Robots in a Rectilinear Environment

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Agarwal, Pankaj K., de Berg, Mark, Holmgren, Benjamin, Steiger, Alex, Struijs, Martijn
Format:	Preprint
Publié:	2026
Sujets:	Computational Geometry
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Near-Optimal Min-Sum Motion Planning in a Planar Polygonal Environment
par: Agarwal, Pankaj K., et autres
Publié: (2025)

On Approximation Schemes for Stabbing Rectilinear Polygons
par: Khan, Arindam, et autres
Publié: (2024)

Minimum Exposure Motion Planning
par: de Berg, Sarita, et autres
Publié: (2026)

Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons
par: Biedl, Therese, et autres
Publié: (2024)

Unit Edge-Length Rectilinear Drawings with Crossings and Rectangular Faces
par: Angelini, Patrizio, et autres
Publié: (2025)

Search-Based Robot Motion Planning With Distance-Based Adaptive Motion Primitives
par: Kraljusic, Benjamin, et autres
Publié: (2025)

On the Parameterized Complexity of Motion Planning for Rectangular Robots
par: Kanj, Iyad, et autres
Publié: (2024)

Nearly-Tight Bounds for Vertical Decomposition in Three and Four Dimensions
par: Agarwal, Pankaj K., et autres
Publié: (2026)

Semi-Algebraic Off-line Range Searching and Biclique Partitions in the Plane
par: Agarwal, Pankaj K., et autres
Publié: (2024)

Rectilinear Crossing Number of Graphs Excluding Single-Crossing Graphs as Minors
par: Dujmović, Vida, et autres
Publié: (2024)

Dynamic Nearest-Neighbor Searching Under General Metrics in ${\mathbb R}^3$ and Its Applications
par: Agarwal, Pankaj K., et autres
Publié: (2026)

A Coreset for Approximate Furthest-Neighbor Queries in a Simple Polygon
par: de Berg, Mark, et autres
Publié: (2024)

The Rectilinear Marco Polo Problem
par: Gila, Ofek, et autres
Publié: (2025)

Universal Solvability for Robot Motion Planning on Graphs
par: Dhar, Anubhav, et autres
Publié: (2025)

An $O(n\log n)$ Algorithm for Single-Source Shortest Paths in Disk Graphs
par: de Berg, Mark, et autres
Publié: (2025)

On Stable Approximation Algorithms for Geometric Coverage Problems
par: de Berg, Mark, et autres
Publié: (2024)

Unlabeled Multi-Robot Motion Planning with Improved Separation Trade-offs
par: Farhana, Tsuri, et autres
Publié: (2026)

Fast Approximation Algorithms for Piercing Boxes by Points
par: Agarwal, Pankaj K., et autres
Publié: (2023)

Improved Bounds for Discrete Voronoi Games
par: de Berg, Mark, et autres
Publié: (2026)

Effective Sampling for Robot Motion Planning Through the Lens of Lattices
par: Panasoff, Itai, et autres
Publié: (2025)

On the Doubling Dimension and the Perimeter of Geodesically Convex Sets in Fat Polygons
par: de Berg, Mark, et autres
Publié: (2026)

Intersection Queries for Flat Semi-Algebraic Objects in Three Dimensions and Related Problems
par: Agarwal, Pankaj K., et autres
Publié: (2022)

Boosting Rectilinear Steiner Minimum Tree Algorithms with Augmented Bounding Volume Hierarchy
par: Yang, Puhan, et autres
Publié: (2025)

Instance-Optimal Imprecise Convex Hull
par: de Berg, Sarita, et autres
Publié: (2025)

Certifying Bimanual RRT Motion Plans in a Second
par: Amice, Alexandre, et autres
Publié: (2023)

Minimum-Length Coordinated Motions For Two Convex Centrally-Symmetric Robots
par: Kirkpatrick, David, et autres
Publié: (2025)

Towards Space Efficient Two-Point Shortest Path Queries in a Polygonal Domain
par: de Berg, Sarita, et autres
Publié: (2023)

Optimally Packing a Large Square by Unit Squares
par: McClenagan, Rory
Publié: (2026)

Square Packing with Asymptotically Smallest Waste Only Needs Good Squares
par: Bui, Hong Duc
Publié: (2025)

Nearest Neighbor Searching in a Dynamic Simple Polygon
par: de Berg, Sarita, et autres
Publié: (2025)

Embeddings to Rectilinear Space and Gromov-Hausdorff Distances
par: Ivanov, A. O., et autres
Publié: (2024)

Lower Bounds for Dominating Set in Ball Graphs and for Weighted Dominating Set in Unit-Ball Graphs
par: de Berg, Mark, et autres
Publié: (2026)

Optimal Algorithm for the Planar Two-Center Problem
par: Cho, Kyungjin, et autres
Publié: (2020)

A Clique-Based Separator for Intersection Graphs of Geodesic Disks in $\mathbb{R}^2$
par: Aronov, Boris, et autres
Publié: (2024)

Towards Practical Finite Sample Bounds for Motion Planning in TAMP
par: Shaw, Seiji, et autres
Publié: (2024)

Euclidean TSP in Narrow Strips
par: Alkema, Henk, et autres
Publié: (2020)

Reconfiguration of Squares Using a Constant Number of Moves Each
par: van der Horst, Thijs, et autres
Publié: (2026)

Star-Based Separators for Intersection Graphs of $c$-Colored Pseudo-Segments
par: de Berg, M., et autres
Publié: (2025)

Gromov-Wasserstein at Scale, Beyond Squared Norms
par: Houry, Guillaume, et autres
Publié: (2026)

Online Hitting Set for Axis-Aligned Squares
par: De, Minati, et autres
Publié: (2025)