Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 51 for “"classical planning"”.

  1. Beyond classical planning: temporal and probabilistic extensions

    Automated planning is a research field at the heart of artificial intelligence that deals with the central question of how to determine adequate actions that transform an initial state into a goal state. In classical planning, actions are deterministic and occur at single instant time points. …

    freiburg-diss Repository record for Beyond classical planning: temporal and probabilistic extensions (opens in a new tab)

  2. Effective Search Techniques for Non-classical Planning via Reformulation

    Automated planning is a branch of AI that addresses the problem of generating a course of action to achieve a specified objective, given an initial state of the world. It is an area that is central to the development of intelligent agents and autonomous robots. In the last decade, automated …

    toronto-retro Repository record for Effective Search Techniques for Non-classical Planning via Reformulation (opens in a new tab)

  3. Discovering and learning preferred operators for classical planning with neural networks

    In a planning task, an agent must choose the most efficient action from a po tentially large set of actions at each step. During a heuristic search, logic-based planners use preferred operators to reduce the branching factor significantly. This work presents a method for sampling and learning …

    brazil-ufrgs Repository record for Discovering and learning preferred operators for classical planning with neural networks (opens in a new tab)

  4. Understanding sample generation strategies for learning heuristic functions in classical planning

    … essential in guiding search algorithms to solve planning tasks. We study the problem of learning good heuristic functions for classical planning tasks with neural networks based on samples that are states with their cost-to-goal estimates. It is well known that the learned model quality depends …

    brazil-ufrgs Repository record for Understanding sample generation strategies for learning heuristic functions in classical planning (opens in a new tab)

  5. Task Planning in Factor Graph Representation

    … of variables (Dellaert 2021). For example, in classical planning, an action chosen between time steps 0 and 1 depends on variables in those time steps, not variables from time step 2. A factor graph is a probabilistic graphical model that has its strength in exploiting the locality property of …

    gatech Repository record for Task Planning in Factor Graph Representation (opens in a new tab)

  6. Goal Decomposition for Probabilistic Planning

    Automated planning is essential for many applications, such as autonomous systems, robotics, and intelligent decision support, where agents must make sequential decisions and execute actions to achieve defined goals. However, as planning domains grow in scale and complexity, classical planning …

    maryland Repository record for Goal Decomposition for Probabilistic Planning (opens in a new tab)

  7. Search Complexities for HTN Planning

    Hierarchical Task Network (HTN) planning is the problem of decomposing an initial task into a sequence of executable steps. Often viewed as just a way to encode human knowledge to solve classical planning problems faster, HTN planning is more expressive than classical planning, even to the point of …

    maryland Repository record for Search Complexities for HTN Planning (opens in a new tab)

  8. On planning with state-dependent action costs

    Automated Planning is an established research field of Artificial Intelligence. While in probabilistic planning models, such as Stochastic Shortest Path problems, the cost of an action can be state-dependent, the classical deterministic planning literature mostly considers the cost of actions to be …

    freiburg-diss Repository record for On planning with state-dependent action costs (opens in a new tab)

  9. Optimal Planning with State Constraints

    In the classical planning model, state variables are assigned values in the initial state and remain unchanged unless explicitly affected by action effects. However, some properties of states are more naturally modelled not as direct effects of actions but instead as derived, in each state, from …

    anu Repository record for Optimal Planning with State Constraints (opens in a new tab)

  10. Symbolic search for optimal planning with expressive extensions

    In classical planning, the goal is to derive a course of actions that allows an intelligent agent to move from any situation it finds itself in to one that satisfies its goals. Classical planning is considered domain-independent, i.e., it is not limited to a particular application and can be used …

    freiburg-diss Repository record for Symbolic search for optimal planning with expressive extensions (opens in a new tab)

  11. Advancing Property Directed Reachability for Classical and Fully Observable Nondeterministic Planning

    … and software systems, as well as for automated planning. To solve classical planning problems, PDR searches iteratively solve a series of small decision problems about whether a particular state can be progressed a single step toward the goal. Unlike earlier monolithic bounded model checking …

    anu Repository record for Advancing Property Directed Reachability for Classical and Fully Observable Nondeterministic Planning (opens in a new tab)

  12. Hierarchical Goal Networks: Formalisms and Algorithms for Planning and Acting

    … operate in these environments requires advanced planning and acting capabilities, some of which are not well supported by the current state of the art automated planning formalisms and algorithms. To address this problem, in my thesis I propose a new planning formalism that addresses some of the …

    maryland Repository record for Hierarchical Goal Networks: Formalisms and Algorithms for Planning and Acting (opens in a new tab)

  13. A Machine Learning Approach to Planning in Complex Real-World Domains

    Classical planning techniques have some serious problems when employed in real-world domains. In classical planning, it is assumed we know the current state of the world and can project that state through a reasonably well-defined set of actions to yield a future state. However, perfect models of …

    uiuc Repository record for A Machine Learning Approach to Planning in Complex Real-World Domains (opens in a new tab)

  14. Efficient Automated Planning with New Formulations

    … formulated. This fact also applies to automated planning, a key field in artificial intelligence research. Classical planning used to be dominated by STRIPS formulation, a simple model based on propositional logic. In the recently introduced SAS+ formulation, the multi-valued variables naturally …

    wustl Repository record for Efficient Automated Planning with New Formulations (opens in a new tab)

  15. Directed unfolding: reachability analysis of concurrent systems & applications to automated planning.

    … of Petri nets are closely related to those of classical planning models, yet automated planning and Petri net analysis have developed independently, with minimal and mainly unconvincing attempts at crossfertilisation. This thesis exploits the relationship between the formal reachability …

    adelaide Repository record for Directed unfolding: reachability analysis of concurrent systems & applications to automated planning. (opens in a new tab)

  16. Planning in constraint space for multi-body manipulation tasks

    … structures and adopt search algorithms in the classical planning literature to find sufficient designs. The key idea is that the interactions between the components of a structure can be encoded as equality and inequality constraints on the configuration spaces of the respective objects. …

    gatech Repository record for Planning in constraint space for multi-body manipulation tasks (opens in a new tab)

  17. Analysis of partial order reduction techniques for automated planning

    Automated planning is an area of Artificial Intelligence (AI) that is closely related to decision making. Given a planning problem, which is described as an initial state (i.e., a start configuration of the problem), a set of actions, and a goal description, a planning algorithm is concerned with …

    freiburg-diss Repository record for Analysis of partial order reduction techniques for automated planning (opens in a new tab)

  18. Pond-Hindsight: Applying Hindsight Optimization to Partially-Observable Markov Decision Processes

    … Markov decision processes (MDPs) by solving classical planning translations of the problem. This thesis extends the concept of problem determination to POMDPs by sampling action observations (similar to how FF-Replan samples action outcomes) and guiding the construction of policy trajectories …

    utahstate Repository record for Pond-Hindsight: Applying Hindsight Optimization to Partially-Observable Markov Decision Processes (opens in a new tab)

  19. Customizing the Composition of Web Services and Beyond

    … is to conceive it as an Artificial Intelligence planning task. This enables us to bring to bear many of the theoretical and computational advances in reasoning about actions to the task of Web service composition. However, Web service composition goes far beyond the reaches of classical planning, …

    toronto-retro Repository record for Customizing the Composition of Web Services and Beyond (opens in a new tab)

Page 1 of 3