{"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","2377-3774"],"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":false,"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I44504214"],"apc_list":null,"apc_paid":null,"fwci":0.4064,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.54341503,"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","2377-3774"],"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/G6006929117","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":{"pdf":false,"grobid_xml":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,100],"solution":[3,31,91,106],"framework":[4,48,68,119,142],"is":[5,32,95,120,143],"proposed":[6,99],"to":[7,88,124,132,151],"address":[8,157],"the":[9,26,33,38,67,77,90,114,128,134,141,152,159],"challengingwatchman":[10],"route":[11,35],"problem(WRP)":[12],"in":[13,113,158],"a":[14,43,50,65,70,104,147],"polygonal":[15],"domain,":[16],"which":[17,37],"can":[18,40],"be":[19],"viewed":[20],"as":[21],"an":[22,56],"offline":[23],"version":[24,139],"of":[25,64,72,140],"robot":[27,39,52],"exploration":[28],"task.":[29],"The":[30,93,117,137],"shortest":[34],"from":[36,127,146],"visually":[41],"inspect":[42],"known":[44],"2D":[45],"environment.":[46],"Our":[47],"considers":[49],"circular":[51],"with":[53,55,59,85],"radius$r$equipped":[54],"omnidirectional":[57],"sensor":[58],"limited":[60],"visibility":[61],"range$d$.":[62],"Instead":[63],"standarddecoupledsolution,":[66],"generates":[69],"set":[71],"specifically":[73],"constrained":[74],"regions":[75],"covering":[76],"domain":[78],"and":[79,108,130],"then":[80,109],"solves":[81],"thetraveling":[82],"salesman":[83],"problem":[84],"continuous":[86,115,149],"neighborhoods(TSPN)":[87],"obtain":[89],"route.":[92],"TSPN":[94],"solved":[96],"by":[97],"another":[98],"algorithm":[101],"that":[102,154],"finds":[103],"discretized":[105],"first":[107],"improves":[110],"it":[111],"back":[112],"domain.":[116],"whole":[118],"evaluated":[121],"experimentally,":[122],"compared":[123],"two":[125],"approaches":[126],"literature,":[129],"shown":[131],"provide":[133],"highest-quality":[135],"solutions.":[136],"current":[138],"one":[144],"step":[145],"fully":[148],"approach":[150],"WRP":[153],"we":[155],"will":[156],"future.":[160]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}