{"id":"https://openalex.org/W2054059338","doi":"https://doi.org/10.1109/sis.2014.7011779","title":"Naturally inspired optimization algorithms as applied to mobile robotic path planning","display_name":"Naturally inspired optimization algorithms as applied to mobile robotic path planning","publication_year":2014,"publication_date":"2014-12-01","ids":{"openalex":"https://openalex.org/W2054059338","doi":"https://doi.org/10.1109/sis.2014.7011779","mag":"2054059338"},"language":"en","primary_location":{"id":"doi:10.1109/sis.2014.7011779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2014.7011779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Swarm Intelligence","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/A5024783311","display_name":"Steven E. Muldoon","orcid":"https://orcid.org/0000-0001-8171-3675"},"institutions":[{"id":"https://openalex.org/I71792333","display_name":"University of Detroit Mercy","ror":"https://ror.org/0037qsh65","country_code":"US","type":"education","lineage":["https://openalex.org/I71792333"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Steven E. Muldoon","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Detroit-Mercy, Detroit, USA","[Department of Electrical and Computer Engineering, University of Detroit Mercy, Detroit, USA]"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Detroit-Mercy, Detroit, USA","institution_ids":["https://openalex.org/I71792333"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering, University of Detroit Mercy, Detroit, USA]","institution_ids":["https://openalex.org/I71792333"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038203605","display_name":"Chaomin Luo","orcid":"https://orcid.org/0000-0002-7578-3631"},"institutions":[{"id":"https://openalex.org/I71792333","display_name":"University of Detroit Mercy","ror":"https://ror.org/0037qsh65","country_code":"US","type":"education","lineage":["https://openalex.org/I71792333"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chaomin Luo","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, University of Detroit-Mercy, Detroit, USA","[Department of Electrical and Computer Engineering, University of Detroit Mercy, Detroit, USA]"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, University of Detroit-Mercy, Detroit, USA","institution_ids":["https://openalex.org/I71792333"]},{"raw_affiliation_string":"[Department of Electrical and Computer Engineering, University of Detroit Mercy, Detroit, USA]","institution_ids":["https://openalex.org/I71792333"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031148687","display_name":"Shen Furao","orcid":null},"institutions":[{"id":"https://openalex.org/I36399199","display_name":"Nanjing University of Science and Technology","ror":"https://ror.org/00xp9wg62","country_code":"CN","type":"education","lineage":["https://openalex.org/I36399199"]},{"id":"https://openalex.org/I881766915","display_name":"Nanjing University","ror":"https://ror.org/01rxvg760","country_code":"CN","type":"education","lineage":["https://openalex.org/I881766915"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Furao Shen","raw_affiliation_strings":["Robotic Intelligence & Neural Computing Lab, Dept. of Computer Science and Technology, Nanjing University, Nanjing, China","Robotic Intelligence & Neural Computing Lab, Dept. of Computer Science and Technology, Nanjing University, Nanjing, China"],"affiliations":[{"raw_affiliation_string":"Robotic Intelligence & Neural Computing Lab, Dept. of Computer Science and Technology, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I36399199"]},{"raw_affiliation_string":"Robotic Intelligence & Neural Computing Lab, Dept. of Computer Science and Technology, Nanjing University, Nanjing, China","institution_ids":["https://openalex.org/I881766915"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075285062","display_name":"Hongwei Mo","orcid":"https://orcid.org/0000-0003-4369-6856"},"institutions":[{"id":"https://openalex.org/I151727225","display_name":"Harbin Engineering University","ror":"https://ror.org/03x80pn82","country_code":"CN","type":"education","lineage":["https://openalex.org/I151727225"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hongwei Mo","raw_affiliation_strings":["Automation College, Harbin Engineering University, Harbin, China"],"affiliations":[{"raw_affiliation_string":"Automation College, Harbin Engineering University, Harbin, China","institution_ids":["https://openalex.org/I151727225"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5024783311"],"corresponding_institution_ids":["https://openalex.org/I71792333"],"apc_list":null,"apc_paid":null,"fwci":0.2439,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.59113663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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.9958999752998352,"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.9866999983787537,"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.6727080345153809},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6564539670944214},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.6559464335441589},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.649172306060791},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.6237014532089233},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5640344619750977},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.520315408706665},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5093408823013306},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4860871136188507},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.4828691780567169},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.43840548396110535},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4111517369747162},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.3296706974506378},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2410372495651245},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.20629408955574036},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.18547487258911133},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1105378270149231}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6727080345153809},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6564539670944214},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6559464335441589},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.649172306060791},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6237014532089233},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5640344619750977},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.520315408706665},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5093408823013306},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4860871136188507},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4828691780567169},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.43840548396110535},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4111517369747162},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.3296706974506378},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2410372495651245},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.20629408955574036},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18547487258911133},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1105378270149231},{"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/sis.2014.7011779","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sis.2014.7011779","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE Symposium on Swarm Intelligence","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.4399999976158142}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W122392886","https://openalex.org/W599184467","https://openalex.org/W1534964335","https://openalex.org/W1547694211","https://openalex.org/W1559717464","https://openalex.org/W1588696863","https://openalex.org/W1978646367","https://openalex.org/W1994593272","https://openalex.org/W2015136933","https://openalex.org/W2018002617","https://openalex.org/W2026316333","https://openalex.org/W2051611154","https://openalex.org/W2059429706","https://openalex.org/W2090254509","https://openalex.org/W2109266171","https://openalex.org/W2114178273","https://openalex.org/W2114304568","https://openalex.org/W2117766032","https://openalex.org/W2124823351","https://openalex.org/W2125569607","https://openalex.org/W2134988446","https://openalex.org/W2135851310","https://openalex.org/W2151299975","https://openalex.org/W2161529113","https://openalex.org/W2165839102","https://openalex.org/W2186037780","https://openalex.org/W2214591607","https://openalex.org/W2486226698","https://openalex.org/W3145839677","https://openalex.org/W3149206622","https://openalex.org/W4249093631","https://openalex.org/W6604970260","https://openalex.org/W6632201914","https://openalex.org/W6633495986","https://openalex.org/W6654506329","https://openalex.org/W6676945587","https://openalex.org/W6686657132","https://openalex.org/W6688417913","https://openalex.org/W6722434303"],"related_works":["https://openalex.org/W4385871958","https://openalex.org/W1997193297","https://openalex.org/W4245157707","https://openalex.org/W2908391583","https://openalex.org/W2392101695","https://openalex.org/W2161373934","https://openalex.org/W2369428395","https://openalex.org/W2120093588","https://openalex.org/W2361943787","https://openalex.org/W2981400081"],"abstract_inverted_index":{"Global":[0],"path":[1,35,92,155],"planning":[2,156],"as":[3,15,132],"applied":[4,85],"to":[5,86,144],"mobile":[6,90],"robotics":[7],"can":[8,51],"be":[9],"approached":[10],"in":[11,152,182],"a":[12,60,101,135,153],"similar":[13],"fashion":[14],"classic":[16],"optimization":[17],"problems":[18],"involving":[19],"combinational":[20],"constraints":[21],"(e.g.":[22],"the":[23,33,53,87,147],"Traveling":[24],"Salesman":[25],"Problem).":[26],"A":[27,158],"single,":[28],"exact":[29],"optimal":[30],"solution":[31],"for":[32,177],"shortest":[34],"may":[36],"not":[37],"exist,":[38],"and":[39,44,75,84,113,141,150,174,180],"obtaining":[40],"near-optimal":[41],"solutions":[42],"selected":[43],"ranked":[45],"by":[46],"criteria,":[47],"or":[48,97,110,131],"deemed":[49],"\u201cgood-enough\u201d,":[50],"satisfy":[52],"problem.":[54],"An":[55],"overview":[56],"is":[57],"provided":[58],"on":[59,128],"select":[61],"subset":[62],"of":[63,89,104,134,138,162,169,172],"naturally":[64,105],"inspired":[65,106],"iterative":[66,139],"search":[67],"algorithms;":[68],"Simulated":[69],"Annealing":[70],"(SA),":[71],"Genetic":[72],"Algorithm":[73],"(GA),":[74],"Ant":[76],"Colony":[77],"Optimization":[78],"(ACO)":[79],"have":[80,125],"all":[81],"been":[82,120,126],"studied":[83],"task":[88],"robotic":[91],"planning.":[93],"These":[94],"three":[95],"techniques":[96],"algorithms":[98,124,140],"(respectively)":[99],"represent":[100],"broader":[102],"range":[103],"physical":[107],"processes,":[108,112],"evolutionary":[109],"biological":[111],"animal":[114],"kingdom":[115],"behavioral":[116],"examples.":[117],"It":[118],"has":[119],"demonstrated":[121],"that":[122],"these":[123],"utilized":[127],"their":[129],"own,":[130],"part":[133],"collaborative":[136],"hybridization":[137],"heuristic":[142],"modifiers,":[143],"effectively":[145],"balance":[146],"constraints,":[148],"strengths":[149],"weaknesses":[151],"given":[154],"approach.":[157],"brief":[159],"contextual":[160],"summary":[161],"current":[163],"literature":[164],"provides":[165],"insights":[166],"regarding":[167],"implementation":[168],"this":[170,183],"category":[171],"algorithms,":[173],"suggests":[175],"approaches":[176],"future":[178],"experimentation":[179],"research":[181],"topic":[184],"area.":[185]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}