Efficient nearest-neighbor computation for GPU-based motion planning

We present a novel k-nearest neighbor search algorithm (KNNS) for proximity computation in motion planning algorithm that exploits the computational capabilities of many-core GPUs. Our approach uses locality sensitive hashing and cuckoo hashing to construct an efficient KNNS algorithm that has linea...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Jia Pan, Lauterbach, C, Manocha, D
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Approximation algorithms Graphics processing unit Heuristic algorithms Indexing Measurement Nearest neighbor searches Planning
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!