{"id":"https://openalex.org/W4386802090","doi":"https://doi.org/10.1007/s11036-023-02247-y","title":"Shortest Path Control for Target Searching Using Robot in Complex Task with Large Range","display_name":"Shortest Path Control for Target Searching Using Robot in Complex Task with Large Range","publication_year":2023,"publication_date":"2023-09-16","ids":{"openalex":"https://openalex.org/W4386802090","doi":"https://doi.org/10.1007/s11036-023-02247-y"},"language":"en","primary_location":{"id":"doi:10.1007/s11036-023-02247-y","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s11036-023-02247-y","pdf_url":null,"source":{"id":"https://openalex.org/S192894947","display_name":"Mobile Networks and Applications","issn_l":"1383-469X","issn":["1383-469X","1572-8153"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mobile Networks and Applications","raw_type":"journal-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/A5101245303","display_name":"Jinyin Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jinyin Peng","raw_affiliation_strings":["School of Mechanical and Electrical Engineering, Hainan Vocational University of Science and Technology, Haikou, 570000, China"],"affiliations":[{"raw_affiliation_string":"School of Mechanical and Electrical Engineering, Hainan Vocational University of Science and Technology, Haikou, 570000, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090517968","display_name":"Li Zhao","orcid":"https://orcid.org/0000-0002-0950-6863"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Li Zhao","raw_affiliation_strings":["Software Department, Hunan College of Information, Changsha, 410000, China"],"affiliations":[{"raw_affiliation_string":"Software Department, Hunan College of Information, Changsha, 410000, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090517968"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1766,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56935084,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"28","issue":"5","first_page":"1806","last_page":"1817"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T13567","display_name":"AI and Multimedia in Education","score":0.9991000294685364,"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/T13567","display_name":"AI and Multimedia in Education","score":0.9991000294685364,"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/T14413","display_name":"Advanced Technologies in Various Fields","score":0.9675999879837036,"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/T13647","display_name":"AI and Big Data Applications","score":0.9368000030517578,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.7784123420715332},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7578720450401306},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.7462469935417175},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.685276210308075},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5856649875640869},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5433720946311951},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4959600865840912},{"id":"https://openalex.org/keywords/controller","display_name":"Controller (irrigation)","score":0.46767768263816833},{"id":"https://openalex.org/keywords/path-length","display_name":"Path length","score":0.4501707851886749},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4357713758945465},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.42950814962387085},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3708319664001465},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3614499568939209},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.3420599102973938},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.29913321137428284},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1268925964832306},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.10803231596946716},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08813130855560303},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.06381392478942871}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7784123420715332},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7578720450401306},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.7462469935417175},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.685276210308075},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5856649875640869},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5433720946311951},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4959600865840912},{"id":"https://openalex.org/C203479927","wikidata":"https://www.wikidata.org/wiki/Q5165939","display_name":"Controller (irrigation)","level":2,"score":0.46767768263816833},{"id":"https://openalex.org/C129045301","wikidata":"https://www.wikidata.org/wiki/Q7144654","display_name":"Path length","level":2,"score":0.4501707851886749},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4357713758945465},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.42950814962387085},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3708319664001465},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3614499568939209},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.3420599102973938},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.29913321137428284},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1268925964832306},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.10803231596946716},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08813130855560303},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.06381392478942871},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s11036-023-02247-y","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1007/s11036-023-02247-y","pdf_url":null,"source":{"id":"https://openalex.org/S192894947","display_name":"Mobile Networks and Applications","issn_l":"1383-469X","issn":["1383-469X","1572-8153"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mobile Networks and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5199999809265137,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W3042511294","https://openalex.org/W3089263838","https://openalex.org/W3126954108","https://openalex.org/W3127151507","https://openalex.org/W3132297558","https://openalex.org/W3134216721","https://openalex.org/W3137539129","https://openalex.org/W3143778447","https://openalex.org/W3146910236","https://openalex.org/W3155146201","https://openalex.org/W3156064686","https://openalex.org/W3169119379","https://openalex.org/W3170250145","https://openalex.org/W3190657081","https://openalex.org/W4200461441","https://openalex.org/W4210310623","https://openalex.org/W4223526404","https://openalex.org/W4283808925","https://openalex.org/W4319065888","https://openalex.org/W4320008877"],"related_works":["https://openalex.org/W2576812951","https://openalex.org/W2391412785","https://openalex.org/W2908094156","https://openalex.org/W2362018502","https://openalex.org/W3210976223","https://openalex.org/W1675650024","https://openalex.org/W3116259232","https://openalex.org/W4213021176","https://openalex.org/W2513969461","https://openalex.org/W4312203491"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-01-22T23:29:09.771500","created_date":"2025-10-10T00:00:00"}