{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T03:19:35Z","timestamp":1774495175272,"version":"3.50.1"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T00:00:00Z","timestamp":1443657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Sci. Eng."],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1109\/tase.2015.2470096","type":"journal-article","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T18:57:53Z","timestamp":1440615473000},"page":"1309-1317","source":"Crossref","is-referenced-by-count":27,"title":["Efficient Multi-Robot Motion Planning for Unlabeled Discs in Simple Polygons"],"prefix":"10.1109","volume":"12","author":[{"given":"Aviv","family":"Adler","sequence":"first","affiliation":[]},{"given":"Mark","family":"de Berg","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[]},{"given":"Kiril","family":"Solovey","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009429"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187683"},{"key":"ref31","article-title":"On the hardness of unlabeled multi-robot motion planning","author":"solovey","year":"2015","journal-title":"Proc Robot Sci Syst (RSS)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2462356.2462360"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01758853"},{"key":"ref34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","author":"de berg","year":"2008","journal-title":"Computational Geometry Algorithms and Applications"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2000.844730"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2002.1014852"},{"key":"ref12","first-page":"239","article-title":"Hybrid motion planning: Coordinating two discs moving among polygonal obstacles in the plane","author":"hirsch","year":"2002","journal-title":"International Workshop on Algorithmic Foundations of Robotics (WAFR)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2014.2331983"},{"key":"ref14","first-page":"591","article-title":"Finding a needle in an exponential haystack: Discrete RRT for exploration of implicit roadmaps in multi-robot motion planning","author":"solovey","year":"2014","journal-title":"Proc Algorithm Found Robot"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0921-8890(97)00033-X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.001"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2005.1570374"},{"key":"ref18","article-title":"<formula formulatype=\"inline\"><tex Notation=\"TeX\">$k$<\/tex> <\/formula>-color multi-robot motion planning","author":"solovey","year":"2013","journal-title":"Int J Robot Res"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/s10514-014-9412-1"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426233"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01530889"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365740"},{"key":"ref3","author":"yap","year":"1984","journal-title":"?Coordinating the motion of several discs ?"},{"key":"ref6","article-title":"Centralized path planning for multiple robots: Optimal decoupling into sequential plans","author":"van den berg","year":"2009","journal-title":"Proc Robot Sci Syst (RSS)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45058-0_6"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009476"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(84)90130-3"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1177\/027836498400300405"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/027836498300200304"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(83)90014-3"},{"key":"ref20","article-title":"Motion planning for unlabeled discs with optimality guarantees","author":"solovey","year":"2015","journal-title":"Proc Robot Sci Syst (RSS)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2012.06.001"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195908002684"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9290-7"},{"key":"ref23","article-title":"Shortest move-sequence in the generalized 15-puzzle is NP-hard","volume":"1","author":"goldreich","year":"1984","journal-title":"Manuscript Laboratory for Computer Sci MIT"},{"key":"ref26","article-title":"From feasibility tests to path planners for multi-agent pathfinding","author":"krontiris","year":"2013","journal-title":"Proc Symp Combinatorial Search"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1984.715921"}],"container-title":["IEEE Transactions on Automation Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8856\/7287835\/07225186.pdf?arnumber=7225186","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:50Z","timestamp":1642003370000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7225186\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tase.2015.2470096","relation":{},"ISSN":["1545-5955","1558-3783"],"issn-type":[{"value":"1545-5955","type":"print"},{"value":"1558-3783","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10]]}}}