{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T10:01:53Z","timestamp":1760608913519,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T00:00:00Z","timestamp":1457308800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100002956","name":"Defence Research and Development Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002956","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10479-016-2145-0","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T02:55:44Z","timestamp":1457319344000},"page":"295-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Static target search path planning optimization with heterogeneous agents"],"prefix":"10.1007","volume":"244","author":[{"given":"Jean","family":"Berger","sequence":"first","affiliation":[]},{"given":"Nassirou","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Mohamed","family":"Barkaoui","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,7]]},"reference":[{"issue":"1 \/ 2","key":"2145_CR1","first-page":"15","volume":"49","author":"I Abi-Zeid","year":"2011","unstructured":"Abi-Zeid, I., Nilo, O., & Lamontagne, L. (2011). Constraint optimization approach for the allocation of multiple search units in search and rescue operations. INFOR: Information Systems and Operational Research, 49(1 \/ 2), 15\u201330.","journal-title":"INFOR: Information Systems and Operational Research"},{"key":"2145_CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E","volume":"38","author":"S Benkoski","year":"1991","unstructured":"Benkoski, S., Monticino, M., & Weisinger, J. (1991). A survey of the search theory literature. Naval Research Logistics, 38, 469\u2013494.","journal-title":"Naval Research Logistics"},{"key":"2145_CR3","doi-asserted-by":"crossref","unstructured":"Choo, C., Smith, J., & Nasrabadi, N. (1991). An efficient terrain acquisition algorithm for a mobile robot, In Proceedings of the IEEE international conference robotics and automation, Sacramento, CA (pp. 306\u2013311).","DOI":"10.1109\/ROBOT.1991.131593"},{"issue":"10","key":"2145_CR4","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1109\/TRO.2011.2170333","volume":"28","author":"TH Chung","year":"2012","unstructured":"Chung, T. H., & Burdick, J. (2012). Analysis of search decision making using probabilistic search strategies. IEEE Transactions on Robotics, 28(10), 132\u2013144.","journal-title":"IEEE Transactions on Robotics"},{"issue":"4","key":"2145_CR5","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"T Chung","year":"2011","unstructured":"Chung, T., Hollinger, G., & Isler, V. (2011). Search and pursuit-evasion in mobile robotics: A survey. Autonomous Robots (AURO), 31(4), 299\u2013316.","journal-title":"Autonomous Robots (AURO)"},{"issue":"1","key":"2145_CR6","first-page":"175","volume":"41","author":"R Hohzaki","year":"1995","unstructured":"Hohzaki, R., & Iida, K. (1995). Optimal search plan for a moving target when a search path is given. Mathematica Japonica, 41(1), 175\u2013184.","journal-title":"Mathematica Japonica"},{"key":"2145_CR7","unstructured":"Hollinger, G.A. (2010). Search in the Physical World. CMU-RI-TR-10-20, Robotics Institute, PhD thesis, Carnegie Mellon University."},{"issue":"1","key":"2145_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10514-010-9189-9","volume":"29","author":"GA Hollinger","year":"2010","unstructured":"Hollinger, G. A., & Singh, S. (2010). GSST: Anytime guaranteed search with spanning trees. Autonomous Robots, 29(1), 99\u2013118.","journal-title":"Autonomous Robots"},{"key":"2145_CR9","unstructured":"IBM, ILOG CPLEX (2009). Optimizer, Available: http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimization-studio\/cplex-optimizer\/cplex-performance\/ and IBM ILOG CPLEX V12.1. ftp:\/\/public.dhe.ibm.com\/software\/websphere\/ilog\/docs\/optimization\/cplex\/ps_usrmancplex.pdf"},{"issue":"3","key":"2145_CR10","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TSMCB.2005.861881","volume":"36","author":"Y Jin","year":"2006","unstructured":"Jin, Y., Liao, Y., Minai, A., & Polycarpou, M. (2006). Balancing search and target response in cooperative unmanned aerial vehicle (UAV) Teams. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions, 36(3), 571\u2013587.","journal-title":"Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions"},{"key":"2145_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot motion planning, ser. International series in engineering and computer science; Robotics: vision, manipulation and sensors","author":"J-C Latombe","year":"1991","unstructured":"Latombe, J.-C. (1991). Robot motion planning, ser. International series in engineering and computer science; Robotics: vision, manipulation and sensors (Vol. 124). Boston: Kluwer Academic Publishers."},{"key":"2145_CR12","unstructured":"Lau, H. (2007). Optimal search in structured environments, PhD Thesis, University of Technology, Sydney."},{"key":"2145_CR13","unstructured":"Lau, H., & Dissanayake, G. (2005). Optimal search for multiple targets in a built environment, In Proceedings of the IEEE\/RSJ international conference intelligent robots and systems, Edmonton, Alberta, Canada (pp. 228\u2013233)."},{"key":"2145_CR14","unstructured":"Lau, H., & Dissanayake, G. (2006). Probabilistic search for a moving target in an indoor environment, In Proceedings of the IEEE\/RSJ international conference intelligent robots and systems (pp. 3393\u20133398)."},{"key":"2145_CR15","doi-asserted-by":"crossref","unstructured":"Lo, N., Berger, J., & Noel, M. (July 2012). Toward Optimizing Static Target Search Path Planning, In Proceedings of the 5th IEEE symposium on computational intelligence for security and defence applications, Ottawa, Canada.","DOI":"10.1109\/CISDA.2012.6291538"},{"key":"2145_CR16","unstructured":"Morin, M., et al. (2009). The optimal searcher path problem with a visibility criterion in discrete time and space. In International conference on information fusion, Seatle, USA."},{"key":"2145_CR17","doi-asserted-by":"crossref","unstructured":"Morin, M., Papillon, A.P., Laviolette, F., Abi-Zeid, I., & Quimper, C.G. (2012). Constraint Programming for Path Planning with Uncertainty: Solving the Optimal Search Path problem, In Proceedings of the 18th conference on principles and practice of constraint programming, Qu\u00e9bec, Qc, Canada (pp. 988\u20131003).","DOI":"10.1007\/978-3-642-33558-7_70"},{"key":"2145_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10472-009-9120-2","volume":"52","author":"I Rekleitis","year":"2008","unstructured":"Rekleitis, I., et al. (2008). Efficient boustrophedon multi-robot coverage: An algorithmic approach. Annals of Mathematics and Artificial Intelligence, 52, 109\u2013142.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"8","key":"2145_CR19","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1002\/nav.20432","volume":"57","author":"JO Royset","year":"2010","unstructured":"Royset, J. O., & Sato, H. (2010). Route Optimization for Multiple Searchers. Naval Research Logistics, 57(8), 701\u2013717.","journal-title":"Naval Research Logistics"},{"key":"2145_CR20","unstructured":"Sankaranarayanan, A., & Masuda, I. (1992). Sensor based terrain acquisition: A new, hierarchical algorithm and a basic theory, In Proceedings of the IEEE\/RSJ international conference intelligent robots and systems, Raleigh (pp. 1515\u20131523)."},{"key":"2145_CR21","unstructured":"Stone, L. D. (2007). Theory of optimal search, 2nd ed., Topics in Operations Research Series., INFORMS."},{"issue":"3","key":"2145_CR22","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1023\/B:AURO.0000025793.46961.f6","volume":"16","author":"J Svennebring","year":"2004","unstructured":"Svennebring, J., & Koenig, S. (2004). Building terrain-covering ant robots: A feasibility study. Autonomous Robots, 16(3), 313\u2013332.","journal-title":"Autonomous Robots"},{"issue":"2","key":"2145_CR23","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1287\/opre.34.2.324","volume":"34","author":"KE Trummel","year":"1986","unstructured":"Trummel, K. E., & Weisinger, J. R. (1986). The complexity of the optimal searcher path problem. Operations Research, 34(2), 324\u2013327.","journal-title":"Operations Research"},{"issue":"5","key":"2145_CR24","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1109\/70.795795","volume":"15","author":"W Wagner","year":"1999","unstructured":"Wagner, W., et al. (1999). Distributed covering by ant-robots using evaporating traces. Robotics and Automation, IEEE Transactions, 15(5), 918\u2013933.","journal-title":"Robotics and Automation, IEEE Transactions"},{"key":"2145_CR25","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7","volume":"45","author":"AR Washburn","year":"1998","unstructured":"Washburn, A. R. (1998). Branch and bound methods for a search problem. Naval Research Logistics, 45, 243\u2013257.","journal-title":"Naval Research Logistics"},{"key":"2145_CR26","unstructured":"Wong, S., & MacDonald, B. (2003). A topological coverage algorithm for mobile robots, In Proceedings of the IEEE\/RSJ international conference intelligent robots and systems, Las Vegas (pp. 1685\u20131690)."},{"issue":"1","key":"2145_CR27","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1109\/TSMCB.2003.811769","volume":"34","author":"S Yang","year":"2004","unstructured":"Yang, S., & Luo, C. (2004). A neural network approach to complete coverage path planning. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions, 34(1), 718\u2013724.","journal-title":"Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Transactions"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2145-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2145-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2145-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2145-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T04:17:18Z","timestamp":1692245838000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2145-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,7]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["2145"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2145-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2016,3,7]]}}}