Ιδρυματικό Αποθετήριο
Πολυτεχνείο Κρήτης
Πολυτεχνείο Κρήτης
EN
|
EL
| URI | http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262 | - |
| Αναγνωριστικό | https://doi.org/10.24963/ijcai.2022/74 | - |
| Αναγνωριστικό | https://www.ijcai.org/proceedings/2022/74 | - |
| Γλώσσα | en | - |
| Μέγεθος | 9 pages | en |
| Τίτλος | Max-sum with quadtrees for decentralized coordination in continuous domains | en |
| Δημιουργός | Troullinos Dimitrios | en |
| Δημιουργός | Τρουλλινος Δημητριος | el |
| Δημιουργός | Chalkiadakis Georgios | en |
| Δημιουργός | Χαλκιαδακης Γεωργιος | el |
| Δημιουργός | Samoladas Vasilis | en |
| Δημιουργός | Σαμολαδας Βασιλης | el |
| Δημιουργός | Papageorgiou Markos | en |
| Δημιουργός | Παπαγεωργιου Μαρκος | el |
| Εκδότης | International Joint Conferences on Artificial Intelligence | en |
| Περιγραφή | 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 |
| Περίληψη | 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 |
| Τύπος | Πλήρης Δημοσίευση σε Συνέδριο | el |
| Τύπος | Conference Full Paper | en |
| Άδεια Χρήσης | http://creativecommons.org/licenses/by/4.0/ | en |
| Ημερομηνία | 2024-12-12 | - |
| Ημερομηνία Δημοσίευσης | 2022 | - |
| Θεματική Κατηγορία | Agent-based and Multi-agent Systems: Coordination and Cooperation | en |
| Θεματική Κατηγορία | Multidisciplinary Topics and Applications: Other | en |
| Θεματική Κατηγορία | Multidisciplinary Topics and Applications: Transportation | en |
| Θεματική Κατηγορία | Planning and Scheduling: Distributed; Multi-agent Planning | en |
| Βιβλιογραφική Αναφορά | 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
