{"id":"https://openalex.org/W2157928957","doi":"https://doi.org/10.1109/cdc.2004.1429671","title":"Numerical algorithms for continuous optimal trajectories","display_name":"Numerical algorithms for continuous optimal trajectories","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W2157928957","doi":"https://doi.org/10.1109/cdc.2004.1429671","mag":"2157928957"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2004.1429671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2004.1429671","pdf_url":null,"source":{"id":"https://openalex.org/S4363608267","display_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","raw_type":"proceedings-article"},"type":"article","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/A5100569647","display_name":"Xiang Ma","orcid":"https://orcid.org/0000-0003-0964-4753"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xiang Ma","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103073490","display_name":"David A. Casta\u00f1\u00f3n","orcid":"https://orcid.org/0000-0002-9635-9776"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"D.A. Castanon","raw_affiliation_strings":["Boston University, Boston, MA, USA"],"affiliations":[{"raw_affiliation_string":"Boston University, Boston, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100569647"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.37777778,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"5427","last_page":"5432 Vol.5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9943000078201294,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10067","display_name":"Stochastic processes and financial applications","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.7387060523033142},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5869980454444885},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5568538308143616},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5528978109359741},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5295575261116028},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.5266925096511841},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4980790615081787},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.48784947395324707},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.4739289879798889},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.47178953886032104},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.45737791061401367},{"id":"https://openalex.org/keywords/stochastic-control","display_name":"Stochastic control","score":0.44849279522895813},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44139599800109863},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.4128516912460327},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.3539581894874573},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3289370834827423},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.216698557138443}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7387060523033142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5869980454444885},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5568538308143616},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5528978109359741},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5295575261116028},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.5266925096511841},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4980790615081787},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.48784947395324707},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.4739289879798889},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.47178953886032104},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.45737791061401367},{"id":"https://openalex.org/C170131372","wikidata":"https://www.wikidata.org/wiki/Q7617811","display_name":"Stochastic control","level":3,"score":0.44849279522895813},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44139599800109863},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.4128516912460327},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3539581894874573},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3289370834827423},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.216698557138443},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2004.1429671","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2004.1429671","pdf_url":null,"source":{"id":"https://openalex.org/S4363608267","display_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1516698920","https://openalex.org/W1964377184","https://openalex.org/W1999244633","https://openalex.org/W2003009438","https://openalex.org/W2049391017","https://openalex.org/W2054113582","https://openalex.org/W2055341194","https://openalex.org/W2055962914","https://openalex.org/W2057462050","https://openalex.org/W2094668823","https://openalex.org/W2098432798","https://openalex.org/W2132202988","https://openalex.org/W2166739719","https://openalex.org/W2561843528","https://openalex.org/W4241127195","https://openalex.org/W4302367620","https://openalex.org/W6630761822"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W4310124294","https://openalex.org/W4318196244"],"abstract_inverted_index":{"We":[0,11,98],"consider":[1],"the":[2,22,27,34,38,43,51,60,71,101,111,116],"problem":[3],"of":[4,16,42,53,103],"computing":[5,110],"minimum-cost":[6],"trajectories":[7,114],"in":[8],"continuous":[9,113],"space.":[10],"focus":[12],"on":[13,26,37],"two":[14],"classes":[15],"problems:":[17],"isotropic":[18,65],"cost":[19,23,31,35],"problems":[20,32],"where":[21,33],"depends":[24,36],"only":[25],"position,":[28],"and":[29,40,83,107],"anisotropic":[30,90],"position":[39],"direction":[41],"trajectory.":[44],"Using":[45],"stochastic":[46,118],"control":[47,119],"discretization,":[48],"we":[49],"evaluate":[50],"performance":[52],"different":[54],"value":[55],"iteration":[56],"techniques":[57],"for":[58,89,109],"solving":[59],"dynamic":[61],"programming":[62],"equations.":[63],"For":[64],"problems,":[66,91],"our":[67],"results":[68],"show":[69],"that":[70],"recently":[72],"developed":[73],"fast-sweeping":[74],"algorithms":[75,82,95],"offer":[76],"significant":[77],"computation":[78],"advantages":[79],"over":[80],"Dijkstra-type":[81],"adaptive":[84,92],"label":[85,93],"correcting":[86,94],"algorithms.":[87],"However,":[88],"are":[96],"fastest.":[97],"also":[99],"investigate":[100],"accuracy":[102],"discrete":[104,117],"graph":[105],"approximations,":[106],"approaches":[108],"optimal":[112],"from":[115],"solution.":[120]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}