Multi-Agent Path Finding with Destination Choice

Autor:	Keisuke Otaki, Tomoki Nishi, Ayano Okoso
Rok vydání:	2021
Předmět:	Travel time Mathematical optimization Computer science ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Path (graph theory) Graph (abstract data type) Destinations New variant ComputingMethodologies_ARTIFICIALINTELLIGENCE Choice problem
Zdroj:	PRIMA 2020: Principles and Practice of Multi-Agent Systems ISBN: 9783030693213 PRIMA
Popis:	Multi-agent path finding problem (MAPF) is a problem to find collision-free paths on a graph for multiple agents from their initial locations to their destinations. MAPF has mainly two types of variants regarding the usage of agent destination; each agent has a unique destination or all agents share common destinations. We propose the MAPF with destination choice problem (MAPF-DC) as a new variant of MAPF. Agents in MAPF-DC could implicitly select the best destinations out of assigned destination candidates partially shared with other agents. Experimental results indicate that the total travel time declines with an increase in the number of destination candidates assigned to each agent.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::38c16e2ef4cf17609f23a846b24a5948 https://doi.org/10.1007/978-3-030-69322-0_26 Zobrazit plný text záznamu