{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T23:10:48Z","timestamp":1654125048572},"reference-count":29,"publisher":"IGI Global","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,7,1]]},"abstract":"<p>This paper presents a new algorithm for solving the generalized watchman problem. It is the problem of mobile robot operators that must find the shortest route for the robot to see the whole area with many obstructions. The algorithm adapts the well-known ant algorithm to the new problem. An experiment where the algorithm is applied to an area containing more than 10 obstructions is described. It proves that efficiency and accuracy of the algorithm are high.<\/p>","DOI":"10.4018\/jsir.2011070101","type":"journal-article","created":{"date-parts":[[2011,10,19]],"date-time":"2011-10-19T16:51:04Z","timestamp":1319043064000},"page":"1-15","source":"Crossref","is-referenced-by-count":1,"title":["How Ants Can Efficiently Solve Generalized Watchman Route Problem"],"prefix":"10.4018","volume":"2","author":[{"given":"Pawel","family":"Paduch","sequence":"first","affiliation":[{"name":"Kielce University of Technology, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Sapiecha","sequence":"additional","affiliation":[{"name":"Kielce University of Technology, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"2432","reference":[{"key":"jsir.2011070101-0","author":"S. A.Ali","year":"2006","journal-title":"Mobile robotics, moving intelligence"},{"key":"jsir.2011070101-1","unstructured":"Bjorling-Sachs, I., & Souvaine, D. (1991). A tight bound for guarding general polygons with holes (Tech. Rep. No. LCSR-TR-165). New Brunswick, NJ: Rutgers University."},{"key":"jsir.2011070101-2","unstructured":"Blum, C., & Dorigo, M. (2001). HC-ACO: The hyper-cube framework for ant colony optimization. In Proceedings of the Metaheuristics International Conference (pp. 399-403)."},{"key":"jsir.2011070101-3","first-page":"25","article-title":"A new rank based version of the ant system - a computational study.","volume":"7","author":"B.Bullnheimer","year":"1997","journal-title":"Central European Journal for Operations Research and Economics"},{"key":"jsir.2011070101-4","first-page":"257","article-title":"Optimum zoo-keeper routes.","volume":"58","author":"W. P.Chin","year":"1987","journal-title":"Congressus Numerantium"},{"key":"jsir.2011070101-5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02574671"},{"key":"jsir.2011070101-6","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90061-1"},{"key":"jsir.2011070101-7","unstructured":"Cordon, O., Fern\u00e1ndez de Viana, I., Herrera, F., & Moreno, L. (2000). A new ACO model integrating evolutionary computation concepts: The best-worst ant system. In Proceedings of the Algorithmic Number Theory Symposium (pp. 22-29)."},{"key":"jsir.2011070101-8","unstructured":"Dorigo, M. (1992). Optimization, learning and natural algorithms. Unpublished doctoral dissertation, Politecnico di Milano, Milan, Italy."},{"key":"jsir.2011070101-9","doi-asserted-by":"publisher","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"jsir.2011070101-10","author":"M.Dorigo","year":"1998","journal-title":"Ant algorithms for discrete optimization"},{"key":"jsir.2011070101-11","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1290.001.0001","author":"M.Dorigo","year":"2004","journal-title":"Ant colony optimization"},{"key":"jsir.2011070101-12","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., & Mitchell, J. S. B. (2003). Touring a sequence of polygons. In Proceedings of the 35th Annual ACM Symposium on Theory Computing (pp. 473-482).","DOI":"10.1145\/780542.780612"},{"key":"jsir.2011070101-13","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(78)90059-X"},{"key":"jsir.2011070101-14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01212977"},{"key":"jsir.2011070101-15","author":"V.Maniezzo","year":"1998","journal-title":"Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem"},{"key":"jsir.2011070101-16","doi-asserted-by":"crossref","unstructured":"Mata, C. S., & Mitchell, J. S. B. (1995). Approximation algorithms for geometric tour and network design problems (extended abstract). In Proceedings of the Eleventh Annual Symposium on Computational Geometry (pp. 360-369).","DOI":"10.1145\/220279.220318"},{"key":"jsir.2011070101-17","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/S0925-7721(03)00039-7","article-title":"Art gallery theorems for guarded guards.","volume":"26","author":"T. S.Michael","year":"2003","journal-title":"Computational Geometry Theory and Applications"},{"key":"jsir.2011070101-18","author":"B. J.Nilsson","year":"1994","journal-title":"Guarding art galleries \u2013 methods for mobile guards"},{"key":"jsir.2011070101-19","author":"J.O\u2019Rourke","year":"1987","journal-title":"Art gallery theorems and algorithms"},{"key":"jsir.2011070101-20","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804120","author":"J.O\u2019Rourke","year":"1998","journal-title":"Computational geometry in C (Cambridge tracts in theoretical computer science)"},{"key":"jsir.2011070101-21","doi-asserted-by":"crossref","unstructured":"Packer, E. (2008). Computing multiple watchman routes. In Proceedings of the 7th International Conference on Experimental Algorithms (pp. 114-128).","DOI":"10.1007\/978-3-540-68552-4_9"},{"key":"jsir.2011070101-22","unstructured":"Robotics Trends. (2010). Stories filed in security and defense. Retrieved from http:\/\/www.roboticstrends.com\/topics\/security_defense_robotics"},{"key":"jsir.2011070101-23","author":"T.St\u00fctzle","year":"1996","journal-title":"Improving the ant system: A detailed report on the max-min ant system"},{"key":"jsir.2011070101-24","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00451-7"},{"key":"jsir.2011070101-25","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(03)00284-9"},{"key":"jsir.2011070101-26","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195999000212"},{"key":"jsir.2011070101-27","author":"P.\u017byli\u0144ski","year":"2002","journal-title":"Some results on cooperative guards"},{"key":"jsir.2011070101-28","doi-asserted-by":"crossref","unstructured":"\u017byli\u0144ski, P. (2006). Orthogonal art galleries with holes: A coloring proof of Aggarwal\u2019s theorem. Electronic Journal of Combinatorics, 13(1).","DOI":"10.37236\/1046"}],"container-title":["International Journal of Swarm Intelligence Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=60159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T22:29:39Z","timestamp":1654122579000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jsir.2011070101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2011,7,1]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,7]]}},"URL":"https:\/\/doi.org\/10.4018\/jsir.2011070101","relation":{},"ISSN":["1947-9263","1947-9271"],"issn-type":[{"value":"1947-9263","type":"print"},{"value":"1947-9271","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,1]]}}}