|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use States | |
---|---|
jmarkov | Provides the basic elements to model continuous time Markov chains (CTMC). |
jmarkov.basic | This package contains basic elements such as State, Event, Action that are used in jMarkov and jMDP. |
jmarkov.jmdp | jMDP is used to solve Markov Decision Processes. |
Uses of States in jmarkov |
---|
Methods in jmarkov that return States | |
---|---|
States<GeomState<Sub>> |
GeomProcess.dests(GeomState<Sub> i,
E e)
Overrides SimpleMarkovProcess' method |
abstract States<S> |
SimpleMarkovProcess.dests(S i,
E e)
Determines the destination set of States when events e occurs. |
Uses of States in jmarkov.basic |
---|
Classes in jmarkov.basic that implement States | |
---|---|
class |
StatesSet<S extends State>
This class represent a set of States. |
Methods in jmarkov.basic with parameters of type States | |
---|---|
boolean |
StatesSet.add(States<S> states)
Adds the States in the iterator to the set. |
Constructors in jmarkov.basic with parameters of type States | |
---|---|
StatesSet(States<S> states)
Creates a set of objects S from the given States |
Uses of States in jmarkov.jmdp |
---|
Fields in jmarkov.jmdp declared as States | |
---|---|
protected States<S> |
InfiniteMDP.absorbingStates
Set of absorving states. |
protected States<S> |
MDP.initial
Set of initial states. |
protected States<S> |
CTMDPEvA.initSet
Initail set od States. |
Methods in jmarkov.jmdp that return States | |
---|---|
States<S> |
FiniteMDP.getStates(int t)
All the states that are available at stage t. |
States<S> |
DTMDPEv.reachable(S i,
A a)
|
abstract States<S> |
DTMDP.reachable(S i,
A a)
Set of states that can be reached from this state i, after taking the action a. |
States<S> |
CTMDPEv.reachable(S i,
A a)
|
abstract States<S> |
CTMDP.reachable(S i,
A a)
Set of States that can be reached from this state i, after taking the action a. |
States<S> |
CT2DTConverter.reachable(S i,
A a)
|
abstract States<S> |
DTMDPEvA.reachable(S i,
A a,
E e)
Set of reachable states from state i given that action a is taken and event e occurs. |
abstract States<S> |
DTMDPEv.reachable(S i,
A a,
E e)
Set of reachable states from state i given that action a is taken and event e occurs. |
abstract States<S> |
CTMDPEv.reachable(S i,
A a,
E e)
Set of reachable states from state i given that action a is taken and event e occurs. |
abstract States<S> |
FiniteMDPEv.reachable(S i,
A a,
E e,
int t)
Set of reachable states from state i given that action a is taken and event e occurs. |
States<S> |
FiniteMDPEv.reachable(S i,
A a,
int t)
|
abstract States<S> |
FiniteMDP.reachable(S i,
A a,
int t)
Set of States that can be reached from this state i, at this stage t, after taking the acton a. |
States<S> |
FiniteDP.reachable(S i,
A a,
int t)
Final function must not be extended by any user. |
States<StateEvent<S,E>> |
DTMDPEvA.reachable(StateEvent<S,E> i,
A a)
|
States<StateEvent<S,E>> |
CTMDPEvA.reachable(StateEvent<S,E> i,
A a)
|
abstract States<S> |
CTMDPEvA.reached(S i,
A a,
E e)
Set of reachable states from state i given that action a is taken and event e occurs. |
Methods in jmarkov.jmdp with parameters of type States | |
---|---|
protected StatesSet<S> |
DTMDP.oneStageReachable(States<S> initSet)
TFinds the states reached in one step. |
protected StatesSet<S> |
CTMDP.oneStageReachable(States<S> initSet)
Finds the states reachable in one step. |
Constructors in jmarkov.jmdp with parameters of type States | |
---|---|
CTMDP(States<S> initial)
Creates a new continuous time infinite horizon MDP Problem. |
|
CTMDPEv(States<S> initial)
This constructor builds a continuous time MDP with events. |
|
CTMDPEvA(States<S> initial)
Creates a new continuous time infinite horizon MDP Problem with events |
|
DTMDP(States<S> initial)
Creates a new infinite horizon discrete time (MDP) Problem. |
|
DTMDPEv(States<S> initial)
Creates a new infinite horizon discrete time (MDP) Problem with events |
|
DTMDPEvA(States<S> initial)
Creates a new infinite horizon discrete time (MDP) Problem with events |
|
FiniteDP(States<S> initial,
int lastStage)
Creates a new FINITE Dynamic Programming (DP) Problem. |
|
FiniteMDP(States<S> initial,
int horizon)
Creates a new FINITE horizon (MDP) Problem. |
|
FiniteMDPEv(States<S> initial,
int horizon)
|
|
InfiniteMDP(States<S> initial)
Creates a new INFINITE Dynamic Programming (DP) Problem. |
|
StochasticShortestPath(States<S> states)
|
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |