A Framework for Planning in Continuous-time Stochastic Domains

No abstract is available for this paper.

• Publication year

  2003

• Venue

  International Conference on Automated Planning and Scheduling

• Publication date

  2003-06-09

• Fields of study

  Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Planning and Execution with Phase Transitions

  2005cited by this paper
• Policy Generation for Continuous-time Stochastic Domains with Concurrency

  2004cited by this paper
• Solving Generalized Semi-Markov Decision Processes Using Continuous Phase-Type Distributions

  2004cited by this paper
• Toward Decision-Theoretic CIRCA with Application to Real-Time Computer Security Control

  2002cited by this paper
• Probabilistic Verification of Discrete Event Systems Using Acceptance Sampling

  2002influential reference
• Planning Under Continuous Time and Resource Uncertainty: A Challenge for AI

  2002influential reference
• Beyond Memoryless Distributions: Model Checking Semi-Markov Chains

  2001cited by this paper
• Planning as Model Checking for Extended Goals in Non-deterministic Domains

  2001cited by this paper
• Infinite-Horizon Policy-Gradient Estimation

  2001cited by this paper
• Decision-Theoretic Planning with Concurrent Temporally Extended Actions

  2001cited by this paper
• PEGASUS: A policy search method for large MDPs and POMDPs

  2000cited by this paper
• OBDD-based Universal Planning for Synchronized Agents in Non-Deterministic Domains

  2000cited by this paper
• Model-checking continuous-time Markov chains

  2000cited by this paper
• Monte Carlo POMDPs

  1999cited by this paper
• Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence

  1999cited by this paper
• Approximate Symbolic Model Checking of Continuous-Time Markov Chains

  1999cited by this paper
• Automatic OBDD-Based Generation of Universal Plans in Non-Deterministic Domains

  1998cited by this paper
• Improving Big Plans

  1998cited by this paper
• Planning Control Rules for Reactive Agents

  1997cited by this paper
• World Modeling for the Dynamic Construction of Real-Time Control Plans

  1995cited by this paper
• An Algorithm for Probabilistic Planning

  1995cited by this paper
• Probabilistic Planning with Information Gathering and Contingent Execution

  1994cited by this paper
• Planning with External Events

  1994influential reference
• Epsilon-Safe Planning

  1994cited by this paper
• Approved for Public Release; Distribution Unlimited

  1994cited by this paper
• Model-Checking in Dense Real-time

  1993cited by this paper
• Supervisory control of a rapid thermal multiprocessor

  1993cited by this paper
• Regenerative Stochastic Simulation

  1992cited by this paper
• Anytime Synthetic Projection: Maximizing the Probability of Goal Satisfaction

  1990cited by this paper
• A logic for reasoning about time and reliability

  1990cited by this paper
• A GSMP formalism for discrete event systems

  1989cited by this paper
• Universal Planning: An (Almost) Universally Bad Idea

  1989cited by this paper
• An Analysis of Time-Dependent Planning

  1988cited by this paper
• A Theory of Debugging Plans and Interpretations

  1988cited by this paper
• Universal Plans for Reactive Robots in Unpredictable Environments

  1987cited by this paper
• Automatic verification of finite-state concurrent systems using temporal logic specifications

  1986cited by this paper
• Graph-Based Algorithms for Boolean Function Manipulation

  1986cited by this paper
• Sequential Tests of Statistical Hypotheses.

  1972influential reference
• Dynamic Probabilistic Systems

  1971cited by this paper
• Information Theory, Statistical Decision Functions, Random Processes

  1962cited by this paper
• Submission Category: Reinforcement Learning, Preference: ORAL Approximate Planning in Large POMDPs via Reusable Trajectories

  year unknowncited by this paper

• Employing AI Techniques in Probabilistic Model Checking Position Paper

  2015cites this paper
• Saturated Path-Constrained MDP: Planning under Uncertainty and Deterministic Model-Checking Constraints

  2014cites this paper
• Markov Decision Processes in Artificial Intelligence: Sigaud/Markov Decision Processes in Artificial Intelligence

  2013cites this paper
• Improving Trust Estimates in Planning Domains with Rare Failure Events

  2013cites this paper
• Extracting STRIPS Representations of Actions and Events

  2011cites this paper
• Deliberation scheduling using GSMDPs in stochastic asynchronous domains

  2009cites this paper
• Probabilistic plan management

  2009cites this paper
• Programmation dynamique avec approximation de la fonction valeur

  2008cites this paper
• Processus décisionnels de Markov en intelligence artificielle

  2008cites this paper
• The Evolution of CIRCA, a Theory-Based AI Architecture with Real-Time Performance Guarantees

  2008cites this paper
• Hierarchical Strategy Learning with Hybrid Representations

  2007cites this paper
• Numerical vs. statistical probabilistic model checking

  2006cites this paper
• Other Agents' Actions as Asynchronous Events

  2006cites this paper
• SPECIAL S ECTION O N T OOLS A ND A LGORITHMS F OR THE C ONSTRUCTION A ND A NALYSIS O F S YSTEMS

  2006cites this paper
• Stochastic Deliberation Scheduling using GSMDPs

  2006cites this paper
• Verification and planning for stochastic processes with asynchronous events

  2004cites this paper
• Policy Generation for Continuous-time Stochastic Domains with Concurrency

  2004cites this paper
• Planning and Verification for Stochastic Processes with Asynchronous Events

  2004cites this paper
• Decision-Theoretic Military Operations Planning

  2004cites this paper
• Numerical vs. Statistical Probabilistic Model Checking: An Empirical Study

  2004cites this paper
• Pushing The Limits of AI Planning

  2004cites this paper
• Specification and verification of systems using model checking and Markov reward models

  2004cites this paper
• Extending PDDL to nondeterminism, limited sensing and iterative conditional plans

  2003cites this paper
• Extending PDDL to Model Stochastic Decision Processes

  2003cites this paper