Multiagent Simple Temporal Problem: The Arc-Consistency Approach

Authors

  • Shufeng Kong University of Technology Sydney
  • Jae Hee Lee University of Technology Sydney
  • Sanjiang Li University of Technology Sydney

Keywords:

Simple Temporal Network, Multiagent Simple Temporal Network, Arc-Consistency

Abstract

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, it does not violate the privacy of the agents and is superior to the state-of-the-art approach to MaSTP. Empirical evaluations on diverse benchmark datasets also show that our AC-based algorithms for STP and MaSTP are significantly more efficient than existing approaches.

Downloads

Published

2018-04-26

How to Cite

Kong, S., Lee, J. H., & Li, S. (2018). Multiagent Simple Temporal Problem: The Arc-Consistency Approach. Proceedings of the AAAI Conference on Artificial Intelligence, 32(1). Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/12087