{"id":"https://openalex.org/W7133831903","doi":"https://doi.org/10.48550/arxiv.2603.03978","title":"Map-Agnostic And Interactive Safety-Critical Scenario Generation via Multi-Objective Tree Search","display_name":"Map-Agnostic And Interactive Safety-Critical Scenario Generation via Multi-Objective Tree Search","publication_year":2026,"publication_date":"2026-03-04","ids":{"openalex":"https://openalex.org/W7133831903","doi":"https://doi.org/10.48550/arxiv.2603.03978"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2603.03978","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5128139131","display_name":"Wenyun Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Wenyun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024182112","display_name":"Zejian Deng","orcid":"https://orcid.org/0000-0002-2765-3162"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Deng, Zejian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5128133996","display_name":"Chen Sun","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sun, Chen","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":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20711149,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9214000105857849,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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/T11099","display_name":"Autonomous Vehicle Technology and Safety","score":0.9214000105857849,"subfield":{"id":"https://openalex.org/subfields/2203","display_name":"Automotive 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.02410000003874302,"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/T10524","display_name":"Traffic control and management","score":0.00570000009611249,"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/monte-carlo-tree-search","display_name":"Monte Carlo tree search","score":0.6783999800682068},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5637999773025513},{"id":"https://openalex.org/keywords/collision","display_name":"Collision","score":0.4487000107765198},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43720000982284546},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.40139999985694885},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3824000060558319},{"id":"https://openalex.org/keywords/scenario-testing","display_name":"Scenario testing","score":0.35179999470710754},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.349700003862381}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7038000226020813},{"id":"https://openalex.org/C46149586","wikidata":"https://www.wikidata.org/wiki/Q11785332","display_name":"Monte Carlo tree search","level":3,"score":0.6783999800682068},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5637999773025513},{"id":"https://openalex.org/C121704057","wikidata":"https://www.wikidata.org/wiki/Q352070","display_name":"Collision","level":2,"score":0.4487000107765198},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43720000982284546},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.40139999985694885},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3824000060558319},{"id":"https://openalex.org/C80519477","wikidata":"https://www.wikidata.org/wiki/Q3532236","display_name":"Scenario testing","level":3,"score":0.35179999470710754},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.349700003862381},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.3361000120639801},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.30799999833106995},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.28220000863075256},{"id":"https://openalex.org/C52421305","wikidata":"https://www.wikidata.org/wiki/Q1151499","display_name":"Particle filter","level":3,"score":0.27649998664855957},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.2705000042915344},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.262800008058548},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.26170000433921814},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.26089999079704285},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C72161134","wikidata":"https://www.wikidata.org/wiki/Q5421219","display_name":"Expert elicitation","level":2,"score":0.25679999589920044},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.25619998574256897},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2603.03978","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2603.03978","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.03978","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2603.03978","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","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":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[{"score":0.5458901524543762,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Generating":[0],"safety-critical":[1,44],"scenarios":[2,170],"is":[3,92,104],"essential":[4],"for":[5,41,189],"validating":[6],"the":[7,70,195],"robustness":[8],"of":[9,72,197],"autonomous":[10,192],"driving":[11],"systems,":[12],"yet":[13,199],"existing":[14],"methods":[15],"often":[16],"struggle":[17],"to":[18,94],"produce":[19],"collisions":[20],"that":[21,150],"are":[22],"both":[23],"realistic":[24,122,198],"and":[25,58,85,106,165,180],"diverse":[26,73],"while":[27,159],"ensuring":[28],"explicit":[29],"interaction":[30],"logic":[31],"among":[32],"traffic":[33,119],"participants.":[34],"This":[35],"paper":[36],"presents":[37],"a":[38,65,186],"novel":[39],"framework":[40,152],"traffic-flow":[42,204],"level":[43],"scenario":[45,109],"generation":[46,110,196],"via":[47],"multi-objective":[48],"Monte":[49],"Carlo":[50],"Tree":[51],"Search":[52],"(MCTS).":[53],"We":[54,132],"reframe":[55],"trajectory":[56],"feasibility":[57,164],"naturalistic":[59],"behavior":[60],"as":[61,174],"optimization":[62],"objectives":[63],"within":[64],"unified":[66],"evaluation":[67],"function,":[68],"enabling":[69,121],"discovery":[71],"collision":[74,156],"events":[75],"without":[76],"compromising":[77],"realism.":[78],"A":[79],"hybrid":[80],"Upper":[81],"Confidence":[82,87],"Bound":[83,88],"(UCB)":[84],"Lower":[86],"(LCB)":[89],"search":[90],"strategy":[91],"introduced":[93],"balance":[95],"exploratory":[96],"efficiency":[97],"with":[98,111,162],"risk-averse":[99],"decision-making.":[100],"Furthermore,":[101],"our":[102,134,151],"method":[103],"map-agnostic":[105],"supports":[107],"interactive":[108],"each":[112],"vehicle":[113,178],"individually":[114],"powered":[115],"by":[116,176],"SUMO's":[117],"microscopic":[118],"models,":[120],"agent":[123],"behaviors":[124],"in":[125,141],"arbitrary":[126],"geographic":[127],"locations":[128],"imported":[129],"from":[130],"OpenStreetMap.":[131],"validate":[133],"approach":[135],"across":[136],"four":[137],"high-risk":[138],"accident":[139],"zones":[140],"Hong":[142],"Kong's":[143],"complex":[144],"urban":[145],"environments.":[146],"Experimental":[147],"results":[148],"demonstrate":[149],"achieves":[153],"an":[154],"85\\%":[155],"failure":[157],"rate":[158],"generating":[160],"trajectories":[161],"superior":[163],"comfort":[166],"metrics.":[167],"The":[168],"resulting":[169],"exhibit":[171],"greater":[172],"complexity,":[173],"evidenced":[175],"increased":[177],"mileage":[179],"CO\\(_2\\)":[181],"emissions.":[182],"Our":[183],"work":[184],"provides":[185],"principled":[187],"solution":[188],"stress":[190],"testing":[191],"vehicles":[193],"through":[194],"infrequent":[200],"corner":[201],"cases":[202],"at":[203],"level.":[205]},"counts_by_year":[],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2026-03-06T00:00:00"}