{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T09:28:35Z","timestamp":1770456515701,"version":"3.49.0"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100004895","name":"European Social Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004895","id-type":"DOI","asserted-by":"publisher"}]},{"name":"BOLT"},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["COVSG24"],"award-info":[{"award-number":["COVSG24"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"publisher","award":["PSG605"],"award-info":[{"award-number":["PSG605"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002301","name":"Eesti Teadusagentuur","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002301","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Robot. Autom. Lett."],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1109\/lra.2021.3061398","type":"journal-article","created":{"date-parts":[[2021,2,23]],"date-time":"2021-02-23T20:48:36Z","timestamp":1614113316000},"page":"3303-3310","source":"Crossref","is-referenced-by-count":11,"title":["GPU Accelerated Convex Approximations for Fast Multi-Agent Trajectory Optimization"],"prefix":"10.1109","volume":"6","author":[{"given":"Fatemeh","family":"Rastgar","sequence":"first","affiliation":[]},{"given":"Houman","family":"Masnavi","sequence":"additional","affiliation":[]},{"given":"Jatan","family":"Shrestha","sequence":"additional","affiliation":[]},{"given":"Karl","family":"Kruusamae","sequence":"additional","affiliation":[]},{"given":"Alvo","family":"Aabloo","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1704-7932","authenticated-orcid":false,"given":"Arun Kumar","family":"Singh","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"p.\ufffd151","article-title":"Cupy: A Numpy-Compatible library for Nvidia Gpu calculations","author":"nishino","year":"0","journal-title":"Proc 31st Conf Neural Inf Process Syst"},{"key":"ref11","article-title":"JAX: Composable Transformations of Python NumPy Programs","author":"bradbury","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11081-015-9294-x"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2017.7989750"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2889533"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2354892"},{"key":"ref16","first-page":"1308","article-title":"A novel trajectory optimization for affine systems: Beyond convex-concave procedure","author":"rastgar","year":"0","journal-title":"IEEE Int Conf Intell Robot Syst"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ITSC.2016.7795555"},{"key":"ref18","first-page":"1267","article-title":"Admm without a fixed penalty parameter: Faster convergence with new adaptive penalization","author":"xu","year":"0","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2008.4543489"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/ECC.2018.8550178"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/LRA.2018.2890572"},{"key":"ref6","first-page":"521","article-title":"A message-passing algorithm for multi-agent trajectory planning","author":"bento","year":"0","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6385823"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCST.2012.2231960"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197162"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7140034"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1561\/9781680833690"},{"key":"ref20","article-title":"High-performance mathematical programming solver for linear programming, mixed integer programming, and quadratic programming","volume":"12","author":"optimizer","year":"2011","journal-title":"IBM ILOG CPLEX Optim Studio Version"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA40945.2020.9197092"}],"container-title":["IEEE Robotics and Automation Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7083369\/9285111\/09361261.pdf?arnumber=9361261","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:58:03Z","timestamp":1639771083000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9361261\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":21,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/lra.2021.3061398","relation":{},"ISSN":["2377-3766","2377-3774"],"issn-type":[{"value":"2377-3766","type":"electronic"},{"value":"2377-3774","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]}}}