{"id":"https://openalex.org/W2042901227","doi":"https://doi.org/10.4018/jsir.2011070101","title":"How Ants Can Efficiently Solve Generalized Watchman Route Problem","display_name":"How Ants Can Efficiently Solve Generalized Watchman Route Problem","publication_year":2011,"publication_date":"2011-07-01","ids":{"openalex":"https://openalex.org/W2042901227","doi":"https://doi.org/10.4018/jsir.2011070101","mag":"2042901227"},"language":"en","primary_location":{"id":"doi:10.4018/jsir.2011070101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jsir.2011070101","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Swarm Intelligence Research","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/A5015469992","display_name":"Pawe\u0142 Paduch","orcid":null},"institutions":[{"id":"https://openalex.org/I169109204","display_name":"Kielce University of Technology","ror":"https://ror.org/01zywja13","country_code":"PL","type":"education","lineage":["https://openalex.org/I169109204"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Pawel Paduch","raw_affiliation_strings":["Kielce University of Technology, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kielce University of Technology, Poland","institution_ids":["https://openalex.org/I169109204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007077278","display_name":"Krzysztof Sapiecha","orcid":null},"institutions":[{"id":"https://openalex.org/I169109204","display_name":"Kielce University of Technology","ror":"https://ror.org/01zywja13","country_code":"PL","type":"education","lineage":["https://openalex.org/I169109204"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof Sapiecha","raw_affiliation_strings":["Kielce University of Technology, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kielce University of Technology, Poland","institution_ids":["https://openalex.org/I169109204"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5015469992"],"corresponding_institution_ids":["https://openalex.org/I169109204"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.10971987,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"2","issue":"3","first_page":"1","last_page":"15"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.6927621364593506},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4922551214694977},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.46384766697883606},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.44001758098602295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4378267824649811},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2624235451221466},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20466148853302002}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6927621364593506},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4922551214694977},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.46384766697883606},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.44001758098602295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4378267824649811},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2624235451221466},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20466148853302002}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.4018/jsir.2011070101","is_oa":false,"landing_page_url":"https://doi.org/10.4018/jsir.2011070101","pdf_url":null,"source":{"id":"https://openalex.org/S146254016","display_name":"International Journal of Swarm Intelligence Research","issn_l":"1947-9263","issn":["1947-9263","1947-9271"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320424","host_organization_name":"IGI Global","host_organization_lineage":["https://openalex.org/P4310320424"],"host_organization_lineage_names":["IGI Global"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Swarm Intelligence Research","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:igg:jsir00:v:2:y:2011:i:3:p:1-15","is_oa":false,"landing_page_url":"https://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/jsir.2011070101","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"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/W139609527","https://openalex.org/W161004712","https://openalex.org/W1545835929","https://openalex.org/W1548671833","https://openalex.org/W1557288165","https://openalex.org/W1573676079","https://openalex.org/W1579112154","https://openalex.org/W1968165428","https://openalex.org/W2009151996","https://openalex.org/W2038280788","https://openalex.org/W2052861240","https://openalex.org/W2057025928","https://openalex.org/W2077799561","https://openalex.org/W2087422927","https://openalex.org/W2091895533","https://openalex.org/W2094658339","https://openalex.org/W2118051273","https://openalex.org/W2125334953","https://openalex.org/W2145459554","https://openalex.org/W2158652185","https://openalex.org/W2167920923","https://openalex.org/W2982209274","https://openalex.org/W4298410530","https://openalex.org/W4299796063","https://openalex.org/W6629566668"],"related_works":["https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2182624400","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2365800168","https://openalex.org/W2767428579","https://openalex.org/W2390279801","https://openalex.org/W1992807692","https://openalex.org/W3014549013"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3],"new":[4,46],"algorithm":[5,38,43,52,73],"for":[6,26],"solving":[7],"the":[8,14,23,27,31,40,45,51,72],"generalized":[9],"watchman":[10],"problem.":[11,47],"It":[12,65],"is":[13,53,63],"problem":[15],"of":[16,71],"mobile":[17],"robot":[18,28],"operators":[19],"that":[20,67],"must":[21],"find":[22],"shortest":[24],"route":[25],"to":[29,44,55],"see":[30],"whole":[32],"area":[33,57],"with":[34],"many":[35],"obstructions.":[36],"The":[37],"adapts":[39],"well-known":[41],"ant":[42],"An":[48],"experiment":[49],"where":[50],"applied":[54],"an":[56],"containing":[58],"more":[59],"than":[60],"10":[61],"obstructions":[62],"described.":[64],"proves":[66],"efficiency":[68],"and":[69],"accuracy":[70],"are":[74],"high.":[75]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}