Searched for:
(1 - 20 of 58)

Pages

document
Witteveen, J.A.S. (author), Bijl, H. (author)
A monomial chaos approach is proposed for efficient uncertainty quantification in nonlinear computational problems. Propagating uncertainty through nonlinear equations can still be computationally intensive for existing uncertainty quantification methods. It usually results in a set of nonlinear equations which can be coupled. The proposed...
conference paper 2006
document
Oosterman, J.E.G. (author), Ravenhorst, R. (author), Witteveen, C. (author), Van Leeuwen, P. (author)
At airports, the turnaround process of aircraft is crucial for a timely and efficient handling of air traffic. During this process, a number of services need to be provided during the time the aircraft is at the gate: e.g., de-boarding, cleaning, catering, fuelling, and boarding. These services are provided by different service providers (agents...
conference paper 2008
document
Ter Mors, A.W. (author), Witteveen, C. (author), Zutt, J. (author), Kuipers, F.A. (author)
In context-aware route planning, there is a set of transportation agents each with a start and destination location on a shared infrastructure. Each agent wants to find a shortest-time route plan without colliding with any of the other agents, or ending up in a deadlock situation. We present a single-agent route planning algorithm that is both...
conference paper 2010
document
Planken, L.R. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
When agents need to interact in order to solve some (possibly common) problem, resolving potential conflicts beforehand is often preferred to coordination during execution. Agents may lose some flexibility, but their course of action will be more predictable and often also more efficient, obtaining a socially optimal outcome instead of a local...
conference paper 2010
document
Witteveen, J.A.S. (author), Bijl, H. (author)
conference paper 2008
document
Ter Mors, A.W. (author), Witteveen, C. (author)
In multi-agent routing, there is a set of mobile agents each with a start location and destination location on a shared infrastructure. An agent wants to reach its destination as quickly as possible, but conflicts with other agents must be avoided. We have previously developed a single-agent route planning algorithm that can find a shortest-time...
conference paper 2012
document
Loeven, A. (author), Witteveen, J.A.S. (author), Bijl, H. (author)
In this paper a Two Step approach with Chaos Collocation for efficient uncertainty quantification in computational fluid-structure interactions is followed. In Step I, a Sensitivity Analysis is used to efficiently narrow the problem down from multiple uncertain parameters to one parameter which has the largest influence on the solution. In Step...
conference paper 2006
document
De Weerdt, M.M. (author), Bos, A. (author), Tonino, J.F.M. (author), Witteveen, C. (author)
We introduce an algorithm for cooperative planning in multi-agent systems. The algorithm enables the agents to combine (fuse) their plans in order to increase their joint profits. A computational resources and skills framework is developed for representing the planned activities of an agent under time constraints. Using this resource-skill...
conference paper 2000
document
Bos, A. (author), De Weerdt, M.M. (author), Witteveen, C. (author), Tonino, J.F.M. (author), Valk, J. (author)
conference paper 1999
document
Buzing, P.C. (author), Steenhuisen, J.R. (author), Witteveen, C. (author)
We address the problem of coordinating autonomous agents that have to come up with a joint plan and schedule for a set of tasks. These tasks are interdependent and temporally constrained and are distributed over the agents. We start with investigating the scheduling part of the problem: How to achieve, given the constraints, a joint solution to...
conference paper 2006
document
Noroozian, A. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
The fundamental problem with P2P networks is that quality of service depends on altruistic resource sharing by participating peers. Many peers freeride on the generosity of others. Current solutions like sharing ratio enforcement and reputation systems are complex, exploitable, inaccurate or unfair at times. The need to design scalable...
conference paper 2012
document
Van der Krogt, R.P.J. (author), De Weerdt, M.M. (author), Witteveen, C. (author)
We discuss a rigorous unifying framework for both planning and replanning, extending an existing logic-based approach to resource-based planning. The primitive concepts in this Action Resource Framework (ARF) are actions and resources. Actions consume and produce resources. Plans are structures composed of actions, resource facts and an explicit...
conference paper 2003
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
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
document
De Weerdt, M.M. (author), Bos, A. (author), Tonino, J.F.M. (author), Witteveen, C. (author)
ƒ†Œˆœ
conference paper 2000
document
Wilson, M. (author), Witteveen, C. (author), Huisman, B. (author)
conference paper 2012
document
Endhoven, L. (author), Klos, T.B. (author), Witteveen, C. (author)
Multi-agent planning and scheduling concerns finding a joint plan to achieve some set of common goals with several independent agents each aiming to find a plan or schedule for their part of the goals. To avoid conflicts in these individual plans or schedules decoupling is used. Such a decoupling entails adding local constraints for the agents...
conference paper 2011
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
Witteveen, J.A.S. (author), Bijl, H. (author)
A monomial chaos approach is proposed for efficient uncertainty quantification in nonlinear computational problems. Propagating uncertainty through nonlinear equations can still be computationally intensive for existing uncertainty quantification methods. It usually results in a set of nonlinear equations which can be coupled. The proposed...
conference paper 2006
document
Wilson, M. (author), Klos, T.B. (author), Witteveen, C. (author), Huisman, B. (author)
conference paper 2013
Searched for:
(1 - 20 of 58)

Pages