ملف الباحث
Siddhartha S Srinivasa
3 أوراق في مجموعة PaperMetrix
المنشورات
أوراق هذا المؤلف
-
Near-Optimal Edge Evaluation in Explicit Generalized Binomial Graphs
2017 · arXiv (Cornell University)
Robotic motion-planning problems, such as a UAV flying fast in a partially-known environment or a robot arm moving around cluttered objects, require finding collision-free paths quickly. Typically, this is solved by constructing a graph, where …
-
A Unifying Formalism for Shortest Path Problems with Expensive Edge\n Evaluations via Lazy Best-First Search over Paths with Edge Selectors
2016 · arXiv (Cornell University)
While the shortest path problem has myriad applications, the computational\nefficiency of suitable algorithms depends intimately on the underlying problem\ndomain. In this paper, we focus on domains where evaluating the edge weight\nfunction dominates algorithm running time. …