<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-10-10T21:17:32Z</responseDate>
  <request identifier="27705" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27705</identifier>
        <datestamp>2026-10-10T19:48:19Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Dynamic Quantitative Skill Distribution in Multi-Agent Temporal Planning as SMT</dc:title>
          <dc:creator>Guéneron, Josselin</dc:creator>
          <dc:creator>Maris, Frédéric</dc:creator>
          <dc:subject>Multi-Agent Temporal Planning</dc:subject>
          <dc:subject>Multi-Agent Task Allocation</dc:subject>
          <dc:subject>SMT-based Planning</dc:subject>
          <dc:subject>Dynamic Team Formation</dc:subject>
          <dc:description>We introduce a new framework for multi-agent temporal planning, based on event-based temporal planning, dynamic team formation and Multi-Robot Task Allocation (MRTA). Unlike existing approaches, team formation is directly integrated into the planning and scheduling process. Then, both the teams and agents' skills may evolve over time. In particular, our framework allows us to address complex and dynamic multi-agent problems, such as cooperative task execution, where heterogeneous agents with qualitative and quantitative skills must cooperate dynamically. We propose an SMT encoding of these team temporal planning problems that utilizes the linear arithmetic theory over the rational numbers, QF-LRA. Next, to demonstrate that our approach is suitable for real-world applications, we present experimental results on disaster response problems.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Josselin Guéneron and Frédéric Maris</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of OASIcs, Volume 146, 33rd International Symposium on Temporal Representation and Reasoning (TIME 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/OASIcs.TIME.2026.9</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-277052</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.TIME.2026.9</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
