k-Robust multi-agent path finding

Dor Atzmon; Ariel Felner; Roni Stern; Glenn Wagner; Roman Barták; Neng Fa Zhou

k-Robust multi-agent path finding

Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng Fa Zhou

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

8 Scopus citations

Original language	English
Pages	157-158
Number of pages	2
State	Published - 2017
Externally published	Yes
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

Bibliographical note

Funding Information:
Another direction for future work is to develop MAPF solvers that generate plans that can be followed with probability greater than a parameter (Wagner and Choset 2017), and to study more reactive execution policies. Acknowledgments: This research was supported by the Israel and Czech Ministries of Science #8G15027.

Funding Information:
This research was supported by the Israel and Czech Ministries of Science #8G15027.

Funding

Another direction for future work is to develop MAPF solvers that generate plans that can be followed with probability greater than a parameter (Wagner and Choset 2017), and to study more reactive execution policies. Acknowledgments: This research was supported by the Israel and Czech Ministries of Science #8G15027. This research was supported by the Israel and Czech Ministries of Science #8G15027.

Funders	Funder number
Israel and Czech Ministries of Science	8G15027
Israel Academy of Sciences and Humanities

Cite this

@conference{a8f9be07859240a495ccd179af885776,

title = "k-Robust multi-agent path finding",

author = "Dor Atzmon and Ariel Felner and Roni Stern and Glenn Wagner and Roman Bart{\'a}k and Zhou, {Neng Fa}",

note = "Funding Information: Another direction for future work is to develop MAPF solvers that generate plans that can be followed with probability greater than a parameter (Wagner and Choset 2017), and to study more reactive execution policies. Acknowledgments: This research was supported by the Israel and Czech Ministries of Science #8G15027. Funding Information: This research was supported by the Israel and Czech Ministries of Science #8G15027.; 10th Annual Symposium on Combinatorial Search, SoCS 2017 ; Conference date: 16-06-2017 Through 17-06-2017",

year = "2017",

language = "אנגלית",

pages = "157--158",

}

TY - CONF

T1 - k-Robust multi-agent path finding

AU - Atzmon, Dor

AU - Felner, Ariel

AU - Stern, Roni

AU - Wagner, Glenn

AU - Barták, Roman

AU - Zhou, Neng Fa

N1 - Funding Information: Another direction for future work is to develop MAPF solvers that generate plans that can be followed with probability greater than a parameter (Wagner and Choset 2017), and to study more reactive execution policies. Acknowledgments: This research was supported by the Israel and Czech Ministries of Science #8G15027. Funding Information: This research was supported by the Israel and Czech Ministries of Science #8G15027.

PY - 2017

Y1 - 2017

UR - http://www.scopus.com/inward/record.url?scp=85048495187&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:85048495187

SP - 157

EP - 158

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

Y2 - 16 June 2017 through 17 June 2017

ER -

k-Robust multi-agent path finding

Conference

Bibliographical note

Funding

Other files and links

Cite this