Corpus ID: 232478559

Generalized Conflict-directed Search for Optimal Ordering Problems

  title={Generalized Conflict-directed Search for Optimal Ordering Problems},
  author={Jingkai Chen and Yuening Zhang and Cheng Fang and Brian Charles Williams},
Solving planning and scheduling problems for multiple tasks with highly coupled state and temporal constraints is notoriously challenging. An appealing approach to effectively decouple the problem is to judiciously order the events such that decisions can be made over sequences of tasks. As many problems encountered in practice are over-constrained, we must instead find relaxed solutions in which certain requirements are dropped. This motivates a formulation of optimality with respect to the… Expand

Figures and Tables from this paper


Efficiently Exploring Ordering Problems through Conflict-directed Search
Conflict-directed Incremental Total Ordering (CDITO), a conflict-directed search method to incrementally and systematically generate event total orders given ordering relations and conflicts returned by sub-solvers, is presented. Expand
Continuously Relaxing Over-Constrained Conditional Temporal Problems through Generalized Conflict Learning and Resolution
The Best-first Conflict-Directed Relaxation (BCDR) algorithm for enumerating the best continuous relaxation for an over-constrained conditional temporal problem with controllable choices is presented. Expand
Nogood recording for valued constraint satisfaction problems
  • Pierre Dago, G. Verfaillie
  • Computer Science
  • Proceedings Eighth IEEE International Conference on Tools with Artificial Intelligence
  • 1996
This study aims to use Nogood Recording in the wider scope of the Valued CSP framework (VCSP) to enhance the branch and bound algorithm and uses nogoods to increase the lower bound used by the branches and bound to prune the search. Expand
Temporal Constraint Networks
It is shown that the STP, which subsumes the major part of Vilain and Kautz's point algebra, can be solved in polynomial time and the applicability of path consistency algorithms as preprocessing of temporal problems is studied, to demonstrate their termination and bound their complexities. Expand
Best-First Enumeration Based on Bounding Conflicts, and its Application to Large-scale Hybrid Estimation
An approach to hybrid estimation that unifies best-first enumeration and conflict-directed search through the concept of “bounding” conflicts, an extension of conflicts that represent tighter bounds on the cost of regions of the search space is presented. Expand
Valued Constraint Satisfaction Problems: Hard and Easy Problems
A simple algebraic framework is considered, related to Partial Constraint Satisfaction, which subsumes most of these proposals and is used to characterize existing proposals in terms of rationality and computational complexity. Expand
tBurton: A Divide and Conquer Temporal Planner
Planning for and controlling a network of interacting devices requires a planner that accounts for the automatic timed transitions of devices, while meeting deadlines and achieving durative goals.Expand
OptiMathSAT: A Tool for Optimization Modulo Theories
OptiMathSAT is presented, an OMT tool extending the MathSAT5 SMT solver that allows for solving a list of optimization problems on SMT formulas with linear objective functions – on the Boolean, the rational and the integer domains, and on their combination thereof– including MaxSMT. Expand
RADMAX: Risk and Deadline Aware Planning for Maximum Utility
RADMAX is presented: a system for Risk And Deadline Aware Planning for Maximum Utility based on constraint programming, which allows us to handle higher level mission specifications and results for the optimality of RADMAX with respect to the mission utility are provided. Expand
A factored planner for the temporal coordination of autonomous systems
Embedded devices are being composed into ever more complex networked systems, including Earth observing systems and transportation networks. The complexity of these systems require automatedExpand