<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><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-09-08T01:53:34Z</responseDate><request verb="GetRecord" identifier="oai:gredos.usal.es:10366/133640" metadataPrefix="mods">https://gredos.usal.es/oai/request</request><GetRecord><record><header><identifier>oai:gredos.usal.es:10366/133640</identifier><datestamp>2025-04-30T21:03:46Z</datestamp><setSpec>com_10366_133431</setSpec><setSpec>com_10366_122682</setSpec><setSpec>com_10366_4666</setSpec><setSpec>com_10366_3823</setSpec><setSpec>col_10366_133433</setSpec></header><metadata><mods:mods xmlns:mods="http://www.loc.gov/mods/v3" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-1.xsd">
<mods:name>
<mods:namePart>Cardoso, Rafael Cauê</mods:namePart>
</mods:name>
<mods:name>
<mods:namePart>Bordini, Rafael Heitor</mods:namePart>
</mods:name>
<mods:extension>
<mods:dateAvailable encoding="iso8601">2017-07-26T11:08:54Z</mods:dateAvailable>
</mods:extension>
<mods:extension>
<mods:dateAccessioned encoding="iso8601">2017-07-26T11:08:54Z</mods:dateAccessioned>
</mods:extension>
<mods:originInfo>
<mods:dateIssued encoding="iso8601">2017-06-30</mods:dateIssued>
</mods:originInfo>
<mods:identifier type="citation">ADCAIJ: Advances in Distributed Computing and Artificial Intelligence Journal, 6 (2017)</mods:identifier>
<mods:identifier type="issn">2255-2863</mods:identifier>
<mods:identifier type="uri">http://hdl.handle.net/10366/133640</mods:identifier>
<mods:abstract>Describing planning domains using a common formalism promotes greater reuse of research, allowing a fairer comparison between different planners and approaches. Common planning formalisms for single-agent planning are already well established (e.g., PDDL, STRIPS, and HTN), but currently there is a shortage of multi-agent planning formalisms with clear semantics. In this paper, we propose a multi-agent extension of the Hierarchical Task Network (HTN) planning formalism for multi-agent planning problems. Our formalism, the Multi-Agent Hierarchical Task Network (MA-HTN), can be used to specify and represent multi-agent planning domains and problems. We provide a grammar with semantics for the domain and problem representation, and describe two case studies with the translation from multi-agent systems developed in JaCaMo to our MA-HTN formalism.</mods:abstract>
<mods:language>
<mods:languageTerm>eng</mods:languageTerm>
</mods:language>
<mods:accessCondition type="useAndReproduction">https://creativecommons.org/licenses/by-nc-nd/3.0/</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">info:eu-repo/semantics/openAccess</mods:accessCondition>
<mods:accessCondition type="useAndReproduction">Attribution-NonCommercial-NoDerivs 3.0 Unported</mods:accessCondition>
<mods:subject>
<mods:topic>Computación</mods:topic>
</mods:subject>
<mods:subject>
<mods:topic>Informótica</mods:topic>
</mods:subject>
<mods:subject>
<mods:topic>Computing</mods:topic>
</mods:subject>
<mods:subject>
<mods:topic>Information Technology</mods:topic>
</mods:subject>
<mods:titleInfo>
<mods:title>A Multi-Agent Extension of a Hierarchical Task Network Planning Formalism</mods:title>
</mods:titleInfo>
<mods:genre>info:eu-repo/semantics/article</mods:genre>
</mods:mods></metadata></record></GetRecord></OAI-PMH>