Conflict-Based Increasing Cost Search

Thayne T. Walker; Nathan R. Sturtevant; Ariel Felner; Han Zhang; Jiaoyang Li; T. K.Satish Kumar

Conflict-Based Increasing Cost Search

Thayne T. Walker, Nathan R. Sturtevant, Ariel Felner, Han Zhang, Jiaoyang Li, T. K.Satish Kumar

Department of Software and Information Systems Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

Two popular optimal search-based solvers for the multi-agent pathfinding (MAPF) problem, Conflict-Based Search (CBS) and Increasing Cost Tree Search (ICTS), have been extended separately for continuous time domains and symmetry breaking. However, an approach to symmetry breaking in continuous time domains remained elusive. In this work, we introduce a new algorithm, Conflict-Based Increasing Cost Search (CBICS), which is capable of symmetry breaking in continuous time domains by combining the strengths of CBS and ICTS. Our experiments show that CBICS often finds solutions faster than CBS and ICTS in both unit time and continuous time domains.

Original language	English
Title of host publication	31st International Conference on Automated Planning and Scheduling, ICAPS 2021
Editors	Susanne Biundo, Minh Do, Robert Goldman, Michael Katz, Qiang Yang, Hankz Hankui Zhuo
Publisher	Association for the Advancement of Artificial Intelligence
Pages	385-395
Number of pages	11
ISBN (Electronic)	9781713832317
State	Published - 1 Jan 2021
Event	31st International Conference on Automated Planning and Scheduling, ICAPS 2021 - Guangzhou, Virtual, China Duration: 2 Aug 2021 → 13 Aug 2021

Publication series

Name	Proceedings International Conference on Automated Planning and Scheduling, ICAPS
Volume	2021-August
ISSN (Print)	2334-0835
ISSN (Electronic)	2334-0843

Conference

Conference	31st International Conference on Automated Planning and Scheduling, ICAPS 2021
Country/Territory	China
City	Guangzhou, Virtual
Period	2/08/21 → 13/08/21

ASJC Scopus subject areas

Artificial Intelligence
Computer Science Applications
Information Systems and Management

Cite this

Walker, T. T., Sturtevant, N. R., Felner, A., Zhang, H., Li, J., & Kumar, T. K. S. (2021). Conflict-Based Increasing Cost Search. In S. Biundo, M. Do, R. Goldman, M. Katz, Q. Yang, & H. H. Zhuo (Eds.), 31st International Conference on Automated Planning and Scheduling, ICAPS 2021 (pp. 385-395). (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; Vol. 2021-August). Association for the Advancement of Artificial Intelligence.

Walker, Thayne T. ; Sturtevant, Nathan R. ; Felner, Ariel et al. / Conflict-Based Increasing Cost Search. 31st International Conference on Automated Planning and Scheduling, ICAPS 2021. editor / Susanne Biundo ; Minh Do ; Robert Goldman ; Michael Katz ; Qiang Yang ; Hankz Hankui Zhuo. Association for the Advancement of Artificial Intelligence, 2021. pp. 385-395 (Proceedings International Conference on Automated Planning and Scheduling, ICAPS).

@inproceedings{a8aead519ecd41f685fbaea39bd35de3,

title = "Conflict-Based Increasing Cost Search",

abstract = "Two popular optimal search-based solvers for the multi-agent pathfinding (MAPF) problem, Conflict-Based Search (CBS) and Increasing Cost Tree Search (ICTS), have been extended separately for continuous time domains and symmetry breaking. However, an approach to symmetry breaking in continuous time domains remained elusive. In this work, we introduce a new algorithm, Conflict-Based Increasing Cost Search (CBICS), which is capable of symmetry breaking in continuous time domains by combining the strengths of CBS and ICTS. Our experiments show that CBICS often finds solutions faster than CBS and ICTS in both unit time and continuous time domains.",

author = "Walker, {Thayne T.} and Sturtevant, {Nathan R.} and Ariel Felner and Han Zhang and Jiaoyang Li and Kumar, {T. K.Satish}",

note = "Publisher Copyright: Copyright {\textcopyright} 2021, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 31st International Conference on Automated Planning and Scheduling, ICAPS 2021 ; Conference date: 02-08-2021 Through 13-08-2021",

year = "2021",

month = jan,

day = "1",

language = "English",

series = "Proceedings International Conference on Automated Planning and Scheduling, ICAPS",

publisher = "Association for the Advancement of Artificial Intelligence",

pages = "385--395",

editor = "Susanne Biundo and Minh Do and Robert Goldman and Michael Katz and Qiang Yang and Zhuo, {Hankz Hankui}",

booktitle = "31st International Conference on Automated Planning and Scheduling, ICAPS 2021",

}

