{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T13:39:21Z","timestamp":1730209161285,"version":"3.28.0"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1109\/coase.2007.4341846","type":"proceedings-article","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T13:45:29Z","timestamp":1191937529000},"page":"899-904","source":"Crossref","is-referenced-by-count":4,"title":["Coverage of a Planar Point Set with Multiple Constrained Robots"],"prefix":"10.1109","author":[{"given":"Nilanjan","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srinivas","family":"Akella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","first-page":"519","article-title":"Numerical mixed-integer optimal control and motorized traveling salesman problems","volume":"35","author":"von stryk","year":"2001","journal-title":"European Journal of Control"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1002\/rob.1036"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.846373"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1077464.1077472"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906061705"},{"journal-title":"The Boost Graph Library User Guide and Reference Manual","year":"2002","author":"siek","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2.4.393"},{"key":"2","article-title":"Motion planning for multirobot assembly systems","author":"bonert","year":"1999","journal-title":"Proceedings of the ASME Design Engineering Technical Conference"},{"journal-title":"The Traveling Salesman Problem A Computational Study","year":"2006","author":"applegate","key":"1"},{"journal-title":"Combinatorial Optimization Algorithms and Complexity","year":"1982","author":"papadimitriou","key":"10"},{"journal-title":"Traveling Salesman Problem and Its Variations","year":"2002","author":"gutin","key":"7"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1990","author":"garey","key":"6"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.6028\/jres.069B.013"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/70.34775"},{"key":"9","first-page":"17","author":"micali","year":"1980","journal-title":"Proc Twenty-first Annual Symposium on the Foundations of Computer Science"},{"journal-title":"Combinatorial Optimization Networks and Matroids","year":"1976","author":"lawler","key":"8"}],"event":{"name":"2007 IEEE International Conference on Automation Science and Engineering","start":{"date-parts":[[2007,9,22]]},"location":"Scottsdale, AZ, USA","end":{"date-parts":[[2007,9,25]]}},"container-title":["2007 IEEE International Conference on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4341639\/4341640\/04341846.pdf?arnumber=4341846","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,16]],"date-time":"2017-03-16T13:23:14Z","timestamp":1489670594000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4341846\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/coase.2007.4341846","relation":{},"subject":[],"published":{"date-parts":[[2007,9]]}}}