Rv

R.P.J. van der Krogt

30 records found

Computing all-pairs shortest paths by leveraging low treewidth

P3 C

A new algorithm for the Simple Temporal Problem

The Simple Temporal Problem (STP) is a sub-problem of almost any planning or scheduling problem involving time constraints. An existing efficient method to solve the STP, called ΔSTP, is based on partial path consistency and starts from a chordal constraint graph. In this paper, ...

Of Mechanism Design and Multiagent Planning

P3C: A New Algorithm for the Simple Temporal Problem

On Inefficiencies in Multiagent Planning

Self-interested planning agents using plan repair

Plan repair using a plan library

Plan repair in single-agent and multi-agent systems
Doctoral thesis (2005) - R.P.J. van der Krogt (author)

Diagnosis of single and multi-agent plans

Plan repair as an extension of planning

Coordination through plan repair

Multiagent Planning through Plan Repair

The two faces of plan repair

Unrefinement planning: extending refinement planners with plan repair capabilities
Conference paper (2004) - R.P.J. van der Krogt (author)

Resource based multi agent plan merging: framework and application

A resource based framework for planning and replanning

Exploiting opportunities using planning graphs

A resource based framework for planning and replanning

Plan merging: experimental results

A resource based framework for planning and replanning