{"id":"https://openalex.org/W7161132729","doi":"https://doi.org/10.48550/arxiv.2605.13748","title":"TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics","display_name":"TinySDP: Real Time Semidefinite Optimization for Certifiable and Agile Edge Robotics","publication_year":2026,"publication_date":"2026-05-13","ids":{"openalex":"https://openalex.org/W7161132729","doi":"https://doi.org/10.48550/arxiv.2605.13748"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.13748","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13748","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":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.13748","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5136138141","display_name":"Ishaan Mahajan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mahajan, Ishaan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017318381","display_name":"Jon Arrizabalaga","orcid":"https://orcid.org/0000-0001-6997-6958"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Arrizabalaga, Jon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114403351","display_name":"Andrea Grillo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Grillo, Andrea","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136157090","display_name":"Fausto Vega","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vega, Fausto","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5136142127","display_name":"James Anderson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anderson, James","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135805312","display_name":"Zachary Manchester","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manchester, Zachary","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5019062457","display_name":"Brian Plancher","orcid":"https://orcid.org/0000-0002-0078-3653"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Plancher, Brian","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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.6225000023841858,"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.6225000023841858,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.09709999710321426,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.030700000002980232,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.8701000213623047},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.704200029373169},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4867999851703644},{"id":"https://openalex.org/keywords/obstacle","display_name":"Obstacle","score":0.4507000148296356},{"id":"https://openalex.org/keywords/agile-software-development","display_name":"Agile software development","score":0.4438000023365021},{"id":"https://openalex.org/keywords/a-priori-and-a-posteriori","display_name":"A priori and a posteriori","score":0.4203999936580658},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.41600000858306885},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4032000005245209}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.8701000213623047},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.704200029373169},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6401000022888184},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4867999851703644},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4853000044822693},{"id":"https://openalex.org/C2776650193","wikidata":"https://www.wikidata.org/wiki/Q264661","display_name":"Obstacle","level":2,"score":0.4507000148296356},{"id":"https://openalex.org/C14185376","wikidata":"https://www.wikidata.org/wiki/Q30232","display_name":"Agile software development","level":2,"score":0.4438000023365021},{"id":"https://openalex.org/C75553542","wikidata":"https://www.wikidata.org/wiki/Q178161","display_name":"A priori and a posteriori","level":2,"score":0.4203999936580658},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.41600000858306885},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4032000005245209},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4027000069618225},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.38449999690055847},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.36469998955726624},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.3361999988555908},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.31610000133514404},{"id":"https://openalex.org/C2778456923","wikidata":"https://www.wikidata.org/wiki/Q5337692","display_name":"Edge computing","level":3,"score":0.3098999857902527},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.29789999127388},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C96865113","wikidata":"https://www.wikidata.org/wiki/Q2946816","display_name":"Certificate","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.2745000123977661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2732999920845032},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.25360000133514404},{"id":"https://openalex.org/C164155591","wikidata":"https://www.wikidata.org/wiki/Q2067766","display_name":"Satisfiability modulo theories","level":2,"score":0.2533999979496002},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.25040000677108765}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.13748","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13748","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":"doi:10.48550/arxiv.2605.13748","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.13748","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":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Semidefinite":[0],"programming":[1,42],"(SDP)":[2],"provides":[3],"a":[4,68,84,133],"principled":[5],"framework":[6],"for":[7,24,45,55,75,146],"convex":[8],"relaxations":[9],"of":[10],"nonconvex":[11,58],"geometric":[12,94],"constraints":[13,139],"in":[14,112],"motion":[15],"planning,":[16],"yet":[17],"existing":[18],"solvers":[19],"are":[20],"too":[21],"computationally":[22],"expensive":[23],"real-time":[25,49,144],"control,":[26],"particularly":[27],"on":[28,53,132],"resource-constrained":[29],"embedded":[30,46,76,148],"systems.":[31],"To":[32],"address":[33],"this":[34,80],"gap,":[35],"we":[36],"introduce":[37],"TinySDP,":[38],"the":[39],"first":[40],"semidefinite":[41,138],"solver":[43,81],"designed":[44],"systems,":[47],"enabling":[48],"model-predictive":[50],"control":[51],"(MPC)":[52],"microcontrollers":[54],"problems":[56],"with":[57,82,119],"obstacle":[59,106],"constraints.":[60],"Our":[61],"approach":[62,131],"integrates":[63],"positive-semidefinite":[64],"cone":[65],"projections":[66],"into":[67,92],"cached-Riccati-based":[69],"ADMM":[70],"solver,":[71],"leveraging":[72],"computational":[73],"structure":[74],"tractability.":[77],"We":[78,128],"pair":[79],"an":[83],"posteriori":[85],"rank-1":[86],"certificate":[87],"that":[88,109,137],"converts":[89],"relaxed":[90],"solutions":[91],"explicit":[93],"guarantees":[95],"at":[96,143],"each":[97],"timestep.":[98],"On":[99],"challenging":[100],"benchmarks,":[101],"e.g.,":[102],"cul-de-sac":[103],"and":[104],"dynamic":[105],"avoidance":[107],"scenarios":[108],"induce":[110],"failures":[111],"local":[113],"methods,":[114],"TinySDP":[115],"achieves":[116],"collision-free":[117],"navigation":[118],"up":[120],"to":[121],"73%":[122],"shorter":[123],"paths":[124],"than":[125],"state-of-the-art":[126],"baselines.":[127],"validate":[129],"our":[130],"Crazyflie":[134],"quadrotor,":[135],"demonstrating":[136],"can":[140],"be":[141],"enforced":[142],"rates":[145],"agile":[147],"robotics.":[149]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-15T00:00:00"}