On the use of Width-based search for Multi Agent Privacy-preserving Planning

Alfonso Emilio Gerevini, Nir Lipovetzky, Francesco Percassi, Alessandro Saetti, Ivan Serina

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The aim of decentralised multi-agent (DMA) planning is to coordinate a set of agents to jointly achieve a goal while preserving their privacy. Blind search algorithms, such as width-based search, have recently proved to be very effective in the context of centralised automated planning, especially when combined with goal-oriented techniques. In this paper, we discuss a recent line of research in which the usage of width-based search has been extensively studied in the context of DMA planning, addressing the challenges related to the agents' privacy and performance.
Original languageEnglish
Title of host publication Proceedings of 15th International Symposium on Combinatorial Search, SoCS 2022
PublisherAAAI press
Number of pages2
Publication statusAccepted/In press - 2022
EventThe 15th International Symposium on Combinatorial Search - TU Wien, Vienna, Austria
Duration: 21 Jul 202223 Jul 2022
Conference number: 15
https://socs2022.unibs.it/

Conference

ConferenceThe 15th International Symposium on Combinatorial Search
Abbreviated titleSoCS 2022
Country/TerritoryAustria
CityVienna
Period21/07/2223/07/22
Internet address

Fingerprint

Dive into the research topics of 'On the use of Width-based search for Multi Agent Privacy-preserving Planning'. Together they form a unique fingerprint.

Cite this