1897 search results - page 91 / 380 » Conditional Linear Planning |
120
click to vote
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
109
click to vote
ISPD
2003
ACM
15 years 8 months ago
2003
ACM
Previous works on buffer planning are mainly based on fixed die placement. It is necessary to reduce the complexity of computing the feasible buffer insertion sites to integrate t...
103
click to vote
WADS
1997
Springer
15 years 7 months ago
1997
Springer
A fundamental task for an autonomous robot is to plan its own motions. Exact approaches to the solution of this motion planning problem suffer from high worst-case running times. ...
118
click to vote
AAAI
2010
15 years 4 months ago
2010
Planning in dynamic continuous environments requires reasoning about nonlinear continuous effects, which previous Hierarchical Task Network (HTN) planners do not support. In this ...
116
click to vote
ATAL
2010
Springer
15 years 4 months ago
2010
Springer
Partially Observable Markov Decision Process (POMDP) is a popular framework for planning under uncertainty in partially observable domains. Yet, the POMDP model is riskneutral in ...