A polynomial algorithm for 2-cyclic robotic scheduling: A non-Euclidean case.
Vladimir KatsEugene LevnerPublished in: Discret. Appl. Math. (2009)
Keyphrases
- probabilistic model
- preprocessing
- learning algorithm
- detection algorithm
- improved algorithm
- experimental evaluation
- dynamic programming
- matching algorithm
- times faster
- computational cost
- search space
- segmentation algorithm
- computational complexity
- np hard
- significant improvement
- optimal scheduling
- k means
- worst case
- simulated annealing
- expectation maximization
- convergence rate
- optimization algorithm
- polynomial size
- real time
- list scheduling
- clustering method
- theoretical analysis
- computationally efficient
- high accuracy
- mobile robot
- optimal solution