Classical Dynamic Controllability Revisited - A Tighter Bound on the Classical Algorithm.
Mikael NilssonJonas KvarnströmPatrick DohertyPublished in: ICAART (1) (2014)
Keyphrases
- learning algorithm
- np hard
- input data
- theoretical analysis
- worst case
- computational cost
- dynamic programming
- upper bound
- experimental evaluation
- search space
- lower bound
- linear programming
- detection algorithm
- selection algorithm
- cost function
- neural network
- computational complexity
- high accuracy
- simulated annealing
- data structure
- optimal solution
- path planning
- times faster
- improved algorithm
- space complexity