{"id":"https://openalex.org/W7135193294","doi":"https://doi.org/10.1109/iccp68926.2025.11427127","title":"Task-Aware Multi-Robot Navigation with RRT and Ant Colony Optimization in ROS2","display_name":"Task-Aware Multi-Robot Navigation with RRT and Ant Colony Optimization in ROS2","publication_year":2025,"publication_date":"2025-10-16","ids":{"openalex":"https://openalex.org/W7135193294","doi":"https://doi.org/10.1109/iccp68926.2025.11427127"},"language":null,"primary_location":{"id":"doi:10.1109/iccp68926.2025.11427127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp68926.2025.11427127","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 Intelligent Computer Communication and Processing (ICCP)","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/A5129021251","display_name":"Dr\u0103ghici Vlad Matei","orcid":null},"institutions":[{"id":"https://openalex.org/I61641377","display_name":"Universitatea Na\u021bional\u0103 de \u0218tiin\u021b\u0103 \u0219i Tehnologie Politehnica Bucure\u0219ti","ror":"https://ror.org/0558j5q12","country_code":"RO","type":"education","lineage":["https://openalex.org/I61641377"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Dr\u0103ghici Vlad Matei","raw_affiliation_strings":["National University of Science and Technology POLITEHNICA Bucharest,Computer Science Department,Bucharest,Romania"],"affiliations":[{"raw_affiliation_string":"National University of Science and Technology POLITEHNICA Bucharest,Computer Science Department,Bucharest,Romania","institution_ids":["https://openalex.org/I61641377"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5129021251"],"corresponding_institution_ids":["https://openalex.org/I61641377"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.76734379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.20669999718666077,"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.20669999718666077,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.12349999696016312,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.05999999865889549,"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/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.48019999265670776},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.3050999939441681},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.2824999988079071},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.2587999999523163},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.24300000071525574}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5705000162124634},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.48019999265670776},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.38029998540878296},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.3050999939441681},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.2824999988079071},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.2711000144481659},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2587999999523163},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.24300000071525574},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.24240000545978546},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.23600000143051147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iccp68926.2025.11427127","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccp68926.2025.11427127","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 Intelligent Computer Communication and Processing (ICCP)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1620919054","https://openalex.org/W1971086298","https://openalex.org/W2105761985","https://openalex.org/W2117211893","https://openalex.org/W2157488300","https://openalex.org/W2167340365","https://openalex.org/W2411093439","https://openalex.org/W3007469703","https://openalex.org/W4280571816","https://openalex.org/W4391654576","https://openalex.org/W4392912258"],"related_works":[],"abstract_inverted_index":{"Multi-Agent":[0],"Pathfinding":[1],"(MAPF)":[2],"ensures":[3],"collisionfree":[4],"motion":[5],"for":[6,176],"teams":[7],"of":[8,18,140],"autonomous":[9],"robots,":[10,169],"yet":[11],"practical":[12],"applications":[13],"also":[14],"demand":[15],"intelligent":[16],"distribution":[17],"tasks":[19],"across":[20],"those":[21],"robots.":[22,47],"We":[23],"present":[24],"a":[25,55,72,118,173],"fully":[26],"integrated":[27],"framework":[28],"that":[29,78,132],"couples":[30],"optimal":[31],"path":[32],"planning":[33],"with":[34,108,114,154],"dependency-aware":[35],"task":[36,112],"allocation":[37],"and":[38,45,58,63,84,122,137,157,185],"validated":[39],"from":[40,103,165],"graph-based":[41],"models":[42],"to":[43,106,149,167],"simulation":[44],"realworld":[46],"First,":[48],"we":[49,110],"develop":[50],"scalable":[51],"MAPF":[52],"algorithms":[53,67],"in":[54,71,182],"graph":[56],"abstraction":[57],"study":[59],"their":[60],"complexity,":[61],"makespan":[62],"sum-of-costs":[64],"behaviour.":[65],"These":[66],"are":[68],"then":[69],"embedded":[70],"ROS":[73],"2":[74],"+":[75],"Gazebo":[76],"environment":[77],"incorporates":[79],"realistic":[80],"kinematics,":[81],"network":[82],"delays":[83],"partial":[85],"observability;":[86],"Cartographer":[87],"provides":[88],"on-line":[89],"occupancy":[90],"grids":[91],"while":[92],"the":[93,101,141],"Nav2":[94],"stack":[95,146],"supplies":[96],"local/global":[97],"planners.":[98],"To":[99],"elevate":[100],"system":[102],"\u2018just":[104],"moving\u2019":[105],"\u2018moving":[107],"purpose\u2019,":[109],"formulate":[111],"assignment":[113],"precedence":[115],"constraints":[116],"as":[117],"combinatorial":[119],"optimization":[120],"problem":[121],"solve":[123],"it":[124],"using":[125],"an":[126],"Ant":[127],"Colony":[128],"Optimization":[129],"(ACO)":[130],"metaheuristic":[131],"minimizes":[133],"total":[134],"completion":[135],"time":[136,139],"idle":[138],"robot.":[142],"The":[143],"same":[144],"software":[145],"is":[147],"ported":[148],"differential":[150],"drive":[151],"robots":[152],"equipped":[153],"2-D":[155],"LiDAR":[156],"Raspberry":[158],"Pi":[159],"controllers.":[160],"By":[161],"demonstrating":[162],"end-to-end":[163],"transfer":[164],"theory":[166],"real":[168],"this":[170],"work":[171],"establishes":[172],"reproducible":[174],"pathway":[175],"deploying":[177],"cooperative,":[178],"task-driven":[179],"multi-robot":[180],"systems":[181],"manufacturing,":[183],"logistics,":[184],"smart-city":[186],"scenarios.":[187]},"counts_by_year":[],"updated_date":"2026-03-15T07:15:06.534987","created_date":"2026-03-14T00:00:00"}