{"id":"https://openalex.org/W3173053706","doi":"https://doi.org/10.1088/1742-6596/1881/2/022046","title":"Robot Path Planning Method Based on Genetic Algorithm","display_name":"Robot Path Planning Method Based on Genetic Algorithm","publication_year":2021,"publication_date":"2021-04-01","ids":{"openalex":"https://openalex.org/W3173053706","doi":"https://doi.org/10.1088/1742-6596/1881/2/022046","mag":"3173053706"},"language":"en","primary_location":{"id":"doi:10.1088/1742-6596/1881/2/022046","doi":"https://doi.org/10.1088/1742-6596/1881/2/022046","is_oa":true,"landing_page_url":"https://doi.org/10.1088/1742-6596/1881/2/022046","pdf_url":"https://iopscience.iop.org/article/10.1088/1742-6596/1881/2/022046/pdf","source":{"id":"https://openalex.org/S4210187594","display_name":"Journal of Physics Conference Series","issn_l":"1742-6588","issn":["1742-6588","1742-6596"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","vabb-shw"],"host_organization":"https://openalex.org/P4310320083","host_organization_name":"IOP Publishing","host_organization_lineage":["https://openalex.org/P4310320083","https://openalex.org/P4310311669"],"host_organization_lineage_names":["IOP Publishing","Institute of Physics"],"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 Physics: Conference Series","raw_type":"journal-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://iopscience.iop.org/article/10.1088/1742-6596/1881/2/022046/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102203007","display_name":"Juan Shao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4210123599","display_name":"Liaoning Jianzhu Vocational University","ror":"https://ror.org/03wtdg769","country_code":"CN","type":"education","lineage":["https://openalex.org/I4210123599"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Juan Shao","raw_affiliation_strings":["Liaoning Jianzhu Vocational College, No. 24, Qingnian Street, Liaoyang 111000 City, Liaoning Province, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Liaoning Jianzhu Vocational College, No. 24, Qingnian Street, Liaoyang 111000 City, Liaoning Province, China","institution_ids":["https://openalex.org/I4210123599"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5102203007"],"corresponding_institution_ids":["https://openalex.org/I4210123599"],"apc_list":null,"apc_paid":null,"fwci":3.3161,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.94048708,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"1881","issue":"2","first_page":"022046","last_page":"022046"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.0005000000237487257,"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.0,"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/robot-path-planning","display_name":"robot path planning","score":0.9879999756813049},{"id":"https://openalex.org/keywords/mobile-robots","display_name":"mobile robots","score":0.8149999976158142},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"genetic algorithm","score":0.906000018119812},{"id":"https://openalex.org/keywords/obstacle-avoidance","display_name":"obstacle avoidance","score":0.6330000162124634},{"id":"https://openalex.org/keywords/dynamic-path-planning","display_name":"dynamic path planning","score":0.6119999885559082},{"id":"https://openalex.org/keywords/static-environments","display_name":"static environments","score":0.722000002861023},{"id":"https://openalex.org/keywords/adaptive-mutation-rate","display_name":"adaptive mutation rate","score":0.7089999914169312},{"id":"https://openalex.org/keywords/crossover-rate","display_name":"crossover rate","score":0.8259999752044678},{"id":"https://openalex.org/keywords/local-minima","display_name":"local minima","score":0.7950000166893005},{"id":"https://openalex.org/keywords/fitness-function","display_name":"fitness function","score":0.824999988079071},{"id":"https://openalex.org/keywords/dijkstra-algorithm-comparison","display_name":"Dijkstra algorithm comparison","score":0.628000020980835}],"concepts":[{"id":"https://openalex.org/C122507166","wikidata":"https://www.wikidata.org/wiki/Q628906","display_name":"Crossover","level":2,"score":0.73991858959198},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6653971672058105},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.6445837020874023},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.6401816606521606},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6370885372161865},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6275074481964111},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.49699094891548157},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47065913677215576},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4330374002456665},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4314424395561218},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4175126850605011},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38069599866867065},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.22002887725830078},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17111879587173462},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1088/1742-6596/1881/2/022046","doi":"https://doi.org/10.1088/1742-6596/1881/2/022046","is_oa":true,"landing_page_url":"https://doi.org/10.1088/1742-6596/1881/2/022046","pdf_url":"https://iopscience.iop.org/article/10.1088/1742-6596/1881/2/022046/pdf","source":{"id":"https://openalex.org/S4210187594","display_name":"Journal of Physics Conference Series","issn_l":"1742-6588","issn":["1742-6588","1742-6596"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","vabb-shw"],"host_organization":"https://openalex.org/P4310320083","host_organization_name":"IOP Publishing","host_organization_lineage":["https://openalex.org/P4310320083","https://openalex.org/P4310311669"],"host_organization_lineage_names":["IOP Publishing","Institute of Physics"],"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 Physics: Conference Series","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1088/1742-6596/1881/2/022046","doi":"https://doi.org/10.1088/1742-6596/1881/2/022046","is_oa":true,"landing_page_url":"https://doi.org/10.1088/1742-6596/1881/2/022046","pdf_url":"https://iopscience.iop.org/article/10.1088/1742-6596/1881/2/022046/pdf","source":{"id":"https://openalex.org/S4210187594","display_name":"Journal of Physics Conference Series","issn_l":"1742-6588","issn":["1742-6588","1742-6596"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-class-a","anvur-scientific","cwts-core","jufo-1","norway-1","poland-40","vabb-shw"],"host_organization":"https://openalex.org/P4310320083","host_organization_name":"IOP Publishing","host_organization_lineage":["https://openalex.org/P4310320083","https://openalex.org/P4310311669"],"host_organization_lineage_names":["IOP Publishing","Institute of Physics"],"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 Physics: Conference Series","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3173053706.pdf","grobid_xml":"https://content.openalex.org/works/W3173053706.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W201359469","https://openalex.org/W2192308205","https://openalex.org/W2293398679","https://openalex.org/W2553536170","https://openalex.org/W2990595235"],"related_works":["https://openalex.org/W1978888935","https://openalex.org/W2107420138","https://openalex.org/W2977684190","https://openalex.org/W4386764015","https://openalex.org/W2153353727","https://openalex.org/W2392586168","https://openalex.org/W2005888650","https://openalex.org/W3033418948","https://openalex.org/W3184502348","https://openalex.org/W2393224382"],"abstract_inverted_index":{"Abstract":[0],"Intelligent":[1],"mobile":[2,91,114],"robots":[3,5],"are":[4,50,223,230],"that":[6,195,263],"can":[7,180,260],"automatically":[8],"complete":[9],"driving":[10],"tasks":[11],"without":[12],"human":[13],"intervention.":[14],"Route":[15],"planning":[16,78,241,249,270],"is":[17,26,68,138,171,243,251],"the":[18,29,35,40,44,53,59,74,87,95,110,141,159,165,168,182,193,196,204,208,227,239,246,265,268],"main":[19],"problem":[20,112,194],"in":[21,73,133,207,212,264,284],"robotics":[22],"research.":[23,79],"The":[24,232],"goal":[25],"to":[27,43,108,125,155,191,203],"find":[28],"lowest":[30],"cost,":[31],"conflict-free":[32],"route":[33,42,77],"from":[34],"known":[36,45],"starting":[37],"point":[38,198],"of":[39,56,65,76,90,99,113,143,150,161,219,234],"obstacle":[41],"end":[46],"point.":[47],"Genetic":[48],"algorithms":[49],"based":[51,129,272],"on":[52,120,130,238,273],"natural":[54],"selection":[55],"populations":[57],"and":[58,62,97,135,148,176,188,226,245],"random,":[60],"repetitive":[61],"evolutionary":[63],"processes":[64],"genetics.":[66],"This":[67],"a":[69,103,123],"very":[70],"effective":[71],"algorithm":[72,105,132,170,183,275,283],"field":[75],"In":[80,140],"this":[81],"article,":[82],"I":[83],"will":[84],"first":[85],"explain":[86],"design":[88,142],"principles":[89],"robots.":[92,115],"After":[93],"comparing":[94],"advantages":[96],"disadvantages":[98],"various":[100],"routing":[101,111],"methods,":[102,258],"genetic":[104,121,131,144,169,274],"was":[106],"chosen":[107],"solve":[109,192],"Then,":[116],"through":[117,173],"detailed":[118],"research":[119],"algorithm,":[122],"solution":[124],"robot":[126],"path":[127,240,248,269],"programming":[128],"static":[134,214],"dynamic":[136,247],"environments":[137,215],"proposed.":[139],"operons,":[145],"standardization,":[146],"insertion":[147],"deletion":[149],"operons":[151],"have":[152],"been":[153],"added":[154],"make":[156],"up":[157],"for":[158],"lack":[160],"basic":[162],"operons.":[163],"At":[164],"same":[166,266],"time,":[167],"optimized":[172],"adaptive":[174,189],"mutation":[175],"crossover":[177],"rate.":[178],"You":[179],"improve":[181],"by":[184],"adding":[185],"new":[186],"operators":[187],"methods":[190],"target":[197],"cannot":[199],"be":[200,261],"reached":[201],"due":[202],"local":[205],"minima":[206],"evolution":[209],"process.":[210],"Finally,":[211],"three":[213],"with":[216,256],"different":[217,235],"levels":[218],"complexity,":[220],"simulation":[221,228,250],"experiments":[222],"carried":[224,252],"out":[225],"results":[229,242],"analyzed.":[231],"influence":[233],"fitness":[236],"parameters":[237],"discussed,":[244],"out.":[253],"Through":[254],"comparison":[255],"other":[257],"it":[259],"found":[262],"environment,":[267],"method":[271],"saves":[276],"at":[277],"least":[278],"5%":[279],"time":[280],"than":[281],"Dijkstra":[282],"search":[285],"time.":[286]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":1}],"updated_date":"2026-10-01T08:54:57.152042","created_date":"2021-06-22T00:00:00"}