{"id":"https://openalex.org/W2521218026","doi":"https://doi.org/10.1109/icra.2017.7989014","title":"Fast second-order cone programming for safe mission planning","display_name":"Fast second-order cone programming for safe mission planning","publication_year":2017,"publication_date":"2017-05-01","ids":{"openalex":"https://openalex.org/W2521218026","doi":"https://doi.org/10.1109/icra.2017.7989014","mag":"2521218026"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2017.7989014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1609.05243","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5101518558","display_name":"Kai Zhong","orcid":"https://orcid.org/0000-0002-8448-9530"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kai Zhong","raw_affiliation_strings":["University of Texas, Austin","University of Texas at Austin"],"affiliations":[{"raw_affiliation_string":"University of Texas, Austin","institution_ids":["https://openalex.org/I86519309"]},{"raw_affiliation_string":"University of Texas at Austin","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034432097","display_name":"Prateek Jain","orcid":"https://orcid.org/0000-0002-8191-9785"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Prateek Jain","raw_affiliation_strings":["MSR","MSR#TAB#"],"affiliations":[{"raw_affiliation_string":"MSR","institution_ids":[]},{"raw_affiliation_string":"MSR#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5078150431","display_name":"Ashish Kapoor","orcid":"https://orcid.org/0000-0003-3977-6140"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ashish Kapoor","raw_affiliation_strings":["MSR","MSR#TAB#"],"affiliations":[{"raw_affiliation_string":"MSR","institution_ids":[]},{"raw_affiliation_string":"MSR#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101518558"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.38133066,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.61331914,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"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.9980999827384949,"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.9980999827384949,"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/T10191","display_name":"Robotics and Sensor-Based Localization","score":0.9962999820709229,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.9926999807357788,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6969625353813171},{"id":"https://openalex.org/keywords/second-order-cone-programming","display_name":"Second-order cone programming","score":0.6181867718696594},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5713880062103271},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5650578141212463},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5042175054550171},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45821139216423035},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.4179838001728058},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.41756531596183777},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3864579200744629},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.1504128873348236},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13437896966934204},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.08918872475624084}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6969625353813171},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.6181867718696594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5713880062103271},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5650578141212463},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5042175054550171},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45821139216423035},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.4179838001728058},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.41756531596183777},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3864579200744629},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.1504128873348236},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13437896966934204},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.08918872475624084},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/icra.2017.7989014","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2017.7989014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1609.05243","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.05243","pdf_url":"https://arxiv.org/pdf/1609.05243","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":"","raw_type":"text"},{"id":"mag:2521218026","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/1609.05243","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1609.05243","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1609.05243","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":"pmh:oai:arXiv.org:1609.05243","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1609.05243","pdf_url":"https://arxiv.org/pdf/1609.05243","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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W1587253418","https://openalex.org/W1967729795","https://openalex.org/W1975762674","https://openalex.org/W1981677383","https://openalex.org/W1992586477","https://openalex.org/W1999131722","https://openalex.org/W2008922743","https://openalex.org/W2067778155","https://openalex.org/W2069647917","https://openalex.org/W2098711104","https://openalex.org/W2100512461","https://openalex.org/W2148391549","https://openalex.org/W2172790076","https://openalex.org/W2214860739","https://openalex.org/W2345428108","https://openalex.org/W2410630689","https://openalex.org/W2470448410","https://openalex.org/W2482392012","https://openalex.org/W2559854331","https://openalex.org/W2737856893","https://openalex.org/W3023767264","https://openalex.org/W3106992008","https://openalex.org/W6681791503","https://openalex.org/W6704977298","https://openalex.org/W6714402795","https://openalex.org/W6741572720"],"related_works":["https://openalex.org/W2964328520","https://openalex.org/W2304816160","https://openalex.org/W2913928292","https://openalex.org/W2398235815","https://openalex.org/W2735716892","https://openalex.org/W2727067723","https://openalex.org/W1989975316","https://openalex.org/W1543201103","https://openalex.org/W3097764191","https://openalex.org/W3122127652","https://openalex.org/W2896345083","https://openalex.org/W651492283","https://openalex.org/W3096721080","https://openalex.org/W165820693","https://openalex.org/W2145537262","https://openalex.org/W2224338515","https://openalex.org/W1605254797","https://openalex.org/W2314244859","https://openalex.org/W2919955088","https://openalex.org/W2422847950"],"abstract_inverted_index":{"This":[0],"paper":[1,64],"considers":[2],"the":[3,18,142,180,208],"problem":[4],"of":[5,9,17,62,134,187],"safe":[6,25,78,100],"mission":[7,79],"planning":[8,80,101],"dynamic":[10],"systems":[11],"operating":[12],"under":[13],"uncertain":[14],"environments.":[15],"Much":[16],"prior":[19],"work":[20],"on":[21,149,201,220],"achieving":[22],"robust":[23,76],"and":[24,50,68,77,103],"control":[26],"requires":[27],"solving":[28],"second-order":[29],"cone":[30],"programs":[31],"(SOCP).":[32],"Unfortunately,":[33],"existing":[34,55],"general":[35,56],"purpose":[36],"SOCP":[37,72,120],"methods":[38],"are":[39],"often":[40],"infeasible":[41],"for":[42,71,117,124,223],"real-time":[43],"robotic":[44],"tasks":[45],"due":[46],"to":[47,107,132,190,207],"high":[48],"memory":[49],"computational":[51],"requirements":[52],"imposed":[53],"by":[54],"optimization":[57,113,194],"methods.":[58],"The":[59],"key":[60],"contribution":[61],"this":[63,176],"is":[65,147],"a":[66,125,159,162,168,184,215,231],"fast":[67],"memory-efficient":[69],"algorithm":[70,86,189],"that":[73,196],"would":[74],"enable":[75],"on-board":[81],"robots":[82],"in":[83,99,104,141],"real-time.":[84],"Our":[85,145],"does":[87],"not":[88],"have":[89],"any":[90,139],"external":[91],"dependency,":[92],"can":[93,154,171,197],"efficiently":[94,173],"utilize":[95],"warm":[96],"start":[97],"provided":[98],"settings,":[102],"fact":[105],"leads":[106,131],"significant":[108],"speed":[109],"up":[110],"over":[111,136,161,175],"standard":[112,119,126],"packages":[114],"(like":[115],"SDPT3)":[116],"even":[118],"problems.":[121],"For":[122],"example,":[123],"quadrotor":[127],"problem,":[128],"our":[129],"method":[130,146,195,218],"speedup":[133],"1000x":[135],"SDPT3":[137],"without":[138],"deterioration":[140],"solution":[143],"quality.":[144],"based":[148,219],"two":[150],"insights:":[151],"a)":[152],"SOCPs":[153],"be":[155,172,198],"interpreted":[156],"as":[157,230],"optimizing":[158],"function":[160,170],"polytope":[163],"with":[164,183,226],"infinite":[165],"sides,":[166],"b)":[167],"linear":[169],"optimized":[174],"polytope.":[177],"We":[178],"combine":[179],"above":[181,209],"observations":[182],"novel":[185],"utilization":[186],"Wolfe's":[188],"obtain":[191],"an":[192],"efficient":[193],"easily":[199],"implemented":[200],"small":[202],"embedded":[203],"devices.":[204],"In":[205],"addition":[206],"mentioned":[210],"algorithm,":[211],"we":[212],"also":[213],"design":[214],"two-level":[216],"sensing":[217],"Gaussian":[221],"Process":[222],"complex":[224],"obstacles":[225],"non-linear":[227],"boundaries":[228],"such":[229],"cylinder.":[232]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":3}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}