Presented by Alp Sardağ Algorithms for POMDP. Monahan Enumeration Phase Generate all vectors:...

Presented by Alp Sardağ

Algorithms for POMDP

Monahan Enumeration Phase

Generate all vectors:Number of gen. Vectors = |A|M||

where M vectors of previous state

Monahan Reduction PhaseAll vectors can be kept:

Each time maximize over all vectors.Lot of excess baggageThe number of vectors in next step will be even large.

LP used to trim away useless vectors

Monahan Reduction PhaseFor a vector to be useful, there must be at least one belief point it gives larger value than others:

Monahan Algorithm

Monahan’s LP Complication

Formulate LP and check for :

Eagle’s Variant of MonahanThe optimization occurs in enumaration phase.If, in the enumaration process, a vector’s components are completely dominated by another vector’s component, discard it. Generate j

i(t) and following condition holds:

Discard ji(t).

Can be applied to check new vector dominates any vector previously enumarated.

Sondik’s One-Pass Algorithm

Find theproper set of belief states to plug into the below formula to get all necessary vectors:

The algorithm is guaranteed to visit finite number of regions.The union of these regions is the entire belief space.

Simplified version of Sondik’s algorithm:


How to define a region around this belief state where that vector is guaranteed to be true linear portion of the value function?Construct a series of constraints when satisfied, region is found.Then go step (5)


The condition *(t), generated at , larger for all other a(t), as varies:

Variations in can cause changes in a(t).Need a new constraint to ensure components of a(t) stay the same.


What affects *(t) and a(t)?

To ensure that every part of the function does not change, these constraint exists for every combination of a and


Constraints restrict belief states to lie on the belief state space simplex:


A constraint consists of a region with all the points on one side of the line:


The LP constraints at step (4):


In step (5), find belief states guaranteed not to be in region defined in step (4).With the new point proceed exactly as step (4).The algorithm goes until a complete partition of the belief space found.


To find points in the neighboring regions, points lying on the edge of the region defined by the constraints is used:


Which constraints are binding:For each constraint, change its inequality into an equality,Solve this LP.

If the LP has solution, it is a binding constraint, a non-binding constraint can not pass through the region defined by all other constraints.


Cheng’s Relaxed Region

Same as Sondik’s One Pass algorithm except each region specified with fewer constraints.Defines regions that will typically be larger than the actual vectors’ regions.

Set of constraints for the relaxed regions of Cheng:



Corners found with interior algorithm:

The algorithm defines an approximate value function over the entire belief space.Refine this approximation until it reaches the optimal value function.

Cheng’s Linear Support

Difference between two algorithms:


Initiliaze a search list with extreme points on the belief simplex(e.g. [1,0,0...],[0,1,0,0...]), and an empty set of vectors.For each of these points the true (t) vector calculated, and added to the set of vectors.


Since both the true and the approximation are PWLC, the largest difference must occur at a corner point.Cheng then finds all the corner points of the regionsinduced by the approximation.Disregard the corner points seen before and add those not seen before to search list.Pick a point from the search list, generate the vector. If it is different all the other approximation, add it to the approximation set. Repeat whole procedure with the new approximation


Presented by Alp Sardağ Algorithms for POMDP. Monahan Enumeration Phase Generate all vectors:...

Documents

Transcript of Presented by Alp Sardağ Algorithms for POMDP. Monahan Enumeration Phase Generate all vectors:...