{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T22:40:01Z","timestamp":1745102401250,"version":"3.40.4"},"publisher-location":"London","reference-count":7,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781447147381"},{"type":"electronic","value":"9781447147398"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-1-4471-4739-8_18","type":"book-chapter","created":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T07:27:13Z","timestamp":1351582033000},"page":"219-224","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Controlling Anytime Scheduling of Observation Tasks"],"prefix":"10.1007","author":[{"given":"J W","family":"Baxter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J","family":"Hargreaves","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N","family":"Hawes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R","family":"Stolkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,9]]},"reference":[{"unstructured":"de Arago, M.P., Viana, H., Uchoa, E.: The team orienteering problem: Formulations and branchcut and price. In: T. Erlebach, M.E. Lbbecke (eds.) ATMOS, OASICS, vol. 14, pp. 142\u2013155.Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany (2010). URL http:\/\/dblp.unitrier.de\/db\/conf\/atmos\/atmos2010.html","key":"18_CR1"},{"doi-asserted-by":"crossref","unstructured":"Boussier, S., Feillet, D., Gendreau, M.: An exact algorithm for team orienteering problems. 4OR: A Quarterly Journal of Operations Research 5, 211\u2013230 (2007).URL http:\/\/dx.doi.org\/10.1007\/s10288-006-0009-1. 10.1007\/s10288-006-0009-1","key":"18_CR2","DOI":"10.1007\/s10288-006-0009-1"},{"key":"18_CR3","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2096","volume":"28","author":"E.A. Hansen","year":"2007","unstructured":"Hansen, E.A., Zhou, R.: Anytime heuristic search. Journal of Artificial Intelligence Research (JAIR 28, 267\u2013297 (2007)","journal-title":"Journal of Artificial Intelligence Research (JAIR"},{"key":"18_CR4","first-page":"139","volume":"126","author":"EA Hansen","year":"2001","unstructured":"Hansen, E.A., Zilberstein, S.: Monitoring and control of anytime algorithms: A dynamic programming approach. ArtificialIntelligence 126, 139\u2013157 (2001)","journal-title":"ArtificialIntelligence"},{"key":"18_CR5","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2474.001.0001","volume-title":"Do the right thing","author":"S Russell","year":"1991","unstructured":"Russell, S.,Wefald, E.: Do the right thing. In: Studies in Limited Rationality. MIT Press (1991)"},{"doi-asserted-by":"crossref","unstructured":"Shi, X., Wang, L., Zhou, Y., Liang, Y.: An ant colony optimization method for prize-collecting traveling salesman problem with time windows. In: Proceedings of the 2008 Fourth InternationalConference on Natural Computation - Volume 07, ICNC \u201908, pp. 480\u2013484. IEEEComputer Society, Washington, DC, USA (2008). DOI 10.1109\/ICNC.2008.470. URLhttp:\/\/dx.doi.org\/10.1109\/ICNC.2008.470","key":"18_CR6","DOI":"10.1109\/ICNC.2008.470"},{"unstructured":"Thayer, J.T., Ruml,W.: Faster than weighted a*: An optimistic approach to bounded suboptimalsearch. In: proceedings of the international conference on planning and scheduling (2008)","key":"18_CR7"}],"container-title":["Research and Development in Intelligent Systems XXIX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4471-4739-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,19]],"date-time":"2025-04-19T22:19:44Z","timestamp":1745101184000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-1-4471-4739-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9781447147381","9781447147398"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-1-4471-4739-8_18","relation":{},"subject":[],"published":{"date-parts":[[2012]]},"assertion":[{"value":"9 October 2012","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}