IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v172y2017i3d10.1007_s10957-016-1014-y.html
   My bibliography  Save this article

Aerial Vehicle Search-Path Optimization: A Novel Method for Emergency Operations

Author

Listed:
  • Manon Raap

    (Universität der Bundeswehr München)

  • Silja Meyer-Nieberg

    (Universität der Bundeswehr München)

  • Stefan Pickl

    (Universität der Bundeswehr München)

  • Martin Zsifkovits

    (Universität der Bundeswehr München)

Abstract

This paper presents a novel search-path optimization method for moving target search by an aerial vehicle, applicable to realistically sized search areas. For such missions, long endurance vehicles are needed, which are usually fixed-winged. The proposed method accounts for flight kinematics of fixed-wing and rotary-wing aerial vehicles. It additionally accounts for movements of the target, considerably increasing complexity of search-path optimization, compared to a static target. The objective is to maximize the probability to detect a conditionally deterministic moving target within a given time period. We propose a first K-step-lookahead planning method that takes flight kinematic constraints into account and in which the target and platform state space are heterogeneous. It consists of a binary integer linear program that yields a physically feasible search-path, while maximizing the probability of detection. It is based on the Max-K-Coverage problem, as it selects K waypoints while maximizing the probability that a target is within the field of view of a platform at one of these waypoints. This K-step-lookahead planning method is embedded in an iterative framework, where the probability of overlooking a target is fed back to the controller after observations are made. Simulations show the applicability and effectiveness of this method.

Suggested Citation

  • Manon Raap & Silja Meyer-Nieberg & Stefan Pickl & Martin Zsifkovits, 2017. "Aerial Vehicle Search-Path Optimization: A Novel Method for Emergency Operations," Journal of Optimization Theory and Applications, Springer, vol. 172(3), pages 965-983, March.
    • Handle: RePEc:spr:joptap:v:172:y:2017:i:3:d:10.1007_s10957-016-1014-y
    DOI: 10.1007/s10957-016-1014-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-1014-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10957-016-1014-y?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. James N. Eagle & James R. Yee, 1990. "An Optimal Branch-and-Bound Procedure for the Constrained Path, Moving Target Search Problem," Operations Research, INFORMS, vol. 38(1), pages 110-114, February.
    2. Joseph Foraker & Johannes O. Royset & Isaac Kaminer, 2016. "Search-Trajectory Optimization: Part II, Algorithms and Computations," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 550-567, May.
    3. Lau, Haye & Huang, Shoudong & Dissanayake, Gamini, 2008. "Discounted MEAN bound for the optimal searcher path problem with non-uniform travel times," European Journal of Operational Research, Elsevier, vol. 190(2), pages 383-397, October.
    4. Joseph Foraker & Johannes O. Royset & Isaac Kaminer, 2016. "Search-Trajectory Optimization: Part I, Formulation and Theory," Journal of Optimization Theory and Applications, Springer, vol. 169(2), pages 530-549, May.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Mehdi Zeynivand & Mehdi Najafi & Mohammad Modarres Yazdi, 2023. "A Recourse Policy to Improve Number of Successful Transplants in Uncertain Kidney Exchange Programs," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 476-507, May.
    2. Morin, Michael & Abi-Zeid, Irène & Quimper, Claude-Guy, 2023. "Ant colony optimization for path planning in search and rescue operations," European Journal of Operational Research, Elsevier, vol. 305(1), pages 53-63.

    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. Morin, Michael & Abi-Zeid, Irène & Quimper, Claude-Guy, 2023. "Ant colony optimization for path planning in search and rescue operations," European Journal of Operational Research, Elsevier, vol. 305(1), pages 53-63.
    2. Bourque, François-Alex, 2019. "Solving the moving target search problem using indistinguishable searchers," European Journal of Operational Research, Elsevier, vol. 275(1), pages 45-52.
    3. Johannes O. Royset & Hiroyuki Sato, 2010. "Route optimization for multiple searchers," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(8), pages 701-717, December.
    4. Steven M. Shechter & Farhad Ghassemi & Yasin Gocgun & Martin L. Puterman, 2015. "Technical Note—Trading Off Quick versus Slow Actions in Optimal Search," Operations Research, INFORMS, vol. 63(2), pages 353-362, April.
    5. J F J Vermeulen & M van den Brink, 2005. "The search for an alerted moving target," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(5), pages 514-525, May.
    6. Claire Walton & Panos Lambrianides & Isaac Kaminer & Johannes Royset & Qi Gong, 2018. "Optimal motion planning in rapid‐fire combat situations with attacker uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(2), pages 101-119, March.
    7. Kress, M. & Royset, J.O. & Rozen, N., 2012. "The eye and the fist: Optimizing search and interdiction," European Journal of Operational Research, Elsevier, vol. 220(2), pages 550-558.
    8. Ron Teller & Moshe Zofi & Moshe Kaspi, 2019. "Minimizing the average searching time for an object within a graph," Computational Optimization and Applications, Springer, vol. 74(2), pages 517-545, November.
    9. Jesse Pietz & Johannes O. Royset, 2013. "Generalized orienteering problem with resource dependent rewards," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(4), pages 294-312, June.
    10. Hong, Sung-Pil & Cho, Sung-Jin & Park, Myoung-Ju, 2009. "A pseudo-polynomial heuristic for path-constrained discrete-time Markovian-target search," European Journal of Operational Research, Elsevier, vol. 193(2), pages 351-364, March.
    11. Michael Zabarankin & Stan Uryasev & Robert Murphey, 2006. "Aircraft routing under the risk of detection," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(8), pages 728-747, December.
    12. Lawrence D. Stone & Alan R. Washburn, 1991. "Introduction special issue on search theory," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 465-468, August.
    13. Alan R. Washburn, 1998. "Branch and bound methods for a search problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 45(3), pages 243-257, April.
    14. Stanley J. Benkoski & Michael G. Monticino & James R. Weisinger, 1991. "A survey of the search theory literature," Naval Research Logistics (NRL), John Wiley & Sons, vol. 38(4), pages 469-494, August.
    15. Lyn C. Thomas & James N. Eagle, 1995. "Criteria and approximate methods for path‐constrained moving‐target search problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 42(1), pages 27-38, February.
    16. Mohamed Abd Allah El-Hadidy, 2016. "On Maximum Discounted Effort Reward Search Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(03), pages 1-30, June.
    17. Hohzaki, Ryusuke & Iida, Koji, 2000. "A search game when a search path is given," European Journal of Operational Research, Elsevier, vol. 124(1), pages 114-124, July.
    18. Hohzaki, Ryusuke & Iida, Koji, 1997. "Optimal strategy of route and look for the path constrained search problem with reward criterion," European Journal of Operational Research, Elsevier, vol. 100(1), pages 236-249, July.
    19. Hiroyuki Sato & Johannes O. Royset, 2010. "Path optimization for the resource‐constrained searcher," Naval Research Logistics (NRL), John Wiley & Sons, vol. 57(5), pages 422-440, August.
    20. Adel Guitouni & Hatem Masri, 2014. "An orienteering model for the search and rescue problem," Computational Management Science, Springer, vol. 11(4), pages 459-473, October.

    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:spr:joptap:v:172:y:2017:i:3:d:10.1007_s10957-016-1014-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.