{"id":"https://openalex.org/W2418899931","doi":"https://doi.org/10.1155/2016/3620895","title":"Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment","display_name":"Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2418899931","doi":"https://doi.org/10.1155/2016/3620895","mag":"2418899931"},"language":"en","primary_location":{"id":"doi:10.1155/2016/3620895","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2016/3620895","pdf_url":"http://downloads.hindawi.com/journals/jece/2016/3620895.pdf","source":{"id":"https://openalex.org/S174662166","display_name":"Journal of Electrical and Computer Engineering","issn_l":"2090-0147","issn":["2090-0147","2090-0155"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Electrical and Computer Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"http://downloads.hindawi.com/journals/jece/2016/3620895.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066218069","display_name":"Yongfeng Dong","orcid":"https://orcid.org/0000-0003-1126-9075"},"institutions":[{"id":"https://openalex.org/I184843921","display_name":"Hebei University of Technology","ror":"https://ror.org/018hded08","country_code":"CN","type":"education","lineage":["https://openalex.org/I184843921"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yong-feng Dong","raw_affiliation_strings":["School of Computer Science and Engineering, Big Data Computing Key Laboratory of Hebei Province, Hebei University of Technology, No. 5340 Xiping Road, Shuangkou, Beichen District, Tianjin 300401, China"],"raw_orcid":"https://orcid.org/0000-0003-1126-9075","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Big Data Computing Key Laboratory of Hebei Province, Hebei University of Technology, No. 5340 Xiping Road, Shuangkou, Beichen District, Tianjin 300401, China","institution_ids":["https://openalex.org/I184843921"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015234712","display_name":"Hong-mei Xia","orcid":null},"institutions":[{"id":"https://openalex.org/I184843921","display_name":"Hebei University of Technology","ror":"https://ror.org/018hded08","country_code":"CN","type":"education","lineage":["https://openalex.org/I184843921"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hong-mei Xia","raw_affiliation_strings":["School of Computer Science and Engineering, Hebei University of Technology, No. 5340 Xiping Road, Shuangkou, Beichen District, Tianjin 300401, China"],"raw_orcid":"https://orcid.org/0000-0002-5944-0591","affiliations":[{"raw_affiliation_string":"School of Computer Science and Engineering, Hebei University of Technology, No. 5340 Xiping Road, Shuangkou, Beichen District, Tianjin 300401, China","institution_ids":["https://openalex.org/I184843921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072106395","display_name":"Yancong Zhou","orcid":"https://orcid.org/0000-0003-0273-0595"},"institutions":[{"id":"https://openalex.org/I110109458","display_name":"Tianjin University of Commerce","ror":"https://ror.org/02b6amy98","country_code":"CN","type":"education","lineage":["https://openalex.org/I110109458"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yan-cong Zhou","raw_affiliation_strings":["School of Information Engineering, Tianjin University of Commerce, Tianjin, China"],"raw_orcid":"https://orcid.org/0000-0003-0273-0595","affiliations":[{"raw_affiliation_string":"School of Information Engineering, Tianjin University of Commerce, Tianjin, China","institution_ids":["https://openalex.org/I110109458"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5015234712"],"corresponding_institution_ids":["https://openalex.org/I184843921"],"apc_list":{"value":1400,"currency":"USD","value_usd":1400},"apc_paid":{"value":1400,"currency":"USD","value_usd":1400},"fwci":0.5068,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.71905875,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"2016","issue":null,"first_page":"1","last_page":"10"},"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T11615","display_name":"Control and Dynamics of Mobile Robots","score":0.9789000153541565,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/crossover","display_name":"Crossover","score":0.7598085999488831},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6189918518066406},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5698236227035522},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5665900707244873},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5539436340332031},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5245469212532043},{"id":"https://openalex.org/keywords/premature-convergence","display_name":"Premature convergence","score":0.5075279474258423},{"id":"https://openalex.org/keywords/population","display_name":"Population","score":0.48808538913726807},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4797431230545044},{"id":"https://openalex.org/keywords/jump","display_name":"Jump","score":0.47149914503097534},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4524376392364502},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.4486352801322937},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.42013299465179443},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.39811208844184875},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.39750802516937256},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3313453793525696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3200153708457947},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.18956530094146729},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17274296283721924},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11855438351631165},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08661213517189026}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.7598085999488831},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6189918518066406},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5698236227035522},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5665900707244873},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5539436340332031},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5245469212532043},{"id":"https://openalex.org/C58758708","wikidata":"https://www.wikidata.org/wiki/Q7240233","display_name":"Premature convergence","level":3,"score":0.5075279474258423},{"id":"https://openalex.org/C2908647359","wikidata":"https://www.wikidata.org/wiki/Q2625603","display_name":"Population","level":2,"score":0.48808538913726807},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4797431230545044},{"id":"https://openalex.org/C2780695682","wikidata":"https://www.wikidata.org/wiki/Q4005959","display_name":"Jump","level":2,"score":0.47149914503097534},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4524376392364502},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.4486352801322937},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.42013299465179443},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.39811208844184875},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.39750802516937256},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3313453793525696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3200153708457947},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.18956530094146729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17274296283721924},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11855438351631165},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08661213517189026},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C149923435","wikidata":"https://www.wikidata.org/wiki/Q37732","display_name":"Demography","level":1,"score":0.0},{"id":"https://openalex.org/C144024400","wikidata":"https://www.wikidata.org/wiki/Q21201","display_name":"Sociology","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1155/2016/3620895","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2016/3620895","pdf_url":"http://downloads.hindawi.com/journals/jece/2016/3620895.pdf","source":{"id":"https://openalex.org/S174662166","display_name":"Journal of Electrical and Computer Engineering","issn_l":"2090-0147","issn":["2090-0147","2090-0155"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Electrical and Computer Engineering","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:31333316143e4541a8db87992113ff5e","is_oa":true,"landing_page_url":"https://doaj.org/article/31333316143e4541a8db87992113ff5e","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Journal of Electrical and Computer Engineering, Vol 2016 (2016)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.1155/2016/3620895","is_oa":true,"landing_page_url":"https://doi.org/10.1155/2016/3620895","pdf_url":"http://downloads.hindawi.com/journals/jece/2016/3620895.pdf","source":{"id":"https://openalex.org/S174662166","display_name":"Journal of Electrical and Computer Engineering","issn_l":"2090-0147","issn":["2090-0147","2090-0155"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319869","host_organization_name":"Hindawi Publishing Corporation","host_organization_lineage":["https://openalex.org/P4310319869"],"host_organization_lineage_names":["Hindawi Publishing Corporation"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Electrical and Computer Engineering","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2418899931.pdf","grobid_xml":"https://content.openalex.org/works/W2418899931.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1974636618","https://openalex.org/W1978646367","https://openalex.org/W1993262167","https://openalex.org/W2082319470","https://openalex.org/W2109718723","https://openalex.org/W2117463424","https://openalex.org/W2126015197","https://openalex.org/W2132985387","https://openalex.org/W2333576774","https://openalex.org/W2352357527","https://openalex.org/W2359881052","https://openalex.org/W2362774640","https://openalex.org/W2366379852","https://openalex.org/W2391628752","https://openalex.org/W2392181345","https://openalex.org/W2392586168"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2110531080","https://openalex.org/W4221129498","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W4310124294","https://openalex.org/W143403600"],"abstract_inverted_index":{"In":[0],"the":[1,7,14,21,29,38,53,68,73,86,92,97,106,113,123,143,158,192],"smart":[2],"home":[3],"environment,":[4],"aiming":[5],"at":[6,63,191],"disordered":[8],"and":[9,56,80,147,177,185],"multiple":[10],"destinations":[11],"path":[12,32,169,189],"planning,":[13],"sequencing":[15],"rule":[16],"is":[17,34,48,163],"proposed":[18],"to":[19,37,67,102,122,131],"determine":[20],"order":[22],"of":[23,40,75,94,105,145,149],"destinations.":[24],"Within":[25],"each":[26],"branching":[27],"process,":[28],"initial":[30],"feasible":[31],"set":[33],"generated":[35],"according":[36],"law":[39],"attractive":[41],"destination.":[42],"A":[43],"sinusoidal":[44],"adaptive":[45],"genetic":[46],"algorithm":[47,111,140,151],"adopted.":[49],"It":[50,153],"can":[51,90,100,141,154,181],"calculate":[52],"crossover":[54],"probability":[55,58],"mutation":[57],"adaptively":[59],"changing":[60],"with":[61,119,175],"environment":[62,118,174],"any":[64],"time.":[65,194],"According":[66,121],"cultural-genetic":[69,139],"algorithm,":[70],"it":[71,162,180],"introduces":[72],"concept":[74],"reducing":[76,81],"turns":[77],"by":[78,83],"parallelogram":[79],"length":[82],"triangle":[84],"in":[85,116,172],"belief":[87],"space,":[88],"which":[89],"improve":[91],"quality":[93],"population.":[95],"And":[96,161],"fallback":[98],"strategy":[99],"help":[101],"jump":[103],"out":[104],"\u201cU\u201d":[107],"trap":[108],"effectively.":[109,152],"The":[110,134],"analyses":[112],"virtual":[114],"collision":[115,125,183],"dynamic":[117,178],"obstacles.":[120,133],"different":[124,127],"types,":[126],"strategies":[128],"are":[129],"executed":[130],"avoid":[132,155,182],"experimental":[135],"results":[136],"show":[137],"that":[138],"overcome":[142],"problems":[144],"premature":[146],"convergence":[148],"original":[150],"getting":[156],"into":[157],"local":[159],"optimum.":[160],"more":[164],"effective":[165],"for":[166],"mobile":[167],"robot":[168],"planning.":[170],"Even":[171],"complex":[173],"static":[176],"obstacles,":[179],"safely":[184],"plan":[186],"an":[187],"optimal":[188],"rapidly":[190],"same":[193]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}