{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,24]],"date-time":"2026-10-24T00:34:29Z","timestamp":1792802069209,"version":"4.5.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2018.2886245","type":"journal-article","created":{"date-parts":[[2018,12,25]],"date-time":"2018-12-25T14:36:37Z","timestamp":1545748597000},"page":"2138-2147","source":"Crossref","is-referenced-by-count":77,"title":["Multi-Robot Path Planning Based on Multi-Objective Particle Swarm Optimization"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7871-165X","authenticated-orcid":false,"given":"Sahib","family":"Thabit","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ali","family":"Mohades","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref30","author":"bartle","year":"2014","journal-title":"The Elements of Integration and Lebesgue Measure"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-14705-5_2"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HNICEM.2017.8269498"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.07.060"},{"key":"ref13","first-page":"851","article-title":"Mobile robot path planning using ant colony optimization","author":"cong","year":"2009","journal-title":"Proc IEEE\/ASME Int Conf Adv Intell Mechatron (AIM)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2012.09.019"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2723892"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2812896"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICIT.2010.5472755"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.4304\/jcp.6.8.1554-1561"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/NaBIC.2011.6089601"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/MHS.1995.494215"},{"key":"ref4","article-title":"A cell decomposition approach to robotic trajectory planning via disjunctive programming","author":"swingler","year":"2012"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICECTECH.2011.5942092"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TMECH.2010.2070843"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.5897\/IJPS11.1745"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.5539\/cis.v3n1p180"},{"key":"ref5","article-title":"Fast shortest path algorithm for road network and implementation","author":"dai","year":"2005"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/978-3-319-29363-9_20","article-title":"Path planning with loop closure constraints using an atlas-based RRT","author":"jaillet","year":"2017","journal-title":"Robotics Research"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.11.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1177\/027836499101000604"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2016.2604240"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-65292-4_23"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICInfA.2015.7279336"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/MAMI.2015.7456577"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-015-1825-z"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICICTA.2010.300"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/EURCON.2009.5167916"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2012.07.023"},{"key":"ref25","doi-asserted-by":"crossref","first-page":"1283","DOI":"10.1007\/s00500-012-0964-8","article-title":"Multi-objective optimal path planning using elitist non-dominated sorting genetic algorithms","volume":"17","author":"ahmed","year":"2013","journal-title":"Soft Comput"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08588984.pdf?arnumber=8588984","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T16:51:48Z","timestamp":1643129508000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8588984\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2018.2886245","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]}}}