---
res:
  bibo_abstract:
  - "A standard model that arises in several applications in sequential decision-making
    is partially observable Markov decision processes (POMDPs) where a decision-making
    agent interacts with an uncertain environment. A basic objective in POMDPs is
    the reachability objective, where given a target set of states, the goal is to
    eventually arrive at one of them.\r\n\r\nThe limit-sure problem asks whether reachability
    can be ensured with probability arbitrarily close to 1. In general, the limit-sure
    reachability problem for POMDPs is undecidable. However, in many practical cases,
    the most relevant question is the existence of policies with a small amount of
    memory. In this work, we study the limit-sure reachability problem for POMDPs
    with a fixed amount of memory. We establish that the computational complexity
    of the problem is NP-complete.@eng"
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Ali
      foaf_name: Asadi, Ali
      foaf_surname: Asadi
      foaf_workInfoHomepage: http://www.librecat.org/personId=02d96aae-000e-11ec-b801-cadd0a5eefbb
  - foaf_Person:
      foaf_givenName: Krishnendu
      foaf_name: Chatterjee, Krishnendu
      foaf_surname: Chatterjee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2E5DCA20-F248-11E8-B48F-1D18A9856A87
    orcid: 0000-0002-4561-241X
  - foaf_Person:
      foaf_givenName: Raimundo J
      foaf_name: Saona Urmeneta, Raimundo J
      foaf_surname: Saona Urmeneta
      foaf_workInfoHomepage: http://www.librecat.org/personId=BD1DF4C4-D767-11E9-B658-BC13E6697425
    orcid: 0000-0001-5103-038X
  - foaf_Person:
      foaf_givenName: Ali
      foaf_name: Shafiee, Ali
      foaf_surname: Shafiee
      foaf_workInfoHomepage: http://www.librecat.org/personId=2783031a-7378-11f0-b2d0-f17f1db2ebad
  bibo_volume: 286
  dct_date: 2025^xs_gYear
  dct_isPartOf:
  - http://id.crossref.org/issn/2640-3498
  dct_language: eng
  dct_publisher: ML Research Press@
  dct_title: Limit-sure reachability for small memory policies in POMDPs is NP-complete@
...
