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 language | English |
---|---|
Title of host publication | Proceedings of 15th International Symposium on Combinatorial Search |
Subtitle of host publication | SoCS 2022 |
Publisher | AAAI press |
Pages | 276-278 |
Number of pages | 3 |
Volume | 15 |
Edition | 1 |
ISBN (Print) | 1577358732 |
Publication status | Published - 17 Jul 2022 |
Event | The 15th International Symposium on Combinatorial Search - TU Wien, Vienna, Austria Duration: 21 Jul 2022 → 23 Jul 2022 Conference number: 15 https://socs2022.unibs.it/ |
Conference
Conference | The 15th International Symposium on Combinatorial Search |
---|---|
Abbreviated title | SoCS 2022 |
Country/Territory | Austria |
City | Vienna |
Period | 21/07/22 → 23/07/22 |
Internet address |