{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,4]],"date-time":"2025-09-04T14:08:46Z","timestamp":1756994926409,"version":"3.28.0"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,5,29]],"date-time":"2023-05-29T00:00:00Z","timestamp":1685318400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,5,29]]},"DOI":"10.1109\/icra48891.2023.10161532","type":"proceedings-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T17:20:56Z","timestamp":1688491256000},"page":"7691-7698","source":"Crossref","is-referenced-by-count":2,"title":["Relay Pursuit for Multirobot Target Tracking on Tile Graphs"],"prefix":"10.1109","author":[{"given":"Shashwata","family":"Mandal","sequence":"first","affiliation":[{"name":"Iowa State University,Department of Computer Science,Ames,IA,USA,50010"}]},{"given":"Sourabh","family":"Bhattacharya","sequence":"additional","affiliation":[{"name":"Iowa State University,Department of Computer Science,Ames,IA,USA,50010"}]}],"member":"263","reference":[{"journal-title":"Decomposition problems in computational geometry","year":"1992","author":"palios","key":"ref13"},{"journal-title":"Art gallery theorems and algorithms \/ Joseph O'Rourke ser International series of monographs on computer science","year":"1987","author":"o'rourke","key":"ref12"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1515\/crll.1908.133.97"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364911415885"},{"key":"ref52","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/978-3-319-46448-0_2","article-title":"SSD: Single shot MultiBox detector","author":"liu","year":"2016","journal-title":"Computer Vision - ECCV 2016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195921500060"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/sym13112146"},{"key":"ref17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"chvatal","year":"1975","journal-title":"Journal of Combinatorial Theory Series B"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/116873.116880"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0604020"},{"key":"ref18","article-title":"A practical algorithm with performance guarantees for the art gallery problem","author":"hengeveld","year":"2022","journal-title":"ArXiv org"},{"key":"ref51","first-page":"1","volume":"14","author":"vaddi","year":"2021","journal-title":"Efficient object detection model for real-time UAV applications"},{"journal-title":"A note on minimal art galleries","year":"2019","author":"lipka","key":"ref50"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.2514\/1.G003070"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2010.09.003"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/0031-3203(92)90093-X"},{"key":"ref47","first-page":"395","volume":"13","author":"avis","year":"1981","journal-title":"An efficient algorithm for decomposing a polygon into star-shaped polygons"},{"key":"ref42","first-page":"592","author":"subhash","year":"2018","journal-title":"Pseudorandom sets in grass-mann graph have near-perfect expansion"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.04.008"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/BF00994018"},{"key":"ref43","article-title":"A better approximation ratio for the vertex cover problem","volume":"5","author":"karakostas","year":"2004","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"key":"ref49","first-page":"1","author":"ashur","year":"2020","journal-title":"Terrain-Like Graphs PTASs for Guarding Weakly-Visible Polygons and Terrains"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.is.2003.09.001"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10518"},{"key":"ref9","article-title":"Discovery, analysis, and presentation of strong rules","author":"piatetsky-shapiro","year":"1991","journal-title":"Knowledge Discovery in Databases"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8967602"},{"journal-title":"Au-tonomous UAV v navigation for active perception of targets in uncertain and cluttered environments","year":"2020","author":"sandino","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0452-2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF00146907"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00717-3"},{"key":"ref35","first-page":"85","author":"karp","year":"1972","journal-title":"Reducibility Among Combinatorial Problems"},{"key":"ref34","article-title":"New methods for computing visibility graphs","author":"overmars","year":"2001","journal-title":"Proceedings of the Fourth Annual Symposium on Computational Geometry"},{"key":"ref37","doi-asserted-by":"crossref","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"chen","year":"2010","journal-title":"Theoretical Computer Science"},{"journal-title":"Introduction to Algorithms","year":"2009","author":"cormen","key":"ref36"},{"key":"ref31","first-page":"167","volume":"20","author":"welzl","year":"1985","journal-title":"Constructing the visibility graph for n-line segments in 0(n2) time"},{"key":"ref30","first-page":"125","volume":"6","author":"zhou","year":"2009","journal-title":"Minimum partition of an independence system into independent sets"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1017\/S0373463318001005"},{"key":"ref32","first-page":"119","author":"o'rourke","year":"1997","journal-title":"Vertex-edge pseudo-visibility graphs Characterization and recognition"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2021.103122"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6871-y"},{"key":"ref39","first-page":"439","volume":"162","author":"dinur","year":"2005","journal-title":"On the hardness of approximating minimum vertex cover"},{"key":"ref38","volume":"32","author":"steiglitz","year":"1982","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"journal-title":"Studies on Kernels of Simple Polygons","year":"2020","author":"mark","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2022.05.001"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07821-2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IROS51168.2021.9636581"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2018.2882747"},{"key":"ref28","first-page":"113805","volume":"163","author":"xun","year":"2021","journal-title":"Incremental frequent itemsets mining based on frequent pattern tree and multi -scale"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2017.10.016"},{"journal-title":"Decomposition problems in computational geometry","year":"1992","author":"palios","key":"ref29"}],"event":{"name":"2023 IEEE International Conference on Robotics and Automation (ICRA)","start":{"date-parts":[[2023,5,29]]},"location":"London, United Kingdom","end":{"date-parts":[[2023,6,2]]}},"container-title":["2023 IEEE International Conference on Robotics and Automation (ICRA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10160211\/10160212\/10161532.pdf?arnumber=10161532","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T17:30:21Z","timestamp":1690219821000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10161532\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,29]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/icra48891.2023.10161532","relation":{},"subject":[],"published":{"date-parts":[[2023,5,29]]}}}