Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Trajectory planning for unmanned aerial vehicles: a network optimization approach

From MaRDI portal
Publication:1935911
Jump to:navigation, search

DOI10.1007/s00186-011-0366-1zbMath1258.93116OpenAlexW2075407672MaRDI QIDQ1935911

Luitpold Babel

Publication date: 20 February 2013

Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00186-011-0366-1


zbMATH Keywords

network optimizationshortest path problemroute planningaircraft trajectoryflight path optimization


Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).




Cites Work

  • Unnamed Item
  • Unnamed Item
  • An efficient algorithm for computing least cost paths with turn constraints
  • Aircraft routing under the risk of detection
  • An algorithm for the resource constrained shortest path problem
  • Approximation Schemes for the Restricted Shortest Path Problem
  • Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
  • Planning Algorithms
  • On finding minimum routes in a network with turn penalties
  • A simple efficient approximation scheme for the restricted shortest path problem


This page was built for publication: Trajectory planning for unmanned aerial vehicles: a network optimization approach

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1935911&oldid=14368125"
Category:
  • Pages with script errors
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 16:32.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki