• Corpus ID: 1011119

The Language for the Classical Part of the th International Planning Competition

@inproceedings{Edelkamp2006TheLF,
  title={The Language for the Classical Part of the th International Planning Competition},
  author={Stefan Edelkamp},
  year={2006}
}
This document de nes the language to be used in the classical part of the th International Planning Competition IPC The language comprises all of PDDL levels and as de ned by Maria Fox and Derek Long in parts of this document have been copied from that source On top of this language for IPC derived predicates are re introduced and timed initial literals are newly introduced into the competition language We give the syntax and semantics of these constructs 

Extracting plans from plans

This paper presents PIMP (Plans Inside Multi-threaded Plans), a domain-independent algorithm which can schedule a plan whilst retaining the knowledge inherent in a traditional plan.

APP: Agent Planning Package

Through the use of APP, agents can generate plans within their operating environment, as well as execute them and supervise the execution, and support online changes to the planning problem and domain.

Acquiring planning models from narrative synopses

The creation of planning domain models for automated planning is challenging, especially when non-technical domain experts are required for the creation of content. This is particularly true for the

An AI Planning-based Tool for Scheduling Satellite Nominal Operations

An AI domain-independent planner is used that solves the planning and scheduling problems in the HISPASAT domain thanks to its capability of representing and handling continuous variables, coding functions to obtain the operators' variable values, and the use of control rules to prune the search.

Continual planning and acting in dynamic multiagent environments

A new principled approach to continual planning is presented that describes why and when an agent should switch between planning and acting, and shows that, using continual planning techniques, deliberate action planning can be used efficiently even in complex multiagent environments.

SmartPM: Automatic Adaptation of Dynamic Processes at Run-Time

The purpose is to demonstrate that the combination of procedural and imperative models with declarative elements, along with the exploitation of techniques from the field of artificial intelligence (AI), can increase the ability of existing PMSs of supporting dynamic processes.

An Algorithm for Avoiding Plateaus in Heuristic Search

This thesis presents an implementation of DBFS into the Fast Downward planner, and presents a systematic evaluation ofDBFS for several parameter settings, leading to a better understanding of the impact of the parameter choices to the search performance.

Planning robotic agent actions using semantic knowledge for a home environment

A framework that integrates a domain ontology (home environment ontology) with a task planner (ROSPlan) to translate the objectives coming from a given agent (robot or human) into executable actions by a robotic agent is proposed.

BOARD-AI: A goal-aware modeling interface for systems engineering, combining machine learning and plan recognition

This study presents an approach and a Human-machine interface for natural sketching that allows engineers to capture system models using interactive whiteboards and combines techniques from symbolic AI and machine learning to improve performance while not compromising explainability.

SIADEX : A Real World Planning Approach for Forest Fire Fighting

This paper describes the SIADEX project (Assisted Design of Forest Fire Fighting Plans by means of Artificial Intelligence Techniques), which is being developed under a research contract with the

References

SHOWING 1-3 OF 3 REFERENCES

The actions available to the planner do not aaect the derived predicates: no derived predicate occurs on any of the eeect lists of the domain actions

  • The actions available to the planner do not aaect the derived predicates: no derived predicate occurs on any of the eeect lists of the domain actions

If a rule deenes that P(x) can bederived from (x), then the variables in x are pairwise diierent (and, as the notation suggests, the free variables of (x) are exactly the variables in x)

  • If a rule deenes that P(x) can bederived from (x), then the variables in x are pairwise diierent (and, as the notation suggests, the free variables of (x) are exactly the variables in x)

If a rule deenes that P(x) can be derived from , then the Negation Normal Form (NNF) of (x) d o e s n o t c o n tain any derived predicates in negated form

  • If a rule deenes that P(x) can be derived from , then the Negation Normal Form (NNF) of (x) d o e s n o t c o n tain any derived predicates in negated form