{"id":"https://openalex.org/W2906232307","doi":"https://doi.org/10.1145/3277453.3277463","title":"An Oblique Sprint Algorithm with Eight Directions for Micromouse Contests","display_name":"An Oblique Sprint Algorithm with Eight Directions for Micromouse Contests","publication_year":2018,"publication_date":"2018-09-19","ids":{"openalex":"https://openalex.org/W2906232307","doi":"https://doi.org/10.1145/3277453.3277463","mag":"2906232307"},"language":"en","primary_location":{"id":"doi:10.1145/3277453.3277463","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3277453.3277463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Electronics and Electrical Engineering Technology","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/A5072297645","display_name":"Chenhu Yuan","orcid":null},"institutions":[{"id":"https://openalex.org/I198091727","display_name":"Tianjin Polytechnic University","ror":"https://ror.org/00xsr9m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I198091727"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Chenhu Yuan","raw_affiliation_strings":["Tianjin Polytechnic University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Tianjin Polytechnic University, Tianjin, China","institution_ids":["https://openalex.org/I198091727"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100453159","display_name":"Qi Liu","orcid":"https://orcid.org/0000-0001-7485-6344"},"institutions":[{"id":"https://openalex.org/I198091727","display_name":"Tianjin Polytechnic University","ror":"https://ror.org/00xsr9m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I198091727"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qi Liu","raw_affiliation_strings":["Tianjin Polytechnic University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Tianjin Polytechnic University, Tianjin, China","institution_ids":["https://openalex.org/I198091727"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100409020","display_name":"Xiaoming Liu","orcid":"https://orcid.org/0000-0001-6630-489X"},"institutions":[{"id":"https://openalex.org/I198091727","display_name":"Tianjin Polytechnic University","ror":"https://ror.org/00xsr9m91","country_code":"CN","type":"education","lineage":["https://openalex.org/I198091727"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaoming Liu","raw_affiliation_strings":["Tianjin Polytechnic University, Tianjin, China"],"affiliations":[{"raw_affiliation_string":"Tianjin Polytechnic University, Tianjin, China","institution_ids":["https://openalex.org/I198091727"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072297645"],"corresponding_institution_ids":["https://openalex.org/I198091727"],"apc_list":null,"apc_paid":null,"fwci":0.1045,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.47912481,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"118","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9848999977111816,"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.9848999977111816,"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/T12644","display_name":"Wildlife-Road Interactions and Conservation","score":0.9812999963760376,"subfield":{"id":"https://openalex.org/subfields/2303","display_name":"Ecology"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.953000009059906,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/sprint","display_name":"Sprint","score":0.875160276889801},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7448381781578064},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6103552579879761},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6070759296417236},{"id":"https://openalex.org/keywords/oblique-case","display_name":"Oblique case","score":0.5783339738845825},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5283620953559875},{"id":"https://openalex.org/keywords/action","display_name":"Action (physics)","score":0.441017210483551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3680724501609802},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3371133804321289},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.11383965611457825}],"concepts":[{"id":"https://openalex.org/C2776868573","wikidata":"https://www.wikidata.org/wiki/Q46855","display_name":"Sprint","level":2,"score":0.875160276889801},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7448381781578064},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6103552579879761},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6070759296417236},{"id":"https://openalex.org/C160697094","wikidata":"https://www.wikidata.org/wiki/Q1233197","display_name":"Oblique case","level":2,"score":0.5783339738845825},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5283620953559875},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.441017210483551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3680724501609802},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3371133804321289},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11383965611457825},{"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3277453.3277463","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3277453.3277463","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2018 International Conference on Electronics and Electrical Engineering Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W2002451116","https://openalex.org/W2043251218","https://openalex.org/W2046252330","https://openalex.org/W2055185049","https://openalex.org/W2516597714","https://openalex.org/W2603857561","https://openalex.org/W2978127844"],"related_works":["https://openalex.org/W2322263331","https://openalex.org/W1926641957","https://openalex.org/W2125815613","https://openalex.org/W4313472654","https://openalex.org/W2896007044","https://openalex.org/W4210557094","https://openalex.org/W2966431795","https://openalex.org/W2903404893","https://openalex.org/W4225917259","https://openalex.org/W4391006234"],"abstract_inverted_index":{"According":[0],"to":[1,7,51],"IEEE":[2],"micromouse":[3,5,40,84,168],"standards,":[4],"needs":[6],"find":[8],"the":[9,13,22,25,29,36,42,53,72,79,83,86,90,94,98,107,111,118,132,139,143,146,158,164,170],"shortest":[10,26,37,91],"path":[11,27,38,92,123],"in":[12,41,66,85,169],"maze":[14,43,73],"that":[15,44,138],"has":[16,45],"been":[17,46],"searched,":[18],"and":[19,28,104,124,154,162],"sprint":[20,59,122,148,165],"with":[21,61,131],"fastest":[23],"velocity,":[24],"least":[30],"number":[31,159],"of":[32,39,82,121,145,160,167],"turns.":[33],"To":[34],"ensure":[35],"explored,":[47],"it":[48,135],"is":[49,64,127,136],"necessary":[50],"plan":[52],"existing":[54],"paths.":[55],"Therefore,":[56],"an":[57],"Oblique":[58],"algorithm":[60,70,141],"eight":[62,76],"directions":[63],"proposed":[65],"this":[67,102,116],"article.":[68],"The":[69],"divides":[71],"cell":[74],"into":[75,110],"directions,":[77],"records":[78],"running":[80,113],"direction":[81,99,108],"maze,":[87],"finds":[88],"out":[89],"through":[93],"contour":[95],"map,":[96],"makes":[97],"map":[100,109],"on":[101],"path,":[103],"then":[105],"integrates":[106],"actual":[112],"action.":[114],"Through":[115],"algorithm,":[117,134,149],"optimal":[119],"design":[120],"action":[125],"mode":[126],"realized.":[128],"By":[129],"comparing":[130],"traditional":[133,147],"demonstrated":[137],"new":[140],"solved":[142],"problems":[144],"such":[150],"as":[151],"long":[152],"distance":[153],"many":[155],"actions,":[156],"reduced":[157],"turns,":[161],"improved":[163],"efficiency":[166],"maze.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}