{"id":"https://openalex.org/W2148905011","doi":"https://doi.org/10.1109/riiss.2011.5945787","title":"Path planning for mobile robots by bacterial memetic algorithm","display_name":"Path planning for mobile robots by bacterial memetic algorithm","publication_year":2011,"publication_date":"2011-04-01","ids":{"openalex":"https://openalex.org/W2148905011","doi":"https://doi.org/10.1109/riiss.2011.5945787","mag":"2148905011"},"language":"en","primary_location":{"id":"doi:10.1109/riiss.2011.5945787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/riiss.2011.5945787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Workshop on Robotic Intelligence In Informationally Structured Space","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046625768","display_name":"J\u00e1nos Botzheim","orcid":"https://orcid.org/0000-0002-7838-6148"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]},{"id":"https://openalex.org/I83579964","display_name":"Sz\u00e9chenyi Istv\u00e1n University","ror":"https://ror.org/04091f946","country_code":"HU","type":"education","lineage":["https://openalex.org/I83579964"]}],"countries":["HU","JP"],"is_corresponding":true,"raw_author_name":"Janos Botzheim","raw_affiliation_strings":["Department of Automation, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary","Graduate School of System Design, Tokyo Metropolitan University, Hino, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Department of Automation, Sz\u00e9chenyi Istv\u00e1n University, Gyor, Hungary","institution_ids":["https://openalex.org/I83579964"]},{"raw_affiliation_string":"Graduate School of System Design, Tokyo Metropolitan University, Hino, Tokyo, Japan","institution_ids":["https://openalex.org/I69740276"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087750601","display_name":"Yuichiro Toda","orcid":"https://orcid.org/0000-0003-4170-2300"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichiro Toda","raw_affiliation_strings":["Graduate School of System Design, Tokyo Metropolitan University, Hino, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of System Design, Tokyo Metropolitan University, Hino, Tokyo, Japan","institution_ids":["https://openalex.org/I69740276"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074076109","display_name":"Naoyuki Kubota","orcid":"https://orcid.org/0000-0001-8829-037X"},"institutions":[{"id":"https://openalex.org/I69740276","display_name":"Tokyo Metropolitan University","ror":"https://ror.org/00ws30h19","country_code":"JP","type":"education","lineage":["https://openalex.org/I69740276"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Naoyuki Kubota","raw_affiliation_strings":["Graduate School of System Design, Tokyo Metropolitan University, Hino, Tokyo, Japan"],"affiliations":[{"raw_affiliation_string":"Graduate School of System Design, Tokyo Metropolitan University, Hino, Tokyo, Japan","institution_ids":["https://openalex.org/I69740276"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5046625768"],"corresponding_institution_ids":["https://openalex.org/I69740276","https://openalex.org/I83579964"],"apc_list":null,"apc_paid":null,"fwci":0.2576,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.60959784,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"826","issue":null,"first_page":"107","last_page":"112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9986000061035156,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9873999953269958,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/memetic-algorithm","display_name":"Memetic algorithm","score":0.9341259002685547},{"id":"https://openalex.org/keywords/crossover","display_name":"Crossover","score":0.7875422239303589},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6866869330406189},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.647112250328064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6140410304069519},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.596653938293457},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5765268206596375},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5734637975692749},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5732335448265076},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5141273140907288},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4910266399383545},{"id":"https://openalex.org/keywords/local-search","display_name":"Local search (optimization)","score":0.4503733217716217},{"id":"https://openalex.org/keywords/evolutionary-computation","display_name":"Evolutionary computation","score":0.43586400151252747},{"id":"https://openalex.org/keywords/operator","display_name":"Operator (biology)","score":0.42250603437423706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4155164361000061},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4006987512111664},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2791125774383545}],"concepts":[{"id":"https://openalex.org/C35129592","wikidata":"https://www.wikidata.org/wiki/Q324793","display_name":"Memetic algorithm","level":3,"score":0.9341259002685547},{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7875422239303589},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6866869330406189},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.647112250328064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6140410304069519},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.596653938293457},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5765268206596375},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5734637975692749},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5732335448265076},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5141273140907288},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4910266399383545},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4503733217716217},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.43586400151252747},{"id":"https://openalex.org/C17020691","wikidata":"https://www.wikidata.org/wiki/Q139677","display_name":"Operator (biology)","level":5,"score":0.42250603437423706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4155164361000061},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4006987512111664},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2791125774383545},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C86339819","wikidata":"https://www.wikidata.org/wiki/Q407384","display_name":"Transcription factor","level":3,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C158448853","wikidata":"https://www.wikidata.org/wiki/Q425218","display_name":"Repressor","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/riiss.2011.5945787","is_oa":false,"landing_page_url":"https://doi.org/10.1109/riiss.2011.5945787","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Workshop on Robotic Intelligence In Informationally Structured Space","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W18216792","https://openalex.org/W115313685","https://openalex.org/W1497256448","https://openalex.org/W1592161118","https://openalex.org/W1659842140","https://openalex.org/W1911539092","https://openalex.org/W1957996277","https://openalex.org/W1990212111","https://openalex.org/W2039990913","https://openalex.org/W2051321581","https://openalex.org/W2101938656","https://openalex.org/W2112077260","https://openalex.org/W2181064662","https://openalex.org/W2226131034","https://openalex.org/W2741077878","https://openalex.org/W4250503570","https://openalex.org/W4285719527","https://openalex.org/W6600754543","https://openalex.org/W6685446932","https://openalex.org/W6742262481"],"related_works":["https://openalex.org/W2318617794","https://openalex.org/W2163647484","https://openalex.org/W2132985225","https://openalex.org/W47248985","https://openalex.org/W2000270779","https://openalex.org/W4225853026","https://openalex.org/W2129486222","https://openalex.org/W3144175025","https://openalex.org/W1778024729","https://openalex.org/W2787833928"],"abstract_inverted_index":{"The":[0,69,97,129],"goal":[1],"of":[2,37,65,106,116],"the":[3,35,56,73,78,94,102,107],"path":[4,13,63],"planning":[5,64],"problem":[6,32],"is":[7,60,119,132],"to":[8,34,77,91],"determine":[9],"an":[10,26],"optimal":[11],"collision-free":[12],"between":[14],"a":[15,18,22,66],"start":[16],"and":[17,111],"target":[19],"point":[20],"for":[21,62],"mobile":[23,67],"robot":[24],"in":[25,72,89,134],"environment":[27],"surrounded":[28],"by":[29,45],"obstacles.":[30],"This":[31],"belongs":[33],"group":[36],"hard":[38],"optimization":[39,47],"problems":[40],"which":[41],"can":[42,123],"be":[43],"approached":[44],"modern":[46],"techniques":[48],"such":[49],"as":[50],"evolutionary":[51,83,95],"algorithms.":[52],"In":[53],"this":[54],"paper":[55,74],"bacterial":[57,98,103],"memetic":[58,99],"algorithm":[59,100,131],"proposed":[61,130],"robot.":[68],"representation":[70],"used":[71],"fits":[75],"well":[76],"algorithm.":[79],"Memetic":[80],"algorithms":[81,84],"combine":[82],"with":[85,126],"local":[86],"search":[87],"heuristics":[88],"order":[90],"speed":[92],"up":[93],"process.":[96],"applies":[101],"operators":[104,118],"instead":[105],"genetic":[108],"algorithm's":[109],"crossover":[110],"mutation":[112],"operator.":[113],"One":[114],"advantage":[115],"these":[117],"that":[120],"they":[121],"easily":[122],"handle":[124],"individuals":[125],"different":[127],"length.":[128],"tested":[133],"real":[135],"environment.":[136]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}