Institutional Repository
Technical University of Crete
Technical University of Crete
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262 | - |
| Identifier | https://doi.org/10.24963/ijcai.2022/74 | - |
| Identifier | https://www.ijcai.org/proceedings/2022/74 | - |
| Language | en | - |
| Extent | 9 pages | en |
| Title | Max-sum with quadtrees for decentralized coordination in continuous domains | en |
| Creator | Troullinos Dimitrios | en |
| Creator | Τρουλλινος Δημητριος | el |
| Creator | Chalkiadakis Georgios | en |
| Creator | Χαλκιαδακης Γεωργιος | el |
| Creator | Samoladas Vasilis | en |
| Creator | Σαμολαδας Βασιλης | el |
| Creator | Papageorgiou Markos | en |
| Creator | Παπαγεωργιου Μαρκος | el |
| Publisher | International Joint Conferences on Artificial Intelligence | en |
| Description | The research leading to these results has received funding from the European Research Council under the European Union’s Horizon 2020 Research and Innovation programme/ERC Grant Agreement n. [833915], project TrafficFluid. | en |
| Content Summary | In this paper we put forward a novel extension of the classic Max-Sum algorithm to the framework of Continuous Distributed Constrained Optimization Problems (Continuous DCOPs), by utilizing a popular geometric algorithm, namely Quadtrees. In its standard form, Max-Sum can only solve Continuous DCOPs with an a priori discretization procedure. Existing Max-Sum extensions to continuous multiagent coordination domains require additional assumptions regarding the form of the factors, such as access to the gradient, or the ability to model them as continuous piecewise linear functions. Our proposed approach has no such requirements: we model the exchanged messages with Quadtrees, and, as such, the discretization procedure is dynamic and embedded in the internal Max-Sum operations (addition and marginal maximization). We apply Max-Sum with Quadtrees to lane-free autonomous driving. Our experimental evaluation showcases the effectiveness of our approach in this challenging coordination domain. | en |
| Type of Item | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Type of Item | Conference Full Paper | en |
| License | http://creativecommons.org/licenses/by/4.0/ | en |
| Date of Item | 2024-12-12 | - |
| Date of Publication | 2022 | - |
| Subject | Agent-based and Multi-agent Systems: Coordination and Cooperation | en |
| Subject | Multidisciplinary Topics and Applications: Other | en |
| Subject | Multidisciplinary Topics and Applications: Transportation | en |
| Subject | Planning and Scheduling: Distributed; Multi-agent Planning | en |
| Bibliographic Citation | D. Troullinos, G. Chalkiadakis, V. Samoladas, and M. Papageorgiou, “Max-sum with quadtrees for decentralized coordination in continuous domains,” in Proc. 31st Int. Joint Conf. Artif. Intell. (IJCAI 2022), 2022, pp. 518-526, doi: 10.24963/ijcai.2022/74. | en |
Copyright © DIAS 2013
