Optimal Lyapunov-Based Reaching Time Bounds for the Super-Twisting Algorithm.
Richard SeeberMartin HornPublished in: IEEE Control. Syst. Lett. (2019)
Keyphrases
- worst case
- learning algorithm
- dynamic programming
- optimal solution
- preprocessing
- globally optimal
- objective function
- matching algorithm
- k means
- optimization algorithm
- error bounds
- cost function
- tight bounds
- upper and lower bounds
- average case
- recognition algorithm
- optimal path
- similarity measure
- segmentation algorithm
- theoretical analysis
- linear programming
- np hard
- search space
- computational complexity
- mathematical model
- path planning
- simulated annealing
- lower and upper bounds
- computational cost
- stability analysis
- efficiently computable