{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:49:39Z","timestamp":1742982579323,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319026206"},{"type":"electronic","value":"9783319026213"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-319-02621-3_10","type":"book-chapter","created":{"date-parts":[[2013,11,6]],"date-time":"2013-11-06T15:53:57Z","timestamp":1383753237000},"page":"139-155","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Anytime Contract Search"],"prefix":"10.1007","author":[{"given":"Sunandita","family":"Patra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satya Gautam","family":"Vadlamudi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha Pratim","family":"Chakrabarti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,7]]},"reference":[{"unstructured":"Aine, S., Chakrabarti, P.P., Kumar, R.: AWA* - A window constrained anytime heuristic search algorithm. In: M.M. Veloso (ed.) IJCAI, pp. 2250\u20132255 (2007).","key":"10_CR1"},{"unstructured":"Aine, S., Chakrabarti, P.P., Kumar, R.: Contract search: Heuristic search under node expansion constraints. In: ECAI, pp. 733\u2013738 (2010).","key":"10_CR2"},{"issue":"4","key":"10_CR3","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1111\/j.1467-8640.2010.00364.x","volume":"26","author":"S. Aine","year":"2010","unstructured":"Aine, S., Chakrabarti, P.P., Kumar, R.: Heuristic search under contract. Computational Intelligence 26(4), 386\u2013419 (2010).","journal-title":"Computational Intelligence"},{"unstructured":"Dean, T., Boddy, M.: An analysis of time-dependent planning. In: Proceedings of 6th National Conference on Artificial Intelligence (AAAI 88), pp. 49\u201354. AAAI Press, St. Paul, MN (1988).","key":"10_CR4"},{"unstructured":"Dionne, A.J., Thayer, J.T., Ruml, W.: Deadline-aware search using on-line measures of behavior. In: SOCS (2011).","key":"10_CR5"},{"issue":"2","key":"10_CR6","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100\u2013107 (1968).","journal-title":"IEEE Transactions on Systems Science and Cybernetics"},{"doi-asserted-by":"crossref","unstructured":"Hiraishi, H., Ohwada, H., Mizoguchi, F.: Time-constrained heuristic search for practical route finding. In: H.Y. Lee, H. Motoda (eds.) PRICAI98: Topics in Artificial Intelligence,Lecture Notes in Computer Science, vol. 1531, pp. 389\u2013398. Springer, Berlin Heidelberg (1998).","key":"10_CR7","DOI":"10.1007\/BFb0095286"},{"issue":"1\u20132","key":"10_CR8","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/S0004-3702(01)00092-3","volume":"134","author":"R.E. Korf","year":"2002","unstructured":"Korf, R.E., Felner, A.: Disjoint pattern database heuristics. Artif. Intell. 134(1\u20132), 9\u201322 (2002).","journal-title":"Artif. Intell."},{"issue":"4","key":"10_CR9","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E.L. Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: A survey. Operational Research 14(4), 699\u2013719 (1966).","journal-title":"Operational Research"},{"unstructured":"Likhachev, M., Gordon, G.J., Thrun, S.: ARA*: Anytime A* with provable bounds on sub-optimality. In: Advances in Neural Information Processing Systems 16. MIT Press, Cambridge, MA (2004).","key":"10_CR10"},{"doi-asserted-by":"crossref","unstructured":"Lowerre, B.: The Harpy Speech Recognition System. PhD thesis, Carnegie Mellon University (1976).","key":"10_CR11","DOI":"10.1121\/1.2003013"},{"doi-asserted-by":"crossref","unstructured":"Norvig, P.: Paradigms of Artificial Intelligence Programming: Case Studies in Common Lisp, 1st edn. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1992).","key":"10_CR12","DOI":"10.1016\/B978-0-08-057115-7.50024-8"},{"key":"10_CR13","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB - A traveling salesman problem library. ORSA Journal on Computing 3, 376\u2013384 (1991).","journal-title":"ORSA Journal on Computing"},{"unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach, 2 edn. Pearson, Education (2003).","key":"10_CR14"},{"unstructured":"Sturtevant, N.R., Felner, A., Likhachev, M., Ruml, W.: Heuristic search comes of age. In: AAAI (2012).","key":"10_CR15"},{"doi-asserted-by":"crossref","unstructured":"van den Berg, J., Shah, R., Huang, A., Goldberg, K.Y.: Anytime nonparametric A*. In: AAAI (2011).","key":"10_CR16","DOI":"10.1609\/aaai.v25i1.7819"},{"unstructured":"Zhou, R., Hansen, E.A.: Beam-stack search: Integrating backtracking with beam search. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling (ICAPS-05), pp. 90\u201398. Monterey, CA (2005).","key":"10_CR17"}],"container-title":["Research and Development in Intelligent Systems XXX"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-02621-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,9]],"date-time":"2023-02-09T20:23:00Z","timestamp":1675974180000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-02621-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319026206","9783319026213"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-02621-3_10","relation":{},"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"7 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}