Plans are predicated on an assumed initial state, but this state can change unexpectedly during plan generation, po- tentially invalidating the planning effort.
May 9, 2012 · In this paper we make three contributions: (1) We propose a novel algorithm for generating optimal plans in settings where frequent, unexpected ...
A novel algorithm for generating optimal plans in settings where frequent, unexpected events interfere with planning is proposed, able to quickly ...
Jun 18, 2009 · In this paper we make three contributions: (1) We propose a novel algorithm for generating optimal plans in settings where frequent, unexpected ...
Bibliographic details on Generating Optimal Plans in Highly-Dynamic Domains.
Generating Optimal Plans in Highly-Dynamic Domains. Fritz, C. & McIlraith, S. A. In Bilmes, J. A. & Ng, A. Y., editors, UAI 2009, Proceedings of the Twenty ...
A plan formed by the robot is dso high-level, typically having the following kind of form: Travel to the end of the corridor. turn right, tbm go to the ...
Missing: Optimal | Show results with:Optimal
Generating Optimal Plans in Highly-Dynamic Domains. Fritz, C. & McIlraith, S. A. CoRR, 2012. Generating Optimal Plans in Highly-Dynamic Domains [link] Paper ...
The planner is based on a stochastic local search procedure that explores a space of partial plans represented through linear action graphs, which are variants ...
Missing: Optimal | Show results with:Optimal
In this paper, we address the problem of planning in nondeterministic domains by taking nondeterminism into account from the very start. There is already a well ...