Go to the documentation of this file.
28 neighbors.push_back(nodeID);
29 neighbors.push_back(nodeID);
30 neighbors.push_back(nodeID);
41 actions.push_back(-1);
46 assert(!
"GetAction not implemented");
121 return (((
int)(
node.loc*1000))<<10) +
node.speed*1000;
133 glBegin(GL_LINE_STRIP);
134 glColor3f(0, 1.0, 0);
virtual MountainCarAction GetAction(const MountainCarState &s1, const MountainCarState &s2) const
virtual bool GoalTest(const MountainCarState &node, const MountainCarState &goal) const
virtual double HCost(const MountainCarState &node1, const MountainCarState &node2) const
Heuristic value between two arbitrary nodes.
virtual bool InvertAction(MountainCarAction &a) const
virtual uint64_t GetStateHash(const MountainCarState &node) const
double GetHeightAtPosition(double queryPosition) const
virtual void ApplyAction(MountainCarState &s, MountainCarAction a) const
virtual void GetSuccessors(const MountainCarState &nodeID, std::vector< MountainCarState > &neighbors) const
virtual void GetActions(const MountainCarState &nodeID, std::vector< MountainCarAction > &actions) const
bool fgreater(double a, double b)
virtual uint64_t GetActionHash(MountainCarAction act) const
virtual void OpenGLDraw() const
double accelerationFactor
virtual double GCost(const MountainCarState &node1, const MountainCarState &node2) const
virtual void GetNextState(const MountainCarState &, MountainCarAction, MountainCarState &) const
double GetSlope(double queryPosition) const
Nodes to be stored within a Graph.