2 papers
cs.DB2024
CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion
Xianzhi Zeng, Zhuoyan Wu, Xinjing Hu +3
Approximate K Nearest Neighbor (AKNN) algorithms play a pivotal role in various AI applications, including information retrieval, computer vision, and natural language processing.…
cs.RO2024
Time-optimal Point-to-point Motion Planning: A Two-stage Approach
Shuhao Zhang, Jan Swevers
This paper proposes a two-stage approach to formulate the time-optimal point-to-point motion planning problem, involving a first stage with a fixed time grid and a second stage wit…