{"id":"https://openalex.org/W3200333223","doi":"https://doi.org/10.1109/icra46639.2022.9811719","title":"Convex strategies for trajectory optimisation: application to the Polytope Traversal Problem","display_name":"Convex strategies for trajectory optimisation: application to the Polytope Traversal Problem","publication_year":2022,"publication_date":"2022-05-23","ids":{"openalex":"https://openalex.org/W3200333223","doi":"https://doi.org/10.1109/icra46639.2022.9811719","mag":"3200333223"},"language":"en","primary_location":{"id":"doi:10.1109/icra46639.2022.9811719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra46639.2022.9811719","pdf_url":null,"source":{"id":"https://openalex.org/S4363607759","display_name":"2022 International Conference on Robotics and Automation (ICRA)","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":"2022 International Conference on Robotics and Automation (ICRA)","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/A5043622443","display_name":"Steve Tonneau","orcid":"https://orcid.org/0000-0003-3001-8693"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Steve Tonneau","raw_affiliation_strings":["University of Edinburgh,Scotland","University of Edinburgh, Scotland"],"affiliations":[{"raw_affiliation_string":"University of Edinburgh,Scotland","institution_ids":["https://openalex.org/I98677209"]},{"raw_affiliation_string":"University of Edinburgh, Scotland","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043622443"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":null,"apc_paid":null,"fwci":0.1199,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.36040211,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"3335","last_page":"3340"},"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/T10879","display_name":"Robotic Locomotion and Control","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2204","display_name":"Biomedical 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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9668999910354614,"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/traverse","display_name":"Traverse","score":0.8417987823486328},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.7442542910575867},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7180755138397217},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.6418446898460388},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6336327791213989},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5902231931686401},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.523140549659729},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.49521604180336},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4699561595916748},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.447113960981369},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.43773597478866577},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40114060044288635},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.3534306287765503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23420816659927368},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.10688135027885437},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10248258709907532}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.8417987823486328},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7442542910575867},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7180755138397217},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.6418446898460388},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6336327791213989},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5902231931686401},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.523140549659729},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.49521604180336},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4699561595916748},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.447113960981369},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.43773597478866577},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40114060044288635},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.3534306287765503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23420816659927368},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.10688135027885437},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10248258709907532},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icra46639.2022.9811719","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra46639.2022.9811719","pdf_url":null,"source":{"id":"https://openalex.org/S4363607759","display_name":"2022 International Conference on Robotics and Automation (ICRA)","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":"2022 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/78d30c84-6544-45f4-9c1e-ece13ab9330a","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/78d30c84-6544-45f4-9c1e-ece13ab9330a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W102487131","https://openalex.org/W1605218591","https://openalex.org/W2026733661","https://openalex.org/W2099454002","https://openalex.org/W2108234997","https://openalex.org/W2296319761","https://openalex.org/W2345626358","https://openalex.org/W2891491652","https://openalex.org/W2905259751","https://openalex.org/W3003747652","https://openalex.org/W3010768390","https://openalex.org/W3046005546","https://openalex.org/W3090500517","https://openalex.org/W3103565931","https://openalex.org/W4250589301","https://openalex.org/W6893603746"],"related_works":["https://openalex.org/W2377402383","https://openalex.org/W2380835401","https://openalex.org/W2381912691","https://openalex.org/W2350381577","https://openalex.org/W2366394613","https://openalex.org/W2152421698","https://openalex.org/W2990193004","https://openalex.org/W2953363500","https://openalex.org/W4287022798","https://openalex.org/W3195259914"],"abstract_inverted_index":{"Non-linear":[0],"trajectory":[1,31,58],"optimisation":[2,77],"methods":[3],"require":[4],"good":[5],"initial":[6,167],"guesses":[7,168],"to":[8,10,32,80,82,123,164,169],"converge":[9,81],"a":[11,24,53,63,75,83,100,125,129],"locally":[12],"optimal":[13],"solution.":[14],"A":[15],"feasible":[16,64,84,95,126],"guess":[17],"can":[18],"often":[19],"be":[20,33],"obtained":[21],"by":[22],"allocating":[23],"large":[25],"amount":[26],"of":[27,56,94,102,109],"time":[28,68],"for":[29,36,143,155],"the":[30,57,92,110,136],"complete.":[34],"However":[35],"unstable":[37],"dynamical":[38],"systems":[39],"such":[40],"as":[41,74],"humanoid":[42],"robots,":[43],"this":[44],"quasi-static":[45],"assumption":[46],"does":[47],"not":[48,117],"always":[49],"hold.":[50],"We":[51,104],"propose":[52],"conservative":[54],"formulation":[55],"problem":[59,71,78,111],"that":[60,97,106],"simultaneously":[61],"computes":[62],"path":[65],"and":[66,151],"its":[67,162],"allocation.":[69],"The":[70,87],"is":[72,89,121],"solved":[73],"convex":[76],"guaranteed":[79],"local":[85],"optimum.":[86],"approach":[88,120],"evaluated":[90],"with":[91,128],"computation":[93],"trajectories":[96],"traverse":[98],"sequentially":[99],"sequence":[101],"polytopes.":[103],"demonstrate":[105],"on":[107],"instances":[108],"where":[112],"quasi":[113],"static":[114],"solutions":[115],"are":[116],"admissible,":[118],"our":[119],"able":[122],"find":[124],"solution":[127],"success":[130],"rate":[131],"above":[132],"80%":[133],"in":[134,139],"all":[135],"scenarios":[137],"considered,":[138],"less":[140,147,152],"than":[141,148,153],"10ms":[142],"problems":[144,156],"involving":[145,157],"traversing":[146],"5":[149],"polytopes":[150],"1s":[154],"20":[158],"polytopes,":[159],"thus":[160],"demonstrating":[161],"ability":[163],"reliably":[165],"provide":[166],"advanced":[170],"non":[171],"linear":[172],"solvers.":[173]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}