<?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-00927100</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-19T04:08:20+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization</title>
            <author role="aut">
              <persName>
                <forename type="first">Xavier</forename>
                <surname>Goaoc</surname>
              </persName>
              <email type="md5">cd46a7d5a40ef590c4ab3a47f0cdfcaa</email>
              <email type="domain">u-pem.fr</email>
              <idno type="idhal" notation="string">xavier-goaoc</idno>
              <idno type="idhal" notation="numeric">9973</idno>
              <idno type="halauthorid" notation="string">13725-9973</idno>
              <idno type="IDREF">https://www.idref.fr/172437245</idno>
              <affiliation ref="#struct-205129"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Hyo-Sil</forename>
                <surname>Kim</surname>
              </persName>
              <idno type="halauthorid">171083-0</idno>
              <orgName ref="#struct-301570"/>
              <affiliation ref="#struct-121665"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Sylvain</forename>
                <surname>Lazard</surname>
              </persName>
              <email type="md5">803278b692333378439119bae9f2aea9</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="string">sylvain-lazard</idno>
              <idno type="idhal" notation="numeric">2334</idno>
              <idno type="halauthorid" notation="string">13654-2334</idno>
              <idno type="IDREF">https://www.idref.fr/179326554</idno>
              <idno type="ORCID">https://orcid.org/0000-0002-6032-0802</idno>
              <affiliation ref="#struct-205129"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Sylvain</forename>
                <surname>Lazard</surname>
              </persName>
              <email type="md5">803278b692333378439119bae9f2aea9</email>
              <email type="domain">inria.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1" type="current">
              <date type="whenSubmitted">2014-01-10 19:06:40</date>
              <date type="whenModified">2025-11-04 11:59:53</date>
              <date type="whenReleased">2018-10-29 10:30:44</date>
              <date type="whenProduced">2013</date>
              <date type="whenEndEmbargoed">2014-01-10</date>
              <ref type="file" target="https://inria.hal.science/hal-00927100v1/document">
                <date notBefore="2014-01-10"/>
              </ref>
              <ref type="annex" subtype="figure" n="1" target="https://inria.hal.science/hal-00927100v1/file/2013%20Bounded-Curvature%20Shortest%20Paths.png" id="file-1907049-1937868">
                <date notBefore="2018-10-28"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://inria.hal.science/hal-00927100v1/file/viapoints_final.pdf" id="file-1907049-1937867">
                <date notBefore="2014-01-10"/>
              </ref>
              <ref type="externalLink" target="http://koasas.kaist.ac.kr/bitstream/10203/173957/1/000318353800011.pdf"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="103314">
                <persName>
                  <forename>Sylvain</forename>
                  <surname>Lazard</surname>
                </persName>
                <email type="md5">803278b692333378439119bae9f2aea9</email>
                <email type="domain">inria.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00927100</idno>
            <idno type="halUri">https://inria.hal.science/hal-00927100</idno>
            <idno type="halBibtex">goaoc:hal-00927100</idno>
            <idno type="halRefHtml">&lt;i&gt;SIAM Journal on Computing&lt;/i&gt;, 2013, 42 (2), pp.662-684. &lt;a target="_blank" href="https://dx.doi.org/10.1137/100816079"&gt;&amp;#x27E8;10.1137/100816079&amp;#x27E9;&lt;/a&gt;</idno>
            <idno type="halRef">SIAM Journal on Computing, 2013, 42 (2), pp.662-684. &amp;#x27E8;10.1137/100816079&amp;#x27E9;</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-1907049-1937868"/><ref corresp="#file-1907049-1937867"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="INRIA">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="INRIA_TEST">INRIA - Institut National de Recherche en Informatique et en Automatique</idno>
            <idno type="stamp" n="LORIA2">Publications du LORIA</idno>
            <idno type="stamp" n="INRIA-NANCY-GRAND-EST">INRIA Nancy - Grand Est</idno>
            <idno type="stamp" n="TESTALAIN1">TESTALAIN1</idno>
            <idno type="stamp" n="UNIV-LORRAINE">Université de Lorraine</idno>
            <idno type="stamp" n="INRIA2">INRIA 2</idno>
            <idno type="stamp" n="LORIA-ALGO-TEST5">LORIA-ALGO-TEST5  </idno>
            <idno type="stamp" n="LORIA">Laboratoire Lorrain de Recherche en Informatique et ses Applications</idno>
            <idno type="stamp" n="LORIA-ALGO" corresp="LORIA">Department of Algorithms, Computation, Image and Geometry</idno>
            <idno type="stamp" n="NANCY-2014">NANCY 2014</idno>
            <idno type="stamp" n="AM2I-UL">Pôle scientifique Automatique, Mathématiques, Informatique et leurs Intéractions de l'Université de Lorraine</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Bounded-Curvature Shortest Paths through a Sequence of Points using Convex Optimization</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Xavier</forename>
                    <surname>Goaoc</surname>
                  </persName>
                  <email type="md5">cd46a7d5a40ef590c4ab3a47f0cdfcaa</email>
                  <email type="domain">u-pem.fr</email>
                  <idno type="idhal" notation="string">xavier-goaoc</idno>
                  <idno type="idhal" notation="numeric">9973</idno>
                  <idno type="halauthorid" notation="string">13725-9973</idno>
                  <idno type="IDREF">https://www.idref.fr/172437245</idno>
                  <affiliation ref="#struct-205129"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Hyo-Sil</forename>
                    <surname>Kim</surname>
                  </persName>
                  <idno type="halauthorid">171083-0</idno>
                  <orgName ref="#struct-301570"/>
                  <affiliation ref="#struct-121665"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Sylvain</forename>
                    <surname>Lazard</surname>
                  </persName>
                  <email type="md5">803278b692333378439119bae9f2aea9</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="string">sylvain-lazard</idno>
                  <idno type="idhal" notation="numeric">2334</idno>
                  <idno type="halauthorid" notation="string">13654-2334</idno>
                  <idno type="IDREF">https://www.idref.fr/179326554</idno>
                  <idno type="ORCID">https://orcid.org/0000-0002-6032-0802</idno>
                  <affiliation ref="#struct-205129"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">8476</idno>
                <idno type="issn">0097-5397</idno>
                <title level="j">SIAM Journal on Computing</title>
                <imprint>
                  <publisher>Society for Industrial and Applied Mathematics</publisher>
                  <biblScope unit="volume">42</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">662-684</biblScope>
                  <date type="datePub">2013</date>
                </imprint>
              </monogr>
              <idno type="doi">10.1137/100816079</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Path planning</term>
                <term xml:lang="en">Dubins path</term>
                <term xml:lang="en">Bounded curvature</term>
                <term xml:lang="en">Convex optimization</term>
              </keywords>
              <classCode scheme="halDomain" n="info.info-cg">Computer Science [cs]/Computational Geometry [cs.CG]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>We consider the problem of computing shortest paths having curvature at most one almost everywhere and visiting a sequence of $n$ points in the plane in a given order. This problem is a sub-problem of the Dubins Traveling Salesman Problem and also arises naturally in path planning for point car-like robots in the presence of polygonal obstacles. We show that when consecutive waypoints are distance at least four apart, this question reduces to a family of convex optimization problems over polyhedra in $\mathbb{R}^n$.</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="researchteam" xml:id="struct-205129" status="OLD">
          <idno type="RNSR">200518305E</idno>
          <orgName>Effective Geometric Algorithms for Surfaces and Visibility</orgName>
          <orgName type="acronym">VEGAS</orgName>
          <date type="start">2005-08-01</date>
          <date type="end">2016-12-31</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/equipes/vegas</ref>
          </desc>
          <listRelation>
            <relation active="#struct-129671" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-423083" type="direct"/>
            <relation active="#struct-206040" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-121665" status="VALID">
          <orgName>Department of Electrical Engineering [Korea Advanced Institute of Science and Technology]</orgName>
          <orgName type="acronym">KAIST</orgName>
          <desc>
            <address>
              <addrLine>335 Gwahak-ro (373-1 Guseong-dong) Yuseong-gu, Daejeon 305-701 Republic of Korea</addrLine>
              <country key="KR"/>
            </address>
            <ref type="url">http://www.kaist.edu/edu.html</ref>
          </desc>
          <listRelation>
            <relation active="#struct-301570" type="direct"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-129671" status="VALID">
          <idno type="RNSR">198618246Y</idno>
          <idno type="ROR">https://ror.org/03fcjvn64</idno>
          <orgName>Centre Inria de l'Université de Lorraine</orgName>
          <desc>
            <address>
              <addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.inria.fr/nancy</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" 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="department" xml:id="struct-423083" status="VALID">
          <orgName>Department of Algorithms, Computation, Image and Geometry</orgName>
          <orgName type="acronym">LORIA - ALGO</orgName>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr/en/research/departments/algorithms-computation-image-and-geometry/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-206040" type="direct"/>
            <relation active="#struct-300009" type="indirect"/>
            <relation active="#struct-411575" type="indirect"/>
            <relation active="#struct-413289" type="indirect"/>
            <relation name="UMR7503" active="#struct-441569" type="indirect"/>
          </listRelation>
        </org>
        <org type="laboratory" xml:id="struct-206040" status="VALID">
          <idno type="IdRef">067077927</idno>
          <idno type="ISNI">0000000121795429</idno>
          <idno type="RNSR">198912571S</idno>
          <idno type="IdUnivLorraine">[UL]RSI--</idno>
          <idno type="ROR">https://ror.org/02vnf0c38</idno>
          <orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
          <orgName type="acronym">LORIA</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.loria.fr</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300009" type="direct"/>
            <relation active="#struct-411575" type="direct"/>
            <relation active="#struct-413289" type="direct"/>
            <relation name="UMR7503" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-411575" status="VALID">
          <idno type="IdRef">184443237</idno>
          <idno type="ROR">https://ror.org/019tcpt25</idno>
          <orgName>CentraleSupélec</orgName>
          <desc>
            <address>
              <addrLine>3, rue Joliot Curie,Plateau de Moulon,91192 GIF-SUR-YVETTE Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.centralesupelec.fr</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-413289" status="VALID">
          <idno type="IdRef">157040569</idno>
          <idno type="IdUnivLorraine">[UL]100--</idno>
          <idno type="ROR">https://ror.org/04vfs2w97</idno>
          <orgName>Université de Lorraine</orgName>
          <orgName type="acronym">UL</orgName>
          <date type="start">2012-01-01</date>
          <desc>
            <address>
              <addrLine>34 cours Léopold - CS 25233 - 54052 Nancy cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">http://www.univ-lorraine.fr/</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
        <org type="institution" xml:id="struct-301570" status="VALID">
          <idno type="ROR">https://ror.org/05apxxy63</idno>
          <orgName>Korea Advanced Institute of Science and Technology</orgName>
          <orgName type="acronym">KAIST</orgName>
          <date type="start">2016-10-19</date>
          <desc>
            <address>
              <addrLine>291 Daehak-ro, Yuseong-gu, Daejeon 34141, Republic of Korea</addrLine>
              <country key="KR"/>
            </address>
            <ref type="url">http://www.kaist.edu/html/en/index.html</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>