ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1607.04800
  4. Cited By
Collision detection or nearest-neighbor search? On the computational
  bottleneck in sampling-based motion planning

Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning

16 July 2016
Michal Kleinbort
Oren Salzman
Dan Halperin
ArXivPDFHTML

Papers citing "Collision detection or nearest-neighbor search? On the computational bottleneck in sampling-based motion planning"

4 / 4 papers shown
Title
Configuration Space Decomposition for Scalable Proxy Collision Checking
  in Robot Planning and Control
Configuration Space Decomposition for Scalable Proxy Collision Checking in Robot Planning and Control
Mrinal Verghese
Nikhil Das
Yuheng Zhi
Michael C. Yip
22
11
0
12 Jan 2022
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
AIT* and EIT*: Asymmetric bidirectional sampling-based path planning
Marlin P. Strub
Jonathan Gammell
16
50
0
02 Nov 2021
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path
  Planning through Adaptive Heuristics
Adaptively Informed Trees (AIT*): Fast Asymptotically Optimal Path Planning through Adaptive Heuristics
Marlin P. Strub
Jonathan Gammell
16
78
0
16 Feb 2020
Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime
  Search
Batch Informed Trees (BIT*): Informed Asymptotically Optimal Anytime Search
Jonathan Gammell
T. Barfoot
S. Srinivasa
24
146
0
06 Jul 2017
1