{"id":"https://openalex.org/W4312777451","doi":"https://doi.org/10.1007/978-981-19-8234-7_49","title":"Hybrid Boustrophedon and\u00a0Partition Tree Group Algorithm for\u00a0Coverage Path Planning Problem with\u00a0Energy Constraints","display_name":"Hybrid Boustrophedon and\u00a0Partition Tree Group Algorithm for\u00a0Coverage Path Planning Problem with\u00a0Energy Constraints","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4312777451","doi":"https://doi.org/10.1007/978-981-19-8234-7_49"},"language":"en","primary_location":{"id":"doi:10.1007/978-981-19-8234-7_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-19-8234-7_49","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5048779669","display_name":"Tran Thi Cam Giang","orcid":"https://orcid.org/0009-0006-5141-0191"},"institutions":[{"id":"https://openalex.org/I182526193","display_name":"Thuyloi University","ror":"https://ror.org/04afshy24","country_code":"VN","type":"education","lineage":["https://openalex.org/I182526193"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Tran Thi Cam Giang","raw_affiliation_strings":["ThuyLoi University, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"ThuyLoi University, Hanoi, Vietnam","institution_ids":["https://openalex.org/I182526193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072105691","display_name":"Hu\u1ef3nh Th\u1ecb Thanh B\u00ecnh","orcid":"https://orcid.org/0000-0003-1976-6113"},"institutions":[{"id":"https://openalex.org/I94518387","display_name":"Hanoi University of Science and Technology","ror":"https://ror.org/04nyv3z04","country_code":"VN","type":"education","lineage":["https://openalex.org/I94518387"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huynh Thi Thanh Binh","raw_affiliation_strings":["Hanoi University of Science and Technology, Hanoi, Vietnam"],"affiliations":[{"raw_affiliation_string":"Hanoi University of Science and Technology, Hanoi, Vietnam","institution_ids":["https://openalex.org/I94518387"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048779669"],"corresponding_institution_ids":["https://openalex.org/I182526193"],"apc_list":null,"apc_paid":null,"fwci":0.1413,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56773916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"626","last_page":"640"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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.9998999834060669,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12288","display_name":"Optimization and Search Problems","score":0.9934999942779541,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.6823920607566833},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6093530058860779},{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.6079257130622864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5545161366462708},{"id":"https://openalex.org/keywords/mobile-robot","display_name":"Mobile robot","score":0.5353980660438538},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5199303030967712},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5093737840652466},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5056042671203613},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.5015320777893066},{"id":"https://openalex.org/keywords/energy-consumption","display_name":"Energy consumption","score":0.4874703884124756},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4869740903377533},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4763658046722412},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.44445785880088806},{"id":"https://openalex.org/keywords/partition-problem","display_name":"Partition problem","score":0.4284711480140686},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22892290353775024},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.18658149242401123},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1475333571434021},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.1445423662662506},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13791948556900024},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08908244967460632}],"concepts":[{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.6823920607566833},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6093530058860779},{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.6079257130622864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5545161366462708},{"id":"https://openalex.org/C19966478","wikidata":"https://www.wikidata.org/wiki/Q4810574","display_name":"Mobile robot","level":3,"score":0.5353980660438538},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5199303030967712},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5093737840652466},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5056042671203613},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.5015320777893066},{"id":"https://openalex.org/C2780165032","wikidata":"https://www.wikidata.org/wiki/Q16869822","display_name":"Energy consumption","level":2,"score":0.4874703884124756},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4869740903377533},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4763658046722412},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.44445785880088806},{"id":"https://openalex.org/C35995877","wikidata":"https://www.wikidata.org/wiki/Q1065968","display_name":"Partition problem","level":3,"score":0.4284711480140686},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22892290353775024},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.18658149242401123},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1475333571434021},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.1445423662662506},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13791948556900024},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08908244967460632},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-981-19-8234-7_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-981-19-8234-7_49","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.9100000262260437,"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1590932131","https://openalex.org/W2019738489","https://openalex.org/W2029681015","https://openalex.org/W2074654730","https://openalex.org/W2129320259","https://openalex.org/W2553720302","https://openalex.org/W2810818318","https://openalex.org/W2890073142","https://openalex.org/W2892049203","https://openalex.org/W3082132011","https://openalex.org/W4253570324"],"related_works":["https://openalex.org/W2025912669","https://openalex.org/W2057299700","https://openalex.org/W1549987457","https://openalex.org/W2014615094","https://openalex.org/W1977789739","https://openalex.org/W2351778335","https://openalex.org/W4240458717","https://openalex.org/W2497180562","https://openalex.org/W2379495598","https://openalex.org/W2047470742"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}