{"id":"https://openalex.org/W4416747819","doi":"https://doi.org/10.1109/iros60139.2025.11247648","title":"CAP: A Connectivity-Aware Hierarchical Coverage Path Planning Algorithm for Unknown Environments using Coverage Guidance Graph","display_name":"CAP: A Connectivity-Aware Hierarchical Coverage Path Planning Algorithm for Unknown Environments using Coverage Guidance Graph","publication_year":2025,"publication_date":"2025-10-19","ids":{"openalex":"https://openalex.org/W4416747819","doi":"https://doi.org/10.1109/iros60139.2025.11247648"},"language":null,"primary_location":{"id":"doi:10.1109/iros60139.2025.11247648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11247648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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/A5003024825","display_name":"Zongyuan Shen","orcid":"https://orcid.org/0000-0002-6617-2927"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zongyuan Shen","raw_affiliation_strings":["Carnegie Mellon University,Robotics Institute,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Robotics Institute,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5097358536","display_name":"Burhanuddin Shirose","orcid":null},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Burhanuddin Shirose","raw_affiliation_strings":["Carnegie Mellon University,Robotics Institute,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Robotics Institute,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011465900","display_name":"Prasanna Sriganesh","orcid":"https://orcid.org/0000-0002-8803-8569"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Prasanna Sriganesh","raw_affiliation_strings":["Carnegie Mellon University,Robotics Institute,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Robotics Institute,USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075935086","display_name":"Matthew Travers","orcid":"https://orcid.org/0000-0001-7275-2090"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Travers","raw_affiliation_strings":["Carnegie Mellon University,Robotics Institute,USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University,Robotics Institute,USA","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.31682192,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"13244","last_page":"13249"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9480000138282776,"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.9480000138282776,"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.019500000402331352,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.006300000008195639,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/path","display_name":"Path (computing)","score":0.6568999886512756},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6509000062942505},{"id":"https://openalex.org/keywords/any-angle-path-planning","display_name":"Any-angle path planning","score":0.5489000082015991},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5414999723434448},{"id":"https://openalex.org/keywords/planner","display_name":"Planner","score":0.46880000829696655},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.446399986743927},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.37689998745918274}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6585000157356262},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6568999886512756},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6509000062942505},{"id":"https://openalex.org/C158485040","wikidata":"https://www.wikidata.org/wiki/Q4778119","display_name":"Any-angle path planning","level":4,"score":0.5489000082015991},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5414999723434448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5189999938011169},{"id":"https://openalex.org/C2776999362","wikidata":"https://www.wikidata.org/wiki/Q2349274","display_name":"Planner","level":2,"score":0.46880000829696655},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.446399986743927},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.37689998745918274},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.3431999981403351},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31119999289512634},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.28380000591278076},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2734000086784363},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.27320000529289246},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2676999866962433},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.26759999990463257},{"id":"https://openalex.org/C144986985","wikidata":"https://www.wikidata.org/wiki/Q871236","display_name":"Hierarchical database model","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.2621999979019165}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iros60139.2025.11247648","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iros60139.2025.11247648","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 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":24,"referenced_works":["https://openalex.org/W1969483458","https://openalex.org/W1970499532","https://openalex.org/W2001478433","https://openalex.org/W2019738489","https://openalex.org/W2093284501","https://openalex.org/W2093385687","https://openalex.org/W2107956696","https://openalex.org/W2121866178","https://openalex.org/W2790223694","https://openalex.org/W2988886997","https://openalex.org/W3002336439","https://openalex.org/W3047628358","https://openalex.org/W3082132011","https://openalex.org/W3089444735","https://openalex.org/W3206101705","https://openalex.org/W3215839891","https://openalex.org/W4292261726","https://openalex.org/W4300005723","https://openalex.org/W4378804834","https://openalex.org/W4386702724","https://openalex.org/W4390969077","https://openalex.org/W4405710329","https://openalex.org/W4406110714","https://openalex.org/W4414301980"],"related_works":[],"abstract_inverted_index":{"Efficient":[0],"coverage":[1,28,34,45,70,75,106],"of":[2,35,79],"unknown":[3,36],"environments":[4],"requires":[5],"robots":[6],"to":[7,48,67],"adapt":[8],"their":[9],"paths":[10],"in":[11,105],"real":[12],"time":[13],"based":[14],"on":[15,56],"on-board":[16],"sensor":[17],"data.":[18],"In":[19],"this":[20],"paper,":[21],"we":[22],"introduce":[23],"CAP,":[24],"a":[25,44],"connectivity-aware":[26],"hierarchical":[27,61],"path":[29,66,108,111],"planning":[30],"algorithm":[31],"for":[32],"efficient":[33,65],"environments.":[37],"During":[38],"online":[39],"operation,":[40],"CAP":[41,80,101],"incrementally":[42],"constructs":[43],"guidance":[46],"graph":[47],"capture":[49],"essential":[50],"information":[51],"about":[52],"the":[53,57,60],"environment.":[54],"Based":[55],"updated":[58],"graph,":[59],"planner":[62],"determines":[63],"an":[64],"maximize":[68],"global":[69],"efficiency":[71],"and":[72,83,110],"minimize":[73],"local":[74],"time.":[76],"The":[77],"performance":[78],"is":[81],"evaluated":[82],"compared":[84],"with":[85],"five":[86],"baseline":[87],"algorithms":[88],"through":[89],"high-fidelity":[90],"simulations":[91],"as":[92,94],"well":[93],"robot":[95],"experiments.":[96],"Our":[97],"results":[98],"show":[99],"that":[100],"yields":[102],"significant":[103],"improvements":[104],"time,":[107],"length,":[109],"overlap":[112],"ratio.":[113]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-11-28T00:00:00"}