Optimization model of routing-and-searching for unmanned aerial vehicles in special target-detection operations

B. Kriheli, E. Levner, A. Spivak

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We model the problem of routing and search for a hidden target in a directed graph in which nodes represent possible target locations and arcs correspond to possible moves of an unmanned aerial vehicle (UAV) between them. Prior probabilities of locations are known for each target. The inspections are imperfect: a probability of overlooking the hidden target and a probability of a "false alarm" exist. The decision maker has to sequentially inspect the locations so that to find the target with the minimum cost, within a priori given level of confidence An index-based algorithm for finding the optimal search strategy is developed.

Original languageEnglish
Title of host publication7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013 - Proceedings
PublisherIFAC Secretariat
Pages1838-1842
Number of pages5
Edition9
ISBN (Print)9783902823359
DOIs
StatePublished - 2013
Externally publishedYes
Event7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013 - Saint Petersburg, Russian Federation
Duration: 19 Jun 201321 Jun 2013

Publication series

NameIFAC Proceedings Volumes (IFAC-PapersOnline)
Number9
Volume46
ISSN (Print)1474-6670

Conference

Conference7th IFAC Conference on Manufacturing Modelling, Management, and Control, MIM 2013
Country/TerritoryRussian Federation
CitySaint Petersburg
Period19/06/1321/06/13

Keywords

  • Discrete search
  • Greedy algorithm
  • Imperfect inspection
  • Search and detection

Fingerprint

Dive into the research topics of 'Optimization model of routing-and-searching for unmanned aerial vehicles in special target-detection operations'. Together they form a unique fingerprint.

Cite this