Walker, TT, Sturtevant, NR, Felner, A, Zhang, H, Li, J & Kumar, TKS 2021, Conflict-Based Increasing Cost Search. in S Biundo, M Do, R Goldman, M Katz, Q Yang & HH Zhuo (eds), 31st International Conference on Automated Planning and Scheduling, ICAPS 2021. Proceedings International Conference on Automated Planning and Scheduling, ICAPS, vol. 2021-August, Association for the Advancement of Artificial Intelligence, pp. 385-395, 31st International Conference on Automated Planning and Scheduling, ICAPS 2021, Guangzhou, Virtual, China, 2/08/21.

Conflict-Based Increasing Cost Search. / Walker, Thayne T.; Sturtevant, Nathan R.; Felner, Ariel et al.
31st International Conference on Automated Planning and Scheduling, ICAPS 2021. ed. / Susanne Biundo; Minh Do; Robert Goldman; Michael Katz; Qiang Yang; Hankz Hankui Zhuo. Association for the Advancement of Artificial Intelligence, 2021. p. 385-395 (Proceedings International Conference on Automated Planning and Scheduling, ICAPS; Vol. 2021-August).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Conflict-Based Increasing Cost Search

AU - Walker, Thayne T.

AU - Sturtevant, Nathan R.

AU - Felner, Ariel

AU - Zhang, Han

AU - Li, Jiaoyang

AU - Kumar, T. K.Satish

PY - 2021/1/1

Y1 - 2021/1/1

N2 - Two popular optimal search-based solvers for the multi-agent pathfinding (MAPF) problem, Conflict-Based Search (CBS) and Increasing Cost Tree Search (ICTS), have been extended separately for continuous time domains and symmetry breaking. However, an approach to symmetry breaking in continuous time domains remained elusive. In this work, we introduce a new algorithm, Conflict-Based Increasing Cost Search (CBICS), which is capable of symmetry breaking in continuous time domains by combining the strengths of CBS and ICTS. Our experiments show that CBICS often finds solutions faster than CBS and ICTS in both unit time and continuous time domains.

AB - Two popular optimal search-based solvers for the multi-agent pathfinding (MAPF) problem, Conflict-Based Search (CBS) and Increasing Cost Tree Search (ICTS), have been extended separately for continuous time domains and symmetry breaking. However, an approach to symmetry breaking in continuous time domains remained elusive. In this work, we introduce a new algorithm, Conflict-Based Increasing Cost Search (CBICS), which is capable of symmetry breaking in continuous time domains by combining the strengths of CBS and ICTS. Our experiments show that CBICS often finds solutions faster than CBS and ICTS in both unit time and continuous time domains.

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

M3 - Conference contribution

AN - SCOPUS:85124666764

T3 - Proceedings International Conference on Automated Planning and Scheduling, ICAPS

SP - 385

EP - 395

BT - 31st International Conference on Automated Planning and Scheduling, ICAPS 2021

A2 - Biundo, Susanne

A2 - Do, Minh

A2 - Goldman, Robert

A2 - Katz, Michael

A2 - Yang, Qiang

A2 - Zhuo, Hankz Hankui

PB - Association for the Advancement of Artificial Intelligence

T2 - 31st International Conference on Automated Planning and Scheduling, ICAPS 2021

Y2 - 2 August 2021 through 13 August 2021

ER -

Walker TT, Sturtevant NR, Felner A, Zhang H, Li J, Kumar TKS. Conflict-Based Increasing Cost Search. In Biundo S, Do M, Goldman R, Katz M, Yang Q, Zhuo HH, editors, 31st International Conference on Automated Planning and Scheduling, ICAPS 2021. Association for the Advancement of Artificial Intelligence. 2021. p. 385-395. (Proceedings International Conference on Automated Planning and Scheduling, ICAPS).

Conflict-Based Increasing Cost Search

Abstract

Publication series

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this