{"id":"https://openalex.org/W2024865515","doi":"https://doi.org/10.1109/nabic.2011.6089465","title":"Energy efficient trajectory planning by a robot arm using invasive weed optimization technique","display_name":"Energy efficient trajectory planning by a robot arm using invasive weed optimization technique","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2024865515","doi":"https://doi.org/10.1109/nabic.2011.6089465","mag":"2024865515"},"language":"en","primary_location":{"id":"doi:10.1109/nabic.2011.6089465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2011.6089465","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/A5032635465","display_name":"Abhronil Sengupta","orcid":"https://orcid.org/0000-0002-5545-4494"},"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":"Abhronil Sengupta","raw_affiliation_strings":["Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India","[Department of Electronics and Telecommunication Eng, Jadavpur University, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of Electronics and Telecommunication Eng, Jadavpur University, Kolkata, India]","institution_ids":["https://openalex.org/I170979836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003213012","display_name":"Tathagata\ufeff Chakraborti","orcid":"https://orcid.org/0000-0003-2905-5454"},"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":"Tathagata Chakraborti","raw_affiliation_strings":["Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India","[Department of Electronics and Telecommunication Eng, Jadavpur University, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of Electronics and Telecommunication Eng, Jadavpur University, Kolkata, 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":["Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India","[Department of Electronics and Telecommunication Eng, Jadavpur University, Kolkata, India]"],"affiliations":[{"raw_affiliation_string":"Department of Electronics and Telecommunication Engineering, Jadavpur University, Kolkata, India","institution_ids":["https://openalex.org/I170979836"]},{"raw_affiliation_string":"[Department of Electronics and Telecommunication Eng, Jadavpur University, Kolkata, 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 Nagar","raw_affiliation_strings":["Computer and Math Sciences, Liverpool Hope University, Liverpool, UK","Computer and Math Sciences, Liverpool Hope University, England"],"affiliations":[{"raw_affiliation_string":"Computer and Math Sciences, Liverpool Hope University, Liverpool, UK","institution_ids":["https://openalex.org/I44852757"]},{"raw_affiliation_string":"Computer and Math Sciences, Liverpool Hope University, England","institution_ids":["https://openalex.org/I44852757"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5032635465"],"corresponding_institution_ids":["https://openalex.org/I170979836"],"apc_list":null,"apc_paid":null,"fwci":1.2879,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.82653943,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":1.0,"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":1.0,"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/T10879","display_name":"Robotic Locomotion and Control","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.8567575216293335},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.705822229385376},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6787469387054443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6437937021255493},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6398714184761047},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6327343583106995},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5902875661849976},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5664687156677246},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.5169505476951599},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.44097042083740234},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2670569121837616},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23614877462387085},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1295657455921173}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8567575216293335},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.705822229385376},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6787469387054443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6437937021255493},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6398714184761047},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6327343583106995},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5902875661849976},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5664687156677246},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.5169505476951599},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.44097042083740234},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2670569121837616},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23614877462387085},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1295657455921173},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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.6089465","is_oa":false,"landing_page_url":"https://doi.org/10.1109/nabic.2011.6089465","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":[{"score":0.8999999761581421,"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1988543053","https://openalex.org/W2025148441","https://openalex.org/W2033726355","https://openalex.org/W2103120971","https://openalex.org/W2105306717","https://openalex.org/W2131242347","https://openalex.org/W2131286638","https://openalex.org/W2166531026","https://openalex.org/W4238341218"],"related_works":["https://openalex.org/W1941703695","https://openalex.org/W3131574667","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153","https://openalex.org/W3154539612"],"abstract_inverted_index":{"In":[0],"this":[1,55],"paper":[2],"we":[3,17,49],"propose":[4],"an":[5],"energy":[6,85],"efficient":[7],"method":[8],"for":[9],"path":[10,33,86,124],"planning":[11,115,125],"by":[12],"a":[13,20,25,31,51,97,159],"robot":[14],"arm.":[15],"First":[16],"have":[18,87],"developed":[19],"cost":[21],"function":[22],"that":[23,62],"provides":[24],"set":[26,56,77],"of":[27,57,73,78,106,109,161],"via":[28],"points":[29,59],"determining":[30],"suitable":[32,52],"according":[34],"to":[35,54,60,122,158],"the":[36,40,63,71,83,103,119,123],"obstacles":[37],"present":[38],"in":[39,45,113],"surroundings":[41],"and":[42,67,132,151,153],"other":[43],"restrictions":[44],"its":[46],"motion.":[47],"Then":[48],"fit":[50],"polynomial":[53],"interior":[58],"ensure":[61],"journey":[64],"is":[65,96,116,127,148],"smooth":[66],"takes":[68],"place":[69],"with":[70],"consumption":[72],"minimum":[74,84],"energy.":[75],"The":[76,137,145],"via-points":[79],"as":[80,82],"well":[81],"been":[88,141],"determined":[89,135],"using":[90],"IWO":[91],"(Invasive":[92],"Weed":[93],"Optimization)":[94],"which":[95],"new":[98],"search":[99],"heuristic":[100],"based":[101],"on":[102],"colonizing":[104],"property":[105],"weeds.":[107],"Application":[108],"such":[110],"evolutionary":[111],"algorithms":[112],"trajectory":[114],"advantageous":[117],"because":[118],"exact":[120],"solution":[121],"problem":[126],"not":[128],"always":[129],"available":[130],"beforehand":[131],"must":[133],"be":[134,155],"dynamically.":[136],"entire":[138],"procedure":[139],"has":[140],"demonstrated":[142],"through":[143],"simulations.":[144],"above":[146],"formulation":[147],"very":[149],"simple":[150],"versatile":[152],"can":[154],"effectively":[156],"applied":[157],"variety":[160],"situations.":[162]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}