{"id":"https://openalex.org/W7154726526","doi":"https://doi.org/10.48550/arxiv.2604.15004","title":"On-Line Policy Iteration with Trajectory-Driven Policy Generation","display_name":"On-Line Policy Iteration with Trajectory-Driven Policy Generation","publication_year":2026,"publication_date":"2026-04-16","ids":{"openalex":"https://openalex.org/W7154726526","doi":"https://doi.org/10.48550/arxiv.2604.15004"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.15004","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15004","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.15004","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133867170","display_name":"Yuchao Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Yuchao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5054227954","display_name":"Fei Chen","orcid":"https://orcid.org/0000-0002-5395-230X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Chen, Fei","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133887016","display_name":"Yingke Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Yingke","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133884289","display_name":"Chuchu Fan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fan, Chuchu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bertsekas, Dimitri","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.3019999861717224,"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.3019999861717224,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.2581000030040741,"subfield":{"id":"https://openalex.org/subfields/2202","display_name":"Aerospace 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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.07919999957084656,"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/sequence","display_name":"Sequence (biology)","score":0.6431999802589417},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.619700014591217},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.5803999900817871},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5601000189781189},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5164999961853027},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.49230000376701355},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.45170000195503235},{"id":"https://openalex.org/keywords/control","display_name":"Control (management)","score":0.4481000006198883}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.6431999802589417},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6324999928474426},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.619700014591217},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5950000286102295},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.5803999900817871},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5601000189781189},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5164999961853027},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.49230000376701355},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45170000195503235},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.4481000006198883},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.3400999903678894},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.3398999869823456},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.299699991941452},{"id":"https://openalex.org/C123587114","wikidata":"https://www.wikidata.org/wiki/Q2101508","display_name":"Policy analysis","level":2,"score":0.2784999907016754},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.2718000113964081},{"id":"https://openalex.org/C177142836","wikidata":"https://www.wikidata.org/wiki/Q44455","display_name":"Game theory","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.15004","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15004","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.15004","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.15004","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5815178155899048,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,12,121,146],"consider":[1],"deterministic":[2],"finite-horizon":[3],"optimal":[4],"control":[5],"problems":[6,59,174],"with":[7,125,166],"a":[8,22,28,39,92,138,150,176,187],"fixed":[9],"initial":[10,68,113],"state.":[11],"introduce":[13],"an":[14],"on-line":[15],"policy":[16,37,164,169],"iteration":[17,165],"method,":[18],"which,":[19],"starting":[20,64],"from":[21,65,128],"given":[23,112],"policy,":[24],"however":[25],"obtained,":[26],"generates":[27],"sequence":[29,100],"of":[30,101,103,144,153,161],"cost-improving":[31],"policies":[32,106,194],"and":[33,73,131,163,171],"corresponding":[34],"trajectories.":[35],"Each":[36],"produces":[38],"trajectory,":[40],"which":[41],"is":[42,56,84,107],"used":[43,89],"in":[44,141],"turn":[45],"to":[46,87,173,190],"generate":[47],"data":[48],"for":[49,76,110,118,135],"training":[50],"the":[51,66,82,99,104,111,142],"next":[52],"policy.":[53],"The":[54],"method":[55,83],"motivated":[57],"by":[58],"that":[60,98],"are":[61],"repeatedly":[62],"solved":[63],"same":[67],"state,":[69],"including":[70],"discrete":[71],"optimization":[72,130],"path":[74,133],"planning":[75,134],"repetitive":[77],"tasks.":[78],"For":[79],"such":[80],"problems,":[81],"fast":[85],"enough":[86],"be":[88],"on-line.":[90],"Under":[91],"natural":[93],"consistency":[94],"condition,":[95],"we":[96],"show":[97],"costs":[102],"generated":[105],"monotonically":[108],"improving":[109],"state":[114],"(but":[115],"not":[116],"necessarily":[117],"other":[119],"states).":[120],"illustrate":[122],"our":[123,154],"results":[124],"computational":[126],"studies":[127],"combinatorial":[129],"3-dimensional":[132],"drones":[136],"{and":[137],"robot":[139],"arm}":[140],"presence":[143],"obstacles.":[145],"also":[147,185],"discuss":[148],"briefly":[149],"stochastic":[151],"counterpart":[152],"algorithm.":[155],"Our":[156],"proposed":[157],"framework":[158],"combines":[159],"elements":[160],"rollout":[162],"flexible":[167],"trajectory-based":[168],"representations,":[170],"applies":[172],"involving":[175],"single":[177],"as":[178,180],"well":[179],"multiple":[181],"decision":[182],"makers.":[183],"It":[184],"provides":[186],"principled":[188],"way":[189],"train":[191],"neural":[192],"network-based":[193],"using":[195],"trajectory":[196],"data,":[197],"while":[198],"preserving":[199],"monotonic":[200],"cost":[201],"improvement.":[202]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-18T00:00:00"}