<?xml version="1.0" encoding="UTF-8"?><marc:collection xmlns:marc="http://www.loc.gov/MARC21/slim">
  <marc:record>
    <marc:leader>00000nam  2200000zi 4500</marc:leader>
    <marc:controlfield tag="001">9.879262</marc:controlfield>
    <marc:controlfield tag="003">CaOODSP</marc:controlfield>
    <marc:controlfield tag="005">20240220154249</marc:controlfield>
    <marc:controlfield tag="006">m     o  d f      </marc:controlfield>
    <marc:controlfield tag="007">cr cn|||||||||</marc:controlfield>
    <marc:controlfield tag="008">190913t20112011nsca    ob   f000 0 eng d</marc:controlfield>
    <marc:datafield tag="040" ind1=" " ind2=" ">
      <marc:subfield code="a">CaOODSP</marc:subfield>
      <marc:subfield code="b">eng</marc:subfield>
      <marc:subfield code="e">rda</marc:subfield>
      <marc:subfield code="c">CaOODSP</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="041" ind1="0" ind2=" ">
      <marc:subfield code="a">eng</marc:subfield>
      <marc:subfield code="b">eng</marc:subfield>
      <marc:subfield code="b">fre</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="086" ind1="1" ind2=" ">
      <marc:subfield code="a">D68-4/044-2011E-PDF</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="100" ind1="1" ind2=" ">
      <marc:subfield code="a">Myers, Vincent, </marc:subfield>
      <marc:subfield code="e">author.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="245" ind1="1" ind2="0">
      <marc:subfield code="a">Cooperative dynamic pathfinding for multiple autonomous underwater vehicles using D* / </marc:subfield>
      <marc:subfield code="c">Vincent Myers, DRDC Atlantic.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="264" ind1=" " ind2="1">
      <marc:subfield code="a">Dartmouth NS : </marc:subfield>
      <marc:subfield code="b">Defence Research and Development Canada - Atlantic, </marc:subfield>
      <marc:subfield code="c">2011.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="264" ind1=" " ind2="4">
      <marc:subfield code="c">©2011</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="300" ind1=" " ind2=" ">
      <marc:subfield code="a">1 online resource (viii, 26 pages, 2 unnumbered pages) : </marc:subfield>
      <marc:subfield code="b">colour illustrations.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="336" ind1=" " ind2=" ">
      <marc:subfield code="a">text</marc:subfield>
      <marc:subfield code="b">txt</marc:subfield>
      <marc:subfield code="2">rdacontent</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="337" ind1=" " ind2=" ">
      <marc:subfield code="a">computer</marc:subfield>
      <marc:subfield code="b">c</marc:subfield>
      <marc:subfield code="2">rdamedia</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="338" ind1=" " ind2=" ">
      <marc:subfield code="a">online resource</marc:subfield>
      <marc:subfield code="b">cr</marc:subfield>
      <marc:subfield code="2">rdacarrier</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="490" ind1="1" ind2=" ">
      <marc:subfield code="a">Technical report ; </marc:subfield>
      <marc:subfield code="v">DRDC Atlantic TR 2011-044</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="500" ind1=" " ind2=" ">
      <marc:subfield code="a">Cover title.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="500" ind1=" " ind2=" ">
      <marc:subfield code="a">"January 2011."</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="504" ind1=" " ind2=" ">
      <marc:subfield code="a">Includes bibliographical references (pages 24-25).</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="520" ind1="3" ind2=" ">
      <marc:subfield code="a">"A method for finding least-cost paths through an area by collaborating agents is presented. The method relies on extending existing dynamic path planning algorithms, namely D*, to the multi-agent case. The search tree is centrally updated and then used by the agents to cooperatively decide upon which areas to survey, the results of which are then used to update the current best path. Several numerical examples are given where it is shown that, on average, a competitive ratio — the ratio between the cost of the path found by dynamic algorithm and one operating with full knowledge of the area—of nearly one can be achieved while requiring a survey of less than half the total area. It is also shown that the total mission time scales linearly with the number of vehicles, meaning little to no effort wasted on vehicle coordination. In the context of mine countermeasures (MCM) operations with autonomous underwater vehicles (AUVs), the results indicate that a channel through a potentially mined area representing an amount of risk nearly equal to the optimal path can be found in significantly less time than the time required to survey the entire area"--Abstract, page i.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="546" ind1=" " ind2=" ">
      <marc:subfield code="a">Includes abstracts and summaries in English and French.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="710" ind1="2" ind2=" ">
      <marc:subfield code="a">Defence R&amp;D Canada.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="710" ind1="2" ind2=" ">
      <marc:subfield code="a">Defence R&amp;D Canada - Atlantic.</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="830" ind1="#" ind2="0">
      <marc:subfield code="a">Technical report (Defence R&amp;D Canada)</marc:subfield>
      <marc:subfield code="v">DRDC Atlantic TR 2011-044.</marc:subfield>
      <marc:subfield code="w">(CaOODSP)9.820558</marc:subfield>
    </marc:datafield>
    <marc:datafield tag="856" ind1="4" ind2="0">
      <marc:subfield code="q">PDF</marc:subfield>
      <marc:subfield code="s">468 KB</marc:subfield>
      <marc:subfield code="u">https://publications.gc.ca/collections/collection_2019/rddc-drdc/D68-4-044-2011-eng.pdf</marc:subfield>
    </marc:datafield>
  </marc:record>
</marc:collection>
