Algorithms for Cameras View-Frame Placement Problems in the Presence of an Adversary and Distributional Ambiguity

In this paper, we introduce cameras view-frame placement problem (denoted by CFP) in the presence of an adversary whose objective is to minimize the maximum coverage by <inline-formula> <tex-math notation="LaTeX">p </tex-math></inline-formula> cameras in response to...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on automation science and engineering Ročník 22; s. 353 - 364
Hlavní autoři: Park, Seonghun, Bansal, Manish
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 2025
Témata:
ISSN:1545-5955, 1558-3783
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, we introduce cameras view-frame placement problem (denoted by CFP) in the presence of an adversary whose objective is to minimize the maximum coverage by <inline-formula> <tex-math notation="LaTeX">p </tex-math></inline-formula> cameras in response to input provided by <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> autonomous agents in a remote location. We allow uncertainty in the success of attacks, incomplete information of the probability distribution associated with the uncertain data, and varying levels of risk-appetite of the adversary. We present an exact cutting planes based algorithm to solve this problem and provide conditions under which it is finitely convergent. Since this approach solves deterministic CFP in each iteration, we also present improved exact method for CFP with <inline-formula> <tex-math notation="LaTeX">p=1 </tex-math></inline-formula>, approximation algorithm and heuristics for Multi-CFP with <inline-formula> <tex-math notation="LaTeX">p\geq 2 </tex-math></inline-formula>, and Multi-CFP with fixed tilt of the cameras. To evaluate the effectiveness and performance of the proposed approaches, we conduct computational experiments using randomly generated instances and simulation experiments where these approaches are utilized to find a hidden object in a remote location. Note to Practitioners-Telerobotic cameras have been widely used for a variety of applications in environment where it is tedious for humans to collect information such as surveillance, natural environment observation, search and rescue, satellite imaging, and many more. Therefore, computationally efficient approaches proposed in this paper for placement of view-frame of camera(s), by adjusting their pan, tilt, and zoom, will improve the effective utilization of a telerobotic cameras system. Additionally, before operating such systems in a military environment, a decision maker needs to analyze vulnerable cameras in the system whose disruption can significantly impact the information acquisition process. The algorithms presented for adversarial camera view-frame placement problem can identify the set of cameras (or vehicles carrying them) that are susceptible to attacks by a reasonable (risk-averse) attacker. Likewise, the proposed algebraic modeling framework and solution approaches are also applicable for planning interdiction actions to minimize the information acquisition by an evader/enemy. These results can be leveraged by autonomy solutions developed by the Army for both logistics (Autonomous Ground Resupply program) and combat missions (Combat Vehicle Robotics program).
AbstractList In this paper, we introduce cameras view-frame placement problem (denoted by CFP) in the presence of an adversary whose objective is to minimize the maximum coverage by <inline-formula> <tex-math notation="LaTeX">p </tex-math></inline-formula> cameras in response to input provided by <inline-formula> <tex-math notation="LaTeX">n </tex-math></inline-formula> autonomous agents in a remote location. We allow uncertainty in the success of attacks, incomplete information of the probability distribution associated with the uncertain data, and varying levels of risk-appetite of the adversary. We present an exact cutting planes based algorithm to solve this problem and provide conditions under which it is finitely convergent. Since this approach solves deterministic CFP in each iteration, we also present improved exact method for CFP with <inline-formula> <tex-math notation="LaTeX">p=1 </tex-math></inline-formula>, approximation algorithm and heuristics for Multi-CFP with <inline-formula> <tex-math notation="LaTeX">p\geq 2 </tex-math></inline-formula>, and Multi-CFP with fixed tilt of the cameras. To evaluate the effectiveness and performance of the proposed approaches, we conduct computational experiments using randomly generated instances and simulation experiments where these approaches are utilized to find a hidden object in a remote location. Note to Practitioners-Telerobotic cameras have been widely used for a variety of applications in environment where it is tedious for humans to collect information such as surveillance, natural environment observation, search and rescue, satellite imaging, and many more. Therefore, computationally efficient approaches proposed in this paper for placement of view-frame of camera(s), by adjusting their pan, tilt, and zoom, will improve the effective utilization of a telerobotic cameras system. Additionally, before operating such systems in a military environment, a decision maker needs to analyze vulnerable cameras in the system whose disruption can significantly impact the information acquisition process. The algorithms presented for adversarial camera view-frame placement problem can identify the set of cameras (or vehicles carrying them) that are susceptible to attacks by a reasonable (risk-averse) attacker. Likewise, the proposed algebraic modeling framework and solution approaches are also applicable for planning interdiction actions to minimize the information acquisition by an evader/enemy. These results can be leveraged by autonomy solutions developed by the Army for both logistics (Autonomous Ground Resupply program) and combat missions (Combat Vehicle Robotics program).
Author Bansal, Manish
Park, Seonghun
Author_xml – sequence: 1
  givenname: Seonghun
  orcidid: 0009-0008-9355-6935
  surname: Park
  fullname: Park, Seonghun
  email: seonghun@vt.edu
  organization: Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA
