Disclaimer

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

You may be interested to see what Google Scholar has in its database.

2009

R.P.J. van der Krogt. Quantifying Privacy in Multiagent Planning. Accepted for Multiagent and Grid Systems: An International Journal, Special Issue on Coordinating Agents' Plans and Schedules.
[ view abstract | bibtex ]

Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, a metric to evaluate the privacy performance of planners is virtually non-existent. This makes it hard to compare different algorithms on their performance with regards to privacy. Moreover, it prevents multiagent planning methods from being designed specifically for this aspect.
This paper introduces such a measure for privacy. It is based on Shannon's theory of information and revolves around counting the number of alternative plans that are consistent with information that is gained during, for example, a negotiation step, or the complete planning episode. To accurately obtain this measure, one should have intimate knowledge of the agent's domain. It is unlikely (although not impossible) that an opponent who learns some information on a target agent has this knowledge. Therefore, it is not meant to be used by an opponent to understand how much he has learned. Instead, the measure is aimed at agents who want to know how much privacy they have given up, or are about to give up, in the planning process. They can then use this to decide whether or not to engage in a proposed negotiation, or to limit the options they are willing to negotiate upon.

Bibtex not available yet

2008

R.P.J. van der Krogt, M.M. de Weerdt, and Y. Zhang. Of Mechanism Design and Multiagent Planning. In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-08), 2008.
[ view abstract | bibtex ]

Multiagent planning methods are concerned with planning by and for a group of agents. If the agents are self-interested, they may be tempted to lie in order to obtain an outcome that is more rewarding for them. We therefore study the multiagent planning problem from a mechanism design perspective, showing how to incentivise agents to be truthful. We prove that the well-known truthful VCG mechanism is not always truthful in the context of optimal planning, and present a modification to fix this. Finally, we present some (domain-dependent) poly-time planning algorithms using this fix that maintain truthfulness in spite of their non-optimality.
```
@inproceedings{ krogt08ecai,
  author    = {Roman van der Krogt and Mathijs de Weerdt and Yingqian Zhang},
  title     = {Of Mechanism Design and Multiagent Planning},
  year      = 2008,
  booktitle = {Proceedings of the Eighteenth European Conference on Artificial Intelligence},
  pages     = {423--427}
}
```
R.P.J. van der Krogt. Modification Strategies for SAT-based Plan Adaptation. In Archives of Control Sciences 18(2):203-230. Also published as Technical report TR-03-2008.
[ view abstract | bibtex ]

Planning, the generation of a course of action to achieve a set of goals, is an important technique in the development of intelligent agents. Heretofore, planning has been largely considered as a one-shot problem. However, in practice, we are often dealing with situations in which an existing plan has to be adapted. Not only might we be facing a dynamic environment that requires a plan to be repaired, but it may also be that we recognise the new planning problem as being similar to one that we have solved before (i.e. case-based planning).
This paper investigates a plan adaptation framework based on SAT-encodings of the planning problem. Compilation techniques have been very successfully applied to planning, as evidenced by their success in recent planning competitions. So far, however, such techniques have not been used for plan adaptation purposes. This paper explores whether it is feasible to modify the generated SAT instances such as to encode information that was extracted from the solution to the original planning problem.
```
@article{ krogt08acs,
  author    = {Roman van der Krogt},
  title     = {Modification Strategies for {SAT}-based Plan Adaptation},
  year      = 2008,
  journal   = {Archives of Control Sciences},
  volume    = {18},
  number    = {2},
  pages     = {203--230}
}
```
L.R. Planken, M.M. de Weerdt and R.P.J. van der Krogt. P³C: A New Algorithm for the Simple Temporal Problem. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS-08), 2008.
[ view abstract | bibtex ]

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, we analyse this algorithm and show that there exist instances for which its time complexity is quadratic in the number of triangles in the constraint graph. We propose a new algorithm, P³C, whose worst-case time complexity is linear in the number of triangles. We show both formally and experimentally that P³C outperforms ΔSTP significantly.
```
@inproceedings{ planken08icaps,
  author    = {L{'e}on Planken and Mathijs de Weerdt and Roman van der Krogt},
  title     = {P3C: A New Algorithm for the Simple Temporal Problem},
  year      = 2008,
  booktitle = {Proceedings of the Eighteenth International Conference
               on Automated Planning and Scheduling ({ICAPS}-08)},
  pages     = {256--263}
}
```
R.P.J. van der Krogt and J. Little. Finding Efficient Dispatching Rules using Optimisation and Simulation. In Proceedings of the 19th Irish Conference of Artificial Intelligence and Cognitive Science (AICS-08), 2008.
[ view abstract | bibtex ]

