Multi-objective search game: Long-term vs short-term
This study focuses on investigating a multi-objective search allocation game problem, specifically addressing the distribution of a search budget (player 1) across a searched area to detect an evading target (player 2). The game is defined as a two-person zero-sum game, as an optimal search strategy...
Gespeichert in:
| Veröffentlicht in: | Computers & operations research Jg. 164; S. 106551 |
|---|---|
| 1. Verfasser: | |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Ltd
01.04.2024
Elsevier |
| Schlagworte: | |
| ISSN: | 0305-0548, 1873-765X |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | This study focuses on investigating a multi-objective search allocation game problem, specifically addressing the distribution of a search budget (player 1) across a searched area to detect an evading target (player 2). The game is defined as a two-person zero-sum game, as an optimal search strategy must consider the target’s optimal evasion strategy. Traditionally, the sole objective function in search theory literature has been to maximize the detection probability at the end of the time horizon. Our work extends the problem by proposing a multi-objective formulation that aims to strike a balance between long-term and short-term search objectives. In this context, the goal is to maximize the detection probability of the target at the end of each time period (e.g., hourly) throughout the time horizon. The main challenge in this problem lies in handling a multitude of objective functions, where the number of objective functions is an input data. To the best of our knowledge, no prior research has explored the multi-objective search allocation game. Therefore, we meticulously study the significance of this problem by highlighting the disparities and conflicts among these objectives. Subsequently, we propose a solution approach based on the epsilon-constraint algorithm, as well as a heuristic method that decomposes the problem into smaller multi-objective subproblems. We conduct a series of experiments to evaluate two key aspects of the methods: computation time and quality.
•Long-term and short-term are optimized in this search allocation game.•Experimental studies reveal conflicts between the objectives functions.•Non-evading targets and unrestricted targets special cases are examined.•Solution methods are proposed, using epsilon-constraint mechanisms.•Experiments are conducted to examine the quality of solutions and computation times |
|---|---|
| AbstractList | This study focuses on investigating a multi-objective search allocation game problem, specifically addressing the distribution of a search budget (player 1) across a searched area to detect an evading target (player 2). The game is defined as a two-person zero-sum game, as an optimal search strategy must consider the target’s optimal evasion strategy. Traditionally, the sole objective function in search theory literature has been to maximize the detection probability at the end of the time horizon. Our work extends the problem by proposing a multi-objective formulation that aims to strike a balance between long-term and short-term search objectives. In this context, the goal is to maximize the detection probability of the target at the end of each time period (e.g., hourly) throughout the time horizon. The main challenge in this problem lies in handling a multitude of objective functions, where the number of objective functions is an input data. To the best of our knowledge, no prior research has explored the multi-objective search allocation game. Therefore, we meticulously study the significance of this problem by highlighting the disparities and conflicts among these objectives. Subsequently, we propose a solution approach based on the epsilon-constraint algorithm, as well as a heuristic method that decomposes the problem into smaller multi-objective subproblems. We conduct a series of experiments to evaluate two key aspects of the methods: computation time and quality. This study focuses on investigating a multi-objective search allocation game problem, specifically addressing the distribution of a search budget (player 1) across a searched area to detect an evading target (player 2). The game is defined as a two-person zero-sum game, as an optimal search strategy must consider the target’s optimal evasion strategy. Traditionally, the sole objective function in search theory literature has been to maximize the detection probability at the end of the time horizon. Our work extends the problem by proposing a multi-objective formulation that aims to strike a balance between long-term and short-term search objectives. In this context, the goal is to maximize the detection probability of the target at the end of each time period (e.g., hourly) throughout the time horizon. The main challenge in this problem lies in handling a multitude of objective functions, where the number of objective functions is an input data. To the best of our knowledge, no prior research has explored the multi-objective search allocation game. Therefore, we meticulously study the significance of this problem by highlighting the disparities and conflicts among these objectives. Subsequently, we propose a solution approach based on the epsilon-constraint algorithm, as well as a heuristic method that decomposes the problem into smaller multi-objective subproblems. We conduct a series of experiments to evaluate two key aspects of the methods: computation time and quality. •Long-term and short-term are optimized in this search allocation game.•Experimental studies reveal conflicts between the objectives functions.•Non-evading targets and unrestricted targets special cases are examined.•Solution methods are proposed, using epsilon-constraint mechanisms.•Experiments are conducted to examine the quality of solutions and computation times |
| ArticleNumber | 106551 |
| Author | Delavernhe, Florian |
| Author_xml | – sequence: 1 givenname: Florian orcidid: 0000-0002-0363-1065 surname: Delavernhe fullname: Delavernhe, Florian email: florian.delavernhe@u-bourgogne.fr organization: Université de Bourgogne, Laboratoire DRIVE, Nevers, France |
| BackLink | https://ube.hal.science/hal-04700852$$DView record in HAL |
| BookMark | eNp9kLFOwzAQQC1UJErhA9iyMqTYjmM7MFUVUKQiFpDYLNc5t47SGNkmEn9PSmBh6C2nO927071zNOl8BwhdETwnmPCbZm58mFNM2VDzsiQnaEqkKHLBy_cJmuIClzkumTxD5zE2eAhByRSx5882udxvGjDJ9ZBF0MHssq3ew2229t02TxD2WR-zuPMh_VQX6NTqNsLlb56ht4f71-UqX788Pi0X69wUJU85MGIELU2lLUgrKdPWANnYSoCspRasYhWVnFegOWBek5oxi2VdU7CWalbM0PW4d6db9RHcXocv5bVTq8VaHXqYCYxlSXsyzIpx1gQfYwCrjEs6Od-loF2rCFYHUapRgyh1EKVGUQNJ_pF_p44xdyMDw_u9g6CicdAZqF0YRKrauyP0N9LOgdU |
| CitedBy_id | crossref_primary_10_1007_s12046_025_02822_x crossref_primary_10_1080_01605682_2025_2538222 |
| Cites_doi | 10.1016/j.ins.2014.05.054 10.1287/inte.2019.1000 10.1016/j.tcs.2018.06.022 10.1287/opre.4.5.503 10.1016/j.cor.2019.05.021 10.1016/j.robot.2015.08.010 10.1287/opre.5.5.613 10.1287/opre.18.5.883 10.1016/j.ejor.2019.11.040 10.1287/opre.16.3.525 10.1016/j.cor.2012.07.006 10.1002/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E 10.1287/opre.28.6.1275 10.1016/0022-247X(68)90167-4 10.1137/0317009 10.1287/opre.9.1.1 10.1016/j.ejor.2004.10.003 10.1016/j.foreco.2006.08.292 10.1002/nav.20432 10.1109/TEVC.2019.2925175 10.1002/net.21818 10.1016/j.cor.2008.08.007 10.1287/opre.4.3.324 10.1016/j.ejor.2020.11.012 |
| ContentType | Journal Article |
| Copyright | 2024 The Author Distributed under a Creative Commons Attribution 4.0 International License |
| Copyright_xml | – notice: 2024 The Author – notice: Distributed under a Creative Commons Attribution 4.0 International License |
| DBID | 6I. AAFTH AAYXX CITATION 1XC |
| DOI | 10.1016/j.cor.2024.106551 |
| DatabaseName | ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Hyper Article en Ligne (HAL) |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Computer Science Business |
| EISSN | 1873-765X |
| ExternalDocumentID | oai:HAL:hal-04700852v1 10_1016_j_cor_2024_106551 S0305054824000236 |
| GroupedDBID | --K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6I. 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 1XC |
| ID | FETCH-LOGICAL-c356t-e41c725c9afe8f824afce1bf97e8d8a7494928669ea6e06d1d44f08dd2eff2a43 |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001174555100001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-0548 |
| IngestDate | Sat Nov 29 14:57:11 EST 2025 Sat Nov 29 07:20:58 EST 2025 Tue Nov 18 21:19:04 EST 2025 Fri Feb 23 02:35:31 EST 2024 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | ε-constraint Game theory Search game Multiobjective optimization Game theory Search game Multiobjective optimization ε-constraint |
| Language | English |
| License | This is an open access article under the CC BY-NC license. Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0 |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c356t-e41c725c9afe8f824afce1bf97e8d8a7494928669ea6e06d1d44f08dd2eff2a43 |
| ORCID | 0000-0002-0363-1065 |
| OpenAccessLink | https://dx.doi.org/10.1016/j.cor.2024.106551 |
| ParticipantIDs | hal_primary_oai_HAL_hal_04700852v1 crossref_citationtrail_10_1016_j_cor_2024_106551 crossref_primary_10_1016_j_cor_2024_106551 elsevier_sciencedirect_doi_10_1016_j_cor_2024_106551 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-04-01 |
| PublicationDateYYYYMMDD | 2024-04-01 |
| PublicationDate_xml | – month: 04 year: 2024 text: 2024-04-01 day: 01 |
| PublicationDecade | 2020 |
| PublicationTitle | Computers & operations research |
| PublicationYear | 2024 |
| Publisher | Elsevier Ltd Elsevier |
| Publisher_xml | – name: Elsevier Ltd – name: Elsevier |
| References | Zheng, Du, Sheng, Ling (b41) 2019; 49 Ollero, Merino (b32) 2006; 234 Garnaev (b13) 2000 Le Thi, Nguyen, Dinh (b30) 2014; 41 Gal (b12) 2010 Dobbie (b10) 1968; 16 Koopman (b26) 1956; 4 Royset, Sato (b35) 2010; 57 Hohzaki, Iida, Komiya (b20) 2002; 45 Benkoski, Monticino, Weisinger (b4) 1991; 38 Koopman (b27) 1957; 5 Von Neumann, Morgenstern, Kuhn (b38) 2007 Kadane (b24) 1968; 22 Koopman (b25) 1956; 4 Chankong, Haimes (b6) 2008 Simonin, Le Cadre, Dambreville (b37) 2009; 36 Koopman (b28) 1980 Hohzaki (b18) 2016; 59 Hohzaki (b16) 2006; 172 Brown (b5) 1980; 28 Hohzaki (b17) 2013 Hohzaki (b19) 2017; 10 Otto, Agatz, Campbell, Golden, Pesch (b33) 2018; 72 Zheng, Du, Ling, Sheng, Chen (b40) 2019; 24 Garrec, Scarsini (b14) 2020; 283 De Guenin (b8) 1961; 9 Chen, Shen, Chen, Blasch, Pham (b7) 2010 Le Thi, Nguyen, Dinh (b31) 2015 Alpern, Gal (b3) 2006 Pollock (b34) 1970; 18 Lanillos, Gan, Besada-Portas, Pajares, Sukkarieh (b29) 2014; 282 Gal (b11) 1979; 17 Gusev (b15) 2020 Delavernhe, Jaillet, Rossi, Sevaux (b9) 2021; 292 Alfeo, Cimino, Vaglini (b1) 2019; 110 Iida, Hohzaki, Furui (b22) 1996; 39 Iida, Hohzaki, Sato (b23) 1994; 37 Hohzaki, Joo (b21) 2015; 58 Alpern (b2) 2019; 794 Senanayake, Senthooran, Barca, Chung, Kamruzzaman, Murshed (b36) 2016; 75 Waharte, Trigoni (b39) 2010 Ollero (10.1016/j.cor.2024.106551_b32) 2006; 234 Garrec (10.1016/j.cor.2024.106551_b14) 2020; 283 Hohzaki (10.1016/j.cor.2024.106551_b19) 2017; 10 Gal (10.1016/j.cor.2024.106551_b12) 2010 Hohzaki (10.1016/j.cor.2024.106551_b16) 2006; 172 Kadane (10.1016/j.cor.2024.106551_b24) 1968; 22 Chen (10.1016/j.cor.2024.106551_b7) 2010 Zheng (10.1016/j.cor.2024.106551_b40) 2019; 24 Alfeo (10.1016/j.cor.2024.106551_b1) 2019; 110 Benkoski (10.1016/j.cor.2024.106551_b4) 1991; 38 Koopman (10.1016/j.cor.2024.106551_b28) 1980 Garnaev (10.1016/j.cor.2024.106551_b13) 2000 Alpern (10.1016/j.cor.2024.106551_b2) 2019; 794 Simonin (10.1016/j.cor.2024.106551_b37) 2009; 36 Brown (10.1016/j.cor.2024.106551_b5) 1980; 28 Otto (10.1016/j.cor.2024.106551_b33) 2018; 72 Iida (10.1016/j.cor.2024.106551_b22) 1996; 39 Royset (10.1016/j.cor.2024.106551_b35) 2010; 57 Waharte (10.1016/j.cor.2024.106551_b39) 2010 De Guenin (10.1016/j.cor.2024.106551_b8) 1961; 9 Le Thi (10.1016/j.cor.2024.106551_b30) 2014; 41 Koopman (10.1016/j.cor.2024.106551_b26) 1956; 4 Pollock (10.1016/j.cor.2024.106551_b34) 1970; 18 Iida (10.1016/j.cor.2024.106551_b23) 1994; 37 Lanillos (10.1016/j.cor.2024.106551_b29) 2014; 282 Zheng (10.1016/j.cor.2024.106551_b41) 2019; 49 Le Thi (10.1016/j.cor.2024.106551_b31) 2015 Delavernhe (10.1016/j.cor.2024.106551_b9) 2021; 292 Gusev (10.1016/j.cor.2024.106551_b15) 2020 Koopman (10.1016/j.cor.2024.106551_b27) 1957; 5 Hohzaki (10.1016/j.cor.2024.106551_b17) 2013 Chankong (10.1016/j.cor.2024.106551_b6) 2008 Gal (10.1016/j.cor.2024.106551_b11) 1979; 17 Hohzaki (10.1016/j.cor.2024.106551_b20) 2002; 45 Hohzaki (10.1016/j.cor.2024.106551_b18) 2016; 59 Dobbie (10.1016/j.cor.2024.106551_b10) 1968; 16 Hohzaki (10.1016/j.cor.2024.106551_b21) 2015; 58 Alpern (10.1016/j.cor.2024.106551_b3) 2006 Von Neumann (10.1016/j.cor.2024.106551_b38) 2007 Koopman (10.1016/j.cor.2024.106551_b25) 1956; 4 Senanayake (10.1016/j.cor.2024.106551_b36) 2016; 75 |
| References_xml | – volume: 38 start-page: 469 year: 1991 end-page: 494 ident: b4 article-title: A survey of the search theory literature publication-title: Nav. Res. Logist. – year: 2000 ident: b13 publication-title: Search Games and Other Applications of Game Theory – volume: 172 start-page: 101 year: 2006 end-page: 119 ident: b16 article-title: Search allocation game publication-title: European J. Oper. Res. – volume: 39 start-page: 501 year: 1996 end-page: 511 ident: b22 article-title: A search game for a mobile target with the conditionally deterministic motion defined by paths publication-title: J. Oper. Res. Soc. Japan – volume: 4 start-page: 503 year: 1956 end-page: 531 ident: b26 article-title: The theory of search. II. Target detection publication-title: Oper. Res. – start-page: 142 year: 2010 end-page: 147 ident: b39 article-title: Supporting search and rescue operations with UAVs publication-title: 2010 International Conference on Emerging Security Technologies – start-page: 6981 year: 2010 end-page: 6986 ident: b7 article-title: Tracking evasive objects via a search allocation game publication-title: Proceedings of the 2010 American Control Conference – volume: 36 start-page: 2179 year: 2009 end-page: 2192 ident: b37 article-title: A hierarchical approach for planning a multisensor multizone search for a moving target publication-title: Comput. Oper. Res. – volume: 72 start-page: 411 year: 2018 end-page: 458 ident: b33 article-title: Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey publication-title: Networks – year: 2007 ident: b38 article-title: Theory of Games and Economic Behavior (Commemorative Edition) – volume: 41 start-page: 231 year: 2014 end-page: 239 ident: b30 article-title: A DC programming approach for planning a multisensor multizone search for a target publication-title: Comput. Oper. Res. – volume: 16 start-page: 525 year: 1968 end-page: 537 ident: b10 article-title: A survey of search theory publication-title: Oper. Res. – volume: 59 start-page: 1 year: 2016 end-page: 34 ident: b18 article-title: Search games: Literature and survey publication-title: J. Oper. Res. Soc. Japan – year: 2006 ident: b3 publication-title: The Theory of Search Games and Rendezvous – volume: 234 start-page: S263 year: 2006 ident: b32 article-title: Unmanned aerial vehicles as tools for forest-fire fighting publication-title: Forest Ecol. Manag. – volume: 18 start-page: 883 year: 1970 end-page: 903 ident: b34 article-title: A simple model of search for a moving target publication-title: Oper. Res. – volume: 37 start-page: 287 year: 1994 end-page: 296 ident: b23 article-title: Hide-and-seaerch game with the risk criterion publication-title: J. Oper. Res. Soc. Japan – volume: 9 start-page: 1 year: 1961 end-page: 7 ident: b8 article-title: Optimum distribution of effort: An extension of the Koopman basic theory publication-title: Oper. Res. – start-page: 153 year: 2020 end-page: 173 ident: b15 article-title: A multi-stage model of searching for two mobile objects on a graph publication-title: Frontiers in Games and Dynamic Games – volume: 24 start-page: 217 year: 2019 end-page: 231 ident: b40 article-title: Evolutionary collaborative human-UAV search for escaped criminals publication-title: IEEE Trans. Evol. Comput. – volume: 794 start-page: 20 year: 2019 end-page: 26 ident: b2 article-title: Search for an immobile hider in a known subset of a network publication-title: Theoret. Comput. Sci. – volume: 57 start-page: 701 year: 2010 end-page: 717 ident: b35 article-title: Route optimization for multiple searchers publication-title: Nav. Res. Logist. – start-page: 1 year: 2013 end-page: 10 ident: b17 article-title: The search allocation game publication-title: Wiely Encyclopedia of Operations Research and Management Science – volume: 292 start-page: 469 year: 2021 end-page: 482 ident: b9 article-title: Planning a multi-sensors search for a moving target considering traveling costs publication-title: European J. Oper. Res. – year: 2008 ident: b6 article-title: Multiobjective Decision Making: Theory and Methodology – volume: 283 start-page: 783 year: 2020 end-page: 794 ident: b14 article-title: Search for an immobile hider on a stochastic network publication-title: European J. Oper. Res. – volume: 58 start-page: 353 year: 2015 end-page: 375 ident: b21 article-title: A search allocation game with private information of initial target position publication-title: J. Oper. Res. Soc. Japan – volume: 49 start-page: 371 year: 2019 end-page: 383 ident: b41 article-title: Collaborative human–UAV search and rescue for missing tourists in nature reserves publication-title: INFORMS J. Appl. Anal. – volume: 282 start-page: 92 year: 2014 end-page: 110 ident: b29 article-title: Multi-UAV target search using decentralized gradient-based negotiation with expected observation publication-title: Inform. Sci. – volume: 5 start-page: 613 year: 1957 end-page: 626 ident: b27 article-title: The theory of search: III. The optimum distribution of searching effort publication-title: Oper. Res. – volume: 10 start-page: 129 year: 2017 end-page: 142 ident: b19 article-title: A search game with incomplete information on detective capability of searcher publication-title: Contrib. Game Theory Manag. – volume: 75 start-page: 422 year: 2016 end-page: 434 ident: b36 article-title: Search and tracking algorithms for swarms of robots: A survey publication-title: Robot. Auton. Syst. – volume: 28 start-page: 1275 year: 1980 end-page: 1289 ident: b5 article-title: Optimal search for a moving target in discrete time and space publication-title: Oper. Res. – year: 1980 ident: b28 article-title: Search and Screening: General Principles with Historical Applications – start-page: 107 year: 2015 end-page: 118 ident: b31 article-title: A based-DC programming approach for planning a multisensor multizone search for a moving target publication-title: Modelling, Computation and Optimization in Information Systems and Management Sciences – volume: 110 start-page: 34 year: 2019 end-page: 47 ident: b1 article-title: Enhancing biologically inspired swarm behavior: Metaheuristics to foster the optimization of UAVs coordination in target search publication-title: Comput. Oper. Res. – volume: 22 start-page: 156 year: 1968 end-page: 171 ident: b24 article-title: Discrete search and the neyman-pearson lemma publication-title: J. Math. Anal. Appl. – volume: 45 start-page: 93 year: 2002 end-page: 108 ident: b20 article-title: Discrete search allocation game with energy constraints publication-title: J. Oper. Res. Soc. Japan – year: 2010 ident: b12 article-title: Search games publication-title: Wiley Encyclopedia of Operations Research and Management Science – volume: 17 start-page: 99 year: 1979 end-page: 122 ident: b11 article-title: Search games with mobile and immobile hider publication-title: SIAM J. Control Optim. – volume: 4 start-page: 324 year: 1956 end-page: 346 ident: b25 article-title: The theory of search. I. Kinematic bases publication-title: Oper. Res. – volume: 39 start-page: 501 issue: 4 year: 1996 ident: 10.1016/j.cor.2024.106551_b22 article-title: A search game for a mobile target with the conditionally deterministic motion defined by paths publication-title: J. Oper. Res. Soc. Japan – volume: 282 start-page: 92 year: 2014 ident: 10.1016/j.cor.2024.106551_b29 article-title: Multi-UAV target search using decentralized gradient-based negotiation with expected observation publication-title: Inform. Sci. doi: 10.1016/j.ins.2014.05.054 – start-page: 142 year: 2010 ident: 10.1016/j.cor.2024.106551_b39 article-title: Supporting search and rescue operations with UAVs – volume: 49 start-page: 371 issue: 5 year: 2019 ident: 10.1016/j.cor.2024.106551_b41 article-title: Collaborative human–UAV search and rescue for missing tourists in nature reserves publication-title: INFORMS J. Appl. Anal. doi: 10.1287/inte.2019.1000 – volume: 794 start-page: 20 year: 2019 ident: 10.1016/j.cor.2024.106551_b2 article-title: Search for an immobile hider in a known subset of a network publication-title: Theoret. Comput. Sci. doi: 10.1016/j.tcs.2018.06.022 – volume: 10 start-page: 129 year: 2017 ident: 10.1016/j.cor.2024.106551_b19 article-title: A search game with incomplete information on detective capability of searcher publication-title: Contrib. Game Theory Manag. – volume: 4 start-page: 503 issue: 5 year: 1956 ident: 10.1016/j.cor.2024.106551_b26 article-title: The theory of search. II. Target detection publication-title: Oper. Res. doi: 10.1287/opre.4.5.503 – volume: 110 start-page: 34 year: 2019 ident: 10.1016/j.cor.2024.106551_b1 article-title: Enhancing biologically inspired swarm behavior: Metaheuristics to foster the optimization of UAVs coordination in target search publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2019.05.021 – volume: 37 start-page: 287 issue: 4 year: 1994 ident: 10.1016/j.cor.2024.106551_b23 article-title: Hide-and-seaerch game with the risk criterion publication-title: J. Oper. Res. Soc. Japan – volume: 75 start-page: 422 year: 2016 ident: 10.1016/j.cor.2024.106551_b36 article-title: Search and tracking algorithms for swarms of robots: A survey publication-title: Robot. Auton. Syst. doi: 10.1016/j.robot.2015.08.010 – volume: 5 start-page: 613 issue: 5 year: 1957 ident: 10.1016/j.cor.2024.106551_b27 article-title: The theory of search: III. The optimum distribution of searching effort publication-title: Oper. Res. doi: 10.1287/opre.5.5.613 – volume: 18 start-page: 883 issue: 5 year: 1970 ident: 10.1016/j.cor.2024.106551_b34 article-title: A simple model of search for a moving target publication-title: Oper. Res. doi: 10.1287/opre.18.5.883 – volume: 283 start-page: 783 issue: 2 year: 2020 ident: 10.1016/j.cor.2024.106551_b14 article-title: Search for an immobile hider on a stochastic network publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2019.11.040 – year: 2008 ident: 10.1016/j.cor.2024.106551_b6 – start-page: 1 year: 2013 ident: 10.1016/j.cor.2024.106551_b17 article-title: The search allocation game – volume: 58 start-page: 353 issue: 4 year: 2015 ident: 10.1016/j.cor.2024.106551_b21 article-title: A search allocation game with private information of initial target position publication-title: J. Oper. Res. Soc. Japan – volume: 59 start-page: 1 issue: 1 year: 2016 ident: 10.1016/j.cor.2024.106551_b18 article-title: Search games: Literature and survey publication-title: J. Oper. Res. Soc. Japan – volume: 16 start-page: 525 issue: 3 year: 1968 ident: 10.1016/j.cor.2024.106551_b10 article-title: A survey of search theory publication-title: Oper. Res. doi: 10.1287/opre.16.3.525 – volume: 41 start-page: 231 year: 2014 ident: 10.1016/j.cor.2024.106551_b30 article-title: A DC programming approach for planning a multisensor multizone search for a target publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2012.07.006 – start-page: 107 year: 2015 ident: 10.1016/j.cor.2024.106551_b31 article-title: A based-DC programming approach for planning a multisensor multizone search for a moving target – volume: 45 start-page: 93 issue: 1 year: 2002 ident: 10.1016/j.cor.2024.106551_b20 article-title: Discrete search allocation game with energy constraints publication-title: J. Oper. Res. Soc. Japan – volume: 38 start-page: 469 issue: 4 year: 1991 ident: 10.1016/j.cor.2024.106551_b4 article-title: A survey of the search theory literature publication-title: Nav. Res. Logist. doi: 10.1002/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E – volume: 28 start-page: 1275 issue: 6 year: 1980 ident: 10.1016/j.cor.2024.106551_b5 article-title: Optimal search for a moving target in discrete time and space publication-title: Oper. Res. doi: 10.1287/opre.28.6.1275 – volume: 22 start-page: 156 issue: 1 year: 1968 ident: 10.1016/j.cor.2024.106551_b24 article-title: Discrete search and the neyman-pearson lemma publication-title: J. Math. Anal. Appl. doi: 10.1016/0022-247X(68)90167-4 – year: 2010 ident: 10.1016/j.cor.2024.106551_b12 article-title: Search games – volume: 17 start-page: 99 issue: 1 year: 1979 ident: 10.1016/j.cor.2024.106551_b11 article-title: Search games with mobile and immobile hider publication-title: SIAM J. Control Optim. doi: 10.1137/0317009 – volume: 9 start-page: 1 issue: 1 year: 1961 ident: 10.1016/j.cor.2024.106551_b8 article-title: Optimum distribution of effort: An extension of the Koopman basic theory publication-title: Oper. Res. doi: 10.1287/opre.9.1.1 – year: 2006 ident: 10.1016/j.cor.2024.106551_b3 – year: 2000 ident: 10.1016/j.cor.2024.106551_b13 – volume: 172 start-page: 101 issue: 1 year: 2006 ident: 10.1016/j.cor.2024.106551_b16 article-title: Search allocation game publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2004.10.003 – volume: 234 start-page: S263 issue: 1 year: 2006 ident: 10.1016/j.cor.2024.106551_b32 article-title: Unmanned aerial vehicles as tools for forest-fire fighting publication-title: Forest Ecol. Manag. doi: 10.1016/j.foreco.2006.08.292 – start-page: 153 year: 2020 ident: 10.1016/j.cor.2024.106551_b15 article-title: A multi-stage model of searching for two mobile objects on a graph – year: 1980 ident: 10.1016/j.cor.2024.106551_b28 – volume: 57 start-page: 701 issue: 8 year: 2010 ident: 10.1016/j.cor.2024.106551_b35 article-title: Route optimization for multiple searchers publication-title: Nav. Res. Logist. doi: 10.1002/nav.20432 – volume: 24 start-page: 217 issue: 2 year: 2019 ident: 10.1016/j.cor.2024.106551_b40 article-title: Evolutionary collaborative human-UAV search for escaped criminals publication-title: IEEE Trans. Evol. Comput. doi: 10.1109/TEVC.2019.2925175 – start-page: 6981 year: 2010 ident: 10.1016/j.cor.2024.106551_b7 article-title: Tracking evasive objects via a search allocation game – volume: 72 start-page: 411 issue: 4 year: 2018 ident: 10.1016/j.cor.2024.106551_b33 article-title: Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: A survey publication-title: Networks doi: 10.1002/net.21818 – volume: 36 start-page: 2179 issue: 7 year: 2009 ident: 10.1016/j.cor.2024.106551_b37 article-title: A hierarchical approach for planning a multisensor multizone search for a moving target publication-title: Comput. Oper. Res. doi: 10.1016/j.cor.2008.08.007 – volume: 4 start-page: 324 issue: 3 year: 1956 ident: 10.1016/j.cor.2024.106551_b25 article-title: The theory of search. I. Kinematic bases publication-title: Oper. Res. doi: 10.1287/opre.4.3.324 – year: 2007 ident: 10.1016/j.cor.2024.106551_b38 – volume: 292 start-page: 469 issue: 2 year: 2021 ident: 10.1016/j.cor.2024.106551_b9 article-title: Planning a multi-sensors search for a moving target considering traveling costs publication-title: European J. Oper. Res. doi: 10.1016/j.ejor.2020.11.012 |
| SSID | ssj0000721 |
| Score | 2.441988 |
| Snippet | This study focuses on investigating a multi-objective search allocation game problem, specifically addressing the distribution of a search budget (player 1)... |
| SourceID | hal crossref elsevier |
| SourceType | Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 106551 |
| SubjectTerms | Engineering Sciences Game theory Multiobjective optimization Search game ε-constraint |
| Title | Multi-objective search game: Long-term vs short-term |
| URI | https://dx.doi.org/10.1016/j.cor.2024.106551 https://ube.hal.science/hal-04700852 |
| Volume | 164 |
| WOSCitedRecordID | wos001174555100001&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: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fb9MwELZgQ2g88KNsYmOgCPFEFdQ4TmzvrdoPdVBVkxhS3yzHsVeqklZNqfbnc46dNB1iGg-8WK2bROl918vn6_k7hD5SyTMpMQ8NMcpmq_JQmoiHUkc8MzqX3OnMDuloxMZjfuW7OJZVOwFaFOz2li_-K9QwB2DbrbP_AHdzUZiA1wA6jAA7jA8CvtpSG86zqQtlXZ_XuJE_q23ow3lxE9p43F2X3XIC7Lt61yapdaeHsvKL-UIvfb2cVwZqMshneiZtq96JqxG2xXze2XweAbfLT6rkln8St-JPbOv6EieE-Vm7-MhoHNI0GW8FUKdD_kcwdnmBKdjSCq9iAjNp4uVlt4SvB_1v4ursQgwvR1-3P21VCw76QxgncgY3Ti1TxGtY9e5imnCIb7v9y_Pxl80zmFY77pqvUP-fXVX23bmfvzGSx5M6t15xjeuX6LlfJAR9B-4r9EgXHfS03qPQQS9qhAIfmjvoWUtY8jUid5wgcLgF1glOgsYFgnUZbFxgH32_OL8-HYS-P0ao4iRdhZpEiuJEcWk0MwwTaZSOMsOpZjmT1AoPYZamXMtU99I8ygkxPZbnWBuDJYkP0E4xL_QbFMAyVkkGZDRRwPGlYowZCfQmUbHMuMGHqFfbSCgvHm97mMxEXSU4FWBWYc0qnFkP0afmlIVTTrnvYFIbXnjq5yidAGe677QPAFJzeSuVDm4i7NzGSY4ectBbtLf5URyjndXyl36Hnqj16ke5fO_d6zf3NYA8 |
| linkProvider | Elsevier |
| 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=Multi-objective+search+game%3A+Long-term+vs+short-term&rft.jtitle=Computers+%26+operations+research&rft.au=Delavernhe%2C+Florian&rft.date=2024-04-01&rft.pub=Elsevier&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=164&rft_id=info:doi/10.1016%2Fj.cor.2024.106551&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=oai%3AHAL%3Ahal-04700852v1 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon |