A lazy algorithm for planning motions in contact.
Yves PapegayHirohisa HirukawaPublished in: IROS (1994)
Keyphrases
- computationally efficient
- dynamic programming
- times faster
- k means
- cost function
- improved algorithm
- detection algorithm
- expectation maximization
- matching algorithm
- np hard
- convergence rate
- lower bound
- preprocessing
- recognition algorithm
- computational complexity
- learning algorithm
- particle swarm optimization
- objective function
- similarity measure
- tree structure
- optimization algorithm
- classification algorithm
- input data
- video data
- clustering method
- shortest path
- theoretical analysis
- worst case
- probabilistic model
- computational cost
- significant improvement
- search space
- face recognition