Experimental Evaluation • Given • A set of (static) service providers • Each : location . • A set of (dynamic) users • Each : location and arriving time . • Cost Function : any metric distance function • Find an online matching to minimize the total cost MinSum(M)= s.t. • Cardinality Constraint: |M|=min{|T|, |W|} • Real‐Time Constraint: Once a user t appears, a service provider must be immediat...

Cost-optimal planning, in which the aim is to minimize the sum of costs of actions, is a challenging problem due to its computational complexity. A linear program derived from a relaxation which ignores the constraints on the ordering of actions can be used to obtain a lower bound on the cost of a solution-plan. We show that the dual of this linear program provides a transformation of the probl...

Cost-optimal planning, in which the aim is to minimize the sum of costs of actions, is a challenging problem due to its computational complexity. A linear program derived from a relaxation which ignores the constraints on the ordering of actions can be used to obtain a lower bound on the cost of a solution-plan. We show that the dual of this linear program provides a transformation of the probl...

Classical constraint satisfaction is concerned with the feasibility of satisfying a collection of constraints. The extension of this framework to include optimisation is now also being investigated and a theory of so-called soft constraints is being developed. In this extended framework, tuples of values allowed by constraints are given desirability weightings, or costs, and the goal is find th...

We propose a way to define the logic computation cost of operations to be used in evaluations of scalability and efficiency for simulated distributed constraint reasoning (DCR) algorithms. We also report experiments showing that the cost associated with a constraint check, even within the same algorithm, depends on the problem size. The DCR research has seen heated debate regarding the correct ...

In this paper we investigate the stability of hybrid systems in closed-loop with Model Predictive Controllers (MPC) and we derive a priori sufficient conditions for Lyapunov asymptotic stability and exponential stability. A general theory is presented which proves that Lyapunov stability is achieved for both terminal cost and constraint set and terminal equality constraint hybrid MPC, even thou...

In this paper a general shop scheduling problem with sequence dependent setup times arid alternative r[.~ sources is considered, where optimization criteria are both makespan and sum of setup times. Two cooperative models for the problem based on Constraint Programming arc proposed. The first is used to model the scheduling constraints, while the second is a muhipath model used for setup optimi...

Given a product design and a repair network for capital goods, a level of repair analysis determines for each component in the product (1) whether it should be discarded or repaired upon failure and (2) at which location in the repair network to do this. In this paper, we show how the problem can be modelled as a minimum cost flow problem with side constraints. Advantages are that (1) solving o...