AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Multiagent Simple Temporal Problem: The Arc-Consistency Approach

Shufeng Kong, Jae Hee Lee, Sanjiang Li

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 9 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Replace PPC with AC for centralized STN solvingSTN solvers · Scale-free-1/2speedup: 100--1000 times fasterImproved
Replace PPC with AC for centralized STN solvingSTN solvers · New Yorkspeedup: about 5--12 times fasterImproved
Replace DPPC with DAC for distributed MaSTN solvingMaSTN solvers · BDHspeedup: 5--30 times fasterImproved
Replace DPPC with DAC for distributed MaSTN solvingMaSTN solvers · WSspeedup: 2--10 times fasterImproved
Use AC-based propagation rather than PC-based triangulationCentralized and distributed STN solving · Scale-free, New York, BDH, and WSconstraint checks / NCCCsImproved
Avoid adding constraints between agents not directly connectedDAC · MaSTNprivacyImproved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy