{"id":"https://openalex.org/W7123351288","doi":"https://doi.org/10.1109/cdc57313.2025.11312147","title":"Safe navigation using NMPC based on a K-invariant set and its exploration features","display_name":"Safe navigation using NMPC based on a K-invariant set and its exploration features","publication_year":2025,"publication_date":"2025-12-09","ids":{"openalex":"https://openalex.org/W7123351288","doi":"https://doi.org/10.1109/cdc57313.2025.11312147"},"language":"en","primary_location":{"id":"doi:10.1109/cdc57313.2025.11312147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5122862316","display_name":"Zhixin Zhao","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210097418","display_name":"Laboratoire des signaux et syst\u00e8mes","ror":"https://ror.org/00skw9v43","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210097418","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Zhixin Zhao","raw_affiliation_strings":["Universit&#x00E9; Paris-Saclay,CNRS, CentraleSup&#x00E9;lec, Laboratoire des Signaux et Syst&#x00E8;mes,Gif-Sur-Yvette,France,91190"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit&#x00E9; Paris-Saclay,CNRS, CentraleSup&#x00E9;lec, Laboratoire des Signaux et Syst&#x00E8;mes,Gif-Sur-Yvette,France,91190","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210097418"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122854336","display_name":"Antoine Girard","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210097418","display_name":"Laboratoire des signaux et syst\u00e8mes","ror":"https://ror.org/00skw9v43","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210097418","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Antoine Girard","raw_affiliation_strings":["Universit&#x00E9; Paris-Saclay,CNRS, CentraleSup&#x00E9;lec, Laboratoire des Signaux et Syst&#x00E8;mes,Gif-Sur-Yvette,France,91190"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit&#x00E9; Paris-Saclay,CNRS, CentraleSup&#x00E9;lec, Laboratoire des Signaux et Syst&#x00E8;mes,Gif-Sur-Yvette,France,91190","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210097418"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106497955","display_name":"Sorin Olaru","orcid":"https://orcid.org/0000-0003-3256-9595"},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I4210097418","display_name":"Laboratoire des signaux et syst\u00e8mes","ror":"https://ror.org/00skw9v43","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I277688954","https://openalex.org/I277688954","https://openalex.org/I4210097418","https://openalex.org/I4210107720"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Sorin Olaru","raw_affiliation_strings":["Universit&#x00E9; Paris-Saclay,CNRS, CentraleSup&#x00E9;lec, Laboratoire des Signaux et Syst&#x00E8;mes,Gif-Sur-Yvette,France,91190"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit&#x00E9; Paris-Saclay,CNRS, CentraleSup&#x00E9;lec, Laboratoire des Signaux et Syst&#x00E8;mes,Gif-Sur-Yvette,France,91190","institution_ids":["https://openalex.org/I1294671590","https://openalex.org/I4210097418"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"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":"6486","last_page":"6491"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.7075999975204468,"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"}},"topics":[{"id":"https://openalex.org/T10791","display_name":"Advanced Control Systems Optimization","score":0.7075999975204468,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.1597999930381775,"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/T11082","display_name":"Spacecraft Dynamics and Control","score":0.02800000086426735,"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/backup","display_name":"Backup","score":0.7425000071525574},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5584999918937683},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.5375999808311462},{"id":"https://openalex.org/keywords/trajectory","display_name":"Trajectory","score":0.5274999737739563},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4799000024795532},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.46700000762939453},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44359999895095825},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.44209998846054077},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4359999895095825}],"concepts":[{"id":"https://openalex.org/C2780945871","wikidata":"https://www.wikidata.org/wiki/Q194274","display_name":"Backup","level":2,"score":0.7425000071525574},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6308000087738037},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5584999918937683},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.5375999808311462},{"id":"https://openalex.org/C13662910","wikidata":"https://www.wikidata.org/wiki/Q193139","display_name":"Trajectory","level":2,"score":0.5274999737739563},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4799000024795532},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.46700000762939453},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44359999895095825},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4359999895095825},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37869998812675476},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3720000088214874},{"id":"https://openalex.org/C114466953","wikidata":"https://www.wikidata.org/wiki/Q6034165","display_name":"Initialization","level":2,"score":0.36970001459121704},{"id":"https://openalex.org/C149364088","wikidata":"https://www.wikidata.org/wiki/Q185917","display_name":"Translation (biology)","level":4,"score":0.3328000009059906},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.32899999618530273},{"id":"https://openalex.org/C39920418","wikidata":"https://www.wikidata.org/wiki/Q11476","display_name":"Kinematics","level":2,"score":0.3190000057220459},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.31520000100135803},{"id":"https://openalex.org/C2779227376","wikidata":"https://www.wikidata.org/wiki/Q6505497","display_name":"Layer (electronics)","level":2,"score":0.31299999356269836},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.29350000619888306},{"id":"https://openalex.org/C172205157","wikidata":"https://www.wikidata.org/wiki/Q1782962","display_name":"Model predictive control","level":3,"score":0.2838999927043915},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.26919999718666077},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2615000009536743},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.25290000438690186}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc57313.2025.11312147","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc57313.2025.11312147","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE 64th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-05333296v1","is_oa":false,"landing_page_url":"https://hal.science/hal-05333296","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Conference on Decision and Control, Dec 2025, Rio de Janeiro, Brazil., Brazil. &#x27E8;10.1109/cdc57313.2025.11312147&#x27E9;","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,105],"paper":[1],"presents":[2],"a":[3,16,53,103,131,138],"framework":[4,23],"for":[5],"safe":[6],"navigation":[7],"in":[8],"cluttered,":[9],"unknown":[10,41],"environments.":[11],"The":[12,43,60,84],"control":[13],"layer":[14,86],"employs":[15],"new":[17],"Nonlinear":[18],"Model":[19],"Predictive":[20],"Control":[21],"(NMPC)":[22],"based":[24,124],"on":[25,125],"K-invariant":[26,65],"sets,":[27,66],"which":[28,67,126],"guarantees":[29],"that":[30],"the":[31,40,50,78,94,99,127],"trajectories":[32,62],"of":[33,52],"nonlinear":[34],"systems":[35],"satisfy":[36],"safety":[37],"constraints":[38],"despite":[39],"environment.":[42],"recursive":[44],"feasibility":[45],"is":[46,107],"guaranteed":[47],"by":[48,76,98],"ensuring":[49],"existence":[51],"backup":[54,61],"trajectory":[55],"at":[56,120],"each":[57,121],"sampling":[58],"instance.":[59],"return":[63],"to":[64,101,130,141],"are":[68],"designed":[69],"offline":[70],"but":[71],"can":[72,133,145],"be":[73,134,146],"parameterized":[74],"online":[75],"leveraging":[77],"system\u2019s":[79],"translation":[80],"and":[81,110],"rotation":[82],"invariance.":[83],"planning":[85],"uses":[87],"an":[88,117,142],"improved":[89],"convex":[90],"lifting":[91],"method,":[92],"employing":[93],"limited":[95],"information":[96],"provided":[97],"sensors":[100],"find":[102],"path.":[104],"method":[106],"both":[108],"efficient":[109],"exhibits":[111],"versatile":[112],"exploration":[113],"features.":[114],"It":[115],"generates":[116],"interconnected":[118],"graph":[119],"computation":[122],"step,":[123],"shortest":[128,139],"path":[129,140],"goal":[132],"extracted,":[135],"or":[136],"alternatively,":[137],"unexplored":[143],"region":[144],"identified.":[147]},"counts_by_year":[],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2026-01-14T00:00:00"}