The COSAR project ---Combination of Optimisation and Simulation in the Assessment of Risk--- aims to investigate the combination of optimisation and simulation techniques to better deal with uncertainty in manufacturing environments. As a pilot study, we investigated the generation of robust dispatch rules for high-volume cartoning of contact lenses. It is often difficult to determine initially the best set of rules. Here we demonstrate how an initial good set of rules, generated from an optimization model can be improved (manually) through information from a simulation model.
```
@inproceedings{ krogt08aics,
  author    = {Roman van der Krogt and James Little},
  title     = {Finding Efficient Dispatching Rules using Optimisation and
               Simulation},
  year      = 2008,
  booktitle = {Proceedings of the Nineteenth Irish Conference of Artificial
               Intelligence and Cognitive Science},
  pages     = {262--271}
}
```

R.P.J. van der Krogt, M.M. de Weerdt, and Y. Zhang. Of Mechanism Design and Multiagent Planning (abstract). In Proceedings of the Twentieth Belgian-Netherlands Conference on Artificial Intelligence (BNAIC-08), 2008.
L.R. Planken, R.P.J. van der Krogt and M.M. de Weerdt. P³C: A New Algorithm for the Simple Temporal Problem (abstract). In Proceedings of the Twentieth Belgian-Netherlands Conference on Artificial Intelligence (BNAIC-08), 2008.

2007

R.P.J. van der Krogt. Privacy in Multiagent Planning: A Classical Definition with Illustration. In Proceedings of the AAMAS-07 Workshop on Coordinating Agents' Plans and Schedules, 2007.
[ view abstract | bibtex ]

Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning hardly ever make explicit in what ways their systems protect their users' privacy, nor do they give a quantitative analysis. The reason for this is that a theory of privacy loss in multiagent planning is virtually non-existent so far.
This paper proposes a measure for privacy loss based on Shannon's theory of information. To illustrate our approach, we apply this metric to an existing multiagent planning system to assess its merits when it comes to privacy on two domains. For this, we compare its plans to centrally generated solutions (by a trusted third party) for the same problems. The results clearly establish the need for such an analysis: even though the multiagent planner seemingly exchanges little information, its overall performance with respect to privacy is less than that of the centralised system (not taking into account the privacy loss with respect to the central planner, of course).
```
@inproceedings{ krogt07caps,
  author    = {Roman van der Krogt},
  title     = {Privacy in Multiagent Planning: A Classical Definition with
               Illustration},
  year      = 2007,
  booktitle = {Proceedings of the AAMAS-07 Workshop on Coordinating Agents' Plans
                and Schedules},
  pages     = {17--24},
  editor    = {Michael Brenner and Brad Clement and Mathijs de Weerdt},
  location  = {Honolulu, Hawaii}
}
```
Roman van der Krogt, James Little, Kenneth Pulliam, Sue Hanhilammi, and Yue Jin. Scheduling for Cellular Manufacturing. In Proceedings of the 13th International Conference on Principles and Practice of Constraint Programming, 2007. (Springer link)
[ view abstract | bibtex ]

Alcatel-Lucent is a major player in the field of telecommunications. One of the products it offers to network operators is wireless infrastructure such as base stations. Such equipment is delivered in cabinets. These cabinets are packed with various pieces of electronics: filters, amplifiers, circuit packs, etc. The exact configuration of a cabinet is dependent upon the circumstances it is being placed in, and some 20 product groups can be distinguished. However, the variation in cabinets is large, even within one product group. For this reason, they are built to order.
In order to improve cost, yield and delivery performance, lean manufacturing concepts were applied to change the layout of the factory to one based on cells. These cells focus on improving manufacturing through standardised work, limited changeovers between product groups and better utilisation of test equipment. A key component in the implementation of these improvements is a system which schedules the cells to satisfy customer request dates in an efficient sequence.
This paper describes the transformation and the tool that was built to support the new method of operations. The implementation has achieved significant improvements in manufacturing interval, work in process inventory, first test yield, headcount, quality (i.e. fewer defects are found during the testing stage) and delivery performance. Although these benefits are mainly achieved because of the change to a cell layout, the scheduling tool is crucial in realising the full potential of it.
```
@inproceedings{ krogt07cp,
  author    = {Roman van der Krogt and James Little and Kenneth Pulliam and
               Sue Hanhilammi and Yue Jin},
  title     = {Scheduling for Cellular Manufacturing},
  year      = 2007,
  booktitle = {Proceedings of the Thirteenth International Conference on Principles
               and Practice of Constraint Programming ({CP}-07)},
  pages     = {105--117},
  location  = {Providence, Rhode Island}
}
```
R.P.J. van der Krogt. Privacy Loss in Classical Multiagent Planning. In Proceedings of the 2007 IEEE/WIC/ACM International Conference on Intelligent Agent Technology (IAT-07), 2007. (IEEE link)
[ view abstract | bibtex ]

