{"id":"https://openalex.org/W7133299283","doi":"https://doi.org/10.48550/arxiv.2603.00871","title":"Hippo: High-performance Interior-Point and Projection-based Solver for Generic Constrained Trajectory Optimization","display_name":"Hippo: High-performance Interior-Point and Projection-based Solver for Generic Constrained Trajectory Optimization","publication_year":2026,"publication_date":"2026-03-01","ids":{"openalex":"https://openalex.org/W7133299283","doi":"https://doi.org/10.48550/arxiv.2603.00871"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.00871","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00871","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":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.2603.00871","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5110372730","display_name":"Haizhou Zhao","orcid":"https://orcid.org/0009-0008-6919-4057"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Zhao, Haizhou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026007843","display_name":"Ludovic Righetti","orcid":"https://orcid.org/0000-0002-6458-9112"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Righetti, Ludovic","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5043216529","display_name":"Majid Khadiv","orcid":"https://orcid.org/0000-0001-9889-6543"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Khadiv, Majid","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5110372730"],"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.6710000038146973,"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.6710000038146973,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.06970000267028809,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.04879999905824661,"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/solver","display_name":"Solver","score":0.7602999806404114},{"id":"https://openalex.org/keywords/trajectory-optimization","display_name":"Trajectory optimization","score":0.7027999758720398},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6656000018119812},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5645999908447266},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5555999875068665},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5418999791145325},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4260999858379364},{"id":"https://openalex.org/keywords/differential-dynamic-programming","display_name":"Differential dynamic programming","score":0.4244999885559082},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4212000072002411}],"concepts":[{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.7602999806404114},{"id":"https://openalex.org/C173246807","wikidata":"https://www.wikidata.org/wiki/Q7833062","display_name":"Trajectory optimization","level":3,"score":0.7027999758720398},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6656000018119812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5759999752044678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.569599986076355},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5645999908447266},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5555999875068665},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5418999791145325},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C92292787","wikidata":"https://www.wikidata.org/wiki/Q5275342","display_name":"Differential dynamic programming","level":3,"score":0.4244999885559082},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4212000072002411},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.36730000376701355},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.35019999742507935},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.34459999203681946},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.3321000039577484},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3301999866962433},{"id":"https://openalex.org/C70834904","wikidata":"https://www.wikidata.org/wiki/Q1054638","display_name":"Differential inclusion","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.30250000953674316},{"id":"https://openalex.org/C145565327","wikidata":"https://www.wikidata.org/wiki/Q852514","display_name":"Motion control","level":3,"score":0.2897000014781952},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.28529998660087585},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.28349998593330383},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.2827000021934509},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C104114177","wikidata":"https://www.wikidata.org/wiki/Q79782","display_name":"Motion (physics)","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C2164484","wikidata":"https://www.wikidata.org/wiki/Q5170150","display_name":"Core (optical fiber)","level":2,"score":0.25189998745918274}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.00871","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00871","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":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.00871","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.00871","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":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"No poverty","score":0.6764217019081116,"id":"https://metadata.un.org/sdg/1"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Trajectory":[0],"optimization":[1,101],"is":[2,87],"the":[3,61],"core":[4],"of":[5],"modern":[6],"model-based":[7],"robotic":[8,99],"control":[9],"and":[10,38,71,90,109],"motion":[11],"planning.":[12],"Existing":[13],"trajectory":[14,100],"optimizers,":[15],"based":[16],"on":[17],"sequential":[18],"quadratic":[19],"programming":[20,25],"(SQP)":[21],"or":[22,77],"differential":[23],"dynamic":[24],"(DDP),":[26],"are":[27],"often":[28],"limited":[29],"by":[30],"their":[31],"slow":[32],"computation":[33],"efficiency,":[34],"low":[35],"modeling":[36],"flexibility,":[37],"poor":[39],"convergence":[40],"for":[41,97],"complex":[42],"tasks":[43],"requiring":[44,103],"hard":[45,72],"constraints.":[46],"In":[47],"this":[48],"paper,":[49],"we":[50,83],"introduce":[51],"Hippo,":[52],"a":[53,88],"solver":[54],"that":[55,85],"can":[56],"handle":[57],"inequality":[58],"constraints":[59,74],"using":[60],"interior-point":[62],"method":[63],"(IPM)":[64],"with":[65],"an":[66],"adaptive":[67],"barrier":[68],"update":[69],"strategy":[70],"equality":[73],"via":[75],"projection":[76],"IPM.":[78],"Through":[79],"extensive":[80],"numerical":[81],"benchmarks,":[82],"show":[84],"Hippo":[86],"robust":[89],"efficient":[91],"alternative":[92],"to":[93],"existing":[94],"state-of-the-art":[95],"solvers":[96],"difficult":[98],"problems":[102],"high-quality":[104],"solutions,":[105],"such":[106],"as":[107],"locomotion":[108],"manipulation.":[110]},"counts_by_year":[],"updated_date":"2026-05-04T08:30:34.212998","created_date":"2026-03-04T00:00:00"}