Multiagent Simple Temporal Problem: The Arc-Consistency Approach
@inproceedings{Kong2018MultiagentST, title={Multiagent Simple Temporal Problem: The Arc-Consistency Approach}, author={Shufeng Kong and J. H. Lee and S. Li}, booktitle={AAAI}, year={2018} }
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
- Computer Science
- Autonomous Agents and Multi-Agent Systems
- 2018
- 1
Semi-dynamic shortest-path tree algorithms for directed graphs with arbitrary weights
- Mathematics, Computer Science
- ArXiv
- 2019
- 1
- PDF
References
SHOWING 1-10 OF 26 REFERENCES
Algorithms for a temporal decoupling problem in multi-agent planning
- Computer Science
- AAAI/IAAI
- 2002
- 78
- PDF
Distributed Reasoning for Multiagent Simple Temporal Problems
- Computer Science
- J. Artif. Intell. Res.
- 2013
- 26
- Highly Influential
- PDF
Temporal Constraint Networks
- Computer Science, Mathematics
- Artif. Intell.
- 1989
- 2,055
- Highly Influential
- PDF
Backtracking algorithms for disjunctions of temporal constraints
- Computer Science, Mathematics
- Artif. Intell.
- 1998
- 214
- PDF
An Introduction to Constraint-Based Temporal Reasoning
- Computer Science
- An Introduction to Constraint-Based Temporal Reasoning
- 2014
- 23
Optimization of Multi-Agent Workflow for Human-Robot Collaboration in Assembly Manufacturing
- Engineering, Computer Science
- Infotech@Aerospace
- 2012
- 14
- PDF