{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T20:11:35Z","timestamp":1790799095473,"version":"4.1.0"},"reference-count":33,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1109\/cig.2014.6932882","type":"proceedings-article","created":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T04:42:48Z","timestamp":1414816968000},"page":"1-8","source":"Crossref","is-referenced-by-count":28,"title":["Solving Physical Traveling Salesman Problems with policy adaptation"],"prefix":"10.1109","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christoph","family":"Greulich","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/2578043"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77615"},{"key":"33","article-title":"Multi-goal motion planning with physicsbased game engines","author":"edelkamp","year":"2014","journal-title":"Proceedings of the Corerence on Computational Lntelligence and Games (cig)"},{"key":"15","author":"ehrgott","year":"2005","journal-title":"Multicriteria Optimization"},{"key":"16","author":"cormen","year":"1990","journal-title":"Introduction to Algorithms"},{"key":"13","first-page":"930","article-title":"Depth-first branch-and-bound versus local search: A case study","author":"zhang","year":"1999","journal-title":"Proceedings of the National Conference on Artificial Intelligence"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"11","author":"love","year":"2006","journal-title":"General game playing Game description language specification"},{"key":"12","first-page":"160","article-title":"Truncated branch-and-bound: A case study on the asymmetric TSP","author":"zhang","year":"1993","journal-title":"Aaai-93 Spring Symposium on al and NP-hard Problems"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0255(93)90133-7"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6377(86)90073-8"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0255(96)00084-9"},{"key":"23","first-page":"68","article-title":"A new efficient transformation of the generalized traveling salesman problem into traveling salesman problem","author":"behzad","year":"2002","journal-title":"IEEE International Conference on Systems Engineering"},{"key":"24","author":"dorigo","year":"1996","journal-title":"Ant Colonies for the Traveling Salesman Problem"},{"key":"25","first-page":"456","article-title":"Nested monte-carlo search","author":"cazenave","year":"2009","journal-title":"I Jcai"},{"key":"26","first-page":"649","article-title":"Nested rollout policy adaptation for monte carlo tree search","author":"rosin","year":"2011","journal-title":"IJCAI"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.14.4.403.2827"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34413-8_4"},{"key":"29","article-title":"Algorithm and knowledge engineering for the TSPTW problem","author":"edeikamp","year":"2013","journal-title":"IEEE Symposium Series on Computational Intelligence (SSCI)"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v27i1.8544","article-title":"Robot motion planning with dynamics as hybrid search","author":"plaku","year":"2013","journal-title":"AAAI"},{"key":"2","first-page":"369","author":"johnson","year":"2002","journal-title":"Experimental Analysis of Heuristics for the STSP"},{"key":"10","first-page":"1134","article-title":"Simulation-based approach to general game playing","author":"finnsson","year":"2008","journal-title":"AAAl"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2012.6256440"},{"key":"30","first-page":"776","article-title":"Geometric speed-up techniques for finding shortest paths in large sparse graphs","author":"wagner","year":"2003","journal-title":"ESA"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2013.6633658"},{"key":"32","first-page":"351","article-title":"Rolling horizon evolution versus tree search for navigation in single-player realtime games","author":"perez","year":"2013","journal-title":"GECCO"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TCIAIG.2013.2263884"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1126\/science.1137521"},{"key":"4","author":"englot","year":"2012","journal-title":"Sampling-based Coverage Path Planning for Inspection of Complex Structures"},{"key":"9","article-title":"Exploration exploitation in Go: UCT for Monte-Carlo Go","author":"gelly","year":"2006","journal-title":"NIPS-workshop on On-line Trading of Exploration and Exploitation"},{"key":"8","first-page":"282","article-title":"Bandit based Monte-Carlo planning","author":"kocsis","year":"2006","journal-title":"ICML"}],"event":{"name":"2014 IEEE Conference on Computational Intelligence and Games (CIG)","location":"Dortmund, Germany","start":{"date-parts":[[2014,8,26]]},"end":{"date-parts":[[2014,8,29]]}},"container-title":["2014 IEEE Conference on Computational Intelligence and Games"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6919811\/6932856\/06932882.pdf?arnumber=6932882","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T19:33:02Z","timestamp":1689622382000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6932882\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/cig.2014.6932882","relation":{},"subject":[],"published":{"date-parts":[[2014,8]]}}}