Research output per year
Research output per year
Project Details
Project Description
This project aims to exploit advances in discrete optimisation methods to improve the scalability, robustness and flexibility of multiagent path finding systems.
| Status | Finished |
|---|---|
| Effective start/end date | 1/01/20 → 31/12/24 |
Keywords
- optimisation
- multi-agent path finding
- constraint programming
-
Avoiding Node Re-Expansions Can Break Symmetry Breaking
Carlson, M., Harabor, D. D. & Stuckey, P. J., 2024, Proceedings of the Seventeenth International Symposium on Combinatorial Search (SoCS 2024). Felner, A. & Li, J. (eds.). Washington DC USA: Association for the Advancement of Artificial Intelligence (AAAI), p. 20-27 8 p. (The International Symposium on Combinatorial Search; vol. 17, no. 1).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review
Open Access -
Enhanced methods for the weight constrained shortest path problem
Ahmadi, S., Tack, G., Harabor, D., Kilby, P. & Jalili, M., Jul 2024, In: Networks. 84, 1, p. 3-30 28 p.Research output: Contribution to journal › Article › Research › peer-review
Open AccessFile2 Citations (Scopus) -
Planning and Execution in Multi-Agent Path Finding: Models and Algorithms (Extended Abstract)
Zhang, Y., Chen, Z., Harabor, D., Le Bodic, P. & Stuckey, P. J., 2024, Proceedings of the 17th International Symposium on Combinatorial Search. Felner, A. & Li, J. (eds.). Washington DC USA: Association for the Advancement of Artificial Intelligence (AAAI), p. 303-304 2 p. (The International Symposium on Combinatorial Search; vol. 17, no. 1).Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Other › peer-review
Open Access