Variable-Time-Domain Neighboring Optimal Guidance, Part 1: Algorithm Structure.
Mauro PontaniGiampaolo CecchettiPaolo TeofilattoPublished in: J. Optim. Theory Appl. (2015)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- computational complexity
- detection algorithm
- computationally efficient
- expectation maximization
- experimental evaluation
- k means
- improved algorithm
- cost function
- np hard
- times faster
- graph structure
- computational cost
- tree structure
- globally optimal
- learning algorithm
- path planning
- matching algorithm
- frequency domain
- clustering method
- weighting coefficients
- particle swarm optimization
- scheduling problem
- probabilistic model
- preprocessing
- similarity measure
- input data
- high accuracy
- closed form
- search space
- convex hull
- lower bound
- exhaustive search
- genetic algorithm