An efficient, error-bounded approximation algorithm for simulating quasi-statics of complex linkages.
Stephane RedonMing C. LinPublished in: Symposium on Solid and Physical Modeling (2005)
Keyphrases
- error bounds
- dynamic programming
- high accuracy
- cost function
- detection algorithm
- learning algorithm
- k means
- computational cost
- monte carlo
- expectation maximization
- computationally intensive
- times faster
- experimental evaluation
- error tolerance
- simulated annealing
- neural network
- computationally efficient
- theoretical analysis
- optimization algorithm
- probabilistic model
- objective function
- convergence rate
- closed form
- minimum error
- approximation error
- image segmentation
- estimation error
- improved algorithm
- data structure
- preprocessing
- mobile robot
- worst case