1102 search results - page 132 / 221 » Dynamic Constraint Models for Planning and Scheduling Proble... |
PERCOM
2007
ACM
14 years 8 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
AAAI
1996
13 years 10 months ago
1996
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
DATE
2009
IEEE
14 years 3 months ago
2009
IEEE
Abstract—Many application domains require adaptive realtime embedded systems that can change their functionality over time. In such systems it is not only necessary to guarantee ...
IJCAI
2001
13 years 10 months ago
2001
In the future, webs of unmanned air and space vehicles will act together to robustly perform elaborate missions in uncertain environments. We coordinate these systems by introduci...
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...