{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,7]],"date-time":"2026-10-07T05:18:24Z","timestamp":1791350304766,"version":"4.3.1"},"reference-count":24,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,11]]},"DOI":"10.1109\/iros.2013.6696356","type":"proceedings-article","created":{"date-parts":[[2014,1,6]],"date-time":"2014-01-06T17:10:53Z","timestamp":1389028253000},"page":"217-223","source":"Crossref","is-referenced-by-count":25,"title":["On optimizing a sequence of robotic tasks"],"prefix":"10.1109","author":[{"given":"Sergey","family":"Alatartsev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vera","family":"Mersheeva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marcus","family":"Augustine","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Frank","family":"Ortmeier","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","article-title":"An algorithm for solving traveling-salesman and related network optimization problems","author":"bock","year":"1958","journal-title":"Unpublished Manuscript Associated with Talk Presented at the 14th ORSA National Meeting"},{"key":"22","first-page":"309","author":"rego","year":"2002","journal-title":"The Traveling Salesman Problem and Its Variations"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb04146.x"},{"key":"23","author":"press","year":"2007","journal-title":"Numerical Recipes-The Art of Scientific Computing"},{"key":"18","author":"johnson","year":"1997","journal-title":"Local Search in Combinatorial Optimization"},{"key":"24","year":"0"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1016\/j.rcim.2004.04.003"},{"key":"16","first-page":"1","article-title":"The travelling salesman problem with neighbourhoods: MINLP solution","author":"gentilini","year":"2011","journal-title":"Optimization Methods and Software"},{"key":"13","first-page":"175","article-title":"Approximate shortest path algorithms for sequences of pairwise disjoint simple polygons","author":"pan","year":"2010","journal-title":"Canadian Conference on Computational Geometry"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5651948"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195909002897"},{"key":"12","doi-asserted-by":"crossref","DOI":"10.1609\/icaps.v23i1.13539","article-title":"Constricting insertion heuristic for traveling salesman problem with neighborhoods","author":"alatartsev","year":"2013","journal-title":"23rd International Conference on Automated Planning and Scheduling (ICAPS)"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17022-5_46"},{"key":"3","doi-asserted-by":"crossref","DOI":"10.1515\/9781400841103","author":"applegate","year":"2007","journal-title":"The Traveling Salesman Problem A Computational Study"},{"key":"20","first-page":"588","article-title":"Routing for continuous monitoring by multiple micro UAVs in disaster scenarios","author":"mersheeva","year":"2012","journal-title":"20th European Conference on Artificial Intelligence (ECAI)"},{"key":"2","article-title":"A survey of robot programming systems","author":"biggs","year":"2003","journal-title":"Proceedings of the Australasian Conference on Robotics and Automation"},{"key":"1","article-title":"Recent progress on programming methods for industrial robots","author":"pan","year":"2010","journal-title":"Proceedings for the Joint Conference of 41st Internationel Symposium on Robotics and 6th German Conference on Robotics"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2010.08.011"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90008-6"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/780611.780612"},{"key":"5","author":"mennell","year":"2009","journal-title":"Heuristics for Solving Three Routing Problems Closeenough Traveling Salesman Problem Close-enough Vehicle Routing Problem Sequence-dependent Team Orienteering Problem"},{"key":"4","first-page":"97","article-title":"Generalized traveling salesman problem through n sets of nodes","volume":"7","author":"srivastava","year":"1969","journal-title":"CORS J"},{"key":"9","first-page":"607","author":"mitchell","year":"2004","journal-title":"Shortest Paths and Networks"},{"key":"8","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10107-003-0438-y","article-title":"Approximation schemes for NP-hard geometric optimization problems: A survey","volume":"97","author":"arora","year":"2003","journal-title":"Mathematical Programming"}],"event":{"name":"2013 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS 2013)","location":"Tokyo","start":{"date-parts":[[2013,11,3]]},"end":{"date-parts":[[2013,11,7]]}},"container-title":["2013 IEEE\/RSJ International Conference on Intelligent Robots and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6679723\/6696319\/06696356.pdf?arnumber=6696356","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,9]],"date-time":"2023-07-09T13:26:58Z","timestamp":1688909218000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6696356\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/iros.2013.6696356","relation":{},"subject":[],"published":{"date-parts":[[2013,11]]}}}