{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T17:20:01Z","timestamp":1783790401561,"version":"3.55.0"},"publisher-location":"Singapore","reference-count":15,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811623769","type":"print"},{"value":"9789811623776","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T00:00:00Z","timestamp":1632441600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-981-16-2377-6_17","type":"book-chapter","created":{"date-parts":[[2021,9,24]],"date-time":"2021-09-24T01:44:09Z","timestamp":1632447849000},"page":"155-163","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Application of Adjusted Differential Evolution in Optimal Sensor Placement for Interior Coverage"],"prefix":"10.1007","author":[{"given":"Adis","family":"Alihodzic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Damir","family":"Hasanspahic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eva","family":"Tuba","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Milan","family":"Tuba","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,9,24]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","unstructured":"Alihodzic A (2016) Fireworks algorithm with new feasibility-rules in solving uav path planning. In: 2016 3rd International Conference on Soft Computing Machine Intelligence (ISCMI), pp 53\u201357. https:\/\/doi.org\/10.1109\/ISCMI.2016.33","DOI":"10.1109\/ISCMI.2016.33"},{"key":"17_CR2","doi-asserted-by":"publisher","unstructured":"de\u00a0Berg M, Cheong O, van Kreveld M, Overmars M (2008) Computational geometry: algorithms and applications, 3rd edn. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-540-77974-2","DOI":"10.1007\/978-3-540-77974-2"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02574029","volume":"13","author":"I Bjorling-Sachs","year":"1995","unstructured":"Bjorling-Sachs I, Souvaine DL (1995) An efficient algorithm for guard placement in polygons with holes. Discret Comput Geom 13:77\u2013109. https:\/\/doi.org\/10.1007\/BF02574029","journal-title":"Discret Comput Geom"},{"issue":"1","key":"17_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal V (1975) A combinatorial theorem in plane geometry. J Comb Theory, Ser B 18(1):39\u201341. https:\/\/doi.org\/10.1016\/0095-8956(75)90061-1","journal-title":"J Comb Theory, Ser B"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Elnagar A, Lulu L (2005) An art gallery-based approach to autonomous robot motion planning in global environments. In: 2005 IEEE\/RSJ international conference on intelligent robots and systems, pp 2079\u20132084. https:\/\/doi.org\/10.1109\/IROS.2005.1545170","DOI":"10.1109\/IROS.2005.1545170"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Hoffmann F, Kaufmann M, Kriegel K (1991) The art gallery theorem for polygons with holes. In: Proceedings 32nd annual symposium of foundations of computer science, pp 39\u201348. https:\/\/doi.org\/10.1109\/SFCS.1991.185346","DOI":"10.1109\/SFCS.1991.185346"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.comgeo.2007.02.002","volume":"39","author":"MJ Katz","year":"2008","unstructured":"Katz MJ, Roisman GS (2008) On guarding the vertices of rectilinear domains. Computat Geometry 39(3):219\u2013228. https:\/\/doi.org\/10.1016\/j.comgeo.2007.02.002","journal-title":"Computat Geometry"},{"issue":"2","key":"17_CR8","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D Lee","year":"1986","unstructured":"Lee D, Lin A (1986) Computational complexity of art gallery problems. IEEE Trans Inf Theory 32(2):276\u2013282. https:\/\/doi.org\/10.1109\/TIT.1986.1057165","journal-title":"IEEE Trans Inf Theory"},{"key":"17_CR9","unstructured":"O\u2019Rourke J (1998) Computational geometry in C. Cambridge University Press, Cambridge"},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1109\/TIT.1983.1056648","volume":"29","author":"J O\u2019Rourke","year":"1983","unstructured":"O\u2019Rourke J, Supowit K (1983) Some np-hard polygon decomposition problems. IEEE Trans Inf Theory 29(2):181\u2013190. https:\/\/doi.org\/10.1109\/TIT.1983.1056648","journal-title":"IEEE Trans Inf Theory"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1016\/j.cie.2008.03.003","volume":"55","author":"QK Pan","year":"2008","unstructured":"Pan QK, Tasgetiren MF, Liang YC (2008) A discrete differential evolution algorithm for the permutation flowshop scheduling problem. Comput Ind Eng 55(4):795\u2013816. https:\/\/doi.org\/10.1016\/j.cie.2008.03.003","journal-title":"Comput Ind Eng"},{"key":"17_CR12","doi-asserted-by":"publisher","unstructured":"Sadhu S, Hazarika S, Jain KK, Basu S, De T (2012) Grp\\_ch heuristic for generating random simple polygon. In: Combinatorial algorithms, pp 293\u2013302. Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-35926-2","DOI":"10.1007\/978-3-642-35926-2"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/malq.19950410212","volume":"41","author":"D Schuchardt","year":"1995","unstructured":"Schuchardt D, Hecker H (1995) Two np-hard art-gallery problems for ortho-polygons. Math Logic Quart 41(2):261\u2013267. https:\/\/doi.org\/10.1002\/malq.19950410212","journal-title":"Math Logic Quart"},{"issue":"1","key":"17_CR14","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1145\/641865.641868","volume":"35","author":"WR Scott","year":"2003","unstructured":"Scott WR, Roth G (2003) Jean-Fran\u00e7ois: view planning for automated three-dimensional object reconstruction and inspection. ACM Comput Surv 35(1):64\u201396. https:\/\/doi.org\/10.1145\/641865.641868","journal-title":"ACM Comput Surv"},{"issue":"4","key":"17_CR15","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn R, Price K (1997) Differential evolution\u2014a simple and efficient heuristic for global optimization over continuous spaces. J Global Optim 11(4):341\u2013359. https:\/\/doi.org\/10.1023\/A:1008202821328","journal-title":"J Global Optim"}],"container-title":["Lecture Notes in Networks and Systems","Proceedings of Sixth International Congress on Information and Communication Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-16-2377-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,9]],"date-time":"2022-02-09T18:09:27Z","timestamp":1644430167000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-16-2377-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,24]]},"ISBN":["9789811623769","9789811623776"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-981-16-2377-6_17","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"value":"2367-3370","type":"print"},{"value":"2367-3389","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,24]]},"assertion":[{"value":"24 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}