<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">445839961</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180317145340.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170323e20111201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/s00186-011-0366-1</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/s00186-011-0366-1</subfield>
  </datafield>
  <datafield tag="100" ind1="1" ind2=" ">
   <subfield code="a">Babel</subfield>
   <subfield code="D">Luitpold</subfield>
   <subfield code="u">Fakultät Betriebswirtschaft, WE Mathematik und Informatik, Universität der Bundeswehr, Munich, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="245" ind1="1" ind2="0">
   <subfield code="a">Trajectory planning for unmanned aerial vehicles: a network optimization approach</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Luitpold Babel]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper presents a new approach for trajectory planning of air vehicles. It considers scenarios with risk areas and forbidden zones and takes into account the maneuverability of the air vehicle. It is flexible as to allow different kinds of objective functions such as minimizing risk, flight path length or flight time, and allows to implement constraints on fuel consumption or other resources. Additionally, it can incorporate waypoints to be passed by the air vehicle with or without specified overflight directions. The method includes planning of one-way and return trips. The underlying model is based on a discretization of the airspace into a non-regular network. Every path in the network corresponds to a flyable trajectory which means that the trajectory is within the performance limits of the air vehicle. The generation of the network is done non-deterministically. One of the main benefits of the model is that one can make use of standard network optimization techniques.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Springer-Verlag, 2011</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Flight path optimization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Route planning</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Aircraft trajectory</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Shortest path problem</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Network optimization</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">Mathematical Methods of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">74/3(2011-12-01), 343-360</subfield>
   <subfield code="x">1432-2994</subfield>
   <subfield code="q">74:3&lt;343</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">74</subfield>
   <subfield code="o">186</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/s00186-011-0366-1</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/s00186-011-0366-1</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">100</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Babel</subfield>
   <subfield code="D">Luitpold</subfield>
   <subfield code="u">Fakultät Betriebswirtschaft, WE Mathematik und Informatik, Universität der Bundeswehr, Munich, Germany</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">Mathematical Methods of Operations Research</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">74/3(2011-12-01), 343-360</subfield>
   <subfield code="x">1432-2994</subfield>
   <subfield code="q">74:3&lt;343</subfield>
   <subfield code="1">2011</subfield>
   <subfield code="2">74</subfield>
   <subfield code="o">186</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
