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 17 of 17 for “"Artificial intelligence planning"”.

  1. Artificial Intelligence Planning Techniques for Emulating Agents with Application in Social Services

    … thesis extends a rational reasoner in classical artificial intelligence planning, STRIPS, using three theories from psychology and economics. The first theory, bounded rationality, limits an agent's reasoning ability with human-like bounds. The second theory is Maslow's hierarchy, which is used …

    toronto-retro Repository record for Artificial Intelligence Planning Techniques for Emulating Agents with Application in Social Services (opens in a new tab)

  2. A comparison of block-stacking heuristics used by preschool children and classic artificial intelligence planning paradigms

    … body of research in Psychology concerning human planning and problem-solving both by adults and children, the study of planning and problem-solving in the field of Artificial Intelligence has proceeded along its own development with very little concurrent exploration of the methods people use to …

    vt Repository record for A comparison of block-stacking heuristics used by preschool children and classic artificial intelligence planning paradigms (opens in a new tab)

  3. Customizing the Composition of Web Services and Beyond

    … composition problem 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 …

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

  4. Refinement Acting vs. Simple Execution Guided by Hierarchical Planning

    … into hierarchical structures. One approach to artificial intelligence planning is to design intelligent agents capable of breaking complex problems into multiple levels of abstraction so that at any one level, the problem becomes small and simple. However, for an agent to reason at multiple …

    maryland Repository record for Refinement Acting vs. Simple Execution Guided by Hierarchical Planning (opens in a new tab)

  5. Convex optimization meets formal methods : verification, synthesis, and learning in Markov decision processes

    … (MDPs). These models have found applications in artificial intelligence, planning, autonomy, and control theory and can accurately characterize dynamic, uncertain environments. The synthesis of policies for this family of models has long been regarded theoretically and empirically intractable. …

    texas Repository record for Convex optimization meets formal methods : verification, synthesis, and learning in Markov decision processes (opens in a new tab)

  6. DIEGESIS A multi-agent Digital Interactive Storytelling framework using planning and re-planning techniques

    … reach this goal, DIS systems usually employ Artificial Intelligence planning and re-planning algorithms as part of their solution. There is a lack of algorithms created specifically for DIS purposes since most DIS systems use generic algorithms, and they do not usually assess if and why a …

    liverpool-jm Repository record for DIEGESIS A multi-agent Digital Interactive Storytelling framework using planning and re-planning techniques (opens in a new tab) Download PDF for DIEGESIS A multi-agent Digital Interactive Storytelling framework using planning and re-planning techniques (opens in a new tab)

  7. Demonstrating Cognition by Task Execution and Motion Planning with different algorithms for Manipulation

    … the whole path until the manipulation and the planning of the Baxter Robot. We start by analyzing the kinematic analysis of a six degrees of freedom robot. We build our analysis starting from the Denavit-Hartenberg method. We proceed with the kinematic equations of the robot and with the …

    maryland Repository record for Demonstrating Cognition by Task Execution and Motion Planning with different algorithms for Manipulation (opens in a new tab)

  8. Informative Path Planning Algorithms for Anomaly Detection

    Informative path planning (IPP) algorithms are widely used to control the movement of drones or ground robots when the objective is to efficiently collect information from an environment of interest. For instance, in agriculture, drones might be used for the timely detection of outbreaks of plant …

    ucf Repository record for Informative Path Planning Algorithms for Anomaly Detection (opens in a new tab)

  9. Planning with hypothetical reasoning

    … domains. The underlying causal theory drives the planning process directly and, in conjunction with the uniform representation of time and causal facts, allows elegant solutions to planning problems. A new type of planning problem, the indirect goal problem, is identified and solved It is also …

    vt Repository record for Planning with hypothetical reasoning (opens in a new tab)

  10. Planning and exploration in stochastic relational worlds

    … the most interesting aspects of human and animal intelligence. This thesis addresses planning and exploration in so called stochastic relational worlds which are characterized by two key attributes: they contain large numbers of objects whose properties and relationships can be manipulated, and …

    fu-berlin Repository record for Planning and exploration in stochastic relational worlds (opens in a new tab)

  11. Regret-based Reward Elicitation for Markov Decision Processes

    Markov decision processes (MDPs) have proven to be a useful model for sequential decision- theoretic reasoning under uncertainty, yet they require the specification of a reward function that can require sophisticated human judgement to assess relevant tradeoffs. This dissertation casts the problem …

    toronto-retro Repository record for Regret-based Reward Elicitation for Markov Decision Processes (opens in a new tab)

  12. Planning with learned ignorance-aware models

    <p>One of the goals of artificial intelligence research is to create decision-makers (i.e., <em>agents</em>) that improve from experience (i.e., <em>data</em>), collected through interaction with an environment. Models of the environment (i.e., <em>world models</em>) are an explicit way that agents …

    oxford Repository record for Planning with learned ignorance-aware models (opens in a new tab)

  13. Task planning and control synthesis for multi-agent systems

    … Additionally, the combination of task planning with supervisory control for autonomous multi-agent systems is very challenging and it has been a topic of increasing interest in the last decade, since it can provide a robust framework for autonomous multi-agent task planning and …

    greece Repository record for Task planning and control synthesis for multi-agent systems (opens in a new tab)

  14. K-line Reinforcement Learning for context-aware bots

    Reinforcement learning (RL) can cope with uncertainty in partially observable environments. However, RL algorithms face a challenge when the context of the learning problem changes. A change in context alters the goal of the bot, the value function associated with the state-action map learnt by the …

    unsw Repository record for K-line Reinforcement Learning for context-aware bots (opens in a new tab)

  15. Συστήματα ευριστικού σχεδιασμού ενεργειών

    In this dissertation a new heuristic planning system, which searches for plans in the space of the states and constructs its heuristic function in a domain-independent way, is presented. The system is called GRT and it adopts the STRIPS formalism for the domain and problem representation. The …

    greece Repository record for Συστήματα ευριστικού σχεδιασμού ενεργειών (opens in a new tab)