{"id":"https://openalex.org/W4313485567","doi":"https://doi.org/10.1109/lra.2022.3228175","title":"Handling Constrained Optimization in Factor Graphs for Autonomous Navigation","display_name":"Handling Constrained Optimization in Factor Graphs for Autonomous Navigation","publication_year":2022,"publication_date":"2022-12-09","ids":{"openalex":"https://openalex.org/W4313485567","doi":"https://doi.org/10.1109/lra.2022.3228175"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3228175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3228175","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://iris.uniroma1.it/bitstream/11573/1666831/1/Bazzana_preprint_Handling_2022.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5081998394","display_name":"Barbara Bazzana","orcid":"https://orcid.org/0000-0002-2843-4324"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Barbara Bazzana","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering &#x201C;Antonio Ruberti&#x201D;, Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering &#x201C;Antonio Ruberti&#x201D;, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016069215","display_name":"Tiziano Guadagnino","orcid":"https://orcid.org/0000-0002-7853-5510"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Tiziano Guadagnino","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering &#x201C;Antonio Ruberti&#x201D;, Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering &#x201C;Antonio Ruberti&#x201D;, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028708181","display_name":"Giorgio Grisetti","orcid":"https://orcid.org/0000-0002-8038-9989"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giorgio Grisetti","raw_affiliation_strings":["Department of Computer, Control, and Management Engineering &#x201C;Antonio Ruberti&#x201D;, Sapienza University of Rome, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"Department of Computer, Control, and Management Engineering &#x201C;Antonio Ruberti&#x201D;, Sapienza University of Rome, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081998394"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":1.8354,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.8697613,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"8","issue":"1","first_page":"432","last_page":"439"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9991999864578247,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/factor-graph","display_name":"Factor graph","score":0.7862837314605713},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6906837821006775},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6423065066337585},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.5523534417152405},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.528132975101471},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.46654200553894043},{"id":"https://openalex.org/keywords/robotics","display_name":"Robotics","score":0.44516465067863464},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.4207678735256195},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4127961993217468},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.41159629821777344},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32496926188468933},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.32448476552963257},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2738397717475891},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.25907641649246216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23265951871871948},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.1861438751220703}],"concepts":[{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.7862837314605713},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6906837821006775},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6423065066337585},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5523534417152405},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.528132975101471},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.46654200553894043},{"id":"https://openalex.org/C34413123","wikidata":"https://www.wikidata.org/wiki/Q170978","display_name":"Robotics","level":3,"score":0.44516465067863464},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.4207678735256195},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4127961993217468},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.41159629821777344},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32496926188468933},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.32448476552963257},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2738397717475891},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.25907641649246216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23265951871871948},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.1861438751220703},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"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/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/lra.2022.3228175","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3228175","pdf_url":null,"source":{"id":"https://openalex.org/S4210169774","display_name":"IEEE Robotics and Automation Letters","issn_l":"2377-3766","issn":["2377-3766"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Robotics and Automation Letters","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/1666831","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1666831","pdf_url":"https://iris.uniroma1.it/bitstream/11573/1666831/1/Bazzana_preprint_Handling_2022.pdf","source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:iris.uniroma1.it:11573/1666831","is_oa":true,"landing_page_url":"https://hdl.handle.net/11573/1666831","pdf_url":"https://iris.uniroma1.it/bitstream/11573/1666831/1/Bazzana_preprint_Handling_2022.pdf","source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4313485567.pdf","grobid_xml":"https://content.openalex.org/works/W4313485567.grobid-xml"},"referenced_works_count":35,"referenced_works":["https://openalex.org/W2092921","https://openalex.org/W1669104078","https://openalex.org/W1993170675","https://openalex.org/W2062573767","https://openalex.org/W2071563913","https://openalex.org/W2080823437","https://openalex.org/W2082644477","https://openalex.org/W2121498459","https://openalex.org/W2129448244","https://openalex.org/W2137052305","https://openalex.org/W2147476333","https://openalex.org/W2152091745","https://openalex.org/W2153340051","https://openalex.org/W2368403481","https://openalex.org/W2412669390","https://openalex.org/W2415159553","https://openalex.org/W2471962767","https://openalex.org/W2585698528","https://openalex.org/W2594040127","https://openalex.org/W2740584750","https://openalex.org/W2774451424","https://openalex.org/W2884371529","https://openalex.org/W2890882989","https://openalex.org/W2972426016","https://openalex.org/W2997494682","https://openalex.org/W3040033506","https://openalex.org/W3091745744","https://openalex.org/W3098632684","https://openalex.org/W3106106588","https://openalex.org/W3118408399","https://openalex.org/W3138171450","https://openalex.org/W3207888248","https://openalex.org/W4292363360","https://openalex.org/W6732652919","https://openalex.org/W6786045881"],"related_works":["https://openalex.org/W1555349535","https://openalex.org/W1556451512","https://openalex.org/W2186864281","https://openalex.org/W4234091740","https://openalex.org/W4213350282","https://openalex.org/W2230171082","https://openalex.org/W2583128298","https://openalex.org/W4255427455","https://openalex.org/W4238307458","https://openalex.org/W6367512"],"abstract_inverted_index":{"Factor":[0,47],"graphs":[1,88],"are":[2],"graphical":[3],"models":[4],"used":[5],"to":[6,55,75],"represent":[7],"a":[8,42,91,110],"wide":[9],"variety":[10],"of":[11,45,53,61,95,105],"problems":[12,54,141],"across":[13],"robotics,":[14],"such":[15],"as":[16],"Structure":[17],"from":[18,119],"Motion":[19],"(SfM),":[20],"Simultaneous":[21],"Localization":[22],"and":[23,26,132,137],"Mapping":[24],"(SLAM)":[25],"calibration.":[27],"Typically,":[28],"at":[29,175],"their":[30,70],"core,":[31],"they":[32],"have":[33],"an":[34],"optimization":[35],"problem":[36],"whose":[37],"terms":[38],"only":[39],"depend":[40],"on":[41,115],"small":[43],"subset":[44],"variables.":[46],"graph":[48,93],"solvers":[49],"exploit":[50],"the":[51,58,62,96,103,139,143,159,173,180],"locality":[52],"drastically":[56],"reduce":[57],"computational":[59],"time":[60],"Iterative":[63],"Least-Squares":[64],"(ILS)":[65],"methodology.":[66,146],"Although":[67],"extremely":[68],"powerful,":[69],"application":[71,174],"is":[72],"usually":[73],"limited":[74],"unconstrained":[76],"problems.":[77],"In":[78],"this":[79],"letter,":[80],"we":[81,123],"model":[82,125],"constraints":[83],"over":[84],"variables":[85],"within":[86],"factor":[87,92,116,135],"by":[89,108],"introducing":[90],"version":[94],"Augmented":[97],"Lagrangian":[98],"(AL)":[99],"method.":[100],"We":[101,147],"show":[102,170],"potential":[104],"our":[106,149,177],"method":[107],"presenting":[109],"full":[111],"navigation":[112,121,154,163],"stack":[113,164],"based":[114],"graphs.":[117],"Differently":[118],"standard":[120,144,162,181],"stacks,":[122],"can":[124],"both":[126],"optimal":[127],"control":[128],"for":[129,172],"local":[130],"planning":[131],"localization":[133],"with":[134,158],"graphs,":[136],"solve":[138],"two":[140],"using":[142],"ILS":[145],"validate":[148],"approach":[150],"in":[151,166,188],"real-world":[152],"autonomous":[153],"scenarios,":[155],"comparing":[156],"it":[157],"de":[160],"facto":[161],"implemented":[165],"ROS.":[167],"Comparative":[168],"experiments":[169],"that":[171],"hand":[176],"system":[178],"outperforms":[179],"nonlinear":[182],"programming":[183],"solver":[184],"Interior-Point":[185],"Optimizer":[186],"(IPOPT)":[187],"runtime,":[189],"while":[190],"achieving":[191],"similar":[192],"solutions.":[193]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2023-01-06T00:00:00"}
