Under-water sonar placement

Taofeek Biobaku, Gino Lim, Jaeyoung Cho, Selim Bora, Hamid Parsaei

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Given a marine area of interest (e.g., water-ways, ports), this paper attempts to efficiently allocate sonar sensors (utilized for under water detection) within a limited budget to achieve a reasonable amount of coverage, thereby keeping ports and waterways under surveillance against impending threats. Though total coverage of the entire area of interest is desired, priority is given to the criticality/importance attached to specific locations within the area of interest, on a grid-based system. We present two optimization models to detect potential threats by placing underwater sonars within a port or waterway of interest. The first model (mixed integer linear programming model) developed maximizes the detection coverage based on the importance attached to a sub-region. The second model is a mixed integer nonlinear programming model that is designed to achieve optimal detection based on a desired detection probability threshold. Both models satisfy a budget constraint that limits number of sonars to be deployed.

Original languageEnglish
Title of host publicationIIE Annual Conference and Expo 2014
PublisherInstitute of Industrial Engineers
Pages3380-3392
Number of pages13
ISBN (Electronic)9780983762430
Publication statusPublished - 2014
EventIIE Annual Conference and Expo 2014 - Montreal, Canada
Duration: 31 May 20143 Jun 2014

Other

OtherIIE Annual Conference and Expo 2014
CountryCanada
CityMontreal
Period31/5/143/6/14

    Fingerprint

Keywords

  • Grid system
  • Marine
  • Optimization
  • Sonar placement

ASJC Scopus subject areas

  • Industrial and Manufacturing Engineering
  • Control and Systems Engineering

Cite this

Biobaku, T., Lim, G., Cho, J., Bora, S., & Parsaei, H. (2014). Under-water sonar placement. In IIE Annual Conference and Expo 2014 (pp. 3380-3392). Institute of Industrial Engineers.