AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Three New Algorithms to Solve N-POMDPs

Yann Dujardin, Tom Dietterich, Iadine Chadès

AAAI 2017 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristics for integer programming · 12 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
search for the best combination of N alpha-vectors (α-min-2-solve) instead of greedy addition (α-min)N-POMDP solver · milos-aaai97lower bound of V0(b0): 50.31 -> 54.76Improved
α-min-2-solve instead of α-minN-POMDP solver · aloha.10lower bound of V0(b0): 62.66 -> 63.51Improved
α-min-2-solve instead of α-minN-POMDP solver · cheng.D4-5lower bound of V0(b0): 77.85 -> 77.90Improved
α-min-2-solve instead of α-minN-POMDP solver · dujardin-ijcai15computation time (s): 37.8 -> < 1Improved
add beta-points and a lower bound (α-min-2-p instead of α-min-2-fast)α-min-2 with SARSOP initial policy · TagAvoid, N=10gap: gap > 10 -> 5.98Improved
add beta-points and a lower bound (α-min-2-p instead of α-min-2-fast)α-min-2 with SARSOP initial policy · TagAvoid, N=10computation time (s): < 3 -> 3389Hurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy