{"id":"https://openalex.org/W4414767437","doi":"https://doi.org/10.1109/tii.2025.3609041","title":"Persistent Space-Level Path Segment Finding for Multiple Nonholonomic Agents","display_name":"Persistent Space-Level Path Segment Finding for Multiple Nonholonomic Agents","publication_year":2025,"publication_date":"2025-10-02","ids":{"openalex":"https://openalex.org/W4414767437","doi":"https://doi.org/10.1109/tii.2025.3609041"},"language":"en","primary_location":{"id":"doi:10.1109/tii.2025.3609041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2025.3609041","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","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/A5051780992","display_name":"Hongkai Fan","orcid":"https://orcid.org/0009-0003-7354-9360"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hongkai Fan","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"raw_orcid":"https://orcid.org/0009-0003-7354-9360","affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100750387","display_name":"Bo Ouyang","orcid":"https://orcid.org/0000-0003-2378-981X"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Bo Ouyang","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0003-2378-981X","affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025640070","display_name":"Yaonan Wang","orcid":"https://orcid.org/0000-0002-0519-6458"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yaonan Wang","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0002-0519-6458","affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102757940","display_name":"Zhi Yan","orcid":"https://orcid.org/0000-0003-3849-2496"},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhi Yan","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"raw_orcid":"https://orcid.org/0000-0003-3849-2496","affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Qin Tan","orcid":null},"institutions":[{"id":"https://openalex.org/I180662265","display_name":"China Mobile (China)","ror":"https://ror.org/05gftfe97","country_code":"CN","type":"company","lineage":["https://openalex.org/I180662265"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qin Tan","raw_affiliation_strings":["China Mobile Group Hunan Company Limited, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"China Mobile Group Hunan Company Limited, Changsha, China","institution_ids":["https://openalex.org/I180662265"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Zhiheng Yao","orcid":null},"institutions":[{"id":"https://openalex.org/I4210124264","display_name":"Sany (China)","ror":"https://ror.org/023jrwe36","country_code":"CN","type":"company","lineage":["https://openalex.org/I4210124264"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhiheng Yao","raw_affiliation_strings":["Intelligent Manufacturing Institute of Sany Heavy Industry, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Intelligent Manufacturing Institute of Sany Heavy Industry, Changsha, China","institution_ids":["https://openalex.org/I4210124264"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066935918","display_name":"Jiawen He","orcid":null},"institutions":[{"id":"https://openalex.org/I16609230","display_name":"Hunan University","ror":"https://ror.org/05htk5m33","country_code":"CN","type":"education","lineage":["https://openalex.org/I16609230"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jiawen He","raw_affiliation_strings":["College of Electrical and Information Engineering, Hunan University, Changsha, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"College of Electrical and Information Engineering, Hunan University, Changsha, China","institution_ids":["https://openalex.org/I16609230"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":7,"corresponding_author_ids":["https://openalex.org/A5051780992"],"corresponding_institution_ids":["https://openalex.org/I16609230"],"apc_list":null,"apc_paid":null,"fwci":1.1332,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.82942099,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":98},"biblio":{"volume":"22","issue":"1","first_page":"119","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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/T11106","display_name":"Data Management and Algorithms","score":0.9890999794006348,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11714","display_name":"Multimodal Machine Learning Applications","score":0.9721999764442444,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nonholonomic-system","display_name":"Nonholonomic system","score":0.8711000084877014},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6733999848365784},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5928999781608582},{"id":"https://openalex.org/keywords/multi-agent-system","display_name":"Multi-agent system","score":0.5343999862670898},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5223000049591064},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.510200023651123},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5080000162124634},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.47519999742507935},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4178999960422516}],"concepts":[{"id":"https://openalex.org/C138632511","wikidata":"https://www.wikidata.org/wiki/Q2478109","display_name":"Nonholonomic system","level":4,"score":0.8711000084877014},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7010999917984009},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6733999848365784},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5928999781608582},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.5343999862670898},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5223000049591064},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.510200023651123},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5080000162124634},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.47519999742507935},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4178999960422516},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3736000061035156},{"id":"https://openalex.org/C2779304628","wikidata":"https://www.wikidata.org/wiki/Q3503480","display_name":"Face (sociological concept)","level":2,"score":0.36800000071525574},{"id":"https://openalex.org/C13687954","wikidata":"https://www.wikidata.org/wiki/Q4826847","display_name":"Autonomous agent","level":2,"score":0.3517000079154968},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.3296999931335449},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.32899999618530273},{"id":"https://openalex.org/C74222875","wikidata":"https://www.wikidata.org/wiki/Q16000312","display_name":"Robot kinematics","level":4,"score":0.321399986743927},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3122999966144562},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3043000102043152},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.29499998688697815},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2881999909877777},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2840000092983246},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.28119999170303345},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.27619999647140503},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.26809999346733093},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2612000107765198},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.2563000023365021}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tii.2025.3609041","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tii.2025.3609041","pdf_url":null,"source":{"id":"https://openalex.org/S184777250","display_name":"IEEE Transactions on Industrial Informatics","issn_l":"1551-3203","issn":["1551-3203","1941-0050"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Industrial Informatics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4495823523","display_name":null,"funder_award_id":"62373139","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"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":28,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W1989407213","https://openalex.org/W2150973821","https://openalex.org/W2167979940","https://openalex.org/W2241553860","https://openalex.org/W2404271123","https://openalex.org/W2584529157","https://openalex.org/W2808589448","https://openalex.org/W2809708768","https://openalex.org/W2886374915","https://openalex.org/W2913211223","https://openalex.org/W2914864020","https://openalex.org/W2964997335","https://openalex.org/W2965230525","https://openalex.org/W3011643348","https://openalex.org/W3037164939","https://openalex.org/W3112582952","https://openalex.org/W3133180063","https://openalex.org/W3175724379","https://openalex.org/W3187649900","https://openalex.org/W4205985266","https://openalex.org/W4282978153","https://openalex.org/W4285178132","https://openalex.org/W4312785523","https://openalex.org/W4319068583","https://openalex.org/W4320015828","https://openalex.org/W4362654009","https://openalex.org/W4392931098"],"related_works":[],"abstract_inverted_index":{"Multiagent":[0],"path":[1,79],"finding":[2,82],"(MAPF)":[3],"is":[4],"a":[5,74,130],"critical":[6],"problem":[7,116],"in":[8,123,157],"real-world":[9,42,94,182],"multiagent":[10],"systems,":[11],"where":[12],"agents":[13,27,44,135],"reach":[14],"their":[15,39],"respective":[16],"destinations":[17],"without":[18,141],"colliding":[19],"with":[20,32],"one":[21],"another.":[22],"Most":[23],"MAPF":[24,90,148],"solvers":[25],"assume":[26],"move":[28],"at":[29,138],"constant":[30],"speeds":[31,140],"no":[33],"delays":[34,46],"and":[35,51,92,102,112],"stop":[36],"upon":[37],"reaching":[38],"goal.":[40],"However,":[41],"nonholonomic":[43,97,134],"face":[45],"like":[47],"deceleration,":[48],"lane":[49],"changes,":[50],"acceleration,":[52],"which":[53,84],"impact":[54],"efficiency.":[55],"Moreover,":[56],"tasks":[57,149],"are":[58],"continuously":[59],"generated,":[60],"making":[61],"it":[62],"challenging":[63],"to":[64,105,117,136,159,173],"meet":[65],"production":[66],"requirements.":[67],"To":[68],"address":[69],"this":[70],"issue,":[71],"we":[72],"propose":[73],"novel":[75],"approach,":[76],"the":[77,86,93,107,124,174],"space-level":[78],"segment":[80],"(SLPS)":[81],"algorithm,":[83],"bridges":[85],"gap":[87],"between":[88],"traditional":[89],"methods":[91],"requirements":[95],"of":[96],"agents.":[98],"SLPS":[99,145,166],"defines":[100],"necessary":[101],"optional":[103],"constraints":[104],"construct":[106],"collision":[108],"detection":[109],"graph":[110],"(CDG)":[111],"formulates":[113],"an":[114],"optimization":[115],"minimize":[118],"task":[119,169],"completion":[120,170],"time,":[121],"resulting":[122],"simplified":[125],"CDG.":[126],"It":[127],"then":[128],"computes":[129],"single":[131],"SLPS,":[132],"allowing":[133],"operate":[137],"varying":[139],"synchronization.":[142],"In":[143],"addition,":[144],"supports":[146],"persistent":[147],"through":[150],"four":[151],"event-triggered":[152],"methods,":[153],"enabling":[154],"flexible":[155],"replanning":[156],"response":[158],"dynamic":[160],"changes.":[161],"Experimental":[162],"results":[163],"demonstrate":[164],"that":[165],"reduces":[167],"average":[168],"time":[171],"compared":[172],"closest":[175],"state-of-the-art":[176],"solvers,":[177],"proving":[178],"its":[179],"efficiency":[180],"for":[181],"applications.":[183]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}
