Sciweavers

350 search results - page 29 / 70
» Complexity of Planning with Partial Observability
Sort
View
SPATIALCOGNITION
2000
Springer
14 years 19 days ago
Interactive Layout Generation with a Diagrammatic Constraint Language
The paper analyzes a diagrammatic reasoning problem that consists in finding a graphical layout which simultaneously satisfies a set of constraints expressed in a formal language a...
Christoph Schlieder, Cornelius Hagen
AAAI
2012
11 years 11 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...
ICRA
2010
IEEE
136views Robotics» more  ICRA 2010»
13 years 7 months ago
Efficient planning under uncertainty for a target-tracking micro-aerial vehicle
A helicopter agent has to plan trajectories to track multiple ground targets from the air. The agent has partial information of each target's pose, and must reason about its u...
Ruijie He, Abraham Bachrach, Nicholas Roy
AAAI
2004
13 years 10 months ago
Distance Estimates for Planning in the Discrete Belief Space
We present a general framework for studying heuristics for planning in the belief space. Earlier work has focused on giving implementations of heuristics that work well on benchma...
Jussi Rintanen
AAAI
2006
13 years 10 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...