Skip to Main Content Area
CPS-VO
Contact Support
Browse
Calendar
Announcements
Repositories
Groups
Search
Search for Content
Search for a Group
Search for People
Search for a Project
Tagcloud
› Go to login screen
Not a member?
Click here to register!
Forgot username or password?
Cyber-Physical Systems Virtual Organization
Read-only archive of site from September 29, 2023.
CPS-VO
asymptotic computational bottleneck
biblio
Asymptotically Optimal Pruning for Nonholonomic Nearest-Neighbor Search
Submitted by grigby1 on Fri, 05/22/2020 - 2:39pm
distance evaluations
tree searching
set theory
sampling-based motion planning algorithms
pruning techniques
Path Planning
optimal pruning
nonholonomic constraints
k-d tree algorithm
geodesic distance
explicit distance comparisons
exact Nearest-Neighbor Search
pubcrawl
differential geometry
computationally demanding task
asymptotic properties
asymptotic computational bottleneck
nearest neighbor search
search problems
computational complexity
nearest neighbour methods
Measurement
Metrics
mobile robots
