{"id":"https://openalex.org/W4414322589","doi":"https://doi.org/10.1109/ecmr65884.2025.11163178","title":"Hierarchical Token Passing Algorithm for Multi-Agent Pickup and Delivery","display_name":"Hierarchical Token Passing Algorithm for Multi-Agent Pickup and Delivery","publication_year":2025,"publication_date":"2025-09-02","ids":{"openalex":"https://openalex.org/W4414322589","doi":"https://doi.org/10.1109/ecmr65884.2025.11163178"},"language":"en","primary_location":{"id":"doi:10.1109/ecmr65884.2025.11163178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr65884.2025.11163178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Conference on Mobile Robots (ECMR)","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/A5119665429","display_name":"Marcello Bavaro","orcid":null},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marcello Bavaro","raw_affiliation_strings":["Marcello Bavaro and Francesco Amigoni are With the Artificial Intelligence and Robotics Laboratory, Politecnico di Milano,Milano,Italy,20133"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Marcello Bavaro and Francesco Amigoni are With the Artificial Intelligence and Robotics Laboratory, Politecnico di Milano,Milano,Italy,20133","institution_ids":["https://openalex.org/I93860229"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028729032","display_name":"Francesco Amigoni","orcid":"https://orcid.org/0000-0001-8146-6213"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Amigoni","raw_affiliation_strings":["Marcello Bavaro and Francesco Amigoni are With the Artificial Intelligence and Robotics Laboratory, Politecnico di Milano,Milano,Italy,20133"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Marcello Bavaro and Francesco Amigoni are With the Artificial Intelligence and Robotics Laboratory, Politecnico di Milano,Milano,Italy,20133","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I93860229"],"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":"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.9879000186920166,"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.9879000186920166,"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/T12288","display_name":"Optimization and Search Problems","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/pickup","display_name":"Pickup","score":0.510200023651123},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.3028999865055084},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.2985999882221222},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2727999985218048},{"id":"https://openalex.org/keywords/message-passing","display_name":"Message passing","score":0.2574999928474426}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6816999912261963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5972999930381775},{"id":"https://openalex.org/C2776221269","wikidata":"https://www.wikidata.org/wiki/Q572648","display_name":"Pickup","level":3,"score":0.510200023651123},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3695000112056732},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.31119999289512634},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.3028999865055084},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2985999882221222},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2727999985218048},{"id":"https://openalex.org/C854659","wikidata":"https://www.wikidata.org/wiki/Q1859284","display_name":"Message passing","level":2,"score":0.2574999928474426},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2540000081062317}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/ecmr65884.2025.11163178","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ecmr65884.2025.11163178","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 European Conference on Mobile Robots (ECMR)","raw_type":"proceedings-article"},{"id":"pmh:oai:re.public.polimi.it:11311/1308348","is_oa":false,"landing_page_url":"https://hdl.handle.net/11311/1308348","pdf_url":null,"source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1488757178","https://openalex.org/W2191404279","https://openalex.org/W2914864020","https://openalex.org/W2962821458","https://openalex.org/W2964997335","https://openalex.org/W2987539450","https://openalex.org/W3079592479","https://openalex.org/W3158757609","https://openalex.org/W3190828211","https://openalex.org/W3204625264","https://openalex.org/W4283791159","https://openalex.org/W4389000989","https://openalex.org/W4399261747","https://openalex.org/W4401922392"],"related_works":[],"abstract_inverted_index":{"The":[0,136],"problem":[1,93],"of":[2,6,9,36,45,47,54,66,75,98,106,113,141,146,152,156],"coordinating":[3],"the":[4,42,50,52,64,73,99,103,111,142,150,157],"movements":[5],"a":[7,18,82,95,123,139,153],"group":[8],"agents":[10],"that":[11,101,130],"perform":[12],"pickup":[13,37],"and":[14,25,38,119],"delivery":[15,39],"operations":[16],"in":[17,57,72,115,134],"known":[19],"environment":[20,100],"is":[21],"called":[22,85],"Multi-Agent":[23],"Pickup":[24],"Delivery":[26],"(MAPD).":[27],"Warehouses,":[28],"where":[29],"mobile":[30],"robots":[31,55],"complete":[32],"transportation":[33],"tasks":[34],"composed":[35],"operations,":[40],"are":[41],"typical":[43],"domain":[44],"application":[46],"MAPD.":[48],"Over":[49],"years,":[51],"number":[53],"employed":[56],"these":[58],"settings":[59],"has":[60],"gradually":[61],"increased":[62],"to":[63,69,90],"order":[65],"hundreds,":[67],"leading":[68],"new":[70,83],"challenges":[71],"scalability":[74],"algorithms.":[76],"In":[77],"this":[78,92],"paper,":[79],"we":[80],"introduce":[81],"algorithm":[84,125],"hierarchical":[86],"Token":[87],"Passing":[88],"(h-TP)":[89],"face":[91],"through":[94],"logical":[96],"segmentation":[97],"enables":[102],"parallel":[104],"computation":[105],"agents'":[107],"paths.":[108],"We":[109],"test":[110],"performance":[112],"h-TP":[114],"simulated":[116],"warehouse":[117],"environments":[118],"compare":[120],"it":[121],"against":[122],"classical":[124],"for":[126],"solving":[127],"MAPD":[128],"problems":[129],"does":[131],"not":[132],"operate":[133],"parallel.":[135],"results":[137],"show":[138],"reduction":[140],"total":[143],"execution":[144],"time":[145],"about":[147],"50%":[148],"at":[149],"cost":[151],"small":[154],"worsening":[155],"solution":[158],"quality.":[159]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}