The deterministic part of IPC-4: An overview

J Hoffmann, S Edelkamp - Journal of Artificial Intelligence Research, 2005 - jair.org
We provide an overview of the organization and results of the deterministic part of the 4th
International Planning Competition, ie, of the part concerned with evaluating systems doing …

In defense of PDDL axioms

S Thiébaux, J Hoffmann, B Nebel - Artificial Intelligence, 2005 - Elsevier
There is controversy as to whether explicit support for pddl-like axioms and derived
predicates is needed for planners to handle real-world domains effectively. Many …

RAO*: An algorithm for chance-constrained POMDP's

S Thiébaux, B Williams - Proceedings of the AAAI Conference on …, 2016 - ojs.aaai.org
Autonomous agents operating in partially observable stochastic environments often face the
problem of optimizing expected performance while bounding the risk of violating safety …

Strong planning under partial observability

P Bertoli, A Cimatti, M Roveri, P Traverso - Artificial intelligence, 2006 - Elsevier
Rarely planning domains are fully observable. For this reason, the ability to deal with partial
observability is one of the most important challenges in planning. In this paper, we tackle the …

[PDF][PDF] Fast backtrack-free product configuration using a precompiled solution space representation

T Hadzic, S Subbarayan, RM Jensen, HR Andersen… - small, 2004 - Citeseer
The focus in manufacturing industry has shifted from mass production to mass
customization. Companies continually have to offer more product variants with greater …

The probability and timing of power system restoration

RB Duffey, T Ha - IEEE Transactions on power Systems, 2012 - ieeexplore.ieee.org
Power restoration following a large outage or widespread blackout is time critical and
complex. A new method is presented for determining the timing and chance of electric power …

Distributed constraint optimization with structured resource constraints

A Kumar, B Faltings, A Petcu - 2009 - ink.library.smu.edu.sg
Distributed constraint optimization (DCOP) provides a framework for coordinated decision
making by a team of agents. Often, during the decision making, capacity constraints on …

Engineering benchmarks for planning: the domains used in the deterministic part of IPC-4

J Hoffmann, S Edelkamp, S Thiébaux, R Englert… - Journal of Artificial …, 2006 - jair.org
In a field of research about general reasoning mechanisms, it is essential to have
appropriate benchmarks. Ideally, the benchmarks should reflect possible applications of the …

[PDF][PDF] New Complexity Results for Classical Planning Benchmarks.

M Helmert - ICAPS, 2006 - cdn.aaai.org
The 3rd and 4th International Planning Competitions have enriched the set of benchmarks
for classical propositional planning by a number of novel and interesting planning domains …

[LIVRE][B] Understanding planning tasks: domain complexity and heuristic decomposition

M Helmert - 2008 - books.google.com
Action planning has always played a central role in Artificial Intelligence. Given a description
of the current situation, a description of possible actions and a description of the goals to be …