{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:56:43Z","timestamp":1771700203811,"version":"3.50.1"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1109\/cec.2009.4983199","type":"proceedings-article","created":{"date-parts":[[2009,10,14]],"date-time":"2009-10-14T20:17:46Z","timestamp":1255551466000},"page":"2091-2097","source":"Crossref","is-referenced-by-count":16,"title":["Efficient and safe path planning for a Mobile Robot using genetic algorithm"],"prefix":"10.1109","author":[{"given":"Mahmood","family":"Naderan-Tahan","sequence":"first","affiliation":[]},{"given":"Mohammad Taghi","family":"Manzuri-Shalmani","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","article-title":"2d minkowski sums","author":"wein","year":"2007","journal-title":"CGAL User and Reference Manual 3 3 Edition"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8659.00267"},{"key":"18","article-title":"a realtime clearance-based approach for motion planning of mobile robots","author":"tahan","year":"2008","journal-title":"Proc 5th IEEE Int Conf Cognitive Informat"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2007.363767"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/ICSMC.2007.4413953"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/ICNC.2007.546"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2006.1688617"},{"key":"11","first-page":"4350","article-title":"a knowledge based genetic algorithm for path planning of a mobile robot","author":"hu","year":"2004","journal-title":"IEEE Int Conf on Robotics and Automation"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/ICMA.2006.257475"},{"key":"3","first-page":"7","article-title":"near optimal hierarchical path finding","volume":"1","author":"botea","year":"2004","journal-title":"Journal of Game Development"},{"key":"20","year":"0","journal-title":"Computational Geometry Algorithms Library"},{"key":"2","article-title":"anytime dynamic a : an anytime, replanning algorithm","author":"likhachev","year":"2005","journal-title":"Proc Int l Conf Automated Planning and Scheduling"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/NAFIPS.2006.365466"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2000.895219"},{"key":"6","first-page":"521","article-title":"path planning using lazy prm","volume":"1","author":"bohlin","year":"2003","journal-title":"Proc ICRA IEEE International Conference on Robotics and Automation"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/70.508439"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.11.007"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.2004.1307418"},{"key":"8","author":"saha","year":"2006","journal-title":"Motion Planning With Probabilistic Roadmaps"}],"event":{"name":"2009 IEEE Congress on Evolutionary Computation (CEC)","location":"Trondheim, Norway","start":{"date-parts":[[2009,5,18]]},"end":{"date-parts":[[2009,5,21]]}},"container-title":["2009 IEEE Congress on Evolutionary Computation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4939002\/4982922\/04983199.pdf?arnumber=4983199","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T16:17:38Z","timestamp":1602692258000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/4983199"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/cec.2009.4983199","relation":{},"subject":[],"published":{"date-parts":[[2009,5]]}}}