{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T02:46:15Z","timestamp":1794537975016,"version":"4.9.1"},"reference-count":0,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"<jats:p>A recurrent task in coordinated systems is managing (estimating, predicting,\nor controlling) signals that vary in space, such as distributed sensed data or\ncomputation outcomes. Especially in large-scale settings, the problem can be\naddressed through decentralised and situated computing systems: nodes can\nlocally sense, process, and act upon signals, and coordinate with neighbours to\nimplement collective strategies. Accordingly, in this work we devise\ndistributed coordination strategies for the estimation of a spatial phenomenon\nthrough collaborative adaptive sampling. Our design is based on the idea of\ndynamically partitioning space into regions that compete and grow\/shrink to\nprovide accurate aggregate sampling. Such regions hence define a sort of\nvirtualised space that is \"fluid\", since its structure adapts in response to\npressure forces exerted by the underlying phenomenon. We provide an adaptive\nsampling algorithm in the field-based coordination framework, and prove it is\nself-stabilising and locally optimal. Finally, we verify by simulation that the\nproposed algorithm effectively carries out a spatially adaptive sampling while\nmaintaining a tuneable trade-off between accuracy and efficiency.<\/jats:p>","DOI":"10.46298\/lmcs-19(4:29)2023","type":"journal-article","created":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T21:40:14Z","timestamp":1702935614000},"source":"Crossref","is-referenced-by-count":7,"title":["Space-Fluid Adaptive Sampling by Self-Organisation"],"prefix":"10.46298","volume":"Volume 19, Issue 4","author":[{"given":"Roberto","family":"Casadei","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefano","family":"Mariani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Danilo","family":"Pianini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mirko","family":"Viroli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franco","family":"Zambonelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"25203","published-online":{"date-parts":[[2023,12,18]]},"container-title":["Logical Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/lmcs.episciences.org\/12707\/pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/lmcs.episciences.org\/12707\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T21:40:15Z","timestamp":1702935615000},"score":1,"resource":{"primary":{"URL":"https:\/\/lmcs.episciences.org\/10233"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,18]]},"references-count":0,"URL":"https:\/\/doi.org\/10.46298\/lmcs-19(4:29)2023","relation":{"has-preprint":[{"id-type":"arxiv","id":"2210.17505v3","asserted-by":"subject"},{"id-type":"arxiv","id":"2210.17505v2","asserted-by":"subject"},{"id-type":"arxiv","id":"2210.17505v1","asserted-by":"subject"}],"is-same-as":[{"id-type":"arxiv","id":"2210.17505","asserted-by":"subject"},{"id-type":"doi","id":"10.48550\/arXiv.2210.17505","asserted-by":"subject"}]},"ISSN":["1860-5974"],"issn-type":[{"value":"1860-5974","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,18]]},"article-number":"10233"}}