{"id":"https://openalex.org/W3006540802","doi":"https://doi.org/10.1109/iciibms46890.2019.8991502","title":"Research on Robot Path Planning Based on Dijkstra and Ant Colony Optimization","display_name":"Research on Robot Path Planning Based on Dijkstra and Ant Colony Optimization","alternate_titles":[],"publication_year":2019,"publication_date":"2019-11-01","ids":{"openalex":"https://openalex.org/W3006540802","doi":"https://doi.org/10.1109/iciibms46890.2019.8991502","mag":"3006540802"},"language":"en","primary_location":{"id":"doi:10.1109/iciibms46890.2019.8991502","doi":"https://doi.org/10.1109/iciibms46890.2019.8991502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iciibms46890.2019.8991502","pdf_url":null,"source":{"id":"https://openalex.org/S7407087840","display_name":"International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W3006540802"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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":null,"display_name":"Zhen Nie","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhen Nie","raw_affiliation_strings":["School of electrical and Electronic Engineering, Shanghai Institute of technology, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of electrical and Electronic Engineering, Shanghai Institute of technology, Shanghai, China","institution_ids":["https://openalex.org/I67001856"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101054697","display_name":"Huailin Zhao","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I67001856","display_name":"Shanghai Institute of Technology","ror":"https://ror.org/00fjzqj15","country_code":"CN","type":"education","lineage":["https://openalex.org/I67001856"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Huailin Zhao","raw_affiliation_strings":["School of electrical and Electronic Engineering, Shanghai Institute of technology, Shanghai, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of electrical and Electronic Engineering, Shanghai Institute of technology, Shanghai, China","institution_ids":["https://openalex.org/I67001856"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I67001856"],"apc_list":null,"apc_paid":null,"fwci":4.929,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.96918143,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"222","last_page":"226"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9980000257492065,"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.9980000257492065,"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.001500000013038516,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.0,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot-path-planning","display_name":"robot path planning","score":0.9990000128746033},{"id":"https://openalex.org/keywords/dijkstra-s-algorithm","display_name":"Dijkstra's algorithm","score":0.9900000095367432},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":1.0},{"id":"https://openalex.org/keywords/hybrid-method","display_name":"hybrid algorithm","score":0.8930000066757202},{"id":"https://openalex.org/keywords/visual-graph","display_name":"visual graphs","score":0.6940000057220459},{"id":"https://openalex.org/keywords/shortest-path-optimization","display_name":"shortest path optimization","score":0.7590000033378601},{"id":"https://openalex.org/keywords/known-environment","display_name":"known environment","score":0.7749999761581421}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8628079295158386},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8330085277557373},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7160456776618958},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6392754316329956},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6347931623458862},{"id":"https://openalex.org/C103578098","wikidata":"https://www.wikidata.org/wiki/Q277680","display_name":"A* search algorithm","level":2,"score":0.6211690902709961},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5999059081077576},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.5985310673713684},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5817829966545105},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5662398934364319},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5565454959869385},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5294213891029358},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5160050392150879},{"id":"https://openalex.org/C2780365114","wikidata":"https://www.wikidata.org/wiki/Q169478","display_name":"MATLAB","level":2,"score":0.43245214223861694},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.4229530990123749},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4223115146160126},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3926549553871155},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35421162843704224},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3121340870857239},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2220635712146759},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.13990935683250427},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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/iciibms46890.2019.8991502","doi":"https://doi.org/10.1109/iciibms46890.2019.8991502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iciibms46890.2019.8991502","pdf_url":null,"source":{"id":"https://openalex.org/S7407087840","display_name":"International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W2007852842","https://openalex.org/W2223727688","https://openalex.org/W2350455978","https://openalex.org/W2394294774","https://openalex.org/W2781716498","https://openalex.org/W2912906642","https://openalex.org/W2916150073","https://openalex.org/W2938278435","https://openalex.org/W2939018330"],"related_works":["https://openalex.org/W3134346593","https://openalex.org/W4313267221","https://openalex.org/W2023917723","https://openalex.org/W2363398454","https://openalex.org/W7131226118","https://openalex.org/W2100561003","https://openalex.org/W2131225422","https://openalex.org/W4362709184","https://openalex.org/W2760353413","https://openalex.org/W2024211444"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"the":[3,28,32,50,58,63,66,74],"path":[4,47,60,64,75,85,91],"planning":[5,76],"problem":[6],"in":[7],"known":[8],"environments":[9],"was":[10,43,52],"studied.":[11],"According":[12],"to":[13,26,56,61],"Dijkstra":[14,41],"algorithm":[15,25,42,77,94],"and":[16,54,87,97],"ant":[17],"colony":[18],"optimization":[19],"(ACO),":[20],"we":[21],"designed":[22],"a":[23],"hybrid":[24],"search":[27,86],"path.":[29],"Based":[30],"on":[31,70,79],"environment":[33],"model,":[34],"constructed":[35],"by":[36],"using":[37],"visual":[38],"graph":[39],"method,":[40],"used":[44,55],"for":[45],"initial":[46,59],"planning.":[48,92],"Then":[49],"ACO":[51],"improved":[53],"optimizes":[57],"minimize":[62],"of":[65,84,90],"robot.":[67],"The":[68,93],"simulation":[69],"MATLAB":[71],"showed":[72],"that":[73],"based":[78],"Dijkstra-ACO":[80],"has":[81],"higher":[82],"efficiency":[83],"good":[88],"effect":[89],"is":[95],"effective":[96],"feasible.":[98]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W3006540802","counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":2}],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2020-02-24T00:00:00"}
