• Corpus ID: 18348434

PDDL+ : Modelling Continuous Time-dependent Effects

@inproceedings{Fox1999PDDLM,
  title={PDDL+ : Modelling Continuous Time-dependent Effects},
  author={Maria Fox and Derek Long},
  year={1999}
}
The adoption of a common formalism for describing planning domains fosters far greater reuse of research and allows more direct comparison of systems and approaches, and therefore supports faster progress in the field. A common formalism is a compromise between expressive power (in which development is strongly driven by potential applications) and the progress of basic research (which encourages development from well-understood foundations). The role of a common formalism as a communication… 

Figures from this paper

Position Paper: Reasoning About Domains with PDDL

It is argued that PDDL domains should be extended to incorporate a new section which constrains possible problems in the domain, and that such an extension can be based on first-order logic, and described several use cases where this extension might be of use.

Increasing the Numeric Expressiveness of the Planning Domain Definition Language

The example used throughout this paper is the optimisation (minimisation) of machine tool measurement uncertainty, which highlights the limits of PDDL's numerical expressiveness in the absence of the square root function.

Bridging the Gap Between Semantics and Control for Industry 4.0 and Autonomous Production

This paper proposes formal models for declarative and procedural knowledge, which unify the symbolic and subsymbolic representations, and validate the approach with an assembly use-case that illustrates end-to-end autonomous robotic production in a realworld setting.

Refining Process Descriptions from Execution Data in Hybrid Planning Domain Models

This work considers the problem of the refinement of an engineered hybrid domain model, to more accurately capture the effect of the underlying processes, and exploits the information content of the original model, utilising machine learning techniques.

Extending PDDL to Model Stochastic Decision Processes

An extension of PDDL for modeling stochastic decision processes and the use of established logic formalisms, taken from the model checking community, for specifying probabilistic temporally extended goals are proposed.

Extending PDDL to nondeterminism, limited sensing and iterative conditional plans

NPDDL’s extensions are designed to retain backward compatibility with PDDL, and with an emphasis on compactness of the representation, and a powerful, user-friendly plan language to go together with NPDDL is defined.

2005-01-2961 Planner-Based Control of Advanced Life Support Systems

An approach to the integration of qualitative and quantitative modeling techniques for advanced life support (ALS) systems and a reference implementation of an advanced control system using the IDEA control architecture developed at NASA Ames Research Center.

05 ICES-453 Planner-Based Control of Advanced Life Support Systems Nicola Muscettola

An approach to the integration of qualitative and quantitative modeling techniques for advanced life support (ALS) systems and a reference implementation of an advanced control system using the IDEA control architecture developed at NASA Ames Research Center.

Planning for Hybrid Systems via Satisfiability Modulo Theories

This paper presents a new approach for planning for hybrid systems, based on encoding the planning problem as a Satisfiability Modulo Theories (SMT) formula, which is the first SMT encoding that can handle the whole set of PDDL+ features, and is implemented in the planner SMTPlan.

Acquiring Process Knowledge in Hybrid Planning Domains using Machine Learning

Recent progress in Automated Planning not only involves improvements in the efficiency of planning engines but also in the granularity in which domains can be modelled. An important direction is in
...

References

SHOWING 1-10 OF 31 REFERENCES

PDDL-the planning domain definition language

This manual describes the syntax of PDDL, the Planning Domain Definition Language, the problem-specification language for the AIPS-98 planning competition, and hopes to encourage empirical evaluation of planner performance, and development of standard sets of problems all in comparable notations.

Temporal Planning with Mutual Exclusion Reasoning

This paper presents TGP, a new algorithm for temporal planning that operates by incrementally expanding a compact planning graph representation that handles actions of differing duration and demonstrates that mutual exclusion reasoning remains valuable in a rich temporal setting.

Towards a General Theory of Action and Time

HSTS: Integrating Planning and Scheduling

An integrated planner and scheduler for short term scheduling of the Hubble Space Telescope is described and Experimental results show that executable schedules for Hubble can be built in a time compatible with operational needs.

A Temporal Logic for Reasoning About Processes and Plans

A common disclaimer by an AI author is that he has neglected temporal considerations to avoid complication; the implication is nearly made that adding a temporal dimension to the research would be a familiar but tedious exercise that would obscure the new material presented by the author.

Planning with Sharable Resource Constraints

This paper presents a temporal planner, LxTeT, which integrates sharable resource management into the process of plan generation and argues that increasing the expressiveness of a representation can be achieved without fundamentally affecting the global efficiency of the search.

The 1998 AI Planning Systems Competition

The 1998 Planning Competition at the AI Planning Systems Conference was the first of its kind to create planning domains that a wide variety of planning researchers could agree on to make comparison among planners more meaningful, and set up a framework for long-term creation of a repository of problems in a standard notation.

The Event Calculus Explained

  • M. Shanahan
  • Computer Science
    Artificial Intelligence Today
  • 1999
The event calculus is presented, a logic-based formalism for representing actions and their effects which reduces to monotonic predicate completion and is shown to apply to a variety of domains, including those featuring actions with indirect effects, actions with nondeterministic effects, concurrent actions, and continuous change.