An Efficient Algorithm for Managing Partial Orders in Planning.
Maria FoxDerek LongPublished in: SIGART Bull. (1996)
Keyphrases
- objective function
- dynamic programming
- computational complexity
- partial order
- np hard
- learning algorithm
- path planning
- matching algorithm
- lattice structure
- partially ordered
- expectation maximization
- worst case
- probabilistic model
- particle swarm optimization
- computationally efficient
- optimization algorithm
- detection algorithm
- cost function
- space complexity
- data structure
- optimal solution