{"id":"https://openalex.org/W1980454791","doi":"https://doi.org/10.1109/socpar.2011.6089099","title":"Mobile robot path planning by new structured multi-objective genetic algorithm","display_name":"Mobile robot path planning by new structured multi-objective genetic algorithm","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W1980454791","doi":"https://doi.org/10.1109/socpar.2011.6089099","mag":"1980454791"},"language":"en","primary_location":{"id":"doi:10.1109/socpar.2011.6089099","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2011.6089099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference of Soft Computing and Pattern Recognition (SoCPaR)","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/A5021888945","display_name":"Nafiseh Sedaghat","orcid":null},"institutions":[{"id":"https://openalex.org/I110525433","display_name":"Islamic Azad University, Tehran","ror":"https://ror.org/01kzn7k21","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433"]},{"id":"https://openalex.org/I183859904","display_name":"Islamic Azad University, Mashhad","ror":"https://ror.org/00bvysh61","country_code":"IR","type":"education","lineage":["https://openalex.org/I110525433","https://openalex.org/I183859904"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"Nafiseh Sedaghat","raw_affiliation_strings":["Computer Engineering Department, Islamic Azad University, Iran","Computer Engineering Department, Islamic Azad University, Mashhad Branch, Young Researchers Club, Iran"],"affiliations":[{"raw_affiliation_string":"Computer Engineering Department, Islamic Azad University, Iran","institution_ids":["https://openalex.org/I110525433"]},{"raw_affiliation_string":"Computer Engineering Department, Islamic Azad University, Mashhad Branch, Young Researchers Club, Iran","institution_ids":["https://openalex.org/I183859904"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5021888945"],"corresponding_institution_ids":["https://openalex.org/I110525433","https://openalex.org/I183859904"],"apc_list":null,"apc_paid":null,"fwci":1.5682,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.85162434,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"79","last_page":"83"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9901000261306763,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/computer-science","display_name":"Computer science","score":0.7092307806015015},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7081674337387085},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.6486406922340393},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.6134416460990906},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5404253005981445},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.4685056507587433},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.38057368993759155},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34369510412216187},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.1800893247127533},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16757968068122864}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7092307806015015},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7081674337387085},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6486406922340393},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6134416460990906},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5404253005981445},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4685056507587433},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38057368993759155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34369510412216187},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.1800893247127533},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16757968068122864}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/socpar.2011.6089099","is_oa":false,"landing_page_url":"https://doi.org/10.1109/socpar.2011.6089099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 International Conference of Soft Computing and Pattern Recognition (SoCPaR)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.41999998688697815,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W158955209","https://openalex.org/W1905814852","https://openalex.org/W1969436289","https://openalex.org/W2090582776","https://openalex.org/W2116661285","https://openalex.org/W2126105956","https://openalex.org/W2161810229","https://openalex.org/W6673121029"],"related_works":["https://openalex.org/W2122871747","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W3114279067","https://openalex.org/W2161428574","https://openalex.org/W2077416514","https://openalex.org/W2618632915","https://openalex.org/W2359600231","https://openalex.org/W4292862729","https://openalex.org/W2380019117"],"abstract_inverted_index":{"Path":[0],"planning":[1],"problem":[2],"of":[3,19,27,63,120,146,153],"mobile":[4,30,39],"robot":[5,31,40],"is":[6,23],"one":[7,51],"that":[8,73,108],"has":[9,12],"intrigued":[10],"and":[11,55,81,124,142,163],"received":[13],"much":[14],"attention":[15],"throughout":[16],"the":[17,25,77,118,144,151],"history":[18],"robotics,":[20],"since":[21],"it":[22],"at":[24],"essence":[26],"what":[28],"a":[29,61,89,111,126],"needs":[32],"to":[33,44,48,53,58,76,95],"be":[34,42,68],"considered":[35],"truly":[36,59],"\u201cautonomous\u201d.":[37],"A":[38],"must":[41,67],"able":[43],"find":[45],"collision-free":[46],"paths":[47,66,159],"move":[49],"from":[50],"location":[52],"another,":[54],"in":[56,110,156],"order":[57],"show":[60,117,143,150],"level":[62],"intelligence":[64],"these":[65],"optimized":[69],"under":[70],"some":[71],"criteria":[72],"are":[74],"important":[75],"robot,":[78],"working":[79],"space":[80,107],"given":[82],"problem.":[83,98],"In":[84,99],"this":[85,97],"paper":[86],"we":[87,102,116,134],"propose":[88],"new":[90,127],"structured":[91],"multi-objective":[92],"genetic":[93],"algorithm":[94],"solve":[96],"our":[100,132,136,147,154],"method":[101,155],"explore":[103],"only":[104],"valid":[105],"search":[106,113],"results":[109],"smaller":[112],"space.":[114],"Also":[115],"defect":[119],"earlier":[121],"evaluation":[122,128,137],"function":[123,138],"present":[125],"function.":[129],"To":[130],"evaluate":[131],"idea":[133],"compare":[135],"with":[139,160],"other":[140],"ones":[141],"performance":[145],"method.":[148],"Experiments":[149],"ability":[152],"finding":[157],"best":[158],"low":[161],"generation":[162],"population.":[164]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}