Abstract
In the Watchman Route Problem (WRP), the task is to find a path for a watchman agent such that all locations in the given map will be visually seen by the watchman at least once during the path traversal. Recently, the problem has been optimally solved on a grid map using heuristic search. In this paper, we extend this work to the case of multiple agents. We call this problem the Multiple Watchman Route Problem (MWRP). In MWRP, the task is to find a path for each watchman such that each location on the map will be seen by at least one watchman. We optimally solve MWRP with heuristic search for two different objective functions with a number of A*-based variants, including an enhanced branching mechanism. We then provide an experimental study on these methods and on other attributes of this problem.
| Original language | English |
|---|---|
| Pages (from-to) | 905-913 |
| Number of pages | 9 |
| Journal | Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS |
| Volume | 2023-May |
| State | Published - 2023 |
| Externally published | Yes |
| Event | 22nd International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2023 - London, United Kingdom Duration: 29 May 2023 → 2 Jun 2023 |
Bibliographical note
Publisher Copyright:© 2023 International Foundation for Autonomous Agents and Multiagent Systems (www.ifaamas.org). All rights reserved.
Keywords
- Heuristic Search
- Multi-Agent
- Watchman Route Problem