Edge Nearest Neighbor in Sampling-Based Motion Planning
Fuente:
arXiv
Saved in:
| Main Authors: | Ashur, Stav, Amato, Nancy M., Har-Peled, Sariel |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Faster Motion Planning via Restarts
by: Amato, Nancy, et al.
Published: (2025)
by: Amato, Nancy, et al.
Published: (2025)
Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025)
by: Ashur, Stav, et al.
Published: (2025)
SPITE: Simple Polyhedral Intersection Techniques for modified Environments
by: Ashur, Stav, et al.
Published: (2024)
by: Ashur, Stav, et al.
Published: (2024)
Quick Heuristic Validation of Edges in Dynamic Roadmap Graphs
by: Arad, Yulie, et al.
Published: (2026)
by: Arad, Yulie, et al.
Published: (2026)
Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)
by: Giliberti, Jeff, et al.
Published: (2026)
A Framework for Guided Motion Planning
by: Attali, Amnon, et al.
Published: (2024)
by: Attali, Amnon, et al.
Published: (2024)
A Practical Approach for Computing the Diameter of a Point Set
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
The Complexity of One or Many Faces in the Overlay of Many Arrangements
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
An Easy Proof of a Weak Version of Chernoff inequality
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
Bifurcation: How to Explore a Tree
by: Har-Peled, Sariel
Published: (2025)
by: Har-Peled, Sariel
Published: (2025)
An Output Sensitive Algorithm for Discrete Convex Hulls
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
Separator for $c$-Packed Segments and Curves
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
A Simple Proof of the Existence of a Planar Separator
by: Har-Peled, Sariel
Published: (2011)
by: Har-Peled, Sariel
Published: (2011)
Approximately: Independence Implies Vertex Cover
by: Har-Peled, Sariel
Published: (2023)
by: Har-Peled, Sariel
Published: (2023)
How to Get Close to the Median Shape
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
The Prophet and the Voronoi Diagram
by: Har-Peled, Sariel
Published: (2026)
by: Har-Peled, Sariel
Published: (2026)
Serialized Red-Green-Gray: Quicker Heuristic Validation of Edges in Dynamic Roadmap Graphs
by: Arad, Yulie, et al.
Published: (2026)
by: Arad, Yulie, et al.
Published: (2026)
Multi-Robot Motions in Milliseconds: Vector-Accelerated Primitives for Sampling-Based Planning
by: Motes, James D., et al.
Published: (2026)
by: Motes, James D., et al.
Published: (2026)
The Road to the Closest Point is Paved by Good Neighbors
by: Har-Peled, Sariel, et al.
Published: (2025)
by: Har-Peled, Sariel, et al.
Published: (2025)
Deep Fuzzy Optimization for Batch-Size and Nearest Neighbors in Optimal Robot Motion Planning
by: Zhang, Liding, et al.
Published: (2025)
by: Zhang, Liding, et al.
Published: (2025)
Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions
by: Barequet, Gill, et al.
Published: (2025)
by: Barequet, Gill, et al.
Published: (2025)
Polygon Containment and Translational Min-Hausdorff-Distance between Segment Sets are 3SUM-Hard
by: Barequet, Gill, et al.
Published: (2025)
by: Barequet, Gill, et al.
Published: (2025)
Approximating Densest Subgraph in Geometric Intersection Graphs
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
How Packed Is It, Really?
by: Har-Peled, Sariel, et al.
Published: (2021)
by: Har-Peled, Sariel, et al.
Published: (2021)
Net and Prune: A Linear Time Algorithm for Euclidean Distance Problems
by: Har-Peled, Sariel, et al.
Published: (2014)
by: Har-Peled, Sariel, et al.
Published: (2014)
Near-Optimal Euclidean Locality-Sensitive Orderings
by: Gao, Zhimeng, et al.
Published: (2023)
by: Gao, Zhimeng, et al.
Published: (2023)
In the Search for Good Neck Cuts
by: Ruggerio, Sam, et al.
Published: (2026)
by: Ruggerio, Sam, et al.
Published: (2026)
Proof of Dudley's Convex Approximation
by: Har-Peled, Sariel, et al.
Published: (2019)
by: Har-Peled, Sariel, et al.
Published: (2019)
APT*: Asymptotically Optimal Motion Planning via Adaptively Prolated Elliptical R-Nearest Neighbors
by: Zhang, Liding, et al.
Published: (2025)
by: Zhang, Liding, et al.
Published: (2025)
Experience-based Subproblem Planning for Multi-Robot Motion Planning
by: Solis, Irving, et al.
Published: (2024)
by: Solis, Irving, et al.
Published: (2024)
Path Database Guidance for Motion Planning
by: Attali, Amnon, et al.
Published: (2025)
by: Attali, Amnon, et al.
Published: (2025)
Improving the average dilation of a metric graph by adding edges
by: Har-Peled, Sariel, et al.
Published: (2025)
by: Har-Peled, Sariel, et al.
Published: (2025)
New Constructions of SSPDs and their Applications
by: Abam, Mohammad A., et al.
Published: (2025)
by: Abam, Mohammad A., et al.
Published: (2025)
Orthogonal Emptiness Queries for Random Points
by: Dullerud, Jonathan E., et al.
Published: (2025)
by: Dullerud, Jonathan E., et al.
Published: (2025)
No-dimensional Tverberg Partitions Revisited
by: Har-Peled, Sariel, et al.
Published: (2023)
by: Har-Peled, Sariel, et al.
Published: (2023)
Dependable Spanners via Unreliable Edges
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
From Legible to Inscrutable Trajectories: (Il)legible Motion Planning Accounting for Multiple Observers
by: Yammanuru, Ananya, et al.
Published: (2026)
by: Yammanuru, Ananya, et al.
Published: (2026)
Oracle-Augmented Prophet Inequalities
by: Har-Peled, Sariel, et al.
Published: (2024)
by: Har-Peled, Sariel, et al.
Published: (2024)
HAS-RRT: RRT-based Motion Planning using Topological Guidance
by: Uwacu, Diane, et al.
Published: (2023)
by: Uwacu, Diane, et al.
Published: (2023)
Lazy-DaSH: Lazy Approach for Hypergraph-based Multi-robot Task and Motion Planning
by: Lee, Seongwon, et al.
Published: (2025)
by: Lee, Seongwon, et al.
Published: (2025)
Similar Items
-
Faster Motion Planning via Restarts
by: Amato, Nancy, et al.
Published: (2025) -
Quickly Avoiding a Random Catastrophe
by: Ashur, Stav, et al.
Published: (2025) -
SPITE: Simple Polyhedral Intersection Techniques for modified Environments
by: Ashur, Stav, et al.
Published: (2024) -
Quick Heuristic Validation of Edges in Dynamic Roadmap Graphs
by: Arad, Yulie, et al.
Published: (2026) -
Graph-Based Nearest-Neighbor Search without the Spread
by: Giliberti, Jeff, et al.
Published: (2026)