Package | Description |
---|---|
jmarkov.jmdp |
jMDP is used to solve Markov Decision Processes.
|
jmarkov.jmdp.solvers |
This package contins the framwork of solvers used by jMDP to solve Markov Decision Processes.
|
Modifier and Type | Method and Description |
---|---|
AbstractInfiniteSolver<S,A> |
InfiniteMDP.getSolver() |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAverageSolver<S extends State,A extends Action>
Structural class for average cost solvers to extend.
|
class |
AbstractDiscountedSolver<S extends State,A extends Action>
This is a structural class that must be extended by classes solving the
dicounted cost minimization problem.
|
class |
AbstractTotalSolver<S extends State,A extends Action>
Structural class to be extended by solvers in order to solve the total cost
criteria for an infinite horizon problem
|
class |
LPBCLAverageSolver<S extends State,A extends Action>
This solver solves a average-cost infinite horizon MDP by building
and solving a linear problem using as interface Xpress BCL.
|
class |
LPBCLDiscountedSolver<S extends State,A extends Action>
This solver solves a discounted infinite horizon MDP by building
and solving a linear problem using as interface Xpress BCL.
|
class |
MpsLpAverageSolver<S extends State,A extends Action>
This class builds the Dual Linear Program for an average infinite
horizon MDP in a MPS file.
|
class |
MpsLpDiscountedSolver<S extends State,A extends Action>
This class builds a Linear Program for a discounted infinite
horizon MDP in a MPS file.
|
class |
MPSQsOptAverageSolver<S extends State,A extends Action>
This solver solves an average infinite horizon MDP by building and solving a
linear problem using as interface QSopt-Optimizer.
|
class |
MPSQsOptDiscountedSolver<S extends State,A extends Action>
This solver solves an discounted infinite horizon MDP by building and solving a
linear problem using as interface QSopt-Optimizer.
|
class |
MPSXpressAverage<S extends State,A extends Action>
This solver solves an average infinite horizon MDP by building and solving a
linear problem using as interface Xpress-Optimizer.
|
class |
MPSXpressDiscounted<S extends State,A extends Action>
This solver solves a discounted infinite horizon MDP by building
and solving a linear problem using as interface Xpress-Optimizer.
|
class |
PolicyIterationSolver<S extends State,A extends Action>
This class solves infinite horizon discounted problems using the
policy iteration algorithm.
|
class |
PolicyIterationSolverAvg<S extends State,A extends Action>
This class solves infinite horizon non-discounted problems using the
policy iteration algorithm.
|
class |
RelativeValueIterationSolver<S extends State,A extends Action>
This class solves the average cost criteria for infinite horizon problems
|
class |
StochasticShortestPathSolver<S extends StateC,A extends Action>
This solver gives a solution for the minimization of the total cost criterion
for an infinite horizon MDP.
|
class |
ValueIterationSolver<S extends State,A extends Action>
This class belongs to the set of default solvers included in the
jmdp package.
|