{"id":"https://openalex.org/W4416235708","doi":"https://doi.org/10.48550/arxiv.2511.08837","title":"Incorporating the nonlinearity index into adaptive-mesh sequential convex optimization for minimum-fuel low-thrust trajectory design","display_name":"Incorporating the nonlinearity index into adaptive-mesh sequential convex optimization for minimum-fuel low-thrust trajectory design","publication_year":2025,"publication_date":"2025-11-11","ids":{"openalex":"https://openalex.org/W4416235708","doi":"https://doi.org/10.48550/arxiv.2511.08837"},"language":null,"primary_location":{"id":"pmh:oai:arXiv.org:2511.08837","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.08837","pdf_url":"https://arxiv.org/pdf/2511.08837","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2511.08837","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107628295","display_name":"Saeid Tafazzol","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tafazzol, Saeid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5014636068","display_name":"Ehsan Taheri","orcid":"https://orcid.org/0000-0002-6021-7012"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Taheri, Ehsan","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":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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.9934999942779541,"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"}},"topics":[{"id":"https://openalex.org/T11082","display_name":"Spacecraft Dynamics and Control","score":0.9934999942779541,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T11701","display_name":"Space Satellite Systems and Control","score":0.0007999999797903001,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.5723000168800354},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.5465999841690063},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5246000289916992},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5181000232696533},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.5091000199317932},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4799000024795532},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.46790000796318054},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.44110000133514404},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.42289999127388}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.604200005531311},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.5723000168800354},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5465999841690063},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5246000289916992},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5181000232696533},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.5091000199317932},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4799000024795532},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4767000079154968},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.46790000796318054},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.44110000133514404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42649999260902405},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.42289999127388},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4032999873161316},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3481999933719635},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3237000107765198},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.32359999418258667},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.32019999623298645},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.3093000054359436},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.305400013923645},{"id":"https://openalex.org/C2779968344","wikidata":"https://www.wikidata.org/wiki/Q3932925","display_name":"Rendezvous","level":3,"score":0.301800012588501},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2912999987602234},{"id":"https://openalex.org/C207390915","wikidata":"https://www.wikidata.org/wiki/Q1230525","display_name":"Divergence (linguistics)","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2874999940395355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2808000147342682},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.26100000739097595},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2511.08837","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.08837","pdf_url":"https://arxiv.org/pdf/2511.08837","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2511.08837","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.08837","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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2511.08837","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2511.08837","pdf_url":"https://arxiv.org/pdf/2511.08837","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Successive":[0],"convex":[1],"programming":[2],"(SCP)":[3],"is":[4,50,110],"a":[5,38,79,92,118],"powerful":[6],"class":[7],"of":[8,66,74,106],"direct":[9,48],"optimization":[10],"methods,":[11],"known":[12],"for":[13,24,100],"its":[14],"polynomial":[15],"complexity":[16],"and":[17,64,72,122],"computational":[18],"efficiency,":[19],"making":[20],"it":[21,90],"particularly":[22],"suitable":[23],"autonomous":[25],"applications.":[26],"Direct":[27],"methods":[28,49],"are":[29],"also":[30],"referred":[31],"to":[32,55,82],"as":[33],"``discretize-then-optimize''":[34],"with":[35,91],"discretization":[36,67],"being":[37],"fundamental":[39],"solution":[40,58],"step.":[41],"A":[42],"key":[43],"step":[44],"in":[45],"all":[46],"practical":[47],"mesh":[51,85],"refinement,":[52],"which":[53],"aims":[54],"refine":[56],"the":[57,62,97,107,129],"resolution":[59],"by":[60,88],"enhancing":[61],"precision":[63],"quality":[65],"techniques":[68],"through":[69,112],"strategic":[70],"distribution":[71],"placement":[73],"mesh/grid":[75],"points.":[76],"We":[77],"propose":[78],"novel":[80],"method":[81,109],"enhance":[83],"adaptive":[84],"refinement":[86],"stability":[87],"integrating":[89],"nonlinearity-index-based":[93],"trust-region":[94],"strategy":[95],"within":[96],"SCP":[98],"framework":[99],"spacecraft":[101],"trajectory":[102],"design.":[103],"The":[104],"effectiveness":[105],"proposed":[108],"demonstrated":[111],"solving":[113],"minimum-fuel,":[114],"low-thrust":[115],"missions,":[116],"including":[117],"benchmark":[119],"Earth-to-Asteroid":[120],"rendezvous":[121],"an":[123],"Earth-Moon":[124],"L2":[125],"Halo-to-Halo":[126],"transfer":[127],"using":[128],"Circular":[130],"Restricted":[131],"Three-Body":[132],"(CR3BP)":[133],"model.":[134]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-11-14T00:00:00"}