Bonet, Blai - Departamento de Computación y Tecnología de la Información, Universidad Simón Bolívar

• mGPT: A Probabilistic Planner based on Heuristic Search Departamento de Computacion
• Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations
• Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and its application to MDPs
• Learning in Depth-First Search: A Unified Approach to Heuristic Search in Deterministic, Non-Deterministic, Probabilistic, and Game Tree Settings
• Logical Encodings With No Time Indexes for Defining and Computing Admissible Heuristics for Planning
• Journal of Artificial Intelligence Research 24 (2005) 933944 Submitted 12/04; published 12/05 Engineering Note
• Directed Unfolding of Petri Nets Blai Bonet1
• Heuristic Search Planner 2.0 Blai Bonet and Hector Geffner
• Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning
• Introduction Complexity &
• External Memory Value Iteration Stefan Edelkamp
• Efficient Algorithms to Rank and Unrank Permutations in Lexicographic Order
• Planning under Partial Observability by Classical Replanning: Theory and Experiments
• An Algorithm Better than AO*? Departamento de Computacion
• An -Optimal Grid-Based Algorithm for Partially Observable Markov Decision Processes
• Experiments 4 6 8 10 12 14 16 18 20 22 24
• Solving Large POMDPs using Real Time Dynamic Programming
• Automatic Polytime Reductions of NP Problems into a Fragment of STRIPS Departamento de Computacion
• A Complete Algorithm for Generating Landmarks Departamento de Computacion
• Multiple Symmetries in Sliding-Tile Puzzles: First Experiments Cesar Romero Julio Castillo Blai Bonet
• Introduction 1-Safe Petri
• Solving POMDPs: RTDP-Bel vs. Point-based Algorithms Departamento de Computacion
• Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming
• Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic
• Deterministic (Probabilistic)
• Finite-State Controllers Based on Mealy Machines for Centralized and Decentralized POMDPs
• ICAPS 2006 International Planning Competition
• Automatic Derivation of Memoryless Policies and Finite-State Controllers Using Classical Planners
• Learning sorting and decision trees with POMDPs Departamento de Computacion
• A Calculus for Causal Relevance Cognitive Systems Laboratory
• An Expressive and Efficient Solution to the Service Selection Problem
• Results of Probabilistic Track in the 5th International Planning Competition Dept. de Computacion
• Solving Stochastic Shortest-Path Problems with RTDP Cognitive Systems Laboratory
• Results of Conformant Track in the 5th International Planning Competition Dept. de Computacion
• Qualitative MDPs and POMDPs: An Order-of-Magnitude Approximation
• Directed Unfolding of Petri Nets Blai Bonet1
• Planning under Partial Observability by Classical Replanning: Theory and Experiments
• Planning as Heuristic Search: New Results Blai Bonet and Hector Ge ner?
• New Admissible Heuristics for Domain-Independent Planning Patrik Haslum
• Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback
• Deterministic POMDPs Revisited Departamento de Computacion
• December 31, 2005 5th International Planning Competition: Non-deterministic Track
• A Robust and Fast Action Selection Mechanism for Planning
• Arguing for Decisions: A Qualitative Model of Decision Making
• High-Level Planning and Control with Incomplete Information Using POMDP's
• Planning as Heuristic Search Blai Bonet and Hector Ge ner
• Planning with Incomplete Information as Heuristic Search in Belief Space
• Instrumentality Tests Revisited Cognitive Systems Laboratory
• GPT Meets PSR Computer Science Department
• 1 HSP: Heuristic Search Planner 1.1 Introduction
• Automatic Derivation of Finite-State Machines for Behavior Control Universidad Simon Bolivar
• problem |S| V NVI |A| |F| |
• Planning and Control in Arti cial Intelligence: A Unifying Perspective
• External Memory Value Iteration Stefan Edelkamp
• Bounded Branching and Modalities in Non-Deterministic Planning Departamento de Computacion
• Abstraction Heuristics Extended with Counting Abstractions Departamento de Computacion
• Probabilistic Planning Universidad Simon Bolivar