Multi-agent planning problems with constraints on global resource consumption occur in several domains. Existing algorithms for solving Multi-agent Markov Decision Processes can compute policies that meet a resource constraint in expectation, but these policies provide no guarantees on the probability that a resource constraint violation will occur. We derive a method to bound constraint violat...

Multi-agent planning problems with constraints on global resource consumption occur in several domains. Existing algorithms for solving Multi-agent Markov Decision Processes can compute policies that meet a resource constraint in expectation, but these policies provide no guarantees on the probability that a resource constraint violation will occur. We derive a method to bound constraint violat...

We extend the traditional framework of POMDPs to model resource consumption inducing a hard constraint on the behaviour of the model. Resource levels increase and decrease with transitions, and the hard constraint requires that the level remains positive in all steps. We present an algorithm for solving POMDPs with resource levels, developing on existing POMDP solvers. Our second contribution i...

resource constraints project scheduling problem (rspsp) seeks proper sequence of implementation of project activities in a way that the precedence relations and different type of resource constraints are met concurrently. rcpsp tends to optimize some measurement function as make-span, cost of implementation, number of tardy tasks and etc. as rcpsp is assumed as an np-hard problem so, different ...

The notion of buffered resource is useful in many problems. A buffer contains a finite set of items required by some activities, and changing the content of the buffer is costly. For instance, in instruction scheduling, the registers are a buffered resource and any switch of registers has a significant impact on the total runtime of the compiled code. We first show that sequencing activities to...

Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among these global constraints, edge-finding filtering algorithm for unary resources is one of the most popular techniques. In this paper we propose a new O(n log n) version of the edge-finding algorithm that uses a special dat...

There are numerous environments or situations where a computer network has one or more constraints. Impact of these constraints can range from minimal user inconveniences to catastrophic reduction of capabilities. These constraints allow availability of information at the cost of abandoning the safety and reliability of traditional routing and security protocols. A number of environments in whi...

Resource allocation in a feasible or even cost-effective manner is a prominent task appearing in various domains such as energy management, grid computing, distributed heat management or the like. The mere size of future systems calls for mechanisms and algorithms that are able to address uncertainty and scalability – two issues that Organic Computing traditionally focuses on. In particular, se...

Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation. The constraint-propagation step is a fixpoint algorithm that applies pruning operators to tighten the release and due dates of activities using precedence or resource constraints. A variety of pruning operators for re...

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xi