{"id":"https://openalex.org/W4416748666","doi":"https://doi.org/10.1109/iros60139.2025.11247294","title":"Collaborative Task Assignment, Sequencing and Multi-agent Path-finding","display_name":"Collaborative Task Assignment, Sequencing and Multi-agent Path-finding","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416748666","doi":"https://doi.org/10.1109/iros60139.2025.11247294"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11247294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11247294","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":"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/A5062797747","display_name":"Yifan Bai","orcid":"https://orcid.org/0000-0001-6762-7172"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Yifan Bai","raw_affiliation_strings":["Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010553447","display_name":"Shruti Kotpalliwar","orcid":"https://orcid.org/0000-0002-2173-6039"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Shruti Kotpalliwar","raw_affiliation_strings":["Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039277979","display_name":"Christoforos Kanellakis","orcid":"https://orcid.org/0000-0001-8870-6718"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Christoforos Kanellakis","raw_affiliation_strings":["Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032260126","display_name":"George Nikolakopoulos","orcid":null},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"George Nikolakopoulos","raw_affiliation_strings":["Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden"],"affiliations":[{"raw_affiliation_string":"Electrical and Space Engineering at Luleå University of Technology,Robotics and AI Group,Department of Computer Science,Sweden","institution_ids":["https://openalex.org/I190632392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5062797747"],"corresponding_institution_ids":["https://openalex.org/I190632392"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.36894811,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8675","last_page":"8682"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9627000093460083,"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.9627000093460083,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.004699999932199717,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.002199999988079071,"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/task","display_name":"Task (project management)","score":0.6906999945640564},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5131999850273132},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.4993000030517578},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.47189998626708984},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.414000004529953},{"id":"https://openalex.org/keywords/task-analysis","display_name":"Task analysis","score":0.39890000224113464},{"id":"https://openalex.org/keywords/pathfinding","display_name":"Pathfinding","score":0.3790000081062317}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7444999814033508},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6906999945640564},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5131999850273132},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.4993000030517578},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.47189998626708984},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4228000044822693},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.414000004529953},{"id":"https://openalex.org/C175154964","wikidata":"https://www.wikidata.org/wiki/Q380077","display_name":"Task analysis","level":3,"score":0.39890000224113464},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.398499995470047},{"id":"https://openalex.org/C25321074","wikidata":"https://www.wikidata.org/wiki/Q1969601","display_name":"Pathfinding","level":4,"score":0.3790000081062317},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.3781999945640564},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3215000033378601},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C831591","wikidata":"https://www.wikidata.org/wiki/Q59750","display_name":"Bidirectional search","level":5,"score":0.2888000011444092},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.27720001339912415},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.27309998869895935},{"id":"https://openalex.org/C149490388","wikidata":"https://www.wikidata.org/wiki/Q1718507","display_name":"Sequential Pattern Mining","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C139979381","wikidata":"https://www.wikidata.org/wiki/Q17056021","display_name":"Incremental heuristic search","level":4,"score":0.2549000084400177},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11247294","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11247294","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/F4320334322","display_name":"HORIZON EUROPE Framework Programme","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W1919410445","https://openalex.org/W1989407213","https://openalex.org/W2011087880","https://openalex.org/W2119235896","https://openalex.org/W2124015815","https://openalex.org/W2133844819","https://openalex.org/W2167979940","https://openalex.org/W2219548420","https://openalex.org/W2241553860","https://openalex.org/W2406007181","https://openalex.org/W2903998385","https://openalex.org/W2963382051","https://openalex.org/W2964035402","https://openalex.org/W2964997335","https://openalex.org/W2965125400","https://openalex.org/W2966291835","https://openalex.org/W3085644258","https://openalex.org/W3091078866","https://openalex.org/W3112239567","https://openalex.org/W3118630579","https://openalex.org/W3129736740","https://openalex.org/W3142421752","https://openalex.org/W3187649900","https://openalex.org/W3197324768","https://openalex.org/W4285022255","https://openalex.org/W4367281433","https://openalex.org/W4385155193","https://openalex.org/W4391549658","https://openalex.org/W4403021882"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"article,":[2],"we":[3],"address":[4,144],"the":[5,70,107,116,126,145],"problem":[6],"of":[7,19,25,72,128],"collaborative":[8],"task":[9,26,64,84],"assignment,":[10],"sequencing,":[11],"and":[12,38,56,66,86,163],"multi-agent":[13],"pathfinding":[14],"(TSPF),":[15],"where":[16],"a":[17,23,47,77,100,136],"team":[18],"agents":[20],"must":[21],"visit":[22],"set":[24],"locations":[27],"without":[28],"collisions":[29],"while":[30,122],"minimizing":[31],"flowtime.":[32],"TSPF":[33,146],"incorporates":[34],"agent-task":[35],"compatibility":[36],"constraints":[37],"ensures":[39],"that":[40,59,151],"all":[41],"tasks":[42],"are":[43],"completed.":[44],"We":[45],"propose":[46],"Conflict-Based":[48,88],"Search":[49,89,134],"with":[50,91,140],"Task":[51],"Sequencing":[52],"(CBS-TS),":[53],"an":[54],"optimal":[55,165],"complete":[57],"algorithm":[58],"alternates":[60],"between":[61],"finding":[62],"new":[63],"sequences":[65],"resolving":[67],"conflicts":[68],"in":[69,155,172],"paths":[71],"current":[73],"sequences.":[74],"CBS-TS":[75,113,130,152],"uses":[76],"mixed-integer":[78],"linear":[79],"program":[80],"(MILP)":[81],"to":[82],"optimize":[83],"sequencing":[85],"employs":[87],"(CBS)":[90],"Multi-Label":[92],"A*":[93],"(MLA*)":[94],"for":[95,106],"collision-free":[96],"path":[97],"planning":[98],"within":[99],"search":[101,117],"forest.":[102],"By":[103],"invoking":[104],"MILP":[105],"next-best":[108],"sequence":[109],"only":[110],"when":[111],"needed,":[112],"efficiently":[114],"limits":[115],"space,":[118],"enhancing":[119],"computational":[120],"efficiency":[121],"maintaining":[123],"optimality.We":[124],"compare":[125],"performance":[127],"our":[129],"against":[131],"Conflict-based":[132],"Steiner":[133],"(CBSS),":[135],"baseline":[137],"method":[138],"that,":[139],"minor":[141],"modifications,":[142],"can":[143],"problem.":[147],"Experimental":[148],"results":[149],"demonstrate":[150],"outperforms":[153],"CBSS":[154,168],"most":[156],"testing":[157],"scenarios,":[158],"achieving":[159],"higher":[160],"success":[161],"rates":[162],"consistently":[164],"solutions,":[166],"whereas":[167],"achieves":[169],"near-optimal":[170],"solutions":[171],"some":[173],"cases.":[174],"The":[175],"supplementary":[176],"video":[177],"is":[178],"available":[179],"at":[180],"https://youtu.be/QT8BYgvefmU.":[181]},"counts_by_year":[],"updated_date":"2026-04-09T08:11:56.329763","created_date":"2025-11-28T00:00:00"}