SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS

DOI10.1111/coin.12002zbMath1328.68204DBLPjournals/ci/Surynek14OpenAlexW1985591826WikidataQ58682855 ScholiaQ58682855MaRDI QIDQ3462275

Pavel Surynek

Publication date: 5 January 2016

Published in: Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/coin.12002

zbMATH Keywords

motion coordination15-puzzle\(N\times N\)-puzzlesliding puzzle\((N^2-1)\)-puzzleBIBOXBIBOX-\(\theta\)cooperative path-findingdomain dependent planningmakespan optimizationmultirobot path-planning

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Related Items (2)

Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems ⋮ Subdimensional expansion for multirobot path planning

Cites Work

• The \((n^ 2-1)\)-puzzle and related relocation problems
• Maintaining bridge-connected and biconnected components on-line
• A real-time algorithm for the \((n^{2}-1)\)-puzzle
• On the Complexity of Optimal Parallel Cooperative Path-Finding
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS