Search Results for author:
Found 6 papers, 1 papers with code
Tightest Admissible Shortest Path
This is a generalization of the shortest path problem to bounded uncertainty, where edge-weight uncertainty can be traded for computational cost.
A Generalization of the Shortest Path Problem to Graphs with Multiple Edge-Cost Estimates
The shortest path problem in graphs is a cornerstone of AI theory and applications.
Rivendell: Project-Based Academic Search Engine
We posit that in searching for research papers, a combination of a life-time search engine with an explicitly-provided context (project) provides a solution to the concept drift problem.
Planning with Dynamically Estimated Action Costs
Information about action costs is critical for real-world AI planning applications.
Position Paper: Online Modeling for Offline Planning
We therefore suggest to change the AI planning process, such that is carries out online modeling in offline planning, i. e., the use of action models that are computed or even generated as part of the planning process, as they are accessed.
Heuristic Online Goal Recognition in Continuous Domains
However, existing PRP formulation is inherently inefficient in online recognition, and cannot be used with motion planners for continuous spaces.
