Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles

Yichen Ding; Jialong Li; Kenji Tei

doi:10.1109/SISY56759.2022.10036293

Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles

研究成果: Conference contribution

抄録

In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their respective destinations without inter-agent collisions. In the MAPF problem, when agents plan a route, they compete for some resources on a specific route, and such contention sometimes causes deadlock. However, unpredictable obstacles like warehouses may appear in real scenes, making route planning difficult. Based on the existing MAPF algorithm, this paper proposes a new algorithm that relies on an adaptive prioritization scheme to pay effort to the adjacent movements of multiple agents in the presence of unpredictable and moving obstacles while avoiding collisions.

本文言語	English
ホスト出版物のタイトル	SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings
出版社	Institute of Electrical and Electronics Engineers Inc.
ページ	103-108
ページ数	6
ISBN（電子版）	9781665489881
DOI	https://doi.org/10.1109/SISY56759.2022.10036293
出版ステータス	Published - 2022
イベント	20th IEEE Jubilee International Symposium on Intelligent Systems and Informatics, SISY 2022 - Subotica, Serbia 継続期間: 2022 9月 15 → 2022 9月 17

出版物シリーズ

名前	SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings

Conference

Conference	20th IEEE Jubilee International Symposium on Intelligent Systems and Informatics, SISY 2022
国/地域	Serbia
City	Subotica
Period	22/9/15 → 22/9/17

ASJC Scopus subject areas

人工知能
人間とコンピュータの相互作用
情報システム
情報システムおよび情報管理
モデリングとシミュレーション
健康情報学

UN SDG

この成果は、次の持続可能な開発目標に貢献しています

文献へのアクセス

10.1109/SISY56759.2022.10036293

他のファイルとリンク

引用スタイル

Ding, Y., Li, J., & Tei, K. (2022). Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles. In SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings (pp. 103-108). (SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/SISY56759.2022.10036293

Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles. / Ding, Yichen; Li, Jialong ; Tei, Kenji.
SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2022. p. 103-108 (SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings).

研究成果: Conference contribution

Ding, Y, Li, J & Tei, K 2022, Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles. in SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings. SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings, Institute of Electrical and Electronics Engineers Inc., pp. 103-108, 20th IEEE Jubilee International Symposium on Intelligent Systems and Informatics, SISY 2022, Subotica, Serbia, 22/9/15. https://doi.org/10.1109/SISY56759.2022.10036293

Ding Y, Li J , Tei K. Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles. In SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings. Institute of Electrical and Electronics Engineers Inc. 2022. p. 103-108. (SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings). doi: 10.1109/SISY56759.2022.10036293

Ding, Yichen ; Li, Jialong ; Tei, Kenji. / Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles. SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings. Institute of Electrical and Electronics Engineers Inc., 2022. pp. 103-108 (SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings).

@inproceedings{4b084b6912fc4da099dae3b4b10f7c5e,

title = "Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles",

abstract = "In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their respective destinations without inter-agent collisions. In the MAPF problem, when agents plan a route, they compete for some resources on a specific route, and such contention sometimes causes deadlock. However, unpredictable obstacles like warehouses may appear in real scenes, making route planning difficult. Based on the existing MAPF algorithm, this paper proposes a new algorithm that relies on an adaptive prioritization scheme to pay effort to the adjacent movements of multiple agents in the presence of unpredictable and moving obstacles while avoiding collisions.",

keywords = "Multi-agent path finding, moving obstacles, prioritized planning",

author = "Yichen Ding and Jialong Li and Kenji Tei",

note = "Funding Information: The research was partially supported by JSPS KAKENHI and JSPS Research Fellowships for Young Scientists. Publisher Copyright: {\textcopyright} 2022 IEEE.; 20th IEEE Jubilee International Symposium on Intelligent Systems and Informatics, SISY 2022 ; Conference date: 15-09-2022 Through 17-09-2022",

year = "2022",

doi = "10.1109/SISY56759.2022.10036293",

language = "English",

series = "SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "103--108",

booktitle = "SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings",

}

TY - GEN

T1 - Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles

AU - Ding, Yichen

AU - Li, Jialong

AU - Tei, Kenji

PY - 2022

Y1 - 2022

N2 - In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their respective destinations without inter-agent collisions. In the MAPF problem, when agents plan a route, they compete for some resources on a specific route, and such contention sometimes causes deadlock. However, unpredictable obstacles like warehouses may appear in real scenes, making route planning difficult. Based on the existing MAPF algorithm, this paper proposes a new algorithm that relies on an adaptive prioritization scheme to pay effort to the adjacent movements of multiple agents in the presence of unpredictable and moving obstacles while avoiding collisions.

AB - In the Multi-Agent Path Finding (MAPF) problem, a set of agents moving on a graph must reach their respective destinations without inter-agent collisions. In the MAPF problem, when agents plan a route, they compete for some resources on a specific route, and such contention sometimes causes deadlock. However, unpredictable obstacles like warehouses may appear in real scenes, making route planning difficult. Based on the existing MAPF algorithm, this paper proposes a new algorithm that relies on an adaptive prioritization scheme to pay effort to the adjacent movements of multiple agents in the presence of unpredictable and moving obstacles while avoiding collisions.

KW - Multi-agent path finding

KW - moving obstacles

KW - prioritized planning

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

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

U2 - 10.1109/SISY56759.2022.10036293

DO - 10.1109/SISY56759.2022.10036293

M3 - Conference contribution

AN - SCOPUS:85149117465

T3 - SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings

SP - 103

EP - 108

BT - SISY 2022 - IEEE 20th Jubilee International Symposium on Intelligent Systems and Informatics, Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 20th IEEE Jubilee International Symposium on Intelligent Systems and Informatics, SISY 2022

Y2 - 15 September 2022 through 17 September 2022

ER -

Multi-Agent Path Finding with Priority Transfer Accompanied with Moving Obstacles

抄録

出版物シリーズ

Conference

ASJC Scopus subject areas

UN SDG

文献へのアクセス

他のファイルとリンク

フィンガープリント

引用スタイル