Privacy is often cited as the main reason to adopt a multiagent approach for a certain problem. This also holds true for multiagent planning. Still, papers on multiagent planning hardly ever make explicit in what ways their systems protect their users' privacy, nor do they give a quantitative analysis. The reason for this is that a theory of privacy loss in multiagent planning is virtually non-existent so far.
This paper proposes a measure for privacy loss based on Shannon's theory of information. To illustrate our approach, we apply this metric to an existing multiagent planning system to assess its merits when it comes to privacy on two domains. For this, we compare its plans to centrally generated solutions (by a trusted third party) for the same problems. The results clearly establish the need for such an analysis: even though the multiagent planner seemingly exchanges little information, its overall performance with respect to privacy is less than that of the centralised system (not taking into account the privacy loss with respect to the central planner, of course).
```
@inproceedings{ krogt07iat,
  author    = {Roman van der Krogt},
  title     = {Privacy Loss in Classical Multiagent Planning},
  year      = 2007,
  booktitle = {Proceedings of the 2007 {IEEE}/{WIC}/{ACM} International Conference on
               Intelligent Agent Technology ({IAT}-07)},
  pages     = {168--174},
  location  = {Silicon Valley, California}
}
```

R.P.J. van der Krogt. Scheduling Implant Operations using Constraint-Based Scheduling (abstract). In Proceedings of the 3rd Workshop on Simulation in Manufacturing, Services and Logistics, 2007.
[ view abstract | bibtex ]

Our presentation describes recent work on implant scheduling that was undertaken in collaboration with Intel Ireland.

@inproceedings{ krogt07simsoc,
  author    = {Roman van der Krogt},
  title     = {Scheduling Implant Operations using Constraint-Based Scheduling (abstract)},
  year      = 2007,
  booktitle = {Online Proceedings of the Third Workshop on Simulation in Manufacturing,
               Services and Logistics}
  location  = {Dublin, Ireland}
}

2006

R.P.J. van der Krogt and J. Little. The PDES Workbench. In Proceedings of the 13th International Conference on Concurrent Engineering: Research and Applications (CE-06), 2006. (IOS Press link)
[ view abstract | bibtex ]

Central to the operation of a manufacturing plant is the planning and scheduling of the activities that take place. The quality of the plans and schedules produced has significant impact on the effectiveness and efficiency of a company. These schedules are restricted by the constraints imposed upon them by the design of the plant. However, while expert designers are able to roughly predict the outcome of a design in terms of its overall throughput, quantitative figures on future schedules are not usually produced. By implication, design constraints may be found to be expensive in scheduling terms during the operation of the plant and at a stage when improvements are hard or expensive to make.
This paper presents the PDES Workbench, a graphical system that is able to generate plans and schedules based on real-life manufacturing plant designs. This allows a manager or planner to assess the schedulability of a particular design at an early stage. When a schedule is found to be flawed in any aspect, it may not be apparent what to change in the design without degrading other aspects of the schedule. Therefore, the system is equipped with a case-based reasoning system that is able to proactively suggest ways of improving the design for improved scheduling results.
```
@inproceedings{ krogt06ce,
  author    = {Roman van der Krogt and James Little},
  title     = {The {PDES} Workbench},
  year      = 2006,
  booktitle = {Proceedings of the Thirteenth International Conference
               on Concurrent Engineering: Research and Applications ({CE}-06)},
  pages     = {619--626},
  location  = {Antibes, France}
}
```
M.M. de Weerdt and R.P.J. van der Krogt. Inefficiencies in Task Allocation for Multiagent Planning with Bilateral Deals. In Proceedings of the 25th workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG-06), 2006.
[ view abstract | bibtex ]

Distributed planning in a multiagent environment may give rise to inefficiencies. We study this effect focussing on the task allocation problem. We show that in the worst case, the result of a multiagent approach can be arbitrarily bad in theory when recontracting and multilateral deals are not allowed. This is a more precise result than was previously known, which was that we are not guaranteed to find the optimal solution. We show that the sources of this disappointing result are the impossibility to come back on (bad) contracts in combination with either selfish agents, or agents that have incomplete information on potential costs. Furthermore, we show some preliminary experimental results of the effect of these causes on the optimality of a solution for multiagent task allocation. Interestingly, none of the experiments exhibit the very negative outcomes that are predicted by the theory. Although it is too early to draw conclusions, this might indicate that in practical situations, the circumstances that lead to the theoretical results are very unlikely.
```
@inproceedings{ weerdt06plansig,
  author    = {Mathijs de Weerdt and Roman van der Krogt},
  title     = {Inefficiencies in Task Allocation for Multiagent Planning
               with Bilateral Deals},
  year      = 2006,
  booktitle = {Proceedings of the Twentyfifth workshop of the {UK} Planning and
               Scheduling Special Interest Group ({PlanSIG}-06)},
  pages     = {33--38},
  editor    = {Rong Qu},
  location  = {Nottingham, {UK}}
}
```

2005

R.P.J. van der Krogt and M.M. de Weerdt. Plan Repair as an Extension of Planning. In Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), 2005. (AAAI link)
[ view abstract | bibtex ]

In dynamic environments, agents have to deal with changing situations. In these cases, repairing a plan is often more efficient than planning from scratch, but existing planning techniques are more advanced than existing plan repair techniques. Therefore, we propose a straightforward method to extend planning techniques such that they are able to repair plans. This is possible, because plan repair consists of two different operations: (i) removing obstructing constraints (such as actions) from the plan, and (ii) adding actions to achieve the goals. Adding actions is similar to planning, but as we demonstrate, planning heuristics can also be used for removing constraints, which we call unrefinement. We present a plan repair template that reflects these two operations, and we present a heuristic for unrefinement that can make use of an arbitrary existing planning technique. We apply this method to an existing planning system (VHPOP) resulting in POPR, a plan repair system that performs much better than replanning from scratch, and also significantly better than another recent plan repair method (GPG). Furthermore, we show that the plan repair template is a generalisation of existing plan repair methods.
```
@inproceedings{ krogt05icaps,
  author    = {Roman van der Krogt and Mathijs de Weerdt},
  title     = {Plan Repair as an Extension of Planning},
  year      = 2005,
  booktitle = {Proceedings of the Fifteenth International Conference
               on Automated Planning and Scheduling ({ICAPS}-05)},
  pages     = {161--170},
  location  = {Monterey, California}
}
```
C. Witteveen, N.Roos, R.P.J. van der Krogt and M.M. de Weerdt. Diagnosis of Single and Multi-Agent Plans. In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-05), 2005.
[ view abstract | bibtex ]

We discuss the application of Model Based Diagnosis in agent-based planning. We model a plan as a system to be diagnosed and assume that agents can monitor the execution of the plan by making partial observations during plan execution. These observations are used by the agents to explain plan deviations (errors) by qualifying some action instances as behaving abnormally. We prefer those qualifications that are maximum informative, i.e. explain as much as possible. Since in a plan several instances of the same action might occur, an error occurring in one instance might be used to predict the occurrence of the same error in an action instance to be executed later on. To account for such correlations, we introduce causal rules to generate diagnoses from action instances qualified as abnormally and we introduce Pareto minimal causal diagnoses as the right extension of classical minimal diagnoses.
Next, we consider the multi-agent perspective where each agent is responsible for a part of the total plan, we show how plan-diagnoses of these partial plans are related to diagnoses of the total plan and how global diagnoses can be obtained in a distributed way.
```
@inproceedings{ witteveen05aamas,
  author    = {Cees Witteveen and Nico Roos and Roman van der Krogt and Mathijs de Weerdt},
  title     = {Diagnosis of Single and Multi-Agent plans},
  year      = 2005,
  booktitle = {Proceedings of the Fourth International Joint Conference on Autonomous Agents and
               Multi Agent Systems},
  pages     = {805--812},
  location  = {Utrecht, The Netherlands}
}
```
R.P.J. van der Krogt and M.M. de Weerdt. Self-interested Planning Agents Using Plan Repair. In Proceedings of the ICAPS 2005 Workshop on Multiagent Planning and Scheduling, 2005.
[ view abstract | bibtex ]