– sequence: 2
  givenname: Manish
  orcidid: 0000-0002-5617-3862
  surname: Bansal
  fullname: Bansal, Manish
  email: bansal@vt.edu
  organization: Grado Department of Industrial and Systems Engineering, Virginia Tech, Blacksburg, VA, USA
BookMark eNp9kMtOwzAQRS1UJNrCByCx8A-kjGM7cZZRaQGpEpWo2EaOO2mN8gDbBfXvSdQuEAtWM6O5Zx53QkZt1yIhtwxmjEF2v8lfF7MYYjHjXEKW8gsyZlKqiKeKj4ZcyEhmUl6Riffv0CtVBmPymde7ztmwbzytOkfnukGnPX2z-B0tXV_Rda0NNtgGunZdWWOvtC0N-77j0GNrkHYV1S3Nt1_ovHbHvtjSB-uDs-Uh2K7VNc2b0u4ONhyvyWWla4835zglm-ViM3-KVi-Pz_N8FZk4SUKk04QzVBJQa8UyQF4ZIwBVIoEBKCYyJcokxUSXJq1EXLEtmi1XJSSKp3xK2GmscZ33Dqviw9mmP65gUAyWFYNlxWBZcbasZ9I_jLFBDw8Ep239L3l3Ii0i_tokALJM8B_xnHzM
CODEN ITASC7
CitedBy_id crossref_primary_10_1007_s10287_025_00541_6
Cites_doi 10.1109/COASE.2010.5584770
10.1002/net.22114
10.1109/SPAWC.2019.8815522
10.1287/opre.12.6.934
10.1109/COASE.2008.4626527
10.1007/s10846-007-9201-6
10.1002/net.21831
10.1097/00000658-200204000-00005
10.1109/TRO.2007.907488
10.1109/TASE.2005.860617
10.1061/(ASCE)CO.1943-7862.0001636
10.1137/17M1115046
10.1016/j.asoc.2018.10.025
10.1109/ACCESS.2020.2992217
10.1016/0377-2217(82)90109-6
10.1007/s10898-020-00986-w
10.1080/13658810601169857
10.1111/j.1467-9787.1984.tb01031.x
10.1007/BF01584329
10.1109/MC.2002.1039518
10.1016/j.ejor.2019.05.033
10.1002/net.10039
10.1109/MC.2018.2876048
10.1111/j.1467-9787.1982.tb00759.x
10.1109/ROBOT.2008.4543337
10.1002/9781118033203
10.1007/s10514-008-9089-4
10.1016/j.ejor.2021.04.055
10.1109/ROBOT.2009.5152753
10.1287/ijoc.2016.0722
10.1137/20M1378600
10.1109/70.258056
10.1007/s10514-010-9188-x
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
DOI 10.1109/TASE.2024.3350973
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1558-3783
EndPage 364
ExternalDocumentID 10_1109_TASE_2024_3350973
10400994
Genre orig-research
GrantInformation_xml – fundername: DoD Grant by the Automotive Research Center, University of Michigan, Ann Arbor, in accordance with the U.S. Army Combat Capabilities Development Command (CCDC) Ground Vehicle Systems Center (GVSC)
  grantid: W56HZV-19-2-0001
  funderid: 10.13039/100000005
– fundername: NSF-Civil, Mechanical, and Manufacturing Innovation (CMMI)
  grantid: 1824897
  funderid: 10.13039/100000147
