{"id":"https://openalex.org/W2562224395","doi":"https://doi.org/10.1109/iros.2016.7759502","title":"Pose graph optimization with hierarchical conditionally independent graph partitioning","display_name":"Pose graph optimization with hierarchical conditionally independent graph partitioning","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2562224395","doi":"https://doi.org/10.1109/iros.2016.7759502","mag":"2562224395"},"language":"en","primary_location":{"id":"doi:10.1109/iros.2016.7759502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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/A5089085943","display_name":"Hengbo Tang","orcid":"https://orcid.org/0000-0002-6322-7902"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Hengbo Tang","raw_affiliation_strings":["Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100707660","display_name":"Yunhui Liu","orcid":"https://orcid.org/0000-0002-3625-6679"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yunhui Liu","raw_affiliation_strings":["Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101630266","display_name":"Luyang Li","orcid":"https://orcid.org/0000-0002-0980-5046"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Luyang Li","raw_affiliation_strings":["Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical and Automation Engineering, The Chinese University of Hong Kong, Shatin, NT, Hong Kong","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5089085943"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.167,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59162233,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"3255","last_page":"3260"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10036","display_name":"Advanced Neural Network Applications","score":0.9958999752998352,"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/T10036","display_name":"Advanced Neural Network Applications","score":0.9958999752998352,"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/T10331","display_name":"Video Surveillance and Tracking Methods","score":0.9958999752998352,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9947999715805054,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.5805668830871582},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5648379325866699},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5322546362876892},{"id":"https://openalex.org/keywords/strength-of-a-graph","display_name":"Strength of a graph","score":0.5252894163131714},{"id":"https://openalex.org/keywords/distance-hereditary-graph","display_name":"Distance-hereditary graph","score":0.5079532265663147},{"id":"https://openalex.org/keywords/null-graph","display_name":"Null graph","score":0.5074467062950134},{"id":"https://openalex.org/keywords/graph-factorization","display_name":"Graph factorization","score":0.4990835189819336},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.49563801288604736},{"id":"https://openalex.org/keywords/graph-bandwidth","display_name":"Graph bandwidth","score":0.4685472249984741},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.4215218424797058},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.391751766204834},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3582995533943176},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35347309708595276},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.33054593205451965}],"concepts":[{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.5805668830871582},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5648379325866699},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5322546362876892},{"id":"https://openalex.org/C19332903","wikidata":"https://www.wikidata.org/wiki/Q7623247","display_name":"Strength of a graph","level":5,"score":0.5252894163131714},{"id":"https://openalex.org/C147792647","wikidata":"https://www.wikidata.org/wiki/Q5282847","display_name":"Distance-hereditary graph","level":5,"score":0.5079532265663147},{"id":"https://openalex.org/C17169500","wikidata":"https://www.wikidata.org/wiki/Q3033506","display_name":"Null graph","level":5,"score":0.5074467062950134},{"id":"https://openalex.org/C128115575","wikidata":"https://www.wikidata.org/wiki/Q5597083","display_name":"Graph factorization","level":5,"score":0.4990835189819336},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.49563801288604736},{"id":"https://openalex.org/C134727501","wikidata":"https://www.wikidata.org/wiki/Q5597073","display_name":"Graph bandwidth","level":5,"score":0.4685472249984741},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.4215218424797058},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.391751766204834},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3582995533943176},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35347309708595276},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.33054593205451965}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros.2016.7759502","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros.2016.7759502","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W900890939","https://openalex.org/W1965680834","https://openalex.org/W1968315983","https://openalex.org/W2006368361","https://openalex.org/W2024908906","https://openalex.org/W2029780423","https://openalex.org/W2060922083","https://openalex.org/W2076552432","https://openalex.org/W2080823437","https://openalex.org/W2081675903","https://openalex.org/W2095025682","https://openalex.org/W2096052462","https://openalex.org/W2107905629","https://openalex.org/W2121947440","https://openalex.org/W2122871189","https://openalex.org/W2134396142","https://openalex.org/W2146297470","https://openalex.org/W2153054365","https://openalex.org/W2155537009","https://openalex.org/W2164035059","https://openalex.org/W3140425959","https://openalex.org/W3143919370","https://openalex.org/W4238873208","https://openalex.org/W4255306344","https://openalex.org/W6642392100"],"related_works":["https://openalex.org/W2393701947","https://openalex.org/W2953496651","https://openalex.org/W3208942821","https://openalex.org/W2886672068","https://openalex.org/W4285101991","https://openalex.org/W3173082423","https://openalex.org/W167435155","https://openalex.org/W2043718060","https://openalex.org/W2014355235","https://openalex.org/W2562224395"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"propose":[4],"a":[5,14,30,50,65,80,88,96,156],"hierarchical":[6],"pose":[7,16,66,97],"graph":[8,17,32,39,67,92,98,139],"optimization":[9,23,103,135,146],"algorithm,":[10,34],"which":[11,45,71,108],"hierarchically":[12],"divides":[13],"large":[15],"into":[18,43,68],"subgraphs":[19],"and":[20,155],"solves":[21],"the":[22,37,102,113,120,142,145],"problem":[24],"for":[25],"each":[26,75,117,134],"subgraph":[27,118],"independently.":[28],"Applying":[29],"modified":[31,56],"partitioning":[33],"normalized":[35,57],"cut,":[36],"original":[38],"could":[40],"be":[41,124],"partitioned":[42],"subgraphs,":[44,70],"are":[46,72,109,166],"conditionally":[47],"independent":[48,73],"on":[49,74,79],"set":[51],"of":[52,83,105,133,144],"key":[53],"nodes.":[54],"A":[55],"cut":[58],"algorithm":[59],"is":[60,93,136,147],"applied":[61],"to":[62,168],"automatically":[63],"partition":[64],"several":[69],"other":[76,129],"when":[77],"conditioned":[78],"small":[81],"number":[82],"keynodes.":[84],"Preserving":[85],"keynodes":[86],"only,":[87],"simplified":[89],"upper":[90,114],"level":[91,115,122],"generated":[94],"by":[95,111,159],"sparsification":[99],"algorithm.":[100,171],"Given":[101],"results":[104],"all":[106],"keynodes,":[107],"obtained":[110],"solving":[112],"graph,":[116],"in":[119],"lower":[121],"can":[123],"solved":[125],"efficiently":[126],"without":[127],"concerning":[128],"subgraphs.":[130],"The":[131],"scale":[132],"limited":[137],"during":[138],"partitioning.":[140],"Therefore,":[141],"efficiency":[143],"improved.":[148],"Experiments":[149],"with":[150],"both":[151],"public":[152],"standard":[153],"datasets":[154],"dataset":[157],"collected":[158],"an":[160],"autonomous":[161],"guided":[162],"vehicle":[163],"(AGV)":[164],"system":[165],"conducted":[167],"test":[169],"our":[170]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}