ompl::control::Automaton::TransitionMap Struct Reference
Each automaton state has a transition map, which maps from a World to another automaton state. A set \(P\) of true propositions correponds to the formula \(\bigwedge_{p\in P} p\). More...
#include <ompl/control/planners/ltl/Automaton.h>
Public Member Functions | |
int | eval (const World &w) const |
Returns the automaton state corresponding to a given World in this transition map. Returns -1 if no such transition exists. | |
Public Attributes | |
std::unordered_map< World, unsigned int > | entries |
Detailed Description
Each automaton state has a transition map, which maps from a World to another automaton state. A set \(P\) of true propositions correponds to the formula \(\bigwedge_{p\in P} p\).
Definition at line 141 of file Automaton.h.
The documentation for this struct was generated from the following files:
- ompl/control/planners/ltl/Automaton.h
- ompl/control/planners/ltl/src/Automaton.cpp