{"id":"https://openalex.org/W4414117846","doi":"https://doi.org/10.1109/ccta53793.2025.11151390","title":"Motion Planning for Mobile Robots Through Iterative Task Allocation","display_name":"Motion Planning for Mobile Robots Through Iterative Task Allocation","publication_year":2025,"publication_date":"2025-08-25","ids":{"openalex":"https://openalex.org/W4414117846","doi":"https://doi.org/10.1109/ccta53793.2025.11151390"},"language":"en","primary_location":{"id":"doi:10.1109/ccta53793.2025.11151390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta53793.2025.11151390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Conference on Control Technology and Applications (CCTA)","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/A5002142444","display_name":"Ioana Hustiu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Ioana Hustiu","raw_affiliation_strings":["Technical University of Iasi,Faculty of Automatic Control and Computer Science,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Iasi,Faculty of Automatic Control and Computer Science,Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046534630","display_name":"Marius Kloetzer","orcid":"https://orcid.org/0000-0003-4338-0421"},"institutions":[{"id":"https://openalex.org/I4210108695","display_name":"Gheorghe Asachi Technical University of Ia\u0219i","ror":"https://ror.org/014zxnz40","country_code":"RO","type":"education","lineage":["https://openalex.org/I4210108695"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Marius Kloetzer","raw_affiliation_strings":["Technical University of Iasi,Faculty of Automatic Control and Computer Science,Romania"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technical University of Iasi,Faculty of Automatic Control and Computer Science,Romania","institution_ids":["https://openalex.org/I4210108695"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085504277","display_name":"Cristian Mahulea","orcid":"https://orcid.org/0000-0003-0056-2225"},"institutions":[{"id":"https://openalex.org/I255234318","display_name":"Universidad de Zaragoza","ror":"https://ror.org/012a91z28","country_code":"ES","type":"education","lineage":["https://openalex.org/I255234318"]},{"id":"https://openalex.org/I4210132055","display_name":"Instituto de Nanociencia y Materiales de Arag\u00f3n","ror":"https://ror.org/031n2c920","country_code":"ES","type":"facility","lineage":["https://openalex.org/I134820265","https://openalex.org/I255234318","https://openalex.org/I4210132055"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Cristian Mahulea","raw_affiliation_strings":["Aragón Institute of Engineering Research (I3A), University of Zaragoza,Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Aragón Institute of Engineering Research (I3A), University of Zaragoza,Spain","institution_ids":["https://openalex.org/I255234318","https://openalex.org/I4210132055"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"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":"780","last_page":"785"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10653","display_name":"Robot Manipulation and Learning","score":0.9972000122070312,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/rounding","display_name":"Rounding","score":0.7357000112533569},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6269999742507935},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5540000200271606},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.548799991607666},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.532800018787384},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5302000045776367},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.5271999835968018},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.49540001153945923}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7357000112533569},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6438999772071838},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6340000033378601},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6269999742507935},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5540000200271606},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.548799991607666},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.532800018787384},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5302000045776367},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.5271999835968018},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.49540001153945923},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49390000104904175},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.49070000648498535},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4487999975681305},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.4345000088214874},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.4250999987125397},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.3418999910354614},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.29280000925064087},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.287200003862381},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2800000011920929},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2793999910354614},{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.2766000032424927}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccta53793.2025.11151390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta53793.2025.11151390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W196129739","https://openalex.org/W1424654272","https://openalex.org/W1997276729","https://openalex.org/W2009064992","https://openalex.org/W2056864430","https://openalex.org/W2167637024","https://openalex.org/W2176563247","https://openalex.org/W2602257487","https://openalex.org/W2762698157","https://openalex.org/W2914296650","https://openalex.org/W2973769628","https://openalex.org/W2998164266","https://openalex.org/W3000714535","https://openalex.org/W3204625264","https://openalex.org/W4297493126","https://openalex.org/W4381681017","https://openalex.org/W4400744747","https://openalex.org/W4404810233"],"related_works":["https://openalex.org/W2122871747","https://openalex.org/W1904098742","https://openalex.org/W3158921809","https://openalex.org/W1980828932","https://openalex.org/W3213722473","https://openalex.org/W2110944602","https://openalex.org/W2161428574","https://openalex.org/W3114279067","https://openalex.org/W1972453571","https://openalex.org/W2077416514"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"and":[3,176,194],"comparatively":[4],"analyses":[5],"different":[6,170],"techniques":[7,172],"of":[8,35,57,64,74,80,95,104,107,111,116,135,156,169,201],"allocating":[9],"tasks":[10],"to":[11,70,127],"mobile":[12],"robots":[13],"in":[14,43],"a":[15,33,72,81,92,122,138,147,188,202],"computationally":[16],"efficient":[17],"manner,":[18],"with":[19],"the":[20,23,38,45,58,65,108,112,117,128,133,142,151,157,167,183],"purpose":[21],"that":[22,67,87,165,182],"robotic":[24],"team":[25,66],"should":[26],"satisfy":[27],"an":[28],"imposed":[29],"Boolean":[30],"formula":[31],"over":[32],"set":[34],"tasks.":[36],"At":[37],"same":[39],"time,":[40],"various":[41,99],"tweaks":[42],"solving":[44],"path":[46,129],"planning":[47,130],"problem":[48],"are":[49],"investigated.":[50],"The":[51,154,179],"development":[52],"starts":[53],"from":[54],"structural":[55],"properties":[56],"Robot":[59],"Motion":[60],"Petri":[61],"Net":[62],"model":[63],"allows":[68],"one":[69],"solve":[71],"sequence":[73,134],"Linear":[75,84],"Programming":[76,85],"(LP)":[77],"problems":[78],"instead":[79],"Mixed":[82],"Integer":[83],"(MILP)":[86],"may":[88],"become":[89],"intractable":[90],"for":[91,101,198],"large":[93],"number":[94],"robots.":[96,205],"We":[97],"employ":[98],"strategies":[100],"iterative":[102,184],"roundings":[103],"non-integer":[105],"elements":[106],"LP's":[109],"solution":[110,140,177,195],"task":[113],"allocation":[114],"part":[115],"problem,":[118],"while":[119],"also":[120],"examining":[121],"rounding":[123,171],"technique":[124],"directly":[125],"referring":[126],"step.":[131],"Although":[132],"LPs":[136],"returns":[137],"sub-optimal":[139],"versus":[141],"MILP":[143],"formulation,":[144],"it":[145],"brings":[146],"net":[148],"advantage":[149],"regarding":[150],"reduced":[152],"runtime.":[153],"effectiveness":[155],"approach":[158],"is":[159],"supported":[160],"through":[161],"extensive":[162],"numerical":[163],"simulations":[164],"compare":[166],"influence":[168],"on":[173],"both":[174],"runtime":[175],"cost.":[178],"results":[180],"indicate":[181],"LP-based":[185],"methods":[186],"offer":[187],"good":[189],"trade-off":[190],"between":[191],"tractable":[192],"computation":[193],"quality,":[196],"especially":[197],"teams":[199],"composed":[200],"few":[203],"hundred":[204]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}