no code implementations • 15 Aug 2023 • Eyal Weiss, Ariel Felner, Gal A. Kaminka
This is a generalization of the shortest path problem to bounded uncertainty, where edge-weight uncertainty can be traded for computational cost.
1 code implementation • 22 Aug 2022 • Eyal Weiss, Ariel Felner, Gal A. Kaminka
The shortest path problem in graphs is a cornerstone of AI theory and applications.
no code implementations • 26 Jun 2022 • Teddy Lazebnik, Hanna Weitman, Yoav Goldberg, Gal A. Kaminka
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.
no code implementations • 8 Jun 2022 • Eyal Weiss, Gal A. Kaminka
Information about action costs is critical for real-world AI planning applications.
no code implementations • 7 Jun 2022 • Eyal Weiss, Gal A. Kaminka
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.
no code implementations • 28 Sep 2017 • Mor Vered, Gal A. Kaminka
However, existing PRP formulation is inherently inefficient in online recognition, and cannot be used with motion planners for continuous spaces.