An algorithm of dividing a work area to multiple mobile robots.
Daisuke KurabayashiJun OtaTamio AraiEiichi YoshidaPublished in: IROS (2) (1995)
Keyphrases
- computational complexity
- path planning
- experimental evaluation
- mobile robot
- times faster
- matching algorithm
- theoretical analysis
- recognition algorithm
- detection algorithm
- computational cost
- high accuracy
- optimal solution
- obstacle avoidance
- dynamic programming
- cost function
- worst case
- significant improvement
- learning algorithm
- improved algorithm
- expectation maximization
- computationally efficient
- search space
- ant colony optimization
- search algorithm
- k means
- classification algorithm
- tree structure
- clustering method
- optimization algorithm
- simulated annealing
- probabilistic model