{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T13:59:51Z","timestamp":1756994391098},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2015,3,31]],"date-time":"2015-03-31T00:00:00Z","timestamp":1427760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s11590-015-0874-7","type":"journal-article","created":{"date-parts":[[2015,3,30]],"date-time":"2015-03-30T06:51:49Z","timestamp":1427698309000},"page":"1585-1607","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An information theoretic based integer linear programming approach for the discrete search path planning problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Jean","family":"Berger","sequence":"first","affiliation":[]},{"given":"Nassirou","family":"Lo","sequence":"additional","affiliation":[]},{"given":"Abdeslem","family":"Boukhtouta","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Noel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,31]]},"reference":[{"key":"874_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/s10472-009-9121-1","volume":"52","author":"N Agmon","year":"2008","unstructured":"Agmon, N., et al.: The giving tree: constructing trees for efficient offline and online multi-robot coverage. Ann. Math. Artif. Intell. 52, 109\u2013142 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"874_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.: A survey of the search theory literature. Naval Res. Logist. 38, 469\u2013494 (1991)","journal-title":"Naval Res. Logist."},{"key":"874_CR3","doi-asserted-by":"crossref","unstructured":"Chung, T.: On probabilistic search decisions under searcher motion constraints. In: Workshop on Algorithmic Foundation of Robotics VIII, Guanajuato, Mexico, pp. 501\u2013516 (2009)","DOI":"10.1007\/978-3-642-00312-7_31"},{"key":"874_CR4","doi-asserted-by":"crossref","unstructured":"Choo, C., Smith, J., Nasrabadi, N.: An efficient terrain acquisition algorithm for a mobile robot. In: Proceedings of IEEE International Conference on Robotics and Automation, Sacramento, CA, pp. 306\u2013311 (1991)","DOI":"10.1109\/ROBOT.1991.131593"},{"key":"874_CR5","volume-title":"Elements of Information Theory","author":"T Cover","year":"2006","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory, 2nd edn. Wiley, New York (2006)","edition":"2"},{"key":"874_CR6","doi-asserted-by":"crossref","unstructured":"Finn, A., et al.: Design challenges for an autonomous cooperative of UAVs. In: Proceedings of the International Conference on Information, Decision and Control, pp. 160\u2013169 (2007)","DOI":"10.1109\/IDC.2007.374543"},{"key":"874_CR7","doi-asserted-by":"crossref","unstructured":"Flint, F.E., Fernandez-Gaucherand, E., Polycarpou, M.: Efficient Bayesian methods for updating and storing uncertain search information for UAV\u2019s. In: Proceedings of 43rd IEEE Conference on Decision and Control, pp. 1093\u20131098 (2004)","DOI":"10.1109\/CDC.2004.1428838"},{"issue":"1","key":"874_CR8","first-page":"175","volume":"41","author":"R Hohzaki","year":"1995","unstructured":"Hohzaki, R., Iida, K.: Optimal search plan for a moving target when a search path is given. Math. Jpn. 41(1), 175\u2013184 (1995)","journal-title":"Math. Jpn."},{"key":"874_CR9","unstructured":"Hollinger, G.A.: Search in the physical world. CMU-RI-TR-10-20, Robotics Institute. Ph.D. thesis, Carnegie Mellon University (2010)"},{"issue":"1","key":"874_CR10","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.: GSST: anytime guaranteed search with spanning trees. Auton. Robots 29(1), 99\u2013118 (2010)","journal-title":"Auton. Robots"},{"key":"874_CR11","unstructured":"IBM ILOG CPLEX Optimization Studio Academic Research Edition Fix Pack 12.2.0.2. http:\/\/www-01.ibm.com\/support\/docview.wss?uid=swg24028951"},{"issue":"3","key":"874_CR12","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.: Balancing search and target response in cooperative unmanned aerial vehicle (UAV) teams. IEEE Trans. Syst. Man Cybern. Part B 36(3), 571\u2013587 (2006)","journal-title":"IEEE Trans. Syst. Man Cybern. Part B"},{"key":"874_CR13","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.: Robot Motion Planning, ser. International Series in Engineering and Computer Science; Robotics: Vision, Manipulation and Sensors, vol. 124. Kluwer Academic Publishers, Boston (1991)"},{"key":"874_CR14","unstructured":"Lau, H.: Optimal search in structured environments. Ph.D. thesis, University of Technology, Sydney (2007)"},{"key":"874_CR15","doi-asserted-by":"crossref","unstructured":"Lau, H., Dissanayake, G.: Probabilistic search for a moving target in an indoor environment. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, pp. 3393\u20133398 (2006)","DOI":"10.1109\/IROS.2006.282575"},{"key":"874_CR16","doi-asserted-by":"crossref","unstructured":"Lau, H., Dissanayake, G.: Optimal search for multiple targets in a built environment. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, Edmonton, Alberta, Canada, pp. 228\u2013233 (2005)","DOI":"10.1109\/IROS.2005.1544986"},{"key":"874_CR17","unstructured":"Martins, G.: A new branch-and-bound procedure for computing optimal search paths. Master\u2019s thesis. Naval Postgraduate School (1993)"},{"key":"874_CR18","doi-asserted-by":"crossref","unstructured":"Mathews, G., Durrant-Whyte, H.: Scalable decentralised control for multi-platform reconnaissance and information gathering tasks. In: 9th International Conference on Information Fusion, pp. 1\u20138 (2006)","DOI":"10.1109\/ICIF.2006.301807"},{"key":"874_CR19","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.: Efficient Boustrophedon multi-robot coverage: an algorithmic approach. Ann. Math. Artif. Intell. 52, 109\u2013142 (2008)","journal-title":"Ann. Math. Artif. Intell."},{"key":"874_CR20","doi-asserted-by":"crossref","unstructured":"Sankaranarayanan, A., Masuda, I.: Sensor based terrain acquisition: a new, hierarchical algorithm and a basic theory. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, Raleigh, pp. 1515\u20131523 (1992)","DOI":"10.1109\/IROS.1992.594215"},{"issue":"3","key":"874_CR21","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.: Building terrain-covering ant robots: a feasibility study. Auton. Robots 16(3), 313\u2013332 (2004)","journal-title":"Auton. Robots"},{"issue":"3","key":"874_CR22","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.37.3.501","volume":"37","author":"L Stone","year":"1989","unstructured":"Stone, L.: What\u2019s happened in search theory since the 1975 Lanchester prize? Oper. Res. 37(3), 501\u2013506 (1989)","journal-title":"Oper. Res."},{"key":"874_CR23","doi-asserted-by":"crossref","unstructured":"Vincent, P., Rubin, I.: A framework and analysis for cooperative search using UAV swarms. In: ACM Symposium on Applied Computing, pp. 79\u201386 (2004)","DOI":"10.1145\/967900.967919"},{"issue":"5","key":"874_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.: Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robot. Autom. 15(5), 918\u2013933 (1999)","journal-title":"IEEE Trans. Robot. Autom."},{"key":"874_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.: Branch and bound methods for a search problem. Naval Res. Logist. 45, 243\u2013257 (1998)","journal-title":"Naval Res. Logist."},{"key":"874_CR26","doi-asserted-by":"crossref","unstructured":"Wong, S., MacDonald, B.: A topological coverage algorithm for mobile robots. In: Proceedings of IEEE\/RSJ International Conference on Intelligent Robots and Systems, Las Vegas, pp. 1685\u20131690 (2003)","DOI":"10.1109\/IROS.2003.1248886"},{"issue":"1","key":"874_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., Neural, A.: Network approach to complete coverage path planning. IEEE Trans. Syst. Man Cybern. B Cybern. 34(1), 718\u2013724 (2004)","journal-title":"IEEE Trans. Syst. Man Cybern. B Cybern."},{"key":"874_CR28","doi-asserted-by":"crossref","unstructured":"Yang, Y., Minai, A., Polycarpou, M.: Evidential map building approaches for multi-UAV cooperative search. In: Proceedings of the American Control Conference, pp. 116\u2013121 (2005)","DOI":"10.1109\/ACC.2005.1469918"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0874-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0874-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0874-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T02:24:42Z","timestamp":1691547882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0874-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,31]]},"references-count":28,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["874"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0874-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,31]]}}}