An on-line algorithm for exploring an unknown polygonal environment by a point robot.
Subir Kumar GhoshJoel W. BurdickPublished in: CCCG (1997)
Keyphrases
- path planning
- preprocessing
- detection algorithm
- learning algorithm
- matching algorithm
- worst case
- dynamic programming
- cost function
- search space
- np hard
- computational cost
- mobile robot
- experimental evaluation
- k means
- high accuracy
- expectation maximization
- real time
- times faster
- multi robot
- segmentation algorithm
- optimal solution
- recognition algorithm
- robotic systems
- changing environment
- multiple robots