A locally convergent continuous-time algorithm to find all the roots of a time-varying polynomial.
Laura MeniniCorrado PossieriAntonio TornambèPublished in: Autom. (2021)
Keyphrases
- detection algorithm
- learning algorithm
- cost function
- dynamic programming
- computational complexity
- improved algorithm
- np hard
- matching algorithm
- probabilistic model
- high accuracy
- computationally efficient
- theoretical analysis
- convergence rate
- times faster
- polynomially bounded
- ant colony optimization
- estimation algorithm
- optimization algorithm
- segmentation algorithm
- experimental evaluation
- preprocessing
- optimal solution
- simulated annealing
- mobile robot
- mathematical model
- tree structure
- classification algorithm
- k means
- search space
- selection algorithm
- objective function