![]() |
Smart Minotaur
|
An abstract class for implmenting algorithms to explore a map. Mehr ...
#include <MovementAlgorithm.hpp>
Öffentliche Methoden | |
MovementAlgorithm (Map *pMap) | |
virtual RobotPosition | getNextPosition (const RobotPosition pos)=0 |
Calculates the next target position, to which the robot should move. | |
bool | checkObstacle (int x, int y, float theta) |
bool | checkLeftSideObstacle (int x, int y, float theta) |
bool | checkRightSideObstacle (int x, int y, float theta) |
int | getDistanceToObstacle (int x, int y, float theta) |
int | getDistanceToLeftObstacle (int x, int y, float theta) |
int | getDistanceToRightObstacle (int x, int y, float theta) |
RobotPosition | calculateNewPosition (int x, int y, int theta) |
An abstract class for implmenting algorithms to explore a map.
This class is an abstract class for implementing algorithms to explore a map. The exploration algorithm works depending on a already finished Map object.
|
pure virtual |
Calculates the next target position, to which the robot should move.
pos | current position of the robot |
Implementiert in minotaur::PledgeAlgorithm.