The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
Installs an updated version of 'pomdp-solve', a program to solve Partially Observable Markov Decision Processes (POMDPs) using a variety of exact and approximate value iteration algorithms. A convenient R infrastructure is provided in the separate package pomdp. Kaelbling, Littman and Cassandra (1998) <doi:10.1016/S0004-3702(98)00023-X>.
Version: | 1.0.4 |
Depends: | R (≥ 3.5.0) |
Imports: | utils |
Suggests: | pomdp |
Published: | 2023-08-31 |
DOI: | 10.32614/CRAN.package.pomdpSolve |
Author: | Michael Hahsler [aut, cph, cre], Anthony R. Cassandra [aut, cph] |
Maintainer: | Michael Hahsler <mhahsler at lyle.smu.edu> |
BugReports: | https://github.com/mhahsler/pomdpSolve/issues |
License: | GPL (≥ 3) |
Copyright: | pomdp-solve is Copyright (C) Anthony R. Cassandra; LASPack is Copyright (C) Tomas Skalicky; lp-solve is Copyright (C) Michel Berkelaar, Kjell Eikland, Peter Notebaert; all other code is Copyright (C) Michael Hahsler. |
URL: | https://github.com/mhahsler/pomdpSolve |
NeedsCompilation: | yes |
Classification/ACM: | G.4, G.1.6, I.2.6 |
Materials: | README NEWS |
CRAN checks: | pomdpSolve results |
Reference manual: | pomdpSolve.pdf |
Package source: | pomdpSolve_1.0.4.tar.gz |
Windows binaries: | r-devel: pomdpSolve_1.0.4.zip, r-release: pomdpSolve_1.0.4.zip, r-oldrel: pomdpSolve_1.0.4.zip |
macOS binaries: | r-release (arm64): pomdpSolve_1.0.4.tgz, r-oldrel (arm64): pomdpSolve_1.0.4.tgz, r-release (x86_64): pomdpSolve_1.0.4.tgz, r-oldrel (x86_64): pomdpSolve_1.0.4.tgz |
Old sources: | pomdpSolve archive |
Reverse imports: | pomdp |
Please use the canonical form https://CRAN.R-project.org/package=pomdpSolve to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.