{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T10:06:12Z","timestamp":1779098772534,"version":"3.51.4"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"ARL DCIST CRA","award":["W911NF-17-2-0181"],"award-info":[{"award-number":["W911NF-17-2-0181"]}]},{"name":"ONR RAIDER","award":["N00014-18-1-2828"],"award-info":[{"award-number":["N00014-18-1-2828"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2023,11]]},"DOI":"10.1109\/lra.2023.3320011","type":"journal-article","created":{"date-parts":[[2023,9,27]],"date-time":"2023-09-27T17:43:29Z","timestamp":1695836609000},"page":"7527-7534","source":"Crossref","is-referenced-by-count":14,"title":["D-Lite: Navigation-Oriented Compression of 3D Scene Graphs for Multi-Robot Collaboration"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2829-5256","authenticated-orcid":false,"given":"Yun","family":"Chang","sequence":"first","affiliation":[{"name":"Laboratory for Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6521-7142","authenticated-orcid":false,"given":"Luca","family":"Ballotta","sequence":"additional","affiliation":[{"name":"Department of Information Engineering, University of Padova, Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1884-5397","authenticated-orcid":false,"given":"Luca","family":"Carlone","sequence":"additional","affiliation":[{"name":"Laboratory for Information and Decision Systems (LIDS), Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","article-title":"Compressing network graphs","volume":"124","author":"gilbert","year":"0","journal-title":"Proc LinkKDD Workshop ACM Conf KDD"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1177\/02783649211056674"},{"key":"ref12","first-page":"12:1?12:15","article-title":"A quasi-polynomial-time approximation scheme for vehicle routing on planar and bounded-genus graphs","volume":"87","author":"becker","year":"0","journal-title":"Proc Annu Eur Symp Algorithms"},{"key":"ref34","first-page":"368","article-title":"The information bottleneck method","volume":"49","author":"tishby","year":"0","journal-title":"Proc Annu Allerton Conf Commun Control Comput"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2575005"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913498292"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3457335.3461704"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TRO.2020.3003219"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1177\/0278364917732640"},{"key":"ref33","article-title":"D-lite: Navigation-oriented compression of 3d scene graphs for multi-robot collaboration","author":"chang","year":"2022"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2022.3191156"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3099995"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2022.XVIII.050"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2020.XVI.079"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2529506"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2900747"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48350-3_27"},{"key":"ref18","first-page":"405","article-title":"Representing web graphs","author":"raghavan","year":"0","journal-title":"Proc Int Conf Data Eng"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-022-00433-x"},{"key":"ref23","first-page":"11:1","article-title":"An FPT algorithm for minimum additive spanner problem","volume":"154","author":"kobayashi","year":"0","journal-title":"Proc Int Symp Theor Aspects Comp Sci"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3274651"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.125"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-385963-1.00007-1"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2020.100253"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90066-X"},{"key":"ref28","first-page":"46","article-title":"Taskography: Evaluating robot task planning over large 3D scene graphs","author":"agia","year":"0","journal-title":"Proc 5th Conf Robot Learn"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i13.17421"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1177\/0278364920948594"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.15607\/RSS.2018.XIV.071"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8461155"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA48506.2021.9561090"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR46437.2021.00743"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00576"},{"key":"ref6","first-page":"26395","article-title":"Neural trees for learning on graphs","author":"talak","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2019.2931042"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10254630\/10265226.pdf?arnumber=10265226","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:27:24Z","timestamp":1698085644000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10265226\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11]]},"references-count":35,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/lra.2023.3320011","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11]]}}}