Artificial Intelligence
Introduction to algorithms
Learning to act using real-time dynamic programming
Artificial Intelligence - Special volume on computational research on interaction and agency, part 1
Fast planning through planning graph analysis
Artificial Intelligence
Artificial Intelligence - Special issue on heuristic search in artificial intelligence
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Extracting Effective and Admissible State Space Heuristics from the Planning Graph
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Combining the Expressivity of UCPOP with the Efficiency of Graphplan
ECP '97 Proceedings of the 4th European Conference on Planning: Recent Advances in AI Planning
New admissible heuristics for domain-independent planning
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 3
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
Faster heuristic search algorithms for planning with uncertainty and full feedback
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
A robust and fast action selection mechanism for planning
AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence
Generating plans in concurrent, probabilistic, over-subscribed domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 2
The PELA architecture: integrating planning and learning to improve execution
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Generating plans in concurrent, probabilistic, over-subscribed domains
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Engineering a conformant probabilistic planner
Journal of Artificial Intelligence Research
Decision-theoretic planning with non-Markovian rewards
Journal of Artificial Intelligence Research
Planning with durative actions in stochastic domains
Journal of Artificial Intelligence Research
A hybridized planner for stochastic domains
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
ReTrASE: integrating paradigms for approximate probabilistic planning
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Hierarchical planning through operator and world abstraction using ontology for home service robots
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 3
GA-FreeCell: evolving solvers for the game of FreeCell
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Stochastic enforced hill-climbing
Journal of Artificial Intelligence Research
Discovering hidden structure in factored MDPs
Artificial Intelligence
Corpus-based interpretation of instructions in virtual environments
ACL '12 Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics: Short Papers - Volume 2
| Hi-index | 0.00 |
We describe the version of the GPT planner used in the probabilistic track of the 4th International Planning Competition (IPC-4). This version, called mGPT, solves Markov Decision Processes specified in the PPDDL language by extracting and using different classes of lower bounds along with various heuristic-search algorithms. The lower bounds are extracted from deterministic relaxations where the alternative probabilistic effects of an action are mapped into different, independent, deterministic actions. The heuristic-search algorithms use these lower bounds for focusing the updates and delivering a consistent value function over all states reachable from the initial state and the greedy policy.