IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v168y2023icp151-169.html
   My bibliography  Save this article

Biobjective route planning of an unmanned air vehicle in continuous space

Author

Listed:
  • Tezcaner Öztürk, Diclehan
  • Köksalan, Murat

Abstract

We consider the route planning problem of an unmanned air vehicle (UAV) in a continuous space that is monitored by radars. The UAV visits multiple targets and returns to the base. The routes are constructed considering the total distance traveled and the total radar detection threat objectives. The UAV is capable of moving to any point in the terrain. This leads to infinitely many efficient trajectories between target pairs and infinitely many efficient routes to visit all targets. We use a two stage approach in solving the complex problem of finding all efficient routes. In the first stage, we structure the nondominated frontiers of the efficient trajectories between all target pairs. For this, we first identify properties shared by efficient trajectories between target pairs that are protected by a radar. This helps to structure the nondominated frontier between any target pair by identifying at most four specific efficient trajectories. We develop a search-based algorithm that finds these efficient trajectories effectively. For the second stage, we develop a mixed integer nonlinear program that exploits the structured nondominated frontiers between target pairs to construct the efficient routes. We compare the nondominated front we generate in the continuous space with its counterpart in a terrain discretized with three different grid fidelities. The continuous space representation outperforms all discrete representations in terms of solution quality and computational times.

Suggested Citation

  • Tezcaner Öztürk, Diclehan & Köksalan, Murat, 2023. "Biobjective route planning of an unmanned air vehicle in continuous space," Transportation Research Part B: Methodological, Elsevier, vol. 168(C), pages 151-169.
  • Handle: RePEc:eee:transb:v:168:y:2023:i:c:p:151-169
    DOI: 10.1016/j.trb.2023.01.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261523000012
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.trb.2023.01.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Murat Köksalan & Banu Lokman, 2009. "Approximating the nondominated frontiers of multi‐objective combinatorial optimization problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 56(2), pages 191-198, March.
    2. Diclehan Tezcaner & Murat Köksalan, 2011. "An Interactive Algorithm for Multi-objective Route Planning," Journal of Optimization Theory and Applications, Springer, vol. 150(2), pages 379-394, August.
    3. Babel, Luitpold, 2017. "Curvature-constrained traveling salesman tours for aerial surveillance in scenarios with obstacles," European Journal of Operational Research, Elsevier, vol. 262(1), pages 335-346.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Nail Karabay & Murat Köksalan & Diclehan Tezcaner Öztürk, 2023. "Biobjective UAV routing for a mission to visit multiple mobile targets," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 45(3), pages 925-954, September.
    2. Kyriakakis, Nikolaos A. & Marinaki, Magdalene & Matsatsinis, Nikolaos & Marinakis, Yannis, 2022. "A cumulative unmanned aerial vehicle routing problem approach for humanitarian coverage path planning," European Journal of Operational Research, Elsevier, vol. 300(3), pages 992-1004.
    3. Doğan, Ilgın & Lokman, Banu & Köksalan, Murat, 2022. "Representing the nondominated set in multi-objective mixed-integer programs," European Journal of Operational Research, Elsevier, vol. 296(3), pages 804-818.
    4. Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
    5. Zajac, Sandra & Huber, Sandra, 2021. "Objectives and methods in multi-objective routing problems: a survey and classification scheme," European Journal of Operational Research, Elsevier, vol. 290(1), pages 1-25.
    6. Nasim Nasrabadi & Akram Dehnokhalaji & Pekka Korhonen & Jyrki Wallenius, 2019. "Using convex preference cones in multiple criteria decision making and related fields," Journal of Business Economics, Springer, vol. 89(6), pages 699-717, August.
    7. Özarık, Sami Serkan & Lokman, Banu & Köksalan, Murat, 2020. "Distribution based representative sets for multi-objective integer programs," European Journal of Operational Research, Elsevier, vol. 284(2), pages 632-643.
    8. Mavrotas, George & Florios, Kostas, 2013. "An improved version of the augmented epsilon-constraint method (AUGMECON2) for finding the exact Pareto set in Multi-Objective Integer Programming problems," MPRA Paper 105034, University Library of Munich, Germany.
    9. Ceyhan, Gökhan & Köksalan, Murat & Lokman, Banu, 2019. "Finding a representative nondominated set for multi-objective mixed integer programs," European Journal of Operational Research, Elsevier, vol. 272(1), pages 61-77.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transb:v:168:y:2023:i:c:p:151-169. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.