{"id":"https://openalex.org/W66883510","doi":"https://doi.org/10.3233/978-1-58603-891-5-929","title":"Robust Reservation-Based Multi-Agent Routing","display_name":"Robust Reservation-Based Multi-Agent Routing","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W66883510","doi":"https://doi.org/10.3233/978-1-58603-891-5-929","mag":"66883510"},"language":"en","primary_location":{"id":"doi:10.3233/978-1-58603-891-5-929","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-58603-891-5-929","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.3233/978-1-58603-891-5-929","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5112227470","display_name":"Adriaan ter Mors","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156607","display_name":"Almende (Netherlands)","ror":"https://ror.org/05af63f35","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210156607"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"ter Mors Adriaan","raw_affiliation_strings":["Almende BV, adriaan@almende.org#TAB#"],"affiliations":[{"raw_affiliation_string":"Almende BV, adriaan@almende.org#TAB#","institution_ids":["https://openalex.org/I4210156607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109353240","display_name":"Xiaoyu Mao","orcid":"https://orcid.org/0009-0006-2884-6288"},"institutions":[{"id":"https://openalex.org/I4210156607","display_name":"Almende (Netherlands)","ror":"https://ror.org/05af63f35","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210156607"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mao Xiaoyu","raw_affiliation_strings":["Almende BV, xiaoyu@almende.org#TAB#"],"affiliations":[{"raw_affiliation_string":"Almende BV, xiaoyu@almende.org#TAB#","institution_ids":["https://openalex.org/I4210156607"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5082790394","display_name":"J. Zutt","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Zutt Jonne","raw_affiliation_strings":["Delft University of Technology, j.zutt@tudelft.nl#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, j.zutt@tudelft.nl#TAB#","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087895051","display_name":"Cees Witteveen","orcid":"https://orcid.org/0000-0002-7717-1209"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Witteveen Cees","raw_affiliation_strings":["Delft University of Technology, c.witteveen@tudelft.nl#TAB#"],"affiliations":[{"raw_affiliation_string":"Delft University of Technology, c.witteveen@tudelft.nl#TAB#","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111483082","display_name":"Nico Roos","orcid":null},"institutions":[{"id":"https://openalex.org/I34352273","display_name":"Maastricht University","ror":"https://ror.org/02jz4aj89","country_code":"NL","type":"education","lineage":["https://openalex.org/I34352273"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Roos Nico","raw_affiliation_strings":["Maastricht University, roos@micc.unimaas.nl#TAB#"],"affiliations":[{"raw_affiliation_string":"Maastricht University, roos@micc.unimaas.nl#TAB#","institution_ids":["https://openalex.org/I34352273"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5112227470"],"corresponding_institution_ids":["https://openalex.org/I4210156607"],"apc_list":null,"apc_paid":null,"fwci":0.5778,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60951526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"929","last_page":"930"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9993000030517578,"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.9993000030517578,"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.9987999796867371,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9976999759674072,"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/reservation","display_name":"Reservation","score":0.7472443580627441},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5580238103866577},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5468934178352356},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5432390570640564},{"id":"https://openalex.org/keywords/resource","display_name":"Resource (disambiguation)","score":0.488706111907959},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.45748984813690186},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4420100450515747},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3838808536529541},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3284751772880554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15787187218666077},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.07739511132240295}],"concepts":[{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.7472443580627441},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5580238103866577},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5468934178352356},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5432390570640564},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","level":2,"score":0.488706111907959},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.45748984813690186},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4420100450515747},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3838808536529541},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3284751772880554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15787187218666077},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.07739511132240295},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.3233/978-1-58603-891-5-929","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-58603-891-5-929","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},{"id":"pmh:oai:cris.maastrichtuniversity.nl:openaire/70a531e2-1f52-4e64-8b07-8c5814a2ad1d","is_oa":false,"landing_page_url":"https://cris.maastrichtuniversity.nl/en/publications/70a531e2-1f52-4e64-8b07-8c5814a2ad1d","pdf_url":null,"source":{"id":"https://openalex.org/S4306402616","display_name":"Research Publications (Maastricht University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I34352273","host_organization_name":"Maastricht University","host_organization_lineage":["https://openalex.org/I34352273"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mors, A T, Mao, X, Zutt, J, Witteveen, C & Roos, N 2008, Robust Reservation-Based Multi-Agent Routing. in ECAI. pp. 929-930. https://doi.org/10.3233/978-1-58603-891-5-929","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"mag:66883510","is_oa":false,"landing_page_url":"http://www.st.ewi.tudelft.nl/%7Eadriaan/pubs/mors08ecaiRobustRoutePlanning.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306418308","display_name":"European Conference on Artificial Intelligence","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"European Conference on Artificial Intelligence","raw_type":null}],"best_oa_location":{"id":"doi:10.3233/978-1-58603-891-5-929","is_oa":true,"landing_page_url":"https://doi.org/10.3233/978-1-58603-891-5-929","pdf_url":null,"source":{"id":"https://openalex.org/S4210201731","display_name":"Frontiers in artificial intelligence and applications","issn_l":"0922-6389","issn":["0922-6389","1879-8314"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Frontiers in Artificial Intelligence and Applications","raw_type":"book-chapter"},"sustainable_development_goals":[{"score":0.6299999952316284,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W88527779","https://openalex.org/W2025582715","https://openalex.org/W2042342424","https://openalex.org/W2070224057","https://openalex.org/W2108184083","https://openalex.org/W2135997825","https://openalex.org/W2140013028","https://openalex.org/W2161484642","https://openalex.org/W2161644760"],"related_works":["https://openalex.org/W2379215383","https://openalex.org/W2271928667","https://openalex.org/W246884077","https://openalex.org/W3210156514","https://openalex.org/W2387553833","https://openalex.org/W2131387076","https://openalex.org/W2381833100","https://openalex.org/W907625775","https://openalex.org/W2124749316","https://openalex.org/W2947483497"],"abstract_inverted_index":{"In":[0],"a":[1,44,65],"multi-agent":[2,74],"routing":[3,75],"problem,":[4],"agents":[5,53],"must":[6],"find":[7],"the":[8,49,57,60],"shortest-time":[9],"path":[10],"from":[11],"source":[12],"to":[13],"destination":[14],"while":[15],"avoiding":[16],"deadlocks":[17],"and":[18,33,38,63],"collisions":[19],"with":[20],"other":[21],"agents.":[22],"Agents":[23],"travel":[24,67],"over":[25],"an":[26],"infrastructure":[27],"of":[28,52],"resources":[29],"(such":[30],"as":[31],"intersections":[32],"road":[34],"segments":[35],"between":[36],"intersections),":[37],"each":[39],"resource":[40,58],"r":[41],"has":[42],"(i)":[43],"capacity":[45],"C(r),":[46],"which":[47],"is":[48],"maximum":[50],"number":[51],"that":[54],"may":[55],"occupy":[56],"at":[59],"same":[61],"time,":[62],"(ii)":[64],"minimum":[66],"time":[68],"D(r).":[69],"Example":[70],"1":[71],"illustrates":[72],"this":[73],"problem.":[76]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}