Searched for:
(41 - 60 of 76)

Pages

document
De Weerdt, M.M. (author), Zhang, Y. (author), Klos, T. (author)
This paper proposes a new variant of the task allocation problem, where the agents are connected in a social network and tasks arrive at the agents distributed over the network. We show that the complexity of this problem remains NPhard. Moreover, it is not approximable within some factor. We develop an algorithm based on the contract-net...
conference paper 2007
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
We describe an algorithm for learning simple timed automata, known as real-time automata. The transitions of real-time automata can have a temporal constraint on the time of occurrence of the current symbol relative to the previous symbol. The learning algorithm is similar to the redblue fringe state-merging algorithm for the problem of learning...
conference paper 2007
document
Steenhuisen, J.R. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
In crisis response, hierarchical organizations are being replaced by dynamic assemblies of autonomous agents that promise more agility. However, these autonomous agents might cause a decrease in effectiveness when individually constructed plans for moderately-coupled tasks are not jointly feasible. Existing coordination techniques can be applied...
conference paper 2007
document
De Weerdt, M.M. (author), Van der Krogt, R.P.J. (author)
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...
conference paper 2006
document
Máhr, T. (author), De Weerdt, M.M. (author), Srour, F.J. (author), Zuidwijk, R. (author)
Decision support within transport companies should not only use traditional objective functions, but also reason about qualitative effects on all involved actors. We propose a fuzzy logic rule base that can be used in addition to traditional operation research tools to calculate not just optimal solutions, but solutions that are optimal with...
conference paper 2006
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
We are interested in identifying a model for discrete event systems from observations. A common way to model discrete event systems is by using deterministic finite state automata (DFA). When observing a system, however, there often is information in addition to the system events, namely, their times of occurrence. If this time information is...
conference paper 2006
document
Pantic, M. (author), Zwitserloot, R. (author), De Weerdt, M.M. (author)
This paper describes a novel, learner-centered technology for authoring web lectures. Besides seamless integration of video and audio feeds, Microsoft PowerPoint slides, and web-pages, the proposed Online Learning Facility (OLF) also facilitates online interactive testing and review of covered materials, online provision of feedback, real-time...
conference paper 2006
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
In our paper we focus on learning systems of which the execution is determined by a finite set of discrete events. The full version of this paper appeared in: Proceedings of the 15th Annual Machine Learning Conference of Belgium and the Netherlands (Benelearn 2006): http://resolver.tudelft.nl/uuid:faab7982-46bf-4d52-8a2a-324a88542584
conference paper 2006
document
Máhr, T. (author), De Weerdt, M.M. (author)
Multi-attribute auctions allow negotiations over multiple attributes besides price. For example in task allocation, service providers can define their service by means of multiple attributes, such as quality of service, deadlines, or delay penalties. Auction mechanisms assume that the players have evaluation functions over the space of...
conference paper 2006
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
A model for discrete event systems (DES) can be learned from observations. We propose a simple type of timed automaton to model DES where the timing of the events is important. Learning such an automaton is proven to be NP-complete by a reduction from the problem of learning deterministic finite state automata (DFA) without time. Based on this...
conference paper 2006
document
De Weerdt, M.M. (author), Witteveen, C. (author)
Many different problems are called distributed or multiagent planning problems. Existing approaches each deal with only a subset of these problems. Which properties are essential in determining a solution method for multiagent planning problems? We argue that mainly the facts that communication is limited, agents have private goals, and the...
conference paper 2006
document
Witteveen, C. (author), De Weerdt, M.M. (author)
conference paper 2006
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author)
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 significant improvements in efficiency compared to plan repair without a library.
conference paper 2005
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Witeveen, C. (author)
We argue that timed models are a suitable framework for the detection of behavior in real-world event systems. A timed model which detects behavior is constructible by a domain expert. The inference of these timed models from data is a hard problem. We prove the inference of a class of timed automata (event recording automata) to be harder than...
conference paper 2005
document
Verwer, S.E. (author), De Weerdt, M.M. (author), Zutt, J. (author)
In this interactive event we demonstrate a web-based software tool to teach theorem proving in propositional logic, called Bop. This tool is a proof editor in the Fitch proof system that can give hints, proofsteps, or even complete proofs to the student.
conference paper 2005
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author)
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...
conference paper 2005
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author)
We present a novel approach to multiagent planning for selfinterested agents. The main idea behind our approach is that multiagent planning systems should be built upon (singleagent) 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...
conference paper 2005
document
Máhr, T. (author), De Weerdt, M.M. (author)
conference paper 2004
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author)
Plan repair has two faces. Alternately, a plan repair method looks like a planning method, or looks like a method that does exactly the opposite, i.e., removing actions from a plan. We propose a general framework for plan repair that shows the relation between these two alternating steps. Any plan repair method has this property. This claim is...
conference paper 2004
document
De Weerdt, M.M. (author), Van der Krogt, R.P.J. (author), Witteveen, C. (author)
We discuss a resource-based planning framework where agents are able to merge plans by exchanging resources. In this framework, plans are specified as structured objects composed of resource consuming and resource producing processes (actions). A plan itself can also be conceived as a process consuming input resources and producing output...
conference paper 2003
Searched for:
(41 - 60 of 76)

Pages