GroupedDBID -~X
0R~
29I
4.4
5GY
5VS
6IK
97E
AAJGR
AASAJ
AAWTH
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AIBXA
AKJIK
AKQYR
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
IFIPE
IPLJI
JAVBF
LAI
M43
O9-
OCL
PQQKQ
RIA
RIE
RNS
AAYXX
CITATION
ID FETCH-LOGICAL-c266t-a7631e850eaa8190e3fcc40e8650100814984b67e6abc7f42f1decd38b068373
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001165407800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1545-5955
IngestDate Tue Nov 18 20:53:17 EST 2025
Thu Nov 27 00:43:51 EST 2025
Wed Nov 26 07:22:48 EST 2025
IsPeerReviewed false
IsScholarly true
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
https://doi.org/10.15223/policy-029
https://doi.org/10.15223/policy-037
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c266t-a7631e850eaa8190e3fcc40e8650100814984b67e6abc7f42f1decd38b068373
ORCID 0000-0002-5617-3862
0009-0008-9355-6935
PageCount 12
ParticipantIDs ieee_primary_10400994
crossref_primary_10_1109_TASE_2024_3350973
crossref_citationtrail_10_1109_TASE_2024_3350973
PublicationCentury 2000
PublicationDate 20250000
2025-00-00
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 20250000
PublicationDecade 2020
PublicationTitle IEEE transactions on automation science and engineering
PublicationTitleAbbrev TASE
PublicationYear 2025
Publisher IEEE
Publisher_xml – name: IEEE
References ref13
ref35
ref12
ref34
ref15
ref14
ref31
ref30
ref11
ref33
ref10
ref2
ref1
ref17
Church (ref19) 1984; 24
ref16
Samuelson (ref5) 2010; 37
ref18
Kang (ref32) 2023
ref24
ref23
ref26
ref25
ref20
ref22
ref21
ref28
ref27
ref29
ref8
ref7
ref9
ref4
ref3
ref6
References_xml – ident: ref17
  doi: 10.1109/COASE.2010.5584770
– ident: ref29
  doi: 10.1002/net.22114
– ident: ref7
  doi: 10.1109/SPAWC.2019.8815522
– ident: ref26
  doi: 10.1287/opre.12.6.934
– ident: ref35
  doi: 10.1109/COASE.2008.4626527
– ident: ref15
  doi: 10.1007/s10846-007-9201-6
– ident: ref28
  doi: 10.1002/net.21831
– ident: ref1
  doi: 10.1097/00000658-200204000-00005
– ident: ref12
  doi: 10.1109/TRO.2007.907488
– ident: ref4
  doi: 10.1109/TASE.2005.860617
– ident: ref18
  doi: 10.1061/(ASCE)CO.1943-7862.0001636
– ident: ref34
  doi: 10.1137/17M1115046
– volume: 37
  start-page: 30
  issue: 3
  year: 2010
  ident: ref5
  article-title: Changing the war with analytics: Top us intelligence officer in central Asia recommends massive overhaul of how information is gathered and utilized
  publication-title: OR/MS Today
– ident: ref14
  doi: 10.1016/j.asoc.2018.10.025
– ident: ref8
  doi: 10.1109/ACCESS.2020.2992217
– ident: ref21
  doi: 10.1016/0377-2217(82)90109-6
– ident: ref33
  doi: 10.1007/s10898-020-00986-w
– ident: ref22
  doi: 10.1080/13658810601169857
– volume: 24
  start-page: 185
  issue: 2
  year: 1984
  ident: ref19
  article-title: The planar maximal covering location problem. (Symposium on location problems: In memory of Leon Cooper)
  publication-title: J. Regional Sci. Philadelphia
  doi: 10.1111/j.1467-9787.1984.tb01031.x
– ident: ref24
  doi: 10.1007/BF01584329
– ident: ref10
  doi: 10.1109/MC.2002.1039518
– ident: ref31
  doi: 10.1016/j.ejor.2019.05.033
– ident: ref25
  doi: 10.1002/net.10039
– year: 2023
  ident: ref32
  article-title: Distributionally ambiguous multistage stochastic integer and disjunctive programs: Applications to sequential two-player interdiction games
– ident: ref9
  doi: 10.1109/MC.2018.2876048
– ident: ref20
  doi: 10.1111/j.1467-9787.1982.tb00759.x
– ident: ref13
  doi: 10.1109/ROBOT.2008.4543337
– ident: ref23
  doi: 10.1002/9781118033203
– ident: ref3
  doi: 10.1007/s10514-008-9089-4
– ident: ref27
  doi: 10.1016/j.ejor.2021.04.055
– ident: ref16
  doi: 10.1109/ROBOT.2009.5152753
– ident: ref11
  doi: 10.1287/ijoc.2016.0722
– ident: ref30
  doi: 10.1137/20M1378600
