<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-01699599</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-19T22:31:34+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Cost-Optimal Factored Planning: Promises and Pitfalls</title>
            <author role="aut">
              <persName>
                <forename type="first">Eric</forename>
                <surname>Fabre</surname>
              </persName>
              <email type="md5">8deef1ee399d4f272f570da769d0d274</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">eric-fabre</idno>
              <idno type="idhal" notation="numeric">170693</idno>
              <idno type="halauthorid" notation="string">20326-170693</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-9008-8234</idno>
              <idno type="IDREF">https://www.idref.fr/103579648</idno>
              <affiliation ref="#struct-419153"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Loïg</forename>
                <surname>Jezequel</surname>
              </persName>
              <email type="md5">261a4648743e7ed0638954c28dfd9a65</email>
              <email type="domain">univ-nantes.fr</email>
              <idno type="idhal" notation="string">loig-jezequel</idno>
              <idno type="idhal" notation="numeric">17349</idno>
              <idno type="halauthorid" notation="string">14905-17349</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-5113-9668</idno>
              <idno type="IDREF">https://www.idref.fr/169378837</idno>
              <orgName ref="#struct-0"/>
              <affiliation ref="#struct-136233"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Patrik</forename>
                <surname>Haslum</surname>
              </persName>
              <idno type="halauthorid">679255-0</idno>
              <orgName ref="#struct-74662"/>
              <affiliation ref="#struct-75049"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sylvie</forename>
                <surname>Thiébaux</surname>
              </persName>
              <email type="md5">5657a869303a89957b29cc5830b0ee42</email>
              <email type="domain">laas.fr</email>
              <idno type="idhal" notation="string">sylvie-thiebaux</idno>
              <idno type="idhal" notation="numeric">1378926</idno>
              <idno type="halauthorid" notation="string">144869-1378926</idno>
              <idno type="IDREF">https://www.idref.fr/204667038</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-7434-3976</idno>
              <orgName ref="#struct-300009"/>
              <affiliation ref="#struct-75049"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Loïg</forename>
                <surname>Jezequel</surname>
              </persName>
              <email type="md5">261a4648743e7ed0638954c28dfd9a65</email>
              <email type="domain">univ-nantes.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2018-02-07 15:09:08</date>
              <date type="whenModified">2025-03-28 03:09:52</date>
              <date type="whenReleased">2018-02-13 14:53:06</date>
              <date type="whenProduced">2010-05-12</date>
              <date type="whenEndEmbargoed">2018-02-07</date>
              <ref type="file" target="https://hal.science/hal-01699599v1/document">
                <date notBefore="2018-02-07"/>
              </ref>
              <ref type="file" n="1" target="https://hal.science/hal-01699599v1/file/icaps.pdf" id="file-1699599-1743810">
                <date notBefore="2018-02-07"/>
              </ref>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="590049">
                <persName>
                  <forename>Loïg</forename>
                  <surname>Jezequel</surname>
                </persName>
                <email type="md5">261a4648743e7ed0638954c28dfd9a65</email>
                <email type="domain">univ-nantes.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-01699599</idno>
            <idno type="halUri">https://hal.science/hal-01699599</idno>
            <idno type="halBibtex">fabre:hal-01699599</idno>
            <idno type="halRefHtml">&lt;i&gt; ICAPS 2010 - 20th International Conference on Automated Planning and Scheduling)&lt;/i&gt;, May 2010, Toronto, Canada</idno>
            <idno type="halRef"> ICAPS 2010 - 20th International Conference on Automated Planning and Scheduling), May 2010, Toronto, Canada</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1699599-1743810"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="ENS-CACHAN">Ecole Normale Supérieure de Cachan</idno>
            <idno type="stamp" n="INRIA-RENNES">INRIA Rennes - Bretagne Atlantique</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="INRIA-RENGRE">INRIA-RENGRE</idno>
            <idno type="stamp" n="INRIA-300009">Inria 300009</idno>
            <idno type="stamp" n="ENS-PARIS-SACLAY">Ecole Normale Supérieure paris-Saclay</idno>
            <idno type="stamp" n="INRIA-AUSTRALIE">Copublications Inria-Australie</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="invited" n="0">No</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
            <note type="proceedings" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Cost-Optimal Factored Planning: Promises and Pitfalls</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Eric</forename>
                    <surname>Fabre</surname>
                  </persName>
                  <email type="md5">8deef1ee399d4f272f570da769d0d274</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">eric-fabre</idno>
                  <idno type="idhal" notation="numeric">170693</idno>
                  <idno type="halauthorid" notation="string">20326-170693</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-9008-8234</idno>
                  <idno type="IDREF">https://www.idref.fr/103579648</idno>
                  <affiliation ref="#struct-419153"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Loïg</forename>
                    <surname>Jezequel</surname>
                  </persName>
                  <email type="md5">261a4648743e7ed0638954c28dfd9a65</email>
                  <email type="domain">univ-nantes.fr</email>
                  <idno type="idhal" notation="string">loig-jezequel</idno>
                  <idno type="idhal" notation="numeric">17349</idno>
                  <idno type="halauthorid" notation="string">14905-17349</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-5113-9668</idno>
                  <idno type="IDREF">https://www.idref.fr/169378837</idno>
                  <orgName ref="#struct-0"/>
                  <affiliation ref="#struct-136233"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Patrik</forename>
                    <surname>Haslum</surname>
                  </persName>
                  <idno type="halauthorid">679255-0</idno>
                  <orgName ref="#struct-74662"/>
                  <affiliation ref="#struct-75049"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvie</forename>
                    <surname>Thiébaux</surname>
                  </persName>
                  <email type="md5">5657a869303a89957b29cc5830b0ee42</email>
                  <email type="domain">laas.fr</email>
                  <idno type="idhal" notation="string">sylvie-thiebaux</idno>
                  <idno type="idhal" notation="numeric">1378926</idno>
                  <idno type="halauthorid" notation="string">144869-1378926</idno>
                  <idno type="IDREF">https://www.idref.fr/204667038</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-7434-3976</idno>
                  <orgName ref="#struct-300009"/>
                  <affiliation ref="#struct-75049"/>
                </author>
              </analytic>
              <monogr>
                <meeting>
                  <title> ICAPS 2010 - 20th International Conference on Automated Planning and Scheduling)</title>
                  <date type="start">2010-05-12</date>
                  <settlement>Toronto</settlement>
                  <country key="CA">Canada</country>
                </meeting>
                <imprint/>
              </monogr>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <classCode scheme="halDomain" n="info.info-ai">Computer Science [cs]/Artificial Intelligence [cs.AI]</classCode>
              <classCode scheme="halTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halOldTypology" n="COMM">Conference papers</classCode>
              <classCode scheme="halTreeTypology" n="COMM">Conference papers</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>Factored planning methods aim to exploit locality to efficiently solve large but " loosely coupled " planning problems by computing solutions locally and propagating limited information between components. However, all factored planning methods presented so far work with representations that require certain parameters to be bounded (e.g. number of coordination points between local plans considered); the satisfaction of those bounds by a given problem instance is difficult to establish a priori, and the influence of those parameters on the problem complexity is unclear. We present an instance of the factored planning framework using a representation of the (regular) sets of local plans by finite automata, which does not require any such bound. By substituting weighted automata, we can even do factored cost-optimal planning. We test an implementation of the method on the few standard planning benchmarks that we have found to be amenable to factoring. We show that this method runs in polynomial time under conditions similar to those considered in previous work, but not only under those conditions. Thus, what constitutes an essential measure of " factorability " remains obscure.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-419153" status="VALID">
          <idno type="RNSR">198018249C</idno>
          <idno type="ROR">https://ror.org/04040yw90</idno>
          <orgName>Centre Inria de l'Université de Rennes</orgName>
          <desc>
            <address>
              <addrLine>Campus de beaulieu35042 Rennes cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/centre/rennes</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
          </listRelation>
        </org>
        <org type="department" xml:id="struct-136233" status="VALID">
          <orgName>École normale supérieure - Cachan, antenne de Bretagne</orgName>
          <orgName type="acronym">ENS Cachan Bretagne</orgName>
          <desc>
            <address>
              <addrLine>Campus de Ker Lann - Avenue Robert Schuman - 35170 Bruz</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.bretagne.ens-cachan.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-6862" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-75049" status="VALID">
          <orgName>Canberra Research Laboratory</orgName>
          <desc>
            <address>
              <country key="AU"/>
            </address>
          </desc>
          <listRelation>
            <relation active="#struct-74662" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300009" status="VALID">
          <idno type="ROR">https://ror.org/02kvxyf05</idno>
          <orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
          <orgName type="acronym">Inria</orgName>
          <desc>
            <address>
              <addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/en/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-6862" status="VALID">
          <orgName>École normale supérieure - Cachan</orgName>
          <orgName type="acronym">ENS Cachan</orgName>
          <desc>
            <address>
              <addrLine>61, avenue du Président Wilson - 94230 Cachan</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.ens-cachan.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-74662" status="VALID">
          <idno type="IdRef">026470942</idno>
          <idno type="ROR">https://ror.org/019wvm592</idno>
          <orgName>Australian National University</orgName>
          <orgName type="acronym">ANU</orgName>
          <desc>
            <address>
              <addrLine>The Australian National University Canberra ACT 0200 Australia</addrLine>
              <country key="AU"/>
            </address>
            <ref type="url">http://www.anu.edu.au/index.php</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>