An efficient algorithm for finding a path subject to two additive constraints.
Turgay KorkmazMarwan KrunzSpyros TragoudasPublished in: Comput. Commun. (2002)
Keyphrases
- k means
- preprocessing
- detection algorithm
- np hard
- learning algorithm
- recognition algorithm
- computationally efficient
- objective function
- optimal solution
- times faster
- significant improvement
- high accuracy
- constrained optimization
- computational cost
- path planning
- theoretical analysis
- highly efficient
- dynamic programming
- cost function
- search space
- similarity measure
- improved algorithm
- multiple constraints
- constraint sets
- matching algorithm
- ant colony optimization
- optimization algorithm
- input data
- linear programming
- simulated annealing
- motion estimation
- reinforcement learning