{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T13:42:36Z","timestamp":1776433356479,"version":"3.51.2"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,18]],"date-time":"2022-10-18T00:00:00Z","timestamp":1666051200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002322","name":"CAPES\/Brazil","doi-asserted-by":"publisher","award":["001"],"award-info":[{"award-number":["001"]}],"id":[{"id":"10.13039\/501100002322","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,10,18]]},"DOI":"10.1109\/lars\/sbr\/wre56824.2022.9995908","type":"proceedings-article","created":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T18:38:12Z","timestamp":1672857492000},"page":"1-6","source":"Crossref","is-referenced-by-count":3,"title":["A Routing-based Strategy to Socially Approach Multiple Individuals in Cluttered Environments"],"prefix":"10.1109","author":[{"given":"Aline F. F.","family":"Silva","sequence":"first","affiliation":[{"name":"Universidade Federal de Minas Gerais,Computer Vision and Robotics Laboratory (VeRLab),Department of Computer Science,Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Douglas G.","family":"Macharet","sequence":"additional","affiliation":[{"name":"Universidade Federal de Minas Gerais,Computer Vision and Robotics Laboratory (VeRLab),Department of Computer Science,Brazil"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ROMAN.2018.8525834"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ROMAN.2016.7745154"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/RO-MAN47096.2020.9223512"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/HRI.2019.8673103"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1514095.1514117"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.2307\/1572461"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-015-0080-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2019.2923949"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2013.6696660"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3390\/mi12020193"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROMAN.2017.8172454"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-62056-1_5"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/NICS51282.2020.9335878"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SIU.2018.8404328"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCDS.2017.2751963"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/NICS51282.2020.9335845"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s12369-021-00791-9"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2022.3174141"},{"key":"ref19","first-page":"131","article-title":"The traveling salesman problem","author":"Christofides","year":"1979","journal-title":"Combinatorial optimization"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230260206"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/03155986.1993.11732212"},{"key":"ref22","article-title":"The traveling salesman problem: a linear programming formulation","author":"Diaby","year":"2006","journal-title":"arXiv preprint cs\/0609005"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/opre.18.6.1138"},{"key":"ref24","article-title":"An effective implementation of the Lin-Kernighan traveling salesman heuristic (Datalogiske skrifter (writings on computer science) No. 81)","volume-title":"Department of Computer Science","author":"Helsgaun","year":"1998"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.03.048"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/MACE.2011.5987118"},{"key":"ref27","volume-title":"The Art of Comp Systems Perform Analysis","author":"Jain","year":"1991"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2307\/1170654"}],"event":{"name":"2022 Latin American Robotics Symposium (LARS), 2022 Brazilian Symposium on Robotics (SBR), and 2022 Workshop on Robotics in Education (WRE)","location":"S\u00e3o Bernardo do Campo, Brazil","start":{"date-parts":[[2022,10,18]]},"end":{"date-parts":[[2022,10,21]]}},"container-title":["2022 Latin American Robotics Symposium (LARS), 2022 Brazilian Symposium on Robotics (SBR), and 2022 Workshop on Robotics in Education (WRE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9995716\/9995730\/09995908.pdf?arnumber=9995908","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T11:20:52Z","timestamp":1709378452000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9995908\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,18]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/lars\/sbr\/wre56824.2022.9995908","relation":{},"subject":[],"published":{"date-parts":[[2022,10,18]]}}}