# Uses of Package
jmarkov.jmdp

- Packages that use jmarkov.jmdp
  Package | Description
  --- | ---
  examples.jmdp |
  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.

- Classes in jmarkov.jmdp used by examples.jmdp
  Class and Description
  CTMDP This class represents a continuous time MDP.
  CTMDPEv This class represents an Infinite horizon, continuous time Markov Decision Process with events.
  DTMDP This class represents a discrete time infnite horizon MDP problem.
  DTMDPEv This class represents an infinite horizon, discrete time, Markov Decision Process with events.
  FiniteDP This class should ONLY be used in FINITE horizon deterministic problems.
  FiniteMDP This class should ONLY be used in FINITE horizon problems.
  FiniteMDPEv This class represents a finite horizon discrete time MDP with events.
  InfiniteMDP This class is a structural class.
  MDP This class is the main framework to build a Dynamic Programming Problem.

- Classes in jmarkov.jmdp used by jmarkov.jmdp
  Class and Description
  CT2DTConverter This class formulates a DTMDP equivalent to a CTMDP.
  CTMDP This class represents a continuous time MDP.
  DTMDP This class represents a discrete time infnite horizon MDP problem.
  FiniteMDP This class should ONLY be used in FINITE horizon problems.
  InfiniteMDP This class is a structural class.
  MDP This class is the main framework to build a Dynamic Programming Problem.

- Classes in jmarkov.jmdp used by jmarkov.jmdp.solvers
  Class and Description
  CTMDP This class represents a continuous time MDP.
  DTMDP This class represents a discrete time infnite horizon MDP problem.
  FiniteMDP This class should ONLY be used in FINITE horizon problems.
  InfiniteMDP This class is a structural class.
  MDP This class is the main framework to build a Dynamic Programming Problem.
  StochasticShortestPath This class represents an infinite horizon shortest path problem.