On the Complexity of Optimal Parallel Cooperative Path-Finding

DOI10.3233/FI-2015-1192zbMath1357.68248OpenAlexW1511207859MaRDI QIDQ2805441

Pavel Surynek

Publication date: 11 May 2016

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2015-1192

zbMATH Keywords

complexityparallelismNP-completenessmulti-agent system15-puzzlecooperative path-finding (CPF)\((N^2 - 1)\)-puzzle\(N\times N\)-puzzledomain-dependent planningsliding puzzle

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Related Items (3)

Optimal path selection approach for fuzzy reliable shortest path problem ⋮ SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS ⋮ Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems

This page was built for publication: On the Complexity of Optimal Parallel Cooperative Path-Finding