<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262"><efrbr-work:titleOfTheWork>Max-sum with quadtrees for decentralized coordination in continuous domains</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262"><efrbr-expression:titleOfTheExpression>Max-sum with quadtrees for decentralized coordination in continuous domains</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Πλήρης Δημοσίευση σε Συνέδριο
            Conference Full Paper
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2024-12-12</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">2022</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>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.</efrbr-expression:summarizationOfContent><efrbr-expression:contextForTheExpression>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.</efrbr-expression:contextForTheExpression><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="page range">518-526</efrbr-expression:note><efrbr-expression:note type="conference name">31st International Joint Conference on Artificial Intelligence</efrbr-expression:note><efrbr-expression:note type="proceedings title">Proceedings of the 31st International Joint Conference on Artificial Intelligence</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~dtroullinos"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Troullinos Dimitrios
            Τρουλλινος Δημητριος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~gchalkiadakis"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Chalkiadakis Georgios
            Χαλκιαδακης Γεωργιος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~vsamoladas"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Samoladas Vasilis
            Σαμολαδας Βασιλης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-person:person identifier="http://users.isc.tuc.gr/~mpapageorgiou"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Papageorgiou Markos
            Παπαγεωργιου Μαρκος
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="EC12C2D3-3A32-4F4B-BC88-CEE03D44B084"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="">
            International Joint Conferences on Artificial Intelligence
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="722E9BF1-A9CE-4A68-A70E-8EDD29C84FF5"><efrbr-concept:termForTheConcept>
            Agent-based and Multi-agent Systems: Coordination and Cooperation
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="30CEBCC0-7829-4034-8EDF-5ED35151B5DF"><efrbr-concept:termForTheConcept>
            Multidisciplinary Topics and Applications: Other
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="A9CD8F76-1FEB-4959-A653-641A8185B964"><efrbr-concept:termForTheConcept>
            Multidisciplinary Topics and Applications: Transportation
         </efrbr-concept:termForTheConcept></efrbr-concept:concept><efrbr-concept:concept identifier="F4BD0F67-270E-4C15-97F9-20A0E92A7650"><efrbr-concept:termForTheConcept>
            Planning and Scheduling: Distributed; Multi-agent Planning
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="person" targetURI="http://users.isc.tuc.gr/~dtroullinos"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="person" targetURI="http://users.isc.tuc.gr/~dtroullinos" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="person" targetURI="http://users.isc.tuc.gr/~gchalkiadakis" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="person" targetURI="http://users.isc.tuc.gr/~vsamoladas" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="person" targetURI="http://users.isc.tuc.gr/~mpapageorgiou" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="person" targetURI="EC12C2D3-3A32-4F4B-BC88-CEE03D44B084" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="concept" targetURI="722E9BF1-A9CE-4A68-A70E-8EDD29C84FF5"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="concept" targetURI="30CEBCC0-7829-4034-8EDF-5ED35151B5DF"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="concept" targetURI="A9CD8F76-1FEB-4959-A653-641A8185B964"/><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/D193FEA8-B213-4F2F-ADC0-EA38D6F44262" targetEntity="concept" targetURI="F4BD0F67-270E-4C15-97F9-20A0E92A7650"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>