Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants

Pavel Surynek; Ariel Felner; Roni Stern; Eli Boyarski

Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants

Pavel Surynek
, Ariel Felner
, Roni Stern
, Eli Boyarski

Research output: Contribution to conference › Paper › peer-review

7 Scopus citations

Abstract

In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.

Original language	English
Pages	169-170
Number of pages	2
State	Published - 1 Jan 2017
Event	10th Annual Symposium on Combinatorial Search, SoCS 2017 - Pittsburgh, United States Duration: 16 Jun 2017 → 17 Jun 2017

Conference

Conference	10th Annual Symposium on Combinatorial Search, SoCS 2017
Country/Territory	United States
City	Pittsburgh
Period	16/06/17 → 17/06/17

ASJC Scopus subject areas

Computer Networks and Communications

Cite this

@conference{7a3adc626c1549aeb4d0a5b96beb5e40,

title = "Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants",

abstract = "In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.",

author = "Pavel Surynek and Ariel Felner and Roni Stern and Eli Boyarski",

note = "Publisher Copyright: Copyright {\textcopyright} 2017, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 10th Annual Symposium on Combinatorial Search, SoCS 2017 ; Conference date: 16-06-2017 Through 17-06-2017",

year = "2017",

month = jan,

day = "1",

language = "English",

pages = "169--170",

}

TY - CONF

T1 - Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants

AU - Surynek, Pavel

AU - Felner, Ariel

AU - Stern, Roni

AU - Boyarski, Eli

PY - 2017/1/1

Y1 - 2017/1/1

N2 - In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.

AB - In multi-agent path finding (MAPF) the task is to find non-conflicting paths for multiple agents. Recently, a SAT-based approach was developed to solve this problem and proved beneficial in many cases when compared to other search-based solvers. In this paper, we introduce SAT-based unbounded- and bounded-suboptimal algorithms and compare them to relevant search-based algorithms.

UR - https://www.scopus.com/pages/publications/85050567022

M3 - Paper

AN - SCOPUS:85050567022

SP - 169

EP - 170

T2 - 10th Annual Symposium on Combinatorial Search, SoCS 2017

Y2 - 16 June 2017 through 17 June 2017

ER -

Modifying optimal SAT-based approach to multi-agent path-finding problem to suboptimal variants

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this