We present a novel approach to multiagent planning for self-interested agents. The main idea behind our approach is that multiagent planning systems should be built upon (single-agent) plan repair systems. In our system agents can exchange goals and subgoals through an auction, using their own heuristics or utility functions to determine when to auction and what to bid. Some experimental results for a logistics domain demonstrate empirically that this system supports the coordination of self-interested agents.
```
@inproceedings{ krogt05icapsws,
  author    = {Roman van der Krogt and Mathijs de Weerdt},
  title     = {Self-interested Planning Agents Using Plan Repair},
  year      = 2005,
  booktitle = {Proceedings of the {ICAPS} 2005 Workshop on Multiagent
               Planning and Scheduling},
  pages     = {36--44},
  location  = {Monterey, California}
}
```
R.P.J. van der Krogt and M.M. de Weerdt. Coordination through Plan Repair. In Proceedings of the 4th Mexican International Conference on Artificial Intelligence (MICAI-05), 2005.
[ view abstract | bibtex ]

In most practical situations, agents need to continuously improve or repair their plans. In a multiagent system agents also need to coordinate their plans. Consequently, we need methods such that agents in a multiagent system can construct, coordinate, and repair their plans. In this paper we focus on the problem of coordinating plans without exchanging explicit information on dependencies, or having to construct a global set of constraints. Our approach is to combine a propositional plan repair algorithm for each agent with a blackboard that auctions subgoals on behalf of the agents. Both the details of a first construction and some initial experimental results are discussed.
```
@inproceedings{ krogt05micai,
  author    = {Roman van der Krogt and Mathijs de Weerdt},
  title     = {Coordination through Plan Repair},
  year      = 2005,
  booktitle = {Proceedings of the Fourth Mexican International Conference on
               Artificial Intelligence ({MICAI}-05)},
  pages     = {264--274},
  location  = {Monterrey, Mexico}
}
```
R.P.J. van der Krogt and M.M. de Weerdt. Plan Repair using a Plan Library. In Proceedings of the Seventeenth Belgium-Netherlands Conference on Artificial Intelligence (BNAIC-05), 2005.
[ view abstract | bibtex ]

Plan library's have proven their added value to the efficiency of planning. In this paper, we present results on the use of a plan library to plan repair. We show that using a relatively simple library, we can already obtain signifficant improvements in efficiency compared to plan repair without a library.
```
@inproceedings{krogt05bnaic,
  author    = {Roman van der Krogt and Mathijs de Weerdt},
  title     = {Plan Repair using a Plan Library},
  booktitle = {Proceedings of the Belgium-Dutch Conference on Artificial Intelligence (BNAIC-05)},
  year      = {2005},
  pages     = {254--259}
}
```
R.P.J. van der Krogt. Plan Repair in Single-Agent and Multi-Agent Systems. Ph.D. Thesis, Delft University of Technology, 2005.
[ view abstract | bibtex ]

Autonomous agents need to be equipped with a planning component that lets them devise a plan to reach their goals. However, this is not enough, as we saw in the various examples that were provided. Often a plan may become ineffective or inefficient because of changes in the environment that the agent did not expect. Also, agents may need other agents to perform certain subtasks that they cannot perform themselves. Therefore, agents also need to be equipped with techniques to deal with the coordination of their actions with other agents and to deal with dynamic environments. This thesis focuses on the latter of these types of techniques, while taking into account the former type: we investigate plan repair in a multi-agent context.
```
@PHDTHESIS{krogt05thesis,
  author = {Roman van der Krogt},
  title = {Plan repair in Single-Agent and Multi-Agent Systems},
  school = {Delft University of Technology},
  year = {2005},
  address = {Delft, The Netherlands}
}
```

R.P.J. van der Krogt, M.M. de Weerdt, C. Witteveen and N. Roos. Multiagent Planning through Plan Repair (abstract). In Proceedings of the 4th International Joint Conference on Autonomous Agents and Multi Agent Systems (AAMAS-05), 2005.
R.P.J. van der Krogt and M.M. de Weerdt. Coordination through Plan Repair (abstract). In Proceedings of the 3rd European Workshop on Multiagent Systems (EUMAS-05), 2005.

