{"id":"https://openalex.org/W4389666616","doi":"https://doi.org/10.1109/iros55552.2023.10342255","title":"Time-Optimal Control via Heaviside Step-Function Approximation","display_name":"Time-Optimal Control via Heaviside Step-Function Approximation","publication_year":2023,"publication_date":"2023-10-01","ids":{"openalex":"https://openalex.org/W4389666616","doi":"https://doi.org/10.1109/iros55552.2023.10342255"},"language":"en","primary_location":{"id":"doi:10.1109/iros55552.2023.10342255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros55552.2023.10342255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","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/A5020879376","display_name":"Kai Pfeiffer","orcid":"https://orcid.org/0000-0002-4810-2802"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Kai Pfeiffer","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5081279690","display_name":"Quang\u2010Cuong Pham","orcid":"https://orcid.org/0000-0001-9605-4940"},"institutions":[{"id":"https://openalex.org/I172675005","display_name":"Nanyang Technological University","ror":"https://ror.org/02e7b5302","country_code":"SG","type":"education","lineage":["https://openalex.org/I172675005"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Quang-Cuong Pham","raw_affiliation_strings":["School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore","HP-NTU Digital Manufacturing Corporate Lab, Nanyang Technological University, Singapore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University,Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]},{"raw_affiliation_string":"HP-NTU Digital Manufacturing Corporate Lab, Nanyang Technological University, Singapore","institution_ids":["https://openalex.org/I172675005"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16202166,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"8223","last_page":"8230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9976000189781189,"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.9976000189781189,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9957000017166138,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9940999746322632,"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/discretization","display_name":"Discretization","score":0.7126206159591675},{"id":"https://openalex.org/keywords/heaviside-step-function","display_name":"Heaviside step function","score":0.6318352222442627},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5059496760368347},{"id":"https://openalex.org/keywords/optimal-control","display_name":"Optimal control","score":0.4734492003917694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4493846297264099},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4429534375667572},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.4338006377220154},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.40174466371536255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34014028310775757},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3291855454444885},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.12725508213043213}],"concepts":[{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.7126206159591675},{"id":"https://openalex.org/C7980502","wikidata":"https://www.wikidata.org/wiki/Q322339","display_name":"Heaviside step function","level":2,"score":0.6318352222442627},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5059496760368347},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.4734492003917694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4493846297264099},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4429534375667572},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4338006377220154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.40174466371536255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34014028310775757},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3291855454444885},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.12725508213043213}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros55552.2023.10342255","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros55552.2023.10342255","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4873221260","display_name":null,"funder_award_id":"l1801E0028","funder_id":"https://openalex.org/F4320320709","funder_display_name":"National Research Foundation Singapore"}],"funders":[{"id":"https://openalex.org/F4320320709","display_name":"National Research Foundation Singapore","ror":"https://ror.org/03cpyc314"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W68008431","https://openalex.org/W1495441213","https://openalex.org/W1574514837","https://openalex.org/W1981699275","https://openalex.org/W1983639748","https://openalex.org/W1987694238","https://openalex.org/W2000150201","https://openalex.org/W2019606703","https://openalex.org/W2022144657","https://openalex.org/W2026733661","https://openalex.org/W2062736856","https://openalex.org/W2072763216","https://openalex.org/W2130527887","https://openalex.org/W2133304166","https://openalex.org/W2141708863","https://openalex.org/W2145487433","https://openalex.org/W2154724320","https://openalex.org/W2255696229","https://openalex.org/W2295945877","https://openalex.org/W2303961898","https://openalex.org/W2315788538","https://openalex.org/W2320270188","https://openalex.org/W2772033348","https://openalex.org/W2783824884","https://openalex.org/W2802509304","https://openalex.org/W2804623852","https://openalex.org/W2840346287","https://openalex.org/W2906372436","https://openalex.org/W2964057747","https://openalex.org/W3041042960","https://openalex.org/W3046900881","https://openalex.org/W3080709722","https://openalex.org/W3099530328","https://openalex.org/W3118397459","https://openalex.org/W3121497892","https://openalex.org/W3123819824","https://openalex.org/W4313639240","https://openalex.org/W4316661273","https://openalex.org/W4391655634"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2074084660","https://openalex.org/W2021508077","https://openalex.org/W2901390526","https://openalex.org/W2088409529","https://openalex.org/W2077007836","https://openalex.org/W2018118488","https://openalex.org/W4253354271","https://openalex.org/W4390601309","https://openalex.org/W2071876116"],"abstract_inverted_index":{"Least-squares":[0],"programming":[1,22,49],"is":[2],"a":[3,45,61,79,97],"popular":[4],"tool":[5],"in":[6,23,102,122,133],"robotics":[7],"due":[8],"to":[9,104],"its":[10],"simplicity":[11],"and":[12,86,137],"availability":[13],"of":[14,54,64,108],"open-source":[15],"solvers.":[16],"However,":[17],"certain":[18],"problems":[19],"like":[20],"sparse":[21],"the":[24,65,114,118,123,131],"<tex":[25,30],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[26,31],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\ell_{0}$</tex>":[27],"-":[28],"or":[29],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\ell_{0}-\\mathbf{norm}$</tex>":[32],"for":[33,51,125,135],"time-optimal":[34,52,120],"control":[35,53,121,139],"are":[36],"not":[37],"equivalently":[38],"solvable.":[39],"In":[40],"this":[41],"work,":[42],"we":[43,95],"propose":[44],"non-linear":[46,55,138],"hierarchical":[47],"least-squares":[48],"(NL-HLSP)":[50],"discrete":[56,119],"dynamic":[57],"systems.":[58],"We":[59,77,111,129],"use":[60,78],"continuous":[62],"approximation":[63],"heaviside":[66],"step":[67],"function":[68],"with":[69],"an":[70],"additional":[71],"term":[72],"that":[73,113],"avoids":[74],"vanishing":[75],"gradients.":[76],"simple":[80],"discretization":[81,91],"method":[82],"by":[83],"keeping":[84],"states":[85],"controls":[87],"piece-wise":[88],"constant":[89],"between":[90],"steps.":[92],"This":[93],"way,":[94],"obtain":[96],"comparatively":[98],"easily":[99],"implementable":[100],"NL-HLSP":[101,115],"contrast":[103],"direct":[105],"transcription":[106],"approaches":[107],"optimal":[109],"control.":[110],"show":[112],"indeed":[116],"recovers":[117],"limit":[124],"resting":[126],"goal":[127],"points.":[128],"confirm":[130],"results":[132],"simulation":[134],"linear":[136],"scenarios.":[140]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}