– ident: ref6
  doi: 10.1109/70.258056
– ident: ref2
  doi: 10.1007/s10514-010-9188-x
SSID ssj0024890
Score 2.3957756
Snippet In this paper, we introduce cameras view-frame placement problem (denoted by CFP) in the presence of an adversary whose objective is to minimize the maximum...
SourceID crossref
ieee
SourceType Enrichment Source
Index Database
Publisher
StartPage 353
SubjectTerms Adversarial camera view-frame placement
Approximation algorithms
Cameras
cutting planes
distributionally robust optimization
exact and approximate algorithm
pan-tilt-zoom cameras
Probability distribution
Random variables
Robot vision systems
Uncertainty
Videos
Title Algorithms for Cameras View-Frame Placement Problems in the Presence of an Adversary and Distributional Ambiguity
URI https://ieeexplore.ieee.org/document/10400994
Volume 22
WOSCitedRecordID wos001165407800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-3783
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0024890
  issn: 1545-5955
  databaseCode: RIE
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3JTsMwELVoxQEOrEWUTT5wQkrJ4mzHqrTiVEWiQr1FXiYlUptA04L4ezxOgHIAiVsSOZHlcTxvxp73CLlWOpDNPM-zbBUIiwkXKW8ZWDLTC6FS0o-5bcQmwvE4mk7jpClWN7UwAGAOn0EPL81evirlGlNl-g9niGhYi7TCMKyLtb6J9SKTUEFIYPmx7zdbmI4d3076D0MdCrqs53k-8tP8cEIbqirGqYz2_9mdA7LXoEfar819SLagOCK7G5yCx-SlP5-VOuJ_WlRUA1I64Jh2quhjDm_WCI9i0QRT5_htmtRyMhXNC6qRIE1MMZIEWmaUF9SoNVd8-a5vFL1Djt1GHgs7sRD5bK1BfIdMRsPJ4N5qdBUsqd3xyuJ6TXEg8m3gHAEBeJmUzIZIozXk-tFBU8REEELAhQwz5maOAqm8SNiBjme9E9IuygJOCQWVOUK5TAkV4FhwX_vDWAVxpCMl4aousT_HOZUN5zhKX8xTE3vYcYqmSdE0aWOaLrn5euW5Jtz4q3EHzbLRsLbI2S_Pz8mOi_q9JoVyQdqr5RouybZ8XeXV8srMpw8xnchK
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT8JAEN4omqgHnxjxuQdPJsU-tqU9EoRgREIiMdyafUyRBIpS0Pjv3dlWxYMm3tpm22x2tjvfzO58HyGXSgeyied5lq0CYTHhIuUtA0smeiFUSvoRt43YRK3bDQeDqFcUq5taGAAwh8-gipdmL19N5QJTZfoPZ4ho2CpZ8xlznbxc65taLzQpFQQFlh_5frGJ6djRdb_-0NTBoMuqnucjQ80PN7Skq2LcSmvnnx3aJdsFfqT13OB7ZAXSfbK1xCp4QF7q4-FUx_xPk4xqSEobHBNPGX0cwZvVwsNYtIfJc_w27eWCMhkdpVRjQdoz5UgS6DShPKVGrznjs3d9o-gNsuwWAlnYiYkYDRcaxpdJv9XsN9pWoaxgSe2Q5xbXq4oDoW8D5wgJwEukZDaEGq8h248Om0ImghoEXMhawtzEUSCVFwo70BGtd0hK6TSFI0JBJY5QLlNCBTgW3NceMVJBFOpYSbiqQuzPcY5lwTqO4hfj2EQfdhSjaWI0TVyYpkKuvl55zik3_mpcRrMsNcwtcvzL8wuy0e7fd-LObffuhGy6qOZrEiqnpDSfLeCMrMvX-SibnZu59QHHb8uR
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Algorithms+for+Cameras+View-Frame+Placement+Problems+in+the+Presence+of+an+Adversary+and+Distributional+Ambiguity&rft.jtitle=IEEE+transactions+on+automation+science+and+engineering&rft.au=Park%2C+Seonghun&rft.au=Bansal%2C+Manish&rft.date=2025&rft.pub=IEEE&rft.issn=1545-5955&rft.volume=22&rft.spage=353&rft.epage=364&rft_id=info:doi/10.1109%2FTASE.2024.3350973&rft.externalDocID=10400994
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1545-5955&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1545-5955&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1545-5955&client=summon