{"id":"https://openalex.org/W3170607246","doi":"https://doi.org/10.1109/iccicc50026.2020.9450270","title":"QPA*: Design of a searching and path planning algorithm for intelligent agents in two dimensions","display_name":"QPA*: Design of a searching and path planning algorithm for intelligent agents in two dimensions","publication_year":2020,"publication_date":"2020-09-26","ids":{"openalex":"https://openalex.org/W3170607246","doi":"https://doi.org/10.1109/iccicc50026.2020.9450270","mag":"3170607246"},"language":"en","primary_location":{"id":"doi:10.1109/iccicc50026.2020.9450270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccicc50026.2020.9450270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 19th International Conference on Cognitive Informatics & 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/A5077306684","display_name":"Brian Garcia Sarmina","orcid":null},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":true,"raw_author_name":"Brian Garcia Sarmina","raw_affiliation_strings":["Universidad Autónoma Metropolitana Unidad Azcapotzalco,Student of Maestría en Ciencias de la Computación"],"affiliations":[{"raw_affiliation_string":"Universidad Autónoma Metropolitana Unidad Azcapotzalco,Student of Maestría en Ciencias de la Computación","institution_ids":["https://openalex.org/I200362191"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043549411","display_name":"Georgii Khachaturov","orcid":null},"institutions":[{"id":"https://openalex.org/I200362191","display_name":"Universidad Aut\u00f3noma Metropolitana","ror":"https://ror.org/02kta5139","country_code":"MX","type":"education","lineage":["https://openalex.org/I200362191"]}],"countries":["MX"],"is_corresponding":false,"raw_author_name":"Georgii Khachaturov","raw_affiliation_strings":["Universidad Autónoma Metropolitana Unidad Azcapotzalco,Departamento de Sistemas"],"affiliations":[{"raw_affiliation_string":"Universidad Autónoma Metropolitana Unidad Azcapotzalco,Departamento de Sistemas","institution_ids":["https://openalex.org/I200362191"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5077306684"],"corresponding_institution_ids":["https://openalex.org/I200362191"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20385494,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"202","last_page":"209"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.9905999898910522,"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/computer-science","display_name":"Computer science","score":0.7111251354217529},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6293451189994812},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5101085305213928},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.46175241470336914},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3426673710346222},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3371101915836334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.29882076382637024},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06970089673995972}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7111251354217529},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6293451189994812},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5101085305213928},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.46175241470336914},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3426673710346222},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3371101915836334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29882076382637024},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06970089673995972},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccicc50026.2020.9450270","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccicc50026.2020.9450270","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE 19th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1605073378","https://openalex.org/W1969472392","https://openalex.org/W1998364234","https://openalex.org/W2145413351","https://openalex.org/W2169528473","https://openalex.org/W2182059131","https://openalex.org/W2524886531","https://openalex.org/W2541089803","https://openalex.org/W2891479590","https://openalex.org/W2897280781","https://openalex.org/W4256431479","https://openalex.org/W6636193600"],"related_works":["https://openalex.org/W3049557657","https://openalex.org/W3150915502","https://openalex.org/W2111158727","https://openalex.org/W1809059965","https://openalex.org/W2359600231","https://openalex.org/W2380019117","https://openalex.org/W3138952546","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3197207153"],"abstract_inverted_index":{"Searching":[0],"algorithms":[1,5],"and":[2,50,83,102,110,120,150,190],"path":[3,51,121,138,160,174],"planning":[4,52,122,139,161,175],"are":[6],"in":[7,99,177,184],"a":[8,44,55,59,79,100,146,156],"variety":[9],"of":[10,19,39,58,66,108,117,127,137,145,154,163,192],"applications,":[11],"where":[12,105],"the":[13,20,32,48,64,67,74,106,118,134,143,152,159,173,180,188],"mobile":[14],"robotics":[15],"field":[16],"is":[17,94,112,130,142],"one":[18],"most":[21],"popular.":[22],"QPA*":[23,92],"algorithm":[24,36,93],"attempts":[25],"to":[26,42,47,96,114,132,186],"perform":[27],"this":[28,193],"two":[29],"strategies":[30,41],"at":[31],"\u201csame":[33],"time\u201d.":[34],"The":[35,91,124],"makes":[37],"use":[38],"three":[40,169],"generate":[43],"different":[45,170],"solution":[46],"exploration":[49,85],"mainstream,":[53],"using":[54,158],"\u201cproposed":[56],"version\u201d":[57],"modified":[60],"A*":[61,164],"(star)":[62],"algorithm,":[63],"idea":[65],"Potential":[68],"Fields":[69],"Algorithm":[70],"(to":[71],"deal":[72],"with":[73,179],"collision":[75],"avoidance)":[76],"applied":[77,98],"as":[78],"artificial":[80],"binary":[81],"field,":[82],"an":[84],"heuristic":[86],"named":[87],"\u201cquadrant":[88],"grid":[89,182],"search\u201d.":[90],"designed":[95],"be":[97,115],"search":[101],"rescue":[103],"robot,":[104],"problem":[107,136],"\u201clocalization\u201d":[109],"\u201cmapping\u201d":[111],"consider":[113],"independent":[116],"exploring":[119],"algorithm.":[123,165],"\u201cexploration\u201d":[125],"part":[126],"QPA":[128],"*":[129],"intended":[131],"overcome":[133],"main":[135],"algorithms,":[140],"that":[141],"lack":[144],"true":[147],"\u201cexploration":[148],"factor\u201d":[149],"preserve":[151],"efficiency":[153],"making":[155],"route":[157],"approach":[162],"Finally,":[166],"we":[167],"test":[168],"approximations":[171],"(for":[172],"part)":[176],"combination":[178],"quadrant":[181],"search,":[183],"order":[185],"identify":[187],"pros":[189],"cons":[191],"design.":[194]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}