{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:33:07Z","timestamp":1750221187312,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T00:00:00Z","timestamp":1542412800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Grantov\u00e1 Agentura \u00f0esk\u00e9 Republiky","award":["16-24206S"],"award-info":[{"award-number":["16-24206S"]}]},{"name":"Ministerstvo \u00f0kolstv\u00ed, Ml\u00e1de\u00f0e a T\u00f0lov\u00f0chovy","award":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"],"award-info":[{"award-number":["CZ.02.1.01\/0.0\/0.0\/16_019\/0000765"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,11,17]]},"DOI":"10.1145\/3297097.3297099","type":"proceedings-article","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T20:44:12Z","timestamp":1549399452000},"page":"45-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["On Unsupervised Learning based Multi-Goal Path Planning for Visiting 3D Regions"],"prefix":"10.1145","author":[{"given":"Jan","family":"Faigl","sequence":"first","affiliation":[{"name":"Computational Robotics Laboratory, Czech Technical University in Prague (CTU), Prague Czechia"}]},{"given":"Jind\u0159i\u0161ka","family":"Deckerov\u00e1","sequence":"additional","affiliation":[{"name":"Computational Robotics Laboratory, Czech Technical University in Prague (CTU), Prague Czechia"}]}],"member":"320","published-online":{"date-parts":[[2018,11,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-015-0190-6"},{"key":"e_1_3_2_1_2_1","unstructured":"Applegate D. Bixby R. Chv\u00e1tal V. and Cook W. 2007. The Traveling Salesman Problem: A Computational Study. Princeton University Press Princeton NJ USA. Applegate D. Bixby R. Chv\u00e1tal V. and Cook W. 2007. The Traveling Salesman Problem: A Computational Study. Princeton University Press Princeton NJ USA."},{"volume-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS).","author":"Best G.","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/3198334.3198377"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.1067"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.6.6.791"},{"key":"e_1_3_2_1_7_1","unstructured":"Dong J. Yang N. and Chen M.. 2007. Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem Springer US Boston MA. Dong J. Yang N. and Chen M.. 2007. Heuristic Approaches for a TSP Variant: The Automatic Meter Reading Shortest Tour Problem Springer US Boston MA."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MRA.2011.2181683"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195909002897"},{"volume-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS).","author":"Faigl J.","key":"e_1_3_2_1_10_1"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2017.2678482"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.05.019"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.05.079"},{"volume-title":"Self-Organizing Map for the Multi-Goal Path Planning with Polygonal Goals. In International Conference on Artificial Neural Networks (ICANN) Heidelberg, Springer.","author":"Faigl J.","key":"e_1_3_2_1_14_1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Gulczynski D. J. Heath J. W. and Price C. C. 2006. The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics Springer US Boston MA. Gulczynski D. J. Heath J. W. and Price C. C. 2006. The Close Enough Traveling Salesman Problem: A Discussion of Several Heuristics Springer US Boston MA.","DOI":"10.1007\/978-0-387-39934-8_16"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Gutin G. and Punnen A. P. editors. 2007.The Traveling Salesman Problem and Its Variations. Springer US. Gutin G. and Punnen A. P. editors. 2007.The Traveling Salesman Problem and Its Variations. Springer US.","DOI":"10.1007\/b101971"},{"key":"e_1_3_2_1_17_1","unstructured":"Mennell W. K. 2009. Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem Close-Enough Vehicle Routing Problem Sequence-Dependent Team Orienteering Problem. Doctoral Thesis. University of Maryland. Mennell W. K. 2009. Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem Close-Enough Vehicle Routing Problem Sequence-Dependent Team Orienteering Problem. Doctoral Thesis. University of Maryland."},{"key":"e_1_3_2_1_18_1","unstructured":"PassMark\u00ae Software Pty Ltd. Cpu performance comparison 2018. {cited 10 Jul 2018}.https:\/\/www.cpubenchmark.net\/compare.php?cmp{}=1137&cmp{}=2440. PassMark\u00ae Software Pty Ltd. Cpu performance comparison 2018. {cited 10 Jul 2018}.https:\/\/www.cpubenchmark.net\/compare.php?cmp{}=1137&cmp{}=2440."},{"volume-title":"IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS).","author":"Vicencio K.","key":"e_1_3_2_1_19_1"}],"event":{"name":"ICRAI 2018: 2018 4th International Conference on Robotics and Artificial Intelligence","sponsor":["Guangdong University of Technology Guangdong University of Technology"],"location":"Guangzhou China","acronym":"ICRAI 2018"},"container-title":["Proceedings of the 2018 4th International Conference on Robotics and Artificial Intelligence"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297097.3297099","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3297097.3297099","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:08Z","timestamp":1750210748000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3297097.3297099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,17]]},"references-count":19,"alternative-id":["10.1145\/3297097.3297099","10.1145\/3297097"],"URL":"https:\/\/doi.org\/10.1145\/3297097.3297099","relation":{},"subject":[],"published":{"date-parts":[[2018,11,17]]},"assertion":[{"value":"2018-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}