{"id":"https://openalex.org/W2077056715","doi":"https://doi.org/10.1109/nabic.2011.6089601","title":"Multi-robot path-planning using artificial bee colony optimization algorithm","display_name":"Multi-robot path-planning using artificial bee colony optimization algorithm","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2077056715","doi":"https://doi.org/10.1109/nabic.2011.6089601","mag":"2077056715"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2011.6089601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2011.6089601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third World Congress on Nature and Biologically Inspired Computing","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/A5024857254","display_name":"Preetha Bhattacharjee","orcid":null},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Preetha Bhattacharjee","raw_affiliation_strings":["CSE Dept, Jadavpur University, Kolkata, India","CSE Dept., Jadavpur University, Kolkata-700032, India"],"affiliations":[{"raw_affiliation_string":"CSE Dept, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"CSE Dept., Jadavpur University, Kolkata-700032, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102829523","display_name":"Pratyusha Rakshit","orcid":"https://orcid.org/0000-0001-7350-2958"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pratyusha Rakshit","raw_affiliation_strings":["ETCE Dept., Jadavpur University, Kolkata, India","ETCE Dept., Jadavpur University, Kolkata-700032, India"],"affiliations":[{"raw_affiliation_string":"ETCE Dept., Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"ETCE Dept., Jadavpur University, Kolkata-700032, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111799894","display_name":"Indrani Goswami","orcid":null},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Indrani Goswami","raw_affiliation_strings":["Jadavpur University, Kolkata, West Bengal, IN","ETCE Dept., Jadavpur University, Kolkata-700032, India"],"affiliations":[{"raw_affiliation_string":"Jadavpur University, Kolkata, West Bengal, IN","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"ETCE Dept., Jadavpur University, Kolkata-700032, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011939964","display_name":"Amit Konar","orcid":"https://orcid.org/0000-0002-9474-5956"},"institutions":[{"id":"https://openalex.org/I170979836","display_name":"Jadavpur University","ror":"https://ror.org/02af4h012","country_code":"IN","type":"education","lineage":["https://openalex.org/I170979836"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Amit Konar","raw_affiliation_strings":["ETCE Dept., Jadavpur University, Kolkata, India","ETCE Dept., Jadavpur University, Kolkata-700032, India"],"affiliations":[{"raw_affiliation_string":"ETCE Dept., Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"ETCE Dept., Jadavpur University, Kolkata-700032, India","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081696143","display_name":"Atulya K. Nagar","orcid":"https://orcid.org/0000-0001-5549-6435"},"institutions":[{"id":"https://openalex.org/I44852757","display_name":"Liverpool Hope University","ror":"https://ror.org/03ctjbj91","country_code":"GB","type":"education","lineage":["https://openalex.org/I44852757"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Atulya K. Nagar","raw_affiliation_strings":["Math and Computer Science, Liverpool Hope University, UK","Math and Computer Science, Liverpool Hope University, L16 9JD, UK"],"affiliations":[{"raw_affiliation_string":"Math and Computer Science, Liverpool Hope University, UK","institution_ids":["https://openalex.org/I44852757"]},{"raw_affiliation_string":"Math and Computer Science, Liverpool Hope University, L16 9JD, UK","institution_ids":["https://openalex.org/I44852757"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5024857254"],"corresponding_institution_ids":["https://openalex.org/I170979836"],"apc_list":null,"apc_paid":null,"fwci":5.7595,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.96837069,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":96,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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.9753000140190125,"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/motion-planning","display_name":"Motion planning","score":0.8342399597167969},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7036383748054504},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6667608022689819},{"id":"https://openalex.org/keywords/artificial-bee-colony-algorithm","display_name":"Artificial bee colony algorithm","score":0.6201726198196411},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6161227822303772},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5907367467880249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5635435581207275},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.545947253704071},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.5069634914398193},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5043803453445435},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4879247844219208},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46152347326278687},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3077087700366974}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8342399597167969},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7036383748054504},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6667608022689819},{"id":"https://openalex.org/C97133563","wikidata":"https://www.wikidata.org/wiki/Q4801057","display_name":"Artificial bee colony algorithm","level":2,"score":0.6201726198196411},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6161227822303772},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5907367467880249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5635435581207275},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.545947253704071},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.5069634914398193},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5043803453445435},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4879247844219208},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46152347326278687},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3077087700366974},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/nabic.2011.6089601","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2011.6089601","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 Third World Congress on Nature and Biologically Inspired Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7099999785423279}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1595159159","https://openalex.org/W2031767704","https://openalex.org/W2144317842","https://openalex.org/W2166928235","https://openalex.org/W2687161862","https://openalex.org/W3138355580","https://openalex.org/W6792741644"],"related_works":["https://openalex.org/W3083944492","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W2161428574","https://openalex.org/W2618632915","https://openalex.org/W2077416514","https://openalex.org/W4292862729","https://openalex.org/W2150982344","https://openalex.org/W2157678966"],"abstract_inverted_index":{"Path-planning":[0],"is":[1],"an":[2,11,54],"interesting":[3],"problem":[4,28],"in":[5,49,88,117],"mobile":[6,17],"robotics.":[7],"This":[8],"paper":[9],"proposes":[10],"alternative":[12],"approach":[13],"to":[14,32,45,57,78,100,134],"path-planning":[15],"of":[16,36,38,62,84],"robots":[18,40,87],"using":[19],"the":[20,34,39,50,59,64,81,86,89,98,113,118,124],"artificial":[21],"bee":[22],"colony":[23],"(ABC)":[24],"optimization":[25,76,126],"algorithm.":[26],"The":[27],"undertaken":[29],"here":[30],"attempts":[31],"determine":[33],"trajectory":[35,68],"motion":[37],"from":[41,92],"predefined":[42],"starting":[43],"positions":[44,48,83],"fixed":[46],"goal":[47],"world":[51,90,119],"map":[52,91],"with":[53,74,109,112,132],"ultimate":[55],"objective":[56],"minimize":[58],"path":[60,140],"length":[61],"all":[63,85],"robots.":[65],"A":[66],"local":[67],"planning":[69],"scheme":[70,127],"has":[71],"been":[72],"developed":[73,102],"ABC":[75],"algorithm":[77],"optimally":[79],"obtain":[80],"next":[82],"their":[93],"current":[94],"positions,":[95],"so":[96],"that":[97,123],"paths":[99],"be":[101],"locally":[103],"for":[104],"n-robots":[105],"are":[106],"sufficiently":[107],"small":[108],"minimum":[110],"spacing":[111],"obstacles,":[114],"if":[115],"any,":[116],"map.":[120],"Experiments":[121],"reveal":[122],"proposed":[125],"outperforms":[128],"two":[129],"well-known":[130],"algorithms":[131],"respect":[133],"standard":[135],"metrics,":[136],"called":[137],"average":[138,143],"total":[139],"deviation":[141],"and":[142],"uncovered":[144],"target":[145],"distance.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":11},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":4}],"updated_date":"2026-03-24T05:59:24.953642","created_date":"2025-10-10T00:00:00"}