Image de couverture de livre

Near-Optimal Min-Sum Motion Planning in a Planar Polygonal Environment

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Agarwal, Pankaj K., Holmgren, Benjamin, Steiger, Alex
Format:	Preprint
Publié:	2025
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

Optimal Motion Planning for Two Square Robots in a Rectilinear Environment
par: Agarwal, Pankaj K., et autres
Publié: (2026)

Realizing Planar Linkages in Polygonal Domains
par: Depian, Thomas, et autres
Publié: (2026)

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

FPT Approximation Schemes for Min-Sum Radii and Min-Sum Diameters Clustering
par: Grandoni, Fabrizio, et autres
Publié: (2026)

Min-1-Planarity is NP-Hard
par: Okada, Yuto
Publié: (2026)

Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
par: Barequet, Gill, et autres
Publié: (2025)

Approximating Pareto Sum via Bounded Monotone Min-Plus Convolution
par: Gokaj, Geri, et autres
Publié: (2026)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
par: Deligkas, Argyrios, et autres
Publié: (2026)

Triangulating a Polygon with Holes in Optimal (Deterministic) Time
par: Chan, Timothy M.
Publié: (2026)

Convex Polygon Containment: Improving Quadratic to Near Linear Time
par: Chan, Timothy M., et autres
Publié: (2024)

Online Packing of Orthogonal Polygons
par: Gerlach, Tim, et autres
Publié: (2026)

Generalized k-Cell Decomposition for Visibility Planning in Polygons
par: Bahoo, Yeganeh, et autres
Publié: (2025)

On Approximability of $\ell_2^2$ Min-Sum Clustering
par: S., Karthik C., et autres
Publié: (2024)

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

Escaping a Polygon
par: Abel, Zachary, et autres
Publié: (2020)

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

Tiling with Three Polygons is Undecidable
par: Demaine, Erik D., et autres
Publié: (2024)

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

Software for the Thompson and Funk Polygonal Geometry
par: Banerjee, Hridhaan, et autres
Publié: (2025)

Robustly Guarding Polygons
par: Das, Rathish, et autres
Publié: (2024)

Partitioning a Polygon Into Small Pieces
par: Abrahamsen, Mikkel, et autres
Publié: (2022)

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

TřiVis: Versatile, Reliable, and High-Performance Tool for Computing Visibility in Polygonal Environments
par: Mikula, Jan, et autres
Publié: (2024)

A Combinatorial Proof of Universal Optimality for Computing a Planar Convex Hull
par: van der Hoog, Ivor, et autres
Publié: (2025)

Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons
par: Boomari, Hossein, et autres
Publié: (2018)

Compatible Triangulations of Simple Polygons
par: Afshani, Peyman, et autres
Publié: (2026)

Ipelets for the Convex Polygonal Geometry
par: Parepally, Nithin, et autres
Publié: (2024)

Structure-preserving Planar Simplification for Indoor Environments
par: Khanal, Bishwash, et autres
Publié: (2024)

Multirobot Watchman Routes in a Simple Polygon
par: Mitchell, Joseph S. B., et autres
Publié: (2024)

Bounding a Polygon by a Minimum Number of Vertices
par: Abrahamsen, Mikkel, et autres
Publié: (2025)

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

Touring a Sequence of Orthogonal Polygons
par: Casel, Katrin, et autres
Publié: (2026)

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

Bicriteria Polygon Aggregation with Arbitrary Shapes
par: Blank, Lotte, et autres
Publié: (2025)

Multiple Watchman Routes in Staircase Polygons
par: Brötzner, Anna, et autres
Publié: (2025)

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

Covering Simple Orthogonal Polygons with Rectangles
par: Roy, Aniket Basu
Publié: (2024)

Shadoks Approach to Knapsack Polygonal Packing
par: da Fonseca, Guilherme D., et autres
Publié: (2024)

Computing Planar Convex Hulls with a Promise
par: Aghamolaei, Sepideh, et autres
Publié: (2026)

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