{"id":"https://openalex.org/W4414432706","doi":"https://doi.org/10.1109/case58245.2025.11164023","title":"A Formal Definition of the Multi-Robot Multi-Task Time-extended Assignment Problem Configuration","display_name":"A Formal Definition of the Multi-Robot Multi-Task Time-extended Assignment Problem Configuration","publication_year":2025,"publication_date":"2025-08-17","ids":{"openalex":"https://openalex.org/W4414432706","doi":"https://doi.org/10.1109/case58245.2025.11164023"},"language":"en","primary_location":{"id":"doi:10.1109/case58245.2025.11164023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11164023","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","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/A5013070710","display_name":"Branko Miloradovi\u0107","orcid":"https://orcid.org/0000-0002-9051-929X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Branko Miloradovi\u0107","raw_affiliation_strings":["Mälardalen University,Division of Intelligent Future Technologies,Västerås,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mälardalen University,Division of Intelligent Future Technologies,Västerås,Sweden","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5080443843","display_name":"Alessandro V. Papadopoulos","orcid":"https://orcid.org/0000-0002-1364-8127"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alessandro V. Papadopoulos","raw_affiliation_strings":["Mälardalen University,Division of Intelligent Future Technologies,Västerås,Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mälardalen University,Division of Intelligent Future Technologies,Västerås,Sweden","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2215","last_page":"2222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9979000091552734,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9850999712944031,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5976999998092651},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5145999789237976},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5026000142097473},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4724999964237213},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.43470001220703125},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4097000062465668},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.40450000762939453},{"id":"https://openalex.org/keywords/resource-allocation","display_name":"Resource allocation","score":0.36649999022483826}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7365000247955322},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5976999998092651},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5145999789237976},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5026000142097473},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4724999964237213},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.43470001220703125},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.42480000853538513},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4097000062465668},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C29202148","wikidata":"https://www.wikidata.org/wiki/Q287260","display_name":"Resource allocation","level":2,"score":0.36649999022483826},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3598000109195709},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C3019612716","wikidata":"https://www.wikidata.org/wiki/Q730920","display_name":"Problem solver","level":2,"score":0.323199987411499},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.32120001316070557},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.31630000472068787},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3140999972820282},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31040000915527344},{"id":"https://openalex.org/C47822265","wikidata":"https://www.wikidata.org/wiki/Q854457","display_name":"Complex system","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.30489999055862427},{"id":"https://openalex.org/C44616089","wikidata":"https://www.wikidata.org/wiki/Q30158686","display_name":"Constraint satisfaction","level":3,"score":0.2728999853134155},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.26809999346733093},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/case58245.2025.11164023","is_oa":false,"landing_page_url":"https://doi.org/10.1109/case58245.2025.11164023","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 21st International Conference on Automation Science and Engineering (CASE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320307330","display_name":"Knowledge Foundation","ror":"https://ror.org/00v64cg28"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1967398213","https://openalex.org/W1972391046","https://openalex.org/W2005956874","https://openalex.org/W2089448021","https://openalex.org/W2157488300","https://openalex.org/W2537545174","https://openalex.org/W2605051224","https://openalex.org/W2790098940","https://openalex.org/W2799899844","https://openalex.org/W2981917409","https://openalex.org/W3112366178","https://openalex.org/W3154842816","https://openalex.org/W3170415259","https://openalex.org/W3196309440","https://openalex.org/W4200208591","https://openalex.org/W4281632501","https://openalex.org/W4323767314","https://openalex.org/W4385155193"],"related_works":[],"abstract_inverted_index":{"Multi-Robot":[0,42,67],"Systems":[1],"(MRSs)":[2],"play":[3],"a":[4,50,151,176],"crucial":[5],"role":[6],"in":[7,31,89],"several":[8,75],"fields,":[9],"including":[10],"industrial":[11],"automation,":[12],"precision":[13],"agriculture,":[14],"and":[15,18,23,77,109,132,143,183],"urban":[16],"search":[17],"rescue,":[19],"by":[20,121],"enhancing":[21],"efficiency":[22],"operational":[24],"capabilities.":[25],"One":[26],"of":[27,38,54,62,148],"the":[28,35,92,103,145],"main":[29],"challenges":[30,105],"these":[32,111,163],"systems":[33],"is":[34],"efficient":[36],"allocation":[37],"tasks,":[39],"known":[40],"as":[41],"Task":[43],"Allocation":[44],"(MRTA).":[45],"This":[46,114],"paper":[47,115],"focuses":[48],"on":[49,127,178],"particularly":[51],"complex":[52,112],"configuration":[53,94],"MRTA":[55],"that":[56,70,81],"involves":[57],"Multi-Task":[58],"(MT)":[59],"Robots":[60],"capable":[61],"performing":[63],"multiple":[64],"tasks":[65],"simultaneously,":[66],"(MR)":[68],"Tasks":[69],"require":[71],"coordinated":[72],"efforts":[73],"from":[74],"robots,":[76],"Time-extended":[78],"Assignments":[79],"(TA)":[80],"demand":[82],"extended":[83],"duration":[84],"scheduling.":[85],"Despite":[86],"notable":[87],"advancements":[88],"this":[90,119,156],"area,":[91],"MT-MR-TA":[93],"remains":[95],"underexplored.":[96],"Existing":[97],"research":[98],"often":[99],"fails":[100],"to":[101,117,141,154],"address":[102],"specific":[104],"associated":[106],"with":[107,175],"coordinating":[108],"scheduling":[110],"tasks.":[113],"aims":[116],"fill":[118],"gap":[120],"introducing":[122],"new":[123],"computational":[124],"models":[125,137,164],"based":[126],"Integer":[128],"Linear":[129],"Programming":[130,134],"(ILP)":[131],"Constraint":[133],"(CP).":[135],"These":[136],"are":[138],"purposefully":[139],"designed":[140],"formalize":[142],"tackle":[144],"intricate":[146],"dynamics":[147],"MT-MR-TA,":[149],"offering":[150],"structured":[152],"approach":[153],"solve":[155],"multidimensional":[157],"optimization":[158],"problem.":[159],"We":[160],"rigorously":[161],"evaluate":[162],"for":[165],"their":[166],"effectiveness":[167],"using":[168],"advanced,":[169],"general-purpose":[170],"solvers":[171],"across":[172],"various":[173],"instances,":[174],"focus":[177],"model":[179],"scalability,":[180],"solver":[181],"efficiency,":[182],"overall":[184],"solution":[185],"quality.":[186]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}