93 citations · 190 across the 37 of their papers we have counts for
Showing 2016Show all
3 papers · 1 filter
cs.RO2016★ 1 cited
Efficient sampling-based bottleneck pathfinding over cost maps
Kiril Solovey, Dan Halperin
We introduce a simple yet effective sampling-based planner that is tailored for bottleneck pathfinding: Given an implicitly-defined cost map $\mathcal{M}:\mathbb{R}^d\rightarrow \m…
cs.CG2016★ 1 cited
Sampling-based bottleneck pathfinding with applications to Frechet matching
Kiril Solovey, Dan Halperin
We describe a general probabilistic framework to address a variety of Frechet-distance optimization problems. Specifically, we are interested in finding minimal bottleneck-paths in…
cs.RO2016★ 13 cited
New perspective on sampling-based motion planning via random geometric graphs
Kiril Solovey, Oren Salzman, Dan Halperin
Roadmaps constructed by many sampling-based motion planners coincide, in the absence of obstacles, with standard models of random geometric graphs (RGGs). Those models have been st…