{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T13:02:13Z","timestamp":1763643733470,"version":"build-2065373602"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T00:00:00Z","timestamp":1666483200000},"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":[[2022,10,23]]},"DOI":"10.1109\/iros47612.2022.9981570","type":"proceedings-article","created":{"date-parts":[[2022,12,26]],"date-time":"2022-12-26T19:38:15Z","timestamp":1672083495000},"page":"12037-12044","source":"Crossref","is-referenced-by-count":6,"title":["Extended Time Dependent Vehicle Routing Problem for Joint Task Allocation and Path Planning in Shared Space"],"prefix":"10.1109","author":[{"given":"Aayush","family":"Aggarwal","sequence":"first","affiliation":[{"name":"NEC Corporation,Data Science Research Laboratories,Kanagawa,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Florence","family":"Ho","sequence":"additional","affiliation":[{"name":"National Institute of Advanced Industrial Science and Technology (AIST), Artificial Intelligence Research Center,Tokyo,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinji","family":"Nakadai","sequence":"additional","affiliation":[{"name":"NEC Corporation,Data Science Research Laboratories,Kanagawa,Japan"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v5i1.18315"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2021.3074883"},{"key":"ref3","article-title":"The Vehicle Routing Problem with Time Windows","author":"Cordeau","year":"2000","journal-title":"Groupe detudes et de recherche en analyse des decisions"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.07.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1609\/socs.v8i1.18423"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-77778-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2007.05.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/IROS40897.2019.8968096"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3019397"},{"key":"ref10","article-title":"Conflict-based search with optimal task assignment","volume-title":"Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems","author":"Honig","year":"2018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(02)00147-9"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9196667"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90192-C"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v36i9.21170"},{"key":"ref15","article-title":"Optimal target assignment and path finding for teams of agents","author":"Ma","year":"2016","journal-title":"AAMAS"},{"key":"ref16","article-title":"Overview: Generalizations of multi-agent path finding to real-world scenarios","author":"Ma","year":"2017","journal-title":"CoRR"},{"key":"ref17","article-title":"Lifelong multi-agent path finding for online pickup and delivery tasks","author":"Ma","year":"2017","journal-title":"AAMAS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.26.3.185"},{"key":"ref19","article-title":"Planning, scheduling and monitoring for airport surface operations","volume-title":"AAAI Workshop: Planning for Hybrid Systems","author":"Morris","year":"2016"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.08.012"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0323-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8140"},{"key":"ref23","first-page":"662","article-title":"The increasing cost tree search for optimal multi-agent pathfinding","volume-title":"Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI)","author":"Sharon","year":"2011"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2014.08.005"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1609\/aiide.v1i1.18726"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2019.02.016"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2019.10.010"}],"event":{"name":"2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","start":{"date-parts":[[2022,10,23]]},"location":"Kyoto, Japan","end":{"date-parts":[[2022,10,27]]}},"container-title":["2022 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9981026\/9981028\/09981570.pdf?arnumber=9981570","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T06:09:57Z","timestamp":1706767797000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9981570\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,23]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/iros47612.2022.9981570","relation":{},"subject":[],"published":{"date-parts":[[2022,10,23]]}}}