• Corpus ID: 5925051

Flexibility and Decoupling in the Simple Temporal Problem

  title={Flexibility and Decoupling in the Simple Temporal Problem},
  author={Michel Wilson and Tomas Klos and Cees Witteveen and Bob Huisman},
In this paper we concentrate on finding a suitable metric to determine the flexibility of a Simple Temporal Problem (STP). After reviewing some flexibility metrics that have been proposed, we conclude that these metrics fail to capture the correlation between events specified in the STP, resulting in an overestimation of the available flexibility in the system. We propose to use an intuitively more acceptable flexibility metric based upon uncorrelated time-intervals for the allowed starting… 

Figures from this paper

Optimising Flexibility for Simple Temporal Networks
A recently proposed concurrent flexibility metric is generalised to overcome some of its shortcomings and it is shown that these shortcomings can be removed if one selects an optimal subset of variables for which the concurrent flexibility is determined.
Optimal decomposition in linear constraint systems
This paper uses a generalization of a flexibility metric developed for Simple Temporal Networks to show how an efficient decomposition technique for linear constraint systems can be derived that minimizes the loss of flexibility.
Dynamic Temporal Decoupling
Experimental results are presented showing that, in most cases, updating an existing decoupling in case new commitments for variables have been made, significantly increases the flexibility of making commitments for the remaining variables.
Temporal Flexibility Revisited: Maximizing Flexibility by Computing Bipartite Matchings
An interesting connection is established between the computation of these flexibility metrics and properties of the minimal distance matrix DS of an STN S: the concurrent flexibility metric can be computed by finding a minimum weight matching of a weighted bipartite graph completely specified by DS, while the naive flexibility metric corresponds to computing a maximum weight matching in the same graph.
Distributing flexibility to enhance robustness in task scheduling problems
It is investigated in more detail how characteristics of the input instances affect different scheduling methods’ robustness properties, and three new methods for designing interval schedules are derived and shown to provide similar or improved robustness.
The Complexity of Stability: In Parallel Processor Scheduling
It is shown that many of the multi objective optimizations problems that consider both a stability metric and the makespan are strongly NP-complete, and that optimizing just the stability metrics turns out to be possible in polynomial time.
Improving PCP algorithms using flexibility metrics: Creating flexible schedules for Technical Maintenance
This work improves on existing scheduling techniques suitable for scheduling problems at the train maintenance provider, NedTrain, and shows that the envelope approach, which has been considered the weaker approach in recent literature, can be greatly improved.
Distributed Decoupling of Multiagent Simple Temporal Problems
This work poses the MaSTN decoupling problem as a distributed convex optimization problem subject to constraints having a block angular structure; it adapt existing variants of Alternating Direction Method of Multiplier (ADMM) type methods to perform decoupled optimally and presents experimental results for the proposed method.
Robust scheduling in an uncertain environment
This thesis presents research on scheduling in an uncertain environment, which forms a part of the rolling stock life cycle logistics applied research and development program funded by Dutch railway
Promoting Independence with a Schedule Management Assistant that Anticipates Disruptions
A system for schedule management assistance that is developing specifically to help adolescents with disabilities who are transitioning to independent adulthood, and how it has overcome a number of engineering challenges in creating a prototype system is motivated and overviewed.


Temporal Constraint Networks
Distributed algorithms for solving the multiagent temporal decoupling problem
This paper presents a new, provably correct, distributed algorithm for calculating a temporal decoupling that has the same theoretical computational complexity as current state-of-the-art MaSTP solution algorithms, and empirically demonstrate that it is more efficient in practice.
A Distributed Approach to Summarizing Spaces of Multiagent Schedules
A new property called local decomposability is introduced that exploits loose-coupling between agents' problems, protects strategic interests, and supports typical queries and provides and evaluates a new distributed algorithm that summarizes agents' solution spaces in significantly less time and space by using local, rather than full, decomposable.
From precedence constraint posting to partial order schedules: A CSP approach to Robust Scheduling
This paper introduces the concept of a Partial Order Schedule (POS), a type of temporally flexible schedule in which each embedded temporal solution is also guaranteed to be resource feasible, as a target class of solutions that exploit flexibility in a robust way.
Optimal temporal decoupling in multiagent systems
This paper focuses on a constraint problem that is efficiently solvable, but still very relevant and interesting in the context of multiple agents executing their actions, i.e. the Simple Temporal Problem (STP), and shows that finding an optimal decoupling is at least as hard as finding a solution for the constraint problem.
Algorithms for a temporal decoupling problem in multi-agent planning
This paper formally defines the Temporal Decoupling Problem, presents theorems that give necessary and sufficient conditions for solutions to the TDP, and presents a family of sound and complete algorithms for solving the TSP.
Dynamic Control Of Plans With Temporal Uncertainty
This paper resolves the complexity issue for Dynamic Controllability and shows how to efficiently execute networks whose status has been verified.
Distributed Approaches for Solving Constraint-based Multiagent Scheduling Problems
The hypothesis is that combining a bottom-up approach— where an agent externalizes constraints that compactly summarize how its local subproblem affects other agents' subproblems, with a top-down approach—where an agent proactively constructs and internalizes new local constraints that decouple its subproblem from others', will lead to effective solution techniques.
Constraint Processing
  • R. Barták
  • Computer Science
    Encyclopedia of Artificial Intelligence
  • 2009
Mainstream techniques for solving constraint satisfaction problems are presented, which stay behind the existing constraint solvers and their understanding is important to exploit fully the available technology.
Algorithm 97: Shortest path
The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.