Search Results for author: Erez Karpas

Found 8 papers, 2 papers with code

Planning and Acting While the Clock Ticks

no code implementations21 Mar 2024 Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf Shperberg

Recently, situated temporal planning was introduced, where planning starts at time 0 and execution occurs after planning terminates.

A Formal Metareasoning Model of Concurrent Planning and Execution

1 code implementation5 Mar 2023 Amihay Elboher, Ava Bensoussan, Erez Karpas, Wheeler Ruml, Shahaf S. Shperberg, Solomon E. Shimony

When timing is tight, there may be insufficient time to complete the search for a plan before it is time to act.

Understanding Natural Language in Context

no code implementations25 May 2022 Avichai Levy, Erez Karpas

In this paper, we focus on cognitive robots, which have some knowledge-based models of the world and operate by reasoning and planning with this model.

Generalized Planning With Deep Reinforcement Learning

no code implementations5 May 2020 Or Rivlin, Tamir Hazan, Erez Karpas

A hallmark of intelligence is the ability to deduce general principles from examples, which are correct beyond the range of those observed.

reinforcement-learning Reinforcement Learning (RL)

Automated Tactical Decision Planning Model with Strategic Values Guidance for Local Action-Value-Ambiguity

no code implementations30 Nov 2018 Daniel Muller, Erez Karpas

This paper proposes an offline action-value structure analysis to exploit the compactly represented informativeness of net utility of actions to extend the scope of planning to value uncertainty scenarios and to provide a real-time value-rational decision planning tool.

Informativeness

Online Speedup Learning for Optimal Planning

no code implementations23 Jan 2014 Carmel Domshlak, Erez Karpas, Shaul Markovitch

A description of a planning task consists of an initial world state, a goal, and a set of actions for modifying the world state.

Towards Rational Deployment of Multiple Heuristics in A*

no code implementations22 May 2013 David Tolpin, Tal Beja, Solomon Eyal Shimony, Ariel Felner, Erez Karpas

The obvious way to use several admissible heuristics in A* is to take their maximum.

Cannot find the paper you are looking for? You can Submit a new open access paper.