{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:40:38Z","timestamp":1757544038565,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1109\/cisda.2012.6291538","type":"proceedings-article","created":{"date-parts":[[2012,9,7]],"date-time":"2012-09-07T15:58:22Z","timestamp":1347033502000},"page":"1-7","source":"Crossref","is-referenced-by-count":15,"title":["Toward optimizing static target search path planning"],"prefix":"10.1109","author":[{"given":"Nassirou","family":"Lo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean","family":"Berger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Noel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.3138\/infor.49.1.015"},{"journal-title":"IBM ILOG CPLEX Optimizer","year":"0","key":"22"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2005.861881"},{"journal-title":"IBM ILOG CPLEX V12 1","year":"2009","key":"23"},{"journal-title":"Search in the Physical World","year":"2010","author":"hollinger","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1002\/nav.20432"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2011.2170333"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-009-9120-2"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/70.795795"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2003.1248886"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCB.2003.811769"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2003.10.029"},{"key":"3","first-page":"175","article-title":"Optimal search plan for a moving target when a search path is given","volume":"41","author":"hohzaki","year":"1995","journal-title":"Math Japonica"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/ICIF.2010.5712112"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.37.3.501"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1023\/B:AURO.0000025793.46961.f6"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2005.1544986"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2006.282575"},{"journal-title":"Optimal Search in Structured Environments","year":"2007","author":"lau","key":"4"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.1992.594215"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1991.131593"}],"event":{"name":"2012 IEEE Symposium on Computational Intelligence for Security and Defense Applications (CISDA)","start":{"date-parts":[[2012,7,11]]},"location":"Ottawa, ON, Canada","end":{"date-parts":[[2012,7,13]]}},"container-title":["2012 IEEE Symposium on Computational Intelligence for Security and Defence Applications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6279634\/6291498\/06291538.pdf?arnumber=6291538","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T19:59:55Z","timestamp":1490126395000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6291538\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/cisda.2012.6291538","relation":{},"subject":[],"published":{"date-parts":[[2012,7]]}}}