Metraipolis › archive › dc_949a26bd9ffe

Windowed A-K-MDP — arXiv:2609.13676

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.13676
License (as archived)
CC0-1.0
Archived
2026-10-15T22:47:09.959Z
SHA-256 of the archived text
c0c7bc2655dc6fc5a52baeefc351901e564d25ddbdd5681d38344025d198543f
Stable URL of this page
https://metraipolis.com/documento/dc_949a26bd9ffe

How to cite

Windowed A-K-MDP — arXiv:2609.13676 — arXiv (en), https://arxiv.org/abs/2609.13676 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_949a26bd9ffe (Metraipolis archive dc_949a26bd9ffe, sha256 c0c7bc2655dc6fc5a52baeefc351901e564d25ddbdd5681d38344025d198543f)
BibTeX
@misc{dc949a26bd9ffe,
  title = {Windowed A-K-MDP — arXiv:2609.13676},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.13676},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_949a26bd9ffe; sha256 c0c7bc2655dc6fc5a52baeefc351901e564d25ddbdd5681d38344025d198543f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.13676. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Markov decision processes (MDPs) are used to support decision-making in conservation of biodiversity, but policies, even over small state spaces, can be difficult to interpret for conservation managers. K-MDP methods address this problem by building simpler MDPs with at most K abstract states. We show that the previously proposed A-K-MDP algorithm that relies on selecting a discretisation divisor using binary search can skip better abstract states. To fix this issue, we propose Windowed A-K-MDP, an algorithm that generates every distinct feasible partition induced within a declared divisor window and evaluates candidates until reaching the ideal value loss (J = 0) or exhausting the family of candidates. Across 33 K-MDP instances, Windowed improved 25 and tied 8.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-15 in cs.AI).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2609.13676 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-15T22:29:03.115Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).