Corpus ID: 19239443

Multiagent Simple Temporal Problem: The Arc-Consistency Approach

  title={Multiagent Simple Temporal Problem: The Arc-Consistency Approach},
  author={Shufeng Kong and J. H. Lee and S. Li},
  • Shufeng Kong, J. H. Lee, S. Li
  • Published in AAAI 2018
  • Computer Science
  • The Simple Temporal Problem (STP) is a fundamental temporal reasoning problem and has recently been extended to the Multiagent Simple Temporal Problem (MaSTP). In this paper we present a novel approach that is based on enforcing arc-consistency (AC) on the input (multiagent) simple temporal network. We show that the AC-based approach is sufficient for solving both the STP and MaSTP and provide efficient algorithms for them. As our AC-based approach does not impose new constraints between agents… CONTINUE READING
    2 Citations
    A new distributed algorithm for efficient generalized arc-consistency propagation
    • 1
    Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights
    • S. Li, Y. Li
    • Mathematics, Computer Science
    • ArXiv
    • 2019
    • 1
    • PDF


    Algorithms for a temporal decoupling problem in multi-agent planning
    • 78
    • PDF
    Distributed Reasoning for Multiagent Simple Temporal Problems
    • 26
    • Highly Influential
    • PDF
    Temporal Constraint Networks
    • 2,055
    • Highly Influential
    • PDF
    Backtracking algorithms for disjunctions of temporal constraints
    • 214
    • PDF
    An Introduction to Constraint-Based Temporal Reasoning
    • 23
    Dynamic Control Of Plans With Temporal Uncertainty
    • 275
    • PDF
    Optimal Distributed Arc-Consistency
    • 17
    A Distributed Arc-Consistency Algorithm
    • 74
    • PDF
    Optimization of Multi-Agent Workflow for Human-Robot Collaboration in Assembly Manufacturing
    • 14
    • PDF