{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T22:13:05Z","timestamp":1740175985080,"version":"3.37.3"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"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":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1109\/lra.2024.3387131","type":"journal-article","created":{"date-parts":[[2024,4,10]],"date-time":"2024-04-10T18:26:27Z","timestamp":1712773587000},"page":"5006-5013","source":"Crossref","is-referenced-by-count":0,"title":["Manipulating Neural Path Planners via Slight Perturbations"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4582-8560","authenticated-orcid":false,"given":"Zikang","family":"Xiong","sequence":"first","affiliation":[{"name":"Computer Science Department, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6871-2424","authenticated-orcid":false,"given":"Suresh","family":"Jagannathan","sequence":"additional","affiliation":[{"name":"Computer Science Department, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00886"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52729.2023.01712"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2000.892132"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2010.5653275"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1177\/0278364918781001"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2017.8206505"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2019.8793889"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v29i1.3545"},{"key":"ref9","article-title":"Learning to plan in high dimensions via neural exploration-exploitation trees","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Chen","year":"2020"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/icra40945.2020.9197106"},{"key":"ref11","first-page":"12029","article-title":"Path planning using neural a* search","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yonetani","year":"2021"},{"article-title":"Motion planning transformers: One model to plan them all","year":"2021","author":"Johnson","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460851"},{"article-title":"Learning to plan in high dimensions via neural exploration-exploitation trees","year":"2019","author":"Chen","key":"ref14"},{"article-title":"Targeted backdoor attacks on deep learning systems using data poisoning","year":"2017","author":"Chen","key":"ref15"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2909068"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP51992.2021.00022"},{"article-title":"Open X-embodiment: Robotic learning datasets and RT-X models","year":"2023","author":"Collaboration","key":"ref18"},{"year":"2023","key":"ref19","article-title":"Octo: An open-source generalist robot policy"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.01301"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00031"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3433210.3453108"},{"key":"ref23","article-title":"Robust anomaly detection and backdoor attack detection via differential privacy","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Du","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8460730"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3182979"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218663"},{"key":"ref29","doi-asserted-by":"crossref","DOI":"10.24963\/ijcai.2021\/509","article-title":"BACKDOORL: Backdoor attack against competitive reinforcement learning","volume-title":"Proc. Int. Joint Conf. Artif. Intell.","author":"Wang","year":"2021"},{"article-title":"Design of intentional backdoors in sequential models","year":"2019","author":"Yang","key":"ref30"},{"article-title":"Mind your data! hiding backdoors in offline reinforcement learning datasets","year":"2022","author":"Gong","key":"ref31"},{"key":"ref32","article-title":"Rapidly-exploring random trees: A new tool for path planning","volume-title":"Proc. Annu. Res. Rep.","author":"LaValle","year":"1998"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/34.368173"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00470-5_13"},{"article-title":"Pick your poison: Undetectability versus robustness in data poisoning attacks against deep image classification","year":"2023","author":"Lukas","key":"ref36"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/10504377\/10496147.pdf?arnumber=10496147","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T19:33:25Z","timestamp":1734982405000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10496147\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":36,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/lra.2024.3387131","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"type":"electronic","value":"2377-3766"},{"type":"electronic","value":"2377-3774"}],"subject":[],"published":{"date-parts":[[2024,6]]}}}