2004

R.P.J. van der Krogt, M.M. de Weerdt, and C. Witteveen. A resource based framework for planning and replanning. In Web Intelligence and Agent Systems 1: 3-4, pp. 173-186, 2003. (IOS Press link) (bibtex entry)
R.P.J. van der Krogt and M.M. de Weerdt. The Two Faces of Plan Repair. In Proceedings of the Sixteenth Belgium-Netherlands Conference on Artificial Intelligence (BNAIC-04), 2004. (bibtex entry)
R.P.J. van der Krogt. Unrefinement Planning: Extending Refinement Planners with Plan Repair Capabilities. In Proceedings of the 23rd Annual Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG-04), 2004. (bibtex entry)
R.P.J. van der Krogt and M.M. de Weerdt, Plan Repair: A Framework and a New Heuristic with Applications to Logistics. In Proceedings of the 8th TRAIL Congress, 2004. (bibtex entry)

2003

R.P.J. van der Krogt, M.M. de Weerdt, and C. Witteveen. Exploiting Opportunities using Planning Graphs. In Proceedings of the 22nd Annual Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG-03), 2003. (bibtex entry)
M.M. de Weerdt, R.P.J. van der Krogt, and C. Witteveen. Resource Based Multi Agent Plan Merging: framework and application. In Proceedings of the 22nd Annual Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG-03), 2003. (bibtex entry)
M.M. de Weerdt, R.P.J. van der Krogt, and J. Zutt. Plan Merging: Experimental Results. In Proceedings of the Fifteenth Belgium-Netherlands Conference on Artificial Intelligence (BNAIC-03), 2003. (bibtex entry)
R.P.J. van der Krogt, M.M. de Weerdt, and C. Witteveen. A resource based framework for planning and replanning. In Proceedings of the IEEE/WIC International Conference on Intelligent Agent Technology (IAT-03), 2003. (IEEE link) (bibtex entry)
R.P.J. van der Krogt, M.M. de Weerdt, and C. Witteveen. Integrating Planning and Replanning in the ARF. Manuscript. (bibtex entry)

2002

M.M. de Weerdt, R.P.J. van der Krogt. A Method to Integrate Planning and Coordination. An invited talk for the AAAI Workshop on Planning with and for Multi-agent Systems, 2002. (bibtex entry)
R.P.J. van der Krogt, A.Bos, and C. Witteveen. Replanning in a Resource-based Framework. In Multi-Agent-Systems and Applications II: 9th ECCAI-ACAI/EASSS 2001, AEMAS 2001, HoloMAS 2001. Selected Revised Papers, 2002. (Springer link) (bibtex entry)
L.D. Aronson, R.P.J. van der Krogt, C. Witteveen, and J.Zutt. Automated Transport Planning Using Agents. In Proceedings of the International Congress on Freight Transport Automation and Multimodality, 2002. (bibtex entry)
R.P.J. van der Krogt, L.D. Aronson, and J. Zutt. Incident Management in Transport Planning. In Proceedings of the 7th TRAIL Congress, 2002. (bibtex entry)
R.P.J. van der Krogt, L.D. Aronson, N. Roos, C. Witteveen, and J.Zutt. Tactical Planning using Heuristics. In Proceedings of the BNAIC, 2002, pp. 187-194.
J.Zutt, L.D. Aronson, R.P.J. van der Krogt, N. Roos, and C. Witteveen. Multi-Agent Transport Planning. In Proceedings of the BNAIC, 2002, pp. 387-394.

2001

R.P.J. van der Krogt, A. Bos, and C. Witteveen. Replanning in a Resource-based Framework. In Proceedings of Multi-Agent Systems and Applications - ACAI 2001 & EASSS 2001 Student Sessions, 2001.
R.P.J. van der Krogt, A. Bos, and C. Witteveen. Plan Fragment Libraries. In Proceedings of the BNAIC, 2001, pp. 399-406.

2000

R.P.J. van der Krogt, A. Bos, M.M. de Weerdt, and C. Witteveen. An Algorithm for Replanning. In Proceedings of the BNAIC, 2000, pp. 21-28.

Welcome to my little place on the 'Net

[P]apers

What's new

Contact

Buttons & Banners