{"id":"https://openalex.org/W4416749531","doi":"https://doi.org/10.1109/iros60139.2025.11246219","title":"Multi-Agent Combinatorial Path Finding for Tractor-Trailers in Occupancy Grids","display_name":"Multi-Agent Combinatorial Path Finding for Tractor-Trailers in Occupancy Grids","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416749531","doi":"https://doi.org/10.1109/iros60139.2025.11246219"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11246219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5100761151","display_name":"Xianyi Wu","orcid":"https://orcid.org/0000-0002-7403-8330"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuemian Wu","raw_affiliation_strings":["Shanghai Jiao Tong University,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,China","institution_ids":["https://openalex.org/I183067930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018561143","display_name":"Zhongqiang Ren","orcid":"https://orcid.org/0000-0003-2880-8653"},"institutions":[{"id":"https://openalex.org/I183067930","display_name":"Shanghai Jiao Tong University","ror":"https://ror.org/0220qvk04","country_code":"CN","type":"education","lineage":["https://openalex.org/I183067930"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhongqiang Ren","raw_affiliation_strings":["Shanghai Jiao Tong University,China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Shanghai Jiao Tong University,China","institution_ids":["https://openalex.org/I183067930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I183067930"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.42498954,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"14124","last_page":"14131"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9807999730110168,"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.9807999730110168,"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.0052999998442828655,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0012000000569969416,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/planner","display_name":"Planner","score":0.6327999830245972},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6003000140190125},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5655999779701233},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5569000244140625},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.5223000049591064},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4180999994277954},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.39570000767707825},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.3937999904155731}],"concepts":[{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.6327999830245972},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6022999882698059},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6003000140190125},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5655999779701233},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5569000244140625},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5378999710083008},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.5223000049591064},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4180999994277954},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.39570000767707825},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C57077369","wikidata":"https://www.wikidata.org/wiki/Q7075747","display_name":"Occupancy grid mapping","level":4,"score":0.36579999327659607},{"id":"https://openalex.org/C138268822","wikidata":"https://www.wikidata.org/wiki/Q1051925","display_name":"Resolution (logic)","level":2,"score":0.33660000562667847},{"id":"https://openalex.org/C2776505523","wikidata":"https://www.wikidata.org/wiki/Q4785468","display_name":"Plan (archaeology)","level":2,"score":0.3352000117301941},{"id":"https://openalex.org/C2779101595","wikidata":"https://www.wikidata.org/wiki/Q7832787","display_name":"Trailer","level":2,"score":0.33090001344680786},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3077999949455261},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C41550386","wikidata":"https://www.wikidata.org/wiki/Q529909","display_name":"Multi-agent system","level":2,"score":0.3034999966621399},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2775000035762787},{"id":"https://openalex.org/C2780864053","wikidata":"https://www.wikidata.org/wiki/Q5147495","display_name":"Collision avoidance","level":3,"score":0.2766999900341034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2727999985218048},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.266400009393692}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11246219","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11246219","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320309612","display_name":"Natural Science Foundation of Shanghai","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1989407213","https://openalex.org/W2191404279","https://openalex.org/W2728614645","https://openalex.org/W2964997335","https://openalex.org/W2966291835","https://openalex.org/W2966751547","https://openalex.org/W3091078866","https://openalex.org/W3158757609","https://openalex.org/W3187649900","https://openalex.org/W3206820044","https://openalex.org/W4312803667","https://openalex.org/W4367281433","https://openalex.org/W4399261818","https://openalex.org/W4401163469","https://openalex.org/W4403021882"],"related_works":[],"abstract_inverted_index":{"This":[0,140],"paper":[1,141],"investigates":[2],"a":[3,27,51,54,82,97,143,157],"problem":[4],"called":[5,146],"Multi-Agent":[6],"Combinatorial":[7],"Path":[8],"Finding":[9],"for":[10,17,78],"Tractor-Trailers":[11],"(MCPF-TT),":[12],"which":[13,66],"seeks":[14],"collision-free":[15],"paths":[16],"multiple":[18],"agents":[19,113],"from":[20],"their":[21],"start":[22],"to":[23,58,92,109,117,123,136],"goal":[24],"locations,":[25],"visiting":[26],"set":[28],"of":[29,36,43,71,105,181],"intermediate":[30,63],"target":[31,64],"locations":[32],"in":[33,81,96],"the":[34,37,41,59,68,89,103,106,124,129,190],"middle":[35],"paths,":[38],"while":[39,167,183],"minimizing":[40],"sum":[42],"arrival":[44],"times.":[45],"Additionally,":[46],"each":[47,62,94,120],"agent":[48,60,73,95],"behaves":[49],"like":[50],"tractor,":[52],"and":[53,128,156],"trailer":[55],"is":[56],"attached":[57,107],"at":[61],"location,":[65],"increases":[67],"\"body":[69],"length\"":[70],"that":[72,101,148,162,174],"by":[74],"one":[75],"unit.":[76],"Planning":[77],"those":[79],"tractor-trailers":[80],"cluttered":[83],"environment":[84],"introduces":[85],"additional":[86],"challenges,":[87],"since":[88],"planner":[90,145,160],"has":[91],"plan":[93],"larger":[98],"state":[99],"space":[100],"includes":[102,149],"position":[104],"trailers":[108],"avoid":[110],"self-collision.":[111,169],"Furthermore,":[112],"are":[114],"more":[115],"likely":[116],"collide":[118],"with":[119,186],"other":[121],"due":[122],"increasing":[125],"body":[126],"lengths,":[127],"conventional":[130],"collision":[131],"resolution":[132,154],"techniques":[133],"turn":[134],"out":[135],"be":[137],"computationally":[138],"inefficient.":[139],"develops":[142],"new":[144,158],"CBSS-TT":[147,175],"both":[150],"novel":[151],"inter-agent":[152],"conflict":[153],"techniques,":[155],"single-agent":[159,165],"TTCA*":[161],"finds":[163],"optimal":[164],"path":[166],"avoiding":[168],"Our":[170],"test":[171],"results":[172],"show":[173],"sometimes":[176],"requires":[177],"60%":[178],"fewer":[179],"number":[180],"iterations":[182],"finding":[184],"solutions":[185],"cheaper":[187],"costs":[188],"than":[189],"baselines.":[191]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-11-28T00:00:00"}
