ResearchTrend.AI
Tightest Admissible Shortest Path
v1v2 (latest)

Tightest Admissible Shortest Path

Eyal Weiss
Ariel Felner
G. Kaminka
ArXiv (abs)PDFHTML

Papers citing "Tightest Admissible Shortest Path"

5 / 5 papers shown
Title
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
Eyal Weiss
Ariel Felner
G. Kaminka
23
2
0
22 Aug 2022
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles
Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles
Aditya Mandalika
Sanjiban Choudhury
Oren Salzman
S. Srinivasa
67
58
0
04 Apr 2019
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
Aditya Mandalika
Oren Salzman
S. Srinivasa
53
50
0
13 Mar 2018
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors
Christopher M. Dellin
S. Srinivasa
36
71
0
10 Mar 2016
The Fast Downward Planning System
The Fast Downward Planning System
M. Helmert
90
1,906
0
27 Sep 2011

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.