{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T21:08:32Z","timestamp":1768338512058,"version":"3.49.0"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T00:00:00Z","timestamp":1603497600000},"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":[[2020,10,24]]},"DOI":"10.1109\/iros45743.2020.9340864","type":"proceedings-article","created":{"date-parts":[[2021,3,15]],"date-time":"2021-03-15T14:49:56Z","timestamp":1615819796000},"page":"11623-11630","source":"Crossref","is-referenced-by-count":5,"title":["A Hamilton\u2013Jacobi Formulation for Optimal Coordination of Heterogeneous Multiple Vehicle Systems"],"prefix":"10.1109","author":[{"given":"Matthew R.","family":"Kirchner","sequence":"first","affiliation":[]},{"given":"Mark J.","family":"Debord","sequence":"additional","affiliation":[]},{"given":"Joao P.","family":"Hespanha","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","author":"nocedal","year":"2006","journal-title":"Numerical Optimization"},{"key":"ref38","first-page":"480","article-title":"A toolbox of Hamilton-Jacobi solvers for analysis of nondeterministic continuous and hybrid systems","author":"mitchell","year":"2005","journal-title":"HSCC"},{"key":"ref33","author":"rudin","year":"1976","journal-title":"Principles of Mathematical Analysis"},{"key":"ref32","author":"hiriart-urruty","year":"2012","journal-title":"Fundamentals of Convex Analysis"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0847-1"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972238"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1201\/9780203749319"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/BF00940185"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/0728049"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-10277-1","volume":"85","author":"kurzhanski","year":"2014","journal-title":"Dynamics and control of trajectory tubes Theory and computation"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4738800"},{"key":"ref40","first-page":"205","article-title":"? x2 + ü is the most computationally efficient smooth approximation to |x|: a proof","author":"ramirez","year":"2014","journal-title":"Journal of Uncertain Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1115\/1.2766722"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2177576"},{"key":"ref13","volume":"174","author":"roughgarden","year":"2005","journal-title":"Selfish Routing and the Price of Anarchy"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2301613"},{"key":"ref15","article-title":"Towards general performance bounds of the distributed sensor coverage problem","author":"kirchner","year":"2013","journal-title":"Electrical Computer & Energy Engineering Graduate Theses & Dissertations"},{"key":"ref16","first-page":"757","article-title":"Conflict-based search with optimal task assignment","author":"h\u00f6nig","year":"2018","journal-title":"Proc of International Conference on Autonomous Agents and Multiagent Systems"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913515307"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1177\/0278364916632065"},{"key":"ref19","article-title":"The bottleneck assignment problem","author":"gross","year":"1959","journal-title":"The Rand Corporation Santa Monica CA Technical Report RM-1102"},{"key":"ref28","author":"bryson","year":"1975","journal-title":"Applied Optimal Control Optimization Estimation and Control"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2012.6225009"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2017.2785357"},{"key":"ref3","article-title":"Search-based optimal solvers for the multi-agent pathfinding problem: Summary and challenges","author":"felner","year":"2017","journal-title":"Tenth Annual Symposium on Combinatorial Search"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ECC.2015.7331044"},{"key":"ref29","author":"evans","year":"2010","journal-title":"Partial Differential Equations"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385823"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2794582"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2018.8593876"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2014.2314460"},{"key":"ref9","author":"bertsekas","year":"1991","journal-title":"Linear Network Optimization Algorithms and Codes"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.automatica.2004.02.017"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2005.851439"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-007-9174-4"},{"key":"ref21","volume":"153","author":"osher","year":"2006","journal-title":"Level Set Methods and Dynamic Implicit Surfaces"},{"key":"ref24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1186\/s40687-016-0068-7","article-title":"Algorithms for overcoming the curse of dimensionality for certain Hamilton-Jacobi equations arising in control theory and elsewhere","volume":"3","author":"darbon","year":"2016","journal-title":"International Journal of Mathematics and Mathematical Sciences"},{"key":"ref41","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/j.ifacol.2019.08.087","article-title":"A level set approach to online sensing and trajectory optimization with time delays","volume":"52","author":"kirchner","year":"2019","journal-title":"IFAC-PapersOnLine"},{"key":"ref23","author":"bellman","year":"2015","journal-title":"Adaptive Control Processes A Guided Tour"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CCTA.2018.8511584"},{"key":"ref25","first-page":"951","article-title":"Generalized solutions of non-linear equations of first order","volume":"14","author":"hopf","year":"1965","journal-title":"Journal of Mathematics and Mechanics"}],"event":{"name":"2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)","location":"Las Vegas, NV, USA","start":{"date-parts":[[2020,10,24]]},"end":{"date-parts":[[2021,1,24]]}},"container-title":["2020 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9340668\/9340635\/09340864.pdf?arnumber=9340864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T05:16:12Z","timestamp":1698038172000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9340864\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,24]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/iros45743.2020.9340864","relation":{},"subject":[],"published":{"date-parts":[[2020,10,24]]}}}