Refining complexity analyses in planning by exploiting the exponential time hypothesis.
Meysam AghighiChrister BäckströmPeter JonssonSimon StåhlbergPublished in: Ann. Math. Artif. Intell. (2016)
Keyphrases
- linear complexity
- stochastic domains
- causal graph
- worst case
- planning problems
- average case complexity
- decision support
- computational complexity
- domain independent
- decision problems
- space complexity
- information systems
- exponential size
- double exponential
- heuristic search
- data sets
- ai planning
- mixed initiative
- learning algorithm
- blocks world
- machine learning
- neural network