{"id":"https://openalex.org/W4225357267","doi":"https://doi.org/10.1109/lra.2022.3159824","title":"Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes","display_name":"Towards a Continuous Solution of the $d$-Visibility Watchman Route Problem in a Polygon With Holes","publication_year":2022,"publication_date":"2022-03-16","ids":{"openalex":"https://openalex.org/W4225357267","doi":"https://doi.org/10.1109/lra.2022.3159824"},"language":"en","primary_location":{"id":"doi:10.1109/lra.2022.3159824","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3159824","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":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011920602","display_name":"J\u00e1n Mikula","orcid":"https://orcid.org/0000-0003-3404-8742"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Mikula","raw_affiliation_strings":["Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo namesti 13, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-3404-8742","affiliations":[{"raw_affiliation_string":"Department of Cybernetics, Faculty of Electrical Engineering, Czech Technical University in Prague, Karlovo namesti 13, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084228715","display_name":"Miroslav Kulich","orcid":"https://orcid.org/0000-0002-0997-5889"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Miroslav Kulich","raw_affiliation_strings":["Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-0997-5889","affiliations":[{"raw_affiliation_string":"Czech Institute of Informatics, Robotics and Cybernetics, Czech Technical University in Prague, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011920602"],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.5102,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.62720596,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"7","issue":"3","first_page":"5934","last_page":"5941"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9976000189781189,"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"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9954000115394592,"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/heuristic","display_name":"Heuristic","score":0.5635620951652527},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.5451587438583374},{"id":"https://openalex.org/keywords/visibility","display_name":"Visibility","score":0.5305008888244629},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.476578950881958},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46795570850372314},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4582175314426422},{"id":"https://openalex.org/keywords/discretization","display_name":"Discretization","score":0.4258885383605957},{"id":"https://openalex.org/keywords/notation","display_name":"Notation","score":0.4229065477848053},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.36165356636047363},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.33975639939308167},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3334663510322571},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32460224628448486},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.16457140445709229},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08294540643692017}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5635620951652527},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.5451587438583374},{"id":"https://openalex.org/C123403432","wikidata":"https://www.wikidata.org/wiki/Q654068","display_name":"Visibility","level":2,"score":0.5305008888244629},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.476578950881958},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46795570850372314},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4582175314426422},{"id":"https://openalex.org/C73000952","wikidata":"https://www.wikidata.org/wiki/Q17007827","display_name":"Discretization","level":2,"score":0.4258885383605957},{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.4229065477848053},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.36165356636047363},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.33975639939308167},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3334663510322571},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32460224628448486},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.16457140445709229},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08294540643692017},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.0},{"id":"https://openalex.org/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lra.2022.3159824","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lra.2022.3159824","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8087443690","display_name":null,"funder_award_id":"CZ.02.1.01/0.0/0.0/15_003/0000470","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"}],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W65738273","https://openalex.org/W1495217571","https://openalex.org/W1579112154","https://openalex.org/W1986642089","https://openalex.org/W2019738489","https://openalex.org/W2023182928","https://openalex.org/W2024874686","https://openalex.org/W2027386413","https://openalex.org/W2039204626","https://openalex.org/W2065318495","https://openalex.org/W2067096513","https://openalex.org/W2101889102","https://openalex.org/W2103281154","https://openalex.org/W2104686035","https://openalex.org/W2110824994","https://openalex.org/W2120364970","https://openalex.org/W2125334953","https://openalex.org/W2129412583","https://openalex.org/W2135301926","https://openalex.org/W2138800545","https://openalex.org/W2158652185","https://openalex.org/W2614564353","https://openalex.org/W2775016279","https://openalex.org/W3198451928","https://openalex.org/W4213368447","https://openalex.org/W4232146578","https://openalex.org/W4293577837","https://openalex.org/W4294623590","https://openalex.org/W6629501993","https://openalex.org/W6633664879","https://openalex.org/W6677825563","https://openalex.org/W6742799766","https://openalex.org/W6941249815"],"related_works":["https://openalex.org/W2392812199","https://openalex.org/W4200176076","https://openalex.org/W598185802","https://openalex.org/W2006251942","https://openalex.org/W2355516524","https://openalex.org/W2361471170","https://openalex.org/W2025616642","https://openalex.org/W2364741597","https://openalex.org/W2954738200","https://openalex.org/W2035653613"],"abstract_inverted_index":{"A":[0],"new":[1],"heuristic":[2,122],"solution":[3,35,113,128],"framework":[4,52,86,141,164],"is":[5,36,117,142,165],"proposed":[6,121],"to":[7,110,146,154,173],"address":[8,179],"the":[9,30,37,42,85,95,100,112,136,150,156,163,174,181],"challenging":[10],"<italic":[11,81,101],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[12,60,73,82,102],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">watchman":[13],"route":[14,39],"problem</i>":[15],"(WRP)":[16],"in":[17,135,180],"a":[18,47,54,79,88,126,169],"polygonal":[19],"domain,":[20],"which":[21,41],"can":[22,44],"be":[23],"viewed":[24],"as":[25],"an":[26,65],"offline":[27],"version":[28,161],"of":[29,78,90,162],"robot":[31,43,56],"exploration":[32],"task.":[33],"The":[34,115,139,159],"shortest":[38],"from":[40,149,168],"visually":[45],"inspect":[46],"known":[48],"2D":[49],"environment.":[50],"Our":[51],"considers":[53],"circular":[55],"with":[57,64,68,106],"radius":[58],"<inline-formula":[59,72],"xmlns:xlink=\"http://www.w3.org/1999/xlink\"><tex-math":[61,74],"notation=\"LaTeX\">$r$</tex-math></inline-formula>":[62],"equipped":[63],"omnidirectional":[66],"sensor":[67],"limited":[69],"visibility":[70],"range":[71],"notation=\"LaTeX\">$d$</tex-math></inline-formula>":[75],".":[76],"Instead":[77],"standard":[80],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">decoupled</i>":[83],"solution,":[84],"generates":[87],"set":[89],"specifically":[91],"constrained":[92],"regions":[93],"covering":[94],"domain":[96],"and":[97,130,152],"then":[98,131],"solves":[99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">traveling":[103],"salesman":[104],"problem":[105],"continuous":[107,137,171],"neighborhoods</i>":[108],"(TSPN)":[109],"obtain":[111],"route.":[114],"TSPN":[116],"solved":[118],"by":[119],"another":[120],"algorithm":[123],"that":[124,176],"finds":[125],"discretized":[127],"first":[129],"improves":[132],"it":[133],"back":[134],"domain.":[138],"whole":[140],"evaluated":[143],"experimentally,":[144],"compared":[145],"two":[147],"approaches":[148],"literature,":[151],"shown":[153],"provide":[155],"highest-quality":[157],"solutions.":[158],"current":[160],"one":[166],"step":[167],"fully":[170],"approach":[172],"WRP":[175],"we":[177],"will":[178],"future.":[182]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}