| Mathijs M. de Weerdt and Cees Witteveen, "A resource logic for multi-agent plan merging", in Proc. of the 20th Workshop of the UK Planning and Scheduling Special Interest Group, 2001, pp. 244--256. |
No context found.
M. M. de Weerdt, A. Bos, J. Tonino, and C. Witteveen. A resource logic for multi-agent plan merging. Annals of Mathematics and A. I., special issue on Computational Logic on Multi-Agent Systems, 37(1--2):93--130, 2003.
No context found.
M. M. de Weerdt, A. Bos, J. Tonino, and C. Witteveen. A resource logic for multi-agent plan merging. Annals of Mathematics and A. I., special issue on Computational Logic on Multi-Agent Systems, 37(1--2):93--130, 2003.
No context found.
M. M. de Weerdt, A. Bos, J. Tonino, and C. Witteveen. A resource logic for multi-agent plan merging. Annals of Mathematics and Art. Intel., special issue on Computational Logic in Multi-Agent Systems, 37(12):93130, January 2003.
....time. Furthermore, a variant of this algorithm is proposed that handles the exchange of resources in a more exible way. The ideas in the paper will be illustrated by an example from public transportation. This report has been published in the Annals of Mathematics and Arti cial Intelligence [6]. 1 Introduction 1.1 Plan based controlled agents One of the design goals of an agent system is to make the programming of the system easier than in conventional systems. Instead of supplying the system with a list of low level (machine) instructions, an agent is normally told what to do in ....
Mathijs M. de Weerdt, Andre Bos, J.F.M. Tonino, and Cees Witteveen. A resource logic for multi-agent plan merging. Annals of Mathematics and Arti cial Intelligence, special issue on Computational Logic on Multi-Agent Systems, 37(1-2):93-130, Januari 2003.
....certain constraints. Using this formalism, an algorithm for plan merging is developed, which is anytime and runs in polynomial time. The ideas in the paper will be illustrated by an example from public transportation. The formal details of the framework presented in this paper can be found in [1] (to appear) 1 Introduction In an environment with multiple agents that create their own plans, several potential problems may arise. Plans may con ict because they require the same resource for correct execution, or plans may be very ine cient because each agent creates a plan without ....
....constraints between skills in the two services. 6 If Ss is a service over a set S of skills, Skills(Ss) S denotes the set of skills used in Ss. Without loss of generality, we can always assume that whenever s; s 0 2 Skill(Ss) are two di erent skills then var(s) var(s 0 ) In [1] a transition system speci cation of services has been presented allowing us to view a service Ss as complex resource scheme transformations taking a set of input resource schemes In(Ss) and producing a set of output resource schemes Out(Ss) Using this transition system speci cation, the skill ....
[Article contains additional citation context not shown here]
Mathijs M. de Weerdt, Andr Bos, Hans Tonino, and Cees Witteveen. A resource logic for multi-agent plan merging. Annals of Mathematics and Articial Intelligence, special issue on Computational Logic on Multi-Agent Systems, to appear, 2002. 12
....agents (cf. 4, 7, 8] or on cooperation once complete plans have been constructed, called plan merging [2, 9, 12] In this paper we will consider an extension of this latter work where planning and cooperation is fully integrated: cooperative heuristic multi agent planning. In previous work [6, 10, 11], we have developed a framework for multi agent planning using an explicit representation of resources, skills and goals in a multiagent environment. This framework was used in a plan merging algorithm, where complete plans were merged. In this paper, the agents have to actually compute a plan ....
....resources for them. The procedure described above is not complete: Due to the heuristic function used and the fact it doesn t back track, it might fail to nd a solution in cases one does exist. As already mentioned, we will use our action and resource planning formalism (ARPF) see, e.g. [9, 10, 11]) 1 Therefore, in Section 2 we will brie y summarize this framework. Then, in Section 3 we will present our cooperative heuristic multiagent planning algorithm. We conclude the paper with a discussion and some ideas for future work. 2 The action resource planning formalism (ARPF) The framework ....
[Article contains additional citation context not shown here]
M. M. de Weerdt, A. Bos, H. Tonino, and C. Witteveen. A resource logic for multi-agent plan merging. Accepted by the Annals of Mathematics and Articial Intelligence, special issue on Computational Logic on Multi-Agent Systems, 2001.
No context found.
Mathijs M. de Weerdt and Cees Witteveen, "A resource logic for multi-agent plan merging", in Proc. of the 20th Workshop of the UK Planning and Scheduling Special Interest Group, 2001, pp. 244--256.
No context found.
M. M. de Weerdt and C. Witteveen. A resource logic for multi-agent plan merging. In Proc. of the 20th Workshop of the UK Planning and Scheduling Special Interest Group, pages 244--256, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC