Robotic bees: Algorithms for collision detection and prevention
Abstract
In the following paper we will discuss data structures suited for distance threshold queries keeping in mind real life application such as collision detection on robotic bees. We will focus on spatial hashes designed to store 3D points and capable of fastly determining which of them surpass a specific threshold from any other. In this paper we will discuss related literature, explain in depth the data structure chosen with its design criteria, operations and speed and memory efficiency analysis.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.