{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T06:30:41Z","timestamp":1725949841996},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319462561"},{"type":"electronic","value":"9783319462578"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46257-8_5","type":"book-chapter","created":{"date-parts":[[2018,2,6]],"date-time":"2018-02-06T20:40:53Z","timestamp":1517949653000},"page":"37-45","source":"Crossref","is-referenced-by-count":2,"title":["Enhancing State Space Search for Planning by Monte-Carlo Random Walk Exploration"],"prefix":"10.1007","author":[{"given":"Qiang","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"You","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixin","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruoyun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ling","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,13]]},"reference":[{"key":"5_CR1","unstructured":"Adsit, C., Bradley, K., Heinrich, C.: Walksat: solving Boolean satisfiability via stochastic search (2014)"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Benton, J., Talamadupula, K., Eyerich, P., Mattm\u00fcller, R., Kambhampati, S.: G-value plateaus: a challenge for planning. In: Proceedings of International Conference on Automated Planning and Scheduling, pp. 259\u2013262 (2010)","DOI":"10.1609\/icaps.v20i1.13396"},{"issue":"11","key":"5_CR3","doi-asserted-by":"publisher","first-page":"2864","DOI":"10.1093\/comjnl\/bxu135","volume":"58","author":"S Cai","year":"2015","unstructured":"Cai, S., Luo, C., Su, K.: Improving walkSAT by effective tie-breaking and efficient implementation. Comput. J. 58(11), 2864\u20132875 (2015)","journal-title":"Comput. J."},{"key":"5_CR4","unstructured":"Chen, Y., Xu, Y., Yao, G.: Stratified planning. In: Proceedings of International Joint Conference on Artificial Intelligence (2009)"},{"key":"5_CR5","unstructured":"Chen, Y., Yao, G.: Completeness and optimality preserving reduction for planning. In: Proceedings of International Joint Conference on Artificial Intelligence (2009)"},{"key":"5_CR6","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1613\/jair.445","volume":"7","author":"JD Frank","year":"1997","unstructured":"Frank, J.D., Cheeseman, P., Stutz, J.: When gravity fails: local search topology. J. Artif. Intell. Res. 7, 249\u2013281 (1997)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Norwell (1997)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Hampson, S., Kibler, D.: Plateaus and plateau search in Boolean satisfiability problems: when to give up searching and start again. In: The 2nd DIMACS Implementation Challenge, pp. 437\u2013456 (1993)","DOI":"10.1090\/dimacs\/026\/21"},{"key":"5_CR9","unstructured":"Helmert, M., R\u00f6ger, G.: How good is almost perfect. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 944\u2013949 (2008)"},{"key":"5_CR10","unstructured":"Hoffmann, J.: Local search topology in planning benchmarks: a theoretical analysis. In: Proceedings of International Conference on AI Planning and Scheduling, pp. 92\u2013100 (2002)"},{"key":"5_CR11","volume-title":"Artificial Intelligence: A Systems Approach","author":"MT Jones","year":"2015","unstructured":"Jones, M.T.: Artificial Intelligence: A Systems Approach. Jones & Bartlett Learning, Massachusetts (2015)"},{"key":"5_CR12","unstructured":"Kautz, H., Selman, B.: Pushing the envelope: planning, propositional logic, and stochastic search. In: Proceedings of AAAI Conference on Artificial Intelligence (1996)"},{"key":"5_CR13","unstructured":"Nakhost, H., M\u00fcller, M.: Towards a second generation random walk planner: an experimental exploration. In: Proceedings of International Joint Conference on Artificial Intelligence (2013)"},{"key":"5_CR14","unstructured":"Phillips, M., Narayanan, V., Aine, S., Likhachev, M.: Efficient search with an ensemble of heuristics. In: Proceedings of International Joint Conference on Artificial Intelligence (2015)"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-319-05732-3_5","volume-title":"Landmarks","author":"KF Richter","year":"2014","unstructured":"Richter, K.F., Winter, S.: Computational aspects: how landmarks can be observed, stored, and analysed. Landmarks, pp. 137\u2013173. Springer, Heidelberg (2014)"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Richter, S., Helmert, M.: Preferred operators and deferred evaluation in satisficing planning. In: Proc. International Conference on Automated Planning and Scheduling (2009)","DOI":"10.1609\/icaps.v19i1.13345"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Shleyfman, A., Katz, M., Helmert, M., Sievers, S., Wehrle, M.: Heuristics and symmetries in classical planning. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 3371\u20133377 (2015)","DOI":"10.1609\/aaai.v29i1.9649"},{"key":"5_CR18","unstructured":"The Sixth International Planning Competition (2008). http:\/\/ipc.informatik.uni-freiburg.de\/"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Xie, F., M\u00fcller, M., Holte, R.: Adding local exploration to greedy best-first search in satisficing planning. In: Proceedings of AAAI Conference on Artificial Intelligence, pp. 2388\u20132394 (2014)","DOI":"10.1609\/aaai.v28i1.9035"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46257-8_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T21:50:37Z","timestamp":1693518637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-46257-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319462561","9783319462578"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46257-8_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}