{"id":"https://openalex.org/W3045218645","doi":"https://doi.org/10.1109/iccicc46617.2019.9146050","title":"Dynamic Path Optimization for Robot Route Planning","display_name":"Dynamic Path Optimization for Robot Route Planning","publication_year":2019,"publication_date":"2019-07-01","ids":{"openalex":"https://openalex.org/W3045218645","doi":"https://doi.org/10.1109/iccicc46617.2019.9146050","mag":"3045218645"},"language":"en","primary_location":{"id":"doi:10.1109/iccicc46617.2019.9146050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccicc46617.2019.9146050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 18th International Conference on Cognitive Informatics &amp; Cognitive Computing (ICCI*CC)","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/A5036172354","display_name":"Ying Huang","orcid":"https://orcid.org/0000-0001-8862-0092"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ying Huang","raw_affiliation_strings":["Visiting Scholar, Lab for Computational Intelligence and Cognitive Systems, University of Calgary, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Visiting Scholar, Lab for Computational Intelligence and Cognitive Systems, University of Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012322217","display_name":"Yingxu Wang","orcid":"https://orcid.org/0000-0003-0445-3632"},"institutions":[{"id":"https://openalex.org/I168635309","display_name":"University of Calgary","ror":"https://ror.org/03yjb2x39","country_code":"CA","type":"education","lineage":["https://openalex.org/I168635309"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Yingxu Wang","raw_affiliation_strings":["Dept. of Electrical & Computer Engineering, International Institute of Cognitive, Informatics and Cognitive Computing, Schulich School of Engineering and Hotchkiss Brain Institute, University of Calgary, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical & Computer Engineering, International Institute of Cognitive, Informatics and Cognitive Computing, Schulich School of Engineering and Hotchkiss Brain Institute, University of Calgary, Canada","institution_ids":["https://openalex.org/I168635309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5051826538","display_name":"Omar A. Zatarain","orcid":"https://orcid.org/0000-0002-7934-7765"},"institutions":[{"id":"https://openalex.org/I193181351","display_name":"Universidad de Guadalajara","ror":"https://ror.org/043xj7k26","country_code":"MX","type":"education","lineage":["https://openalex.org/I193181351"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Omar Zatarain","raw_affiliation_strings":["Departamento de Ciencias Computacionales e Ingenier\u00edas, University of Guadalajara, Mexico"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Departamento de Ciencias Computacionales e Ingenier\u00edas, University of Guadalajara, Mexico","institution_ids":["https://openalex.org/I193181351"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1446,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.62601172,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"53"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13062","display_name":"Cognitive Computing and Networks","score":0.9993000030517578,"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"}},"topics":[{"id":"https://openalex.org/T13062","display_name":"Cognitive Computing and Networks","score":0.9993000030517578,"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/T12029","display_name":"DNA and Biological Computing","score":0.9837999939918518,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T13382","display_name":"Robotics and Automated Systems","score":0.980400025844574,"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/motion-planning","display_name":"Motion planning","score":0.8421791195869446},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.7485111951828003},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6991605758666992},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6963698267936707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6759891510009766},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.5317973494529724},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5232369303703308},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47932541370391846},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.478812038898468},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2984887957572937},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12778151035308838}],"concepts":[{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.8421791195869446},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.7485111951828003},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6991605758666992},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6963698267936707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6759891510009766},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.5317973494529724},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5232369303703308},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47932541370391846},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.478812038898468},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2984887957572937},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12778151035308838},{"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/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","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},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccicc46617.2019.9146050","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccicc46617.2019.9146050","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 18th International Conference on Cognitive Informatics &amp; Cognitive Computing (ICCI*CC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.47999998927116394,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1545037602","https://openalex.org/W1978580424","https://openalex.org/W1983859915","https://openalex.org/W2031751816","https://openalex.org/W2034088070","https://openalex.org/W2049723463","https://openalex.org/W2085507172","https://openalex.org/W2119394765","https://openalex.org/W2124963399","https://openalex.org/W2145694679","https://openalex.org/W2148247550","https://openalex.org/W2184034910","https://openalex.org/W2234728825","https://openalex.org/W2295470816","https://openalex.org/W2333295699","https://openalex.org/W2335984190","https://openalex.org/W2336690258","https://openalex.org/W2344400972","https://openalex.org/W2504422899","https://openalex.org/W2536131822","https://openalex.org/W2555827514","https://openalex.org/W2895848344","https://openalex.org/W2980390575","https://openalex.org/W3175593498","https://openalex.org/W4231298442","https://openalex.org/W6686268419","https://openalex.org/W6689641870","https://openalex.org/W6702964320"],"related_works":["https://openalex.org/W2648850849","https://openalex.org/W1570961203","https://openalex.org/W2164060583","https://openalex.org/W2127374384","https://openalex.org/W2058994083","https://openalex.org/W2094147845","https://openalex.org/W2380376766","https://openalex.org/W1995929346","https://openalex.org/W2596419101","https://openalex.org/W3143559370"],"abstract_inverted_index":{"Robot":[0],"is":[1],"an":[2,88],"autonomous":[3],"system":[4],"that":[5],"integrates":[6],"advances":[7],"AI":[8],"technologies.":[9,113],"This":[10],"paper":[11],"deals":[12],"with":[13],"the":[14,35,75,105,108],"adaptive":[15],"path":[16,45,49,67,77],"planning":[17,31,93],"and":[18,56,90,99],"optimization":[19,50],"problems":[20],"for":[21,95],"robots":[22,96],"in":[23,97],"dynamic":[24,100],"environments.":[25],"We":[26,41],"propose":[27],"a":[28,43,48,65],"novel":[29],"route":[30,92],"method":[32,71,86,109],"based":[33],"on":[34],"maze":[36],"representation":[37],"of":[38,58,81,107],"workplace":[39],"layouts.":[40],"generate":[42],"universal":[44],"tree":[46],"by":[47],"algorithm.":[51],"Then,":[52],"any":[53,79],"given":[54],"entrances":[55],"exits":[57],"target":[59],"nodes":[60],"can":[61,72],"be":[62],"reduced":[63],"to":[64],"deterministic":[66],"searching":[68],"problem.":[69],"Our":[70],"quickly":[73],"determine":[74],"optimal":[76],"between":[78],"pair":[80],"entrance/exit":[82],"nodes.":[83],"The":[84],"maze-based":[85],"provides":[87],"efficient":[89],"robust":[91],"solution":[94],"real-time":[98],"workplaces.":[101],"Experiments":[102],"have":[103],"demonstrated":[104],"effectiveness":[106],"beyond":[110],"traditional":[111],"heuristic":[112]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
