{"id":"https://openalex.org/W7224087619","doi":"https://doi.org/10.48550/arxiv.2610.37275","title":"A heuristic for optimal coordination of autonomous vehicles: static problems","display_name":"A heuristic for optimal coordination of autonomous vehicles: static problems","publication_year":2026,"publication_date":"2026-10-27","ids":{"openalex":"https://openalex.org/W7224087619","doi":"https://doi.org/10.48550/arxiv.2610.37275"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.37275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.37275","pdf_url":"https://arxiv.org/pdf/2610.37275","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2610.37275","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043629852","display_name":"Saugat Shahi","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shahi, Saugat","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056468963","display_name":"Filippo Fabiani","orcid":"https://orcid.org/0000-0002-9911-4758","observed_orcids":["https://orcid.org/0000-0002-9911-4758"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fabiani, Filippo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5106707940","display_name":"Mario Zanon","orcid":"https://orcid.org/0000-0001-5925-0440","observed_orcids":["https://orcid.org/0000-0001-5925-0440"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zanon, Mario","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"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":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9945999979972839,"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"}},"topics":[{"id":"https://openalex.org/T10524","display_name":"Traffic control and management","score":0.9945999979972839,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.0013000000035390258,"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/T11500","display_name":"Evacuation and Crowd Dynamics","score":0.0005000000237487257,"subfield":{"id":"https://openalex.org/subfields/3311","display_name":"Safety Research"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/autonomous-vehicles","display_name":"autonomous vehicles","score":0.9649999737739563},{"id":"https://openalex.org/keywords/vehicle-coordination","display_name":"vehicle coordination","score":0.7459999918937683},{"id":"https://openalex.org/keywords/unsignalized-intersections","display_name":"unsignalized intersections","score":0.9959999918937683},{"id":"https://openalex.org/keywords/trajectory-planning","display_name":"trajectory planning","score":0.8600000143051147},{"id":"https://openalex.org/keywords/hierarchical-optimization","display_name":"hierarchical optimization","score":0.8209999799728394},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.8659999966621399},{"id":"https://openalex.org/keywords/scheduling-heuristics","display_name":"heuristic scheduling","score":0.6629999876022339},{"id":"https://openalex.org/keywords/sensitivity-analysis","display_name":"sensitivity analysis","score":0.6010000109672546},{"id":"https://openalex.org/keywords/fifo","display_name":"FIFO","score":0.890999972820282}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6704999804496765},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6703000068664551},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6442000269889832},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6274999976158142},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.521399974822998},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.49790000915527344},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.48510000109672546},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4505000114440918},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.4438000023365021},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.4187000095844269},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.41260001063346863},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.37310001254081726},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.34950000047683716},{"id":"https://openalex.org/C79487989","wikidata":"https://www.wikidata.org/wiki/Q934680","display_name":"Vehicle dynamics","level":2,"score":0.31859999895095825},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.3109999895095825},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.3100999891757965},{"id":"https://openalex.org/C2989549987","wikidata":"https://www.wikidata.org/wiki/Q350882","display_name":"Route planning","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29789999127388},{"id":"https://openalex.org/C148220186","wikidata":"https://www.wikidata.org/wiki/Q7111912","display_name":"Outcome (game theory)","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2705000042915344}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.37275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.37275","pdf_url":"https://arxiv.org/pdf/2610.37275","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},{"id":"doi:10.48550/arxiv.2610.37275","doi":"https://doi.org/10.48550/arxiv.2610.37275","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.37275","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2610.37275","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.37275","pdf_url":"https://arxiv.org/pdf/2610.37275","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.5142999887466431},{"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure","score":0.428600013256073}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7224087619.pdf","grobid_xml":"https://content.openalex.org/works/W7224087619.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7224114872","https://openalex.org/W7224130412","https://openalex.org/W4395065562","https://openalex.org/W4405360433","https://openalex.org/W3014355251","https://openalex.org/W2887843538","https://openalex.org/W2804902740","https://openalex.org/W7007859056","https://openalex.org/W2986219004","https://openalex.org/W3037207810"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,48,76],"coordination":[3],"of":[4,40,43,54,86],"autonomous":[5],"vehicles":[6],"at":[7],"unsignalized":[8],"intersections,":[9],"where":[10],"trajectory":[11],"planning":[12],"and":[13,62],"crossing-order":[14],"decisions":[15],"are":[16],"intrinsically":[17],"coupled,":[18],"thereby":[19],"making":[20],"their":[21],"simultaneous":[22],"optimization":[23],"intractable":[24],"in":[25,47],"practice.":[26],"To":[27],"this":[28],"end,":[29],"we":[30],"propose":[31],"a":[32,36,41,58,63,83],"heuristic":[33,65],"based":[34],"on":[35],"hierarchical":[37],"structure":[38],"consisting":[39],"series":[42],"nonlinear":[44],"programs":[45],"(NLP)":[46],"lower":[49],"level,":[50],"which":[51],"optimizes":[52],"trajectories":[53],"each":[55],"vehicle":[56],"for":[57],"given":[59],"crossing":[60,69],"order,":[61],"high-level":[64],"to":[66,99],"design":[67],"new":[68],"schedules":[70],"that":[71,90],"exploits":[72],"sensitivity":[73],"information":[74],"from":[75],"lower-level":[77],"NLPs.":[78],"Extensive":[79],"numerical":[80],"simulations":[81],"across":[82],"broad":[84],"range":[85],"traffic":[87],"scenarios":[88],"demonstrate":[89],"our":[91],"strategy":[92],"achieves":[93],"substantially":[94],"improved":[95],"scheduling":[96],"with":[97],"respect":[98],"first-in-first-out":[100],"ordering":[101],"while":[102],"preserving":[103],"computational":[104],"tractability.":[105]},"counts_by_year":[],"updated_date":"2026-11-01T11:40:01.658920","created_date":"2026-10-29T00:00:00"}