Sciweavers

75 search results - page 8 / 15
» A Correctness Result for Reasoning about One-Dimensional Pla...
Sort
View
AIPS
2009
13 years 8 months ago
Computing Robust Plans in Continuous Domains
We define the robustness of a sequential plan as the probability that it will execute successfully despite uncertainty in the execution environment. We consider a rich notion of u...
Christian Fritz, Sheila A. McIlraith
ATAL
2008
Springer
13 years 9 months ago
The permutable POMDP: fast solutions to POMDPs for preference elicitation
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
Finale Doshi, Nicholas Roy
KBSE
1998
IEEE
13 years 11 months ago
Planning Equational Verification in CCS
Most efforts to automate formal verification of communicating systems have centred around finite-state systems (FSSs). However, FSSs are incapable of modelling many practical comm...
Raul Monroy, Alan Bundy, Ian Green
ICRA
2008
IEEE
123views Robotics» more  ICRA 2008»
14 years 1 months ago
Target-directed attention: Sequential decision-making for gaze planning
— It is widely agreed that efficient visual search requires the integration of target-driven top-down information and image-driven bottom-up information. Yet the problem of gaze...
Julia Vogel, Nando de Freitas
JAIR
2006
90views more  JAIR 2006»
13 years 7 months ago
Engineering Benchmarks for Planning: the Domains Used in the Deterministic Part of IPC-4
In a field of research about general reasoning mechanisms, it is essential to have appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the deve...
Jörg Hoffmann, Stefan Edelkamp, Sylvie Thi&ea...