{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T04:26:25Z","timestamp":1744259185739,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642335570"},{"type":"electronic","value":"9783642335587"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33558-7_70","type":"book-chapter","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T02:32:47Z","timestamp":1349231567000},"page":"988-1003","source":"Crossref","is-referenced-by-count":5,"title":["Constraint Programming for Path Planning with Uncertainty"],"prefix":"10.1007","author":[{"given":"Michael","family":"Morin","sequence":"first","affiliation":[]},{"given":"Anika-Pascale","family":"Papillon","sequence":"additional","affiliation":[]},{"given":"Ir\u00e8ne","family":"Abi-Zeid","sequence":"additional","affiliation":[]},{"given":"Fran\u00e7ois","family":"Laviolette","sequence":"additional","affiliation":[]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"70_CR1","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1287\/opre.34.2.324","volume":"34","author":"K. Trummel","year":"1986","unstructured":"Trummel, K., Weisinger, J.: The complexity of the optimal searcher path problem. Operations Research\u00a034(2), 324\u2013327 (1986)","journal-title":"Operations Research"},{"key":"70_CR2","volume-title":"Theory of Optimal Search","author":"L. Stone","year":"2004","unstructured":"Stone, L.: Theory of Optimal Search. Academic Press, New York (2004)"},{"key":"70_CR3","doi-asserted-by":"crossref","unstructured":"Kranakis, E., Krizanc, D., Rajsbaum, S.: Computing with mobile agents in distributed networks. In: Rajasedaran, S., Reif, J. (eds.) Handbook of Parallel Computing: Models, Algorithms, and Applications, pp. 1\u201326. CRC Press (2007)","DOI":"10.1201\/9781420011296.ch8"},{"key":"70_CR4","doi-asserted-by":"crossref","unstructured":"Chandramouli, R.: Web search steganalysis: Some challenges and approaches. In: Proceedings of IEEE International Symposium on Circuits and Systems, pp. 576\u2013579 (2004)","DOI":"10.1109\/ISCAS.2004.1329728"},{"key":"70_CR5","doi-asserted-by":"crossref","unstructured":"Verkama, M.: Optimal paging - a search theory approach. In: Proceedings of the International Conference on Universal Personal Communications, pp. 956\u2013960 (1996)","DOI":"10.1109\/ICUPC.1996.562719"},{"key":"70_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0305-0548(79)90025-X","volume":"6","author":"T. Stewart","year":"1979","unstructured":"Stewart, T.: Search for a moving target when the searcher motion is restricted. Computers and Operations Research\u00a06, 129\u2013140 (1979)","journal-title":"Computers and Operations Research"},{"issue":"5","key":"70_CR7","doi-asserted-by":"publisher","first-page":"1107","DOI":"10.1287\/opre.32.5.1107","volume":"32","author":"J. Eagle","year":"1984","unstructured":"Eagle, J.: The optimal search for a moving target when the search path is constrained. Operations Research\u00a032(5), 1107\u20131115 (1984)","journal-title":"Operations Research"},{"issue":"1","key":"70_CR8","first-page":"110","volume":"38","author":"J. Eagle","year":"1990","unstructured":"Eagle, J., Yee, J.: An optimal branch-and-bound procedure for the constrained path, moving target search problem. Naval Research Logistics\u00a038(1), 110\u2013114 (1990)","journal-title":"Naval Research Logistics"},{"key":"70_CR9","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1002\/(SICI)1520-6750(199804)45:3<243::AID-NAV1>3.0.CO;2-7","volume":"45","author":"A. Washburn","year":"1998","unstructured":"Washburn, A.: Branch and bound methods for a search problem. Naval Research Logistics\u00a045, 243\u2013257 (1998)","journal-title":"Naval Research Logistics"},{"issue":"2","key":"70_CR10","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.ejor.2007.06.043","volume":"190","author":"H. Lau","year":"2008","unstructured":"Lau, H., Huang, S., Dissanayake, G.: Discounted mean bound for the optimal searcher path problem with non-uniform travel times. European Journal of Operational Research\u00a0190(2), 383\u2013397 (2008)","journal-title":"European Journal of Operational Research"},{"key":"70_CR11","unstructured":"Martins, G.: A new branch-and-bound procedure for computing optimal search paths. Tech. rep., Naval Postgraduate School (1993)"},{"issue":"1","key":"70_CR12","first-page":"15","volume":"49","author":"I. Abi-Zeid","year":"2011","unstructured":"Abi-Zeid, I., Nilo, O., Lamontagne, L.: Resource allocation algorithms for planning search and rescue operations. INFOR\u00a049(1), 15\u201330 (2011)","journal-title":"INFOR"},{"key":"70_CR13","doi-asserted-by":"crossref","unstructured":"Brown, K.M., Miguel, I.: Uncertainty and change. In: Rossi, F., Beek, P.V., Walsh, T. (eds.) Handbook of Constraint Programming, pp. 44\u201358. Springer (2006)","DOI":"10.1016\/S1574-6526(06)80025-8"},{"issue":"1","key":"70_CR14","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s10601-006-6849-7","volume":"11","author":"S. Tarim","year":"2006","unstructured":"Tarim, S., Manandhar, S., Walsh, T.: Stochastic constraint programming: A scenario-based approach. Constraints\u00a011(1), 53\u201380 (2006)","journal-title":"Constraints"},{"issue":"6","key":"70_CR15","doi-asserted-by":"publisher","first-page":"1275","DOI":"10.1287\/opre.28.6.1275","volume":"28","author":"S. Brown","year":"1980","unstructured":"Brown, S.: Optimal search for a moving target in discrete time and space. Operations Research\u00a028(6), 1275\u20131289 (1980)","journal-title":"Operations Research"},{"key":"70_CR16","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s10601-005-2239-9","volume":"10","author":"G. Verfaillie","year":"2005","unstructured":"Verfaillie, G., Jussien, N.: Constraint solving in uncertain and dynamic environments: A survey. Constraints\u00a010, 253\u2013281 (2005)","journal-title":"Constraints"},{"issue":"2-3","key":"70_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/0012-365X(83)90160-7","volume":"43","author":"R. Nowakowski","year":"1983","unstructured":"Nowakowski, R., Winkler, P.: Vertex-to-vertex pursuit in a graph. Discrete Mathematics\u00a043(2-3), 235\u2013239 (1983)","journal-title":"Discrete Mathematics"},{"key":"70_CR18","unstructured":"Laburthe, F., Jussien, N.: Choco Solver Documentation (2012), http:\/\/www.emn.fr\/z-info\/choco-solver\/"},{"key":"70_CR19","unstructured":"O\u2019Madadhain, J., Fisher, D., Nelson, T., White, S., Boey, Y.: Jung: Java universal network\/graph framework (2010), http:\/\/jung.sourceforge.net"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33558-7_70","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T22:14:00Z","timestamp":1744236840000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33558-7_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642335570","9783642335587"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33558-7_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}