2016
DOI: 10.1007/978-3-319-46073-4_5
|View full text |Cite
|
Sign up to set email alerts
|

A Fast Elimination Method for Pruning in POMDPs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2018
2018

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…Pruning algorithms often aim to remove unnecessary or dominated vectors from the value function; otherwise, the number of possible vectors will increase quickly and can lead to slowing down the process of nding an optimal policy in the steps of the exact value iteration algorithm. This property is used for representing the value function by a nite set of jSj-dimensional vectors, = f 0 ; 1 ; : : : ; k g, in which the belief point b has a value of V (b) = max n 2 b: n , where \:" denotes \dot product"(for more details about this, refer to [56] or [57]). The CBSM model proposed in the present paper can also be rewritten in the vector form.…”
Section: Accelerated Vector Pruning (Avp) and Incremental Pruning (Ip) Methodsmentioning
confidence: 99%
“…Pruning algorithms often aim to remove unnecessary or dominated vectors from the value function; otherwise, the number of possible vectors will increase quickly and can lead to slowing down the process of nding an optimal policy in the steps of the exact value iteration algorithm. This property is used for representing the value function by a nite set of jSj-dimensional vectors, = f 0 ; 1 ; : : : ; k g, in which the belief point b has a value of V (b) = max n 2 b: n , where \:" denotes \dot product"(for more details about this, refer to [56] or [57]). The CBSM model proposed in the present paper can also be rewritten in the vector form.…”
Section: Accelerated Vector Pruning (Avp) and Incremental Pruning (Ip) Methodsmentioning
confidence: 99%