Papers are now available online in IEEE Xplore.
Many self-organizing or self-adaptive systems are “spatial computers” – collections of local computational devices distributed through a physical space, in which:
- the difficulty of moving information between any two devices is strongly dependent on the distance between them, and
- the “functional goals” of the system are generally defined in terms of the system's spatial structure.
Systems that can be viewed as spatial computers are abundant, both natural and man-made. For example, in wireless sensor networks and animal or robot swarms, inter-agent communication network topologies are determined by the distance between devices, while the agent collectives as a whole solve spatially-defined problems like “analyze and react to spatial temperature variance” or “surround and destroy an enemy.”
Similarly, in reconfigurable microchip platforms, moving data between adjacent logic blocks is much faster than moving it across the chip, which in turn favors problems with spatial structure like stream processing. In biological embryos, each developing cell's behavior is controlled only by its local chemical and physical environment, but the eventual structure of the organism is a global property of the cellular arrangement. Moreover, a variety of successful established techniques for self-organization and self-adaptation arise from explicitly spatial metaphors, e.g., self-healing gradients.
On the other hand, not all spatially distributed systems are spatial computers. The Internet and peer-to-peer overlay networks may not in general best be considered as spatial computers, both because their communication graphs have little relation to the Euclidean geometry in which the participating devices are embedded, and because most applications for them are explicitly defined independent of network structure. Spatial computers, in contrast, tend to have more structure, with specific constraints and capabilities that can be used in the design and analysis of algorithms.
The goal of this workshop is to explicitly identify the idea of “spatial computing” as a theme in self-organizing and self-adaptive systems, and further to develop the study of spatial computation as a subject in its own right. We believe that progress towards identifying common principles, techniques, and research directions – and consolidating the substantial progress that is already being made – will benefit all of the fields in which spatial computing takes place. And, as the impact of spatial computing is recognized in many areas, we hope to set up frameworks to ensure portability and cross-fertilization between solutions in the various domains.
We are soliciting submissions on any aspect of spatial computing. Examples of topics of interest include, but are by no means limited to:
- Languages for programming spatial computers and describing spatial tasks and patterns
- Methods for compiling global programs to local rules that produce the desired global effect
- Characterization of spatial self-organization phenomena as algorithmic building blocks
- Characterization of error in spatial computers (e.g., error from approximating continuous space with networks of devices)
- Analysis of tradeoffs between system parameters (e.g., communication radius vs. device memory consumption)
- Studies of the relationship between time, propagation of information through the spatial computer, and computational complexity
- Application of spatial computing principles to novel areas, or generalization of area-specific techniques
- Device motion in spatial computing algorithms (e.g. the relationship between robot speed and gradient accuracy in multi-robot swarms)
We encourage authors to submit papers in one of two formats: (1) Papers that develop “unifying” principles or techniques in spatial computing – these papers should be suitable in format and quality for a conference track, but avoid incrementalism. (2) Papers that demonstrate how a technique or problem from a specific area of application can usefully be generalized – these papers should be a combination of review paper and position paper, presenting the material from one area in a form comprehensible to researchers of another area, as well as a coherent technical argument generalizing the material to other areas. Although our interests are broad, we discourage authors from submitting reviews of particular application areas unless the paper explicitly connects the material to the larger technical issues of spatial computing.
This workshop will be of interest both to researchers who work on specific systems in which spatial structure is relevant (from sensor networks to developmental biology), as well as to those working on general approaches to spatially distributed systems (e.g., amorphous computing and cellular automata). We also expect the workshop to appeal to researchers interested in the relationship between self-organization, self-adaptation, and distributed or decentralized computing.
Papers should be no longer than 6 pages in standard IEEE two-column format. All manuscripts should be submitted in PDF form to email@example.com.
Please direct all questions to firstname.lastname@example.org.
Workshop proceedings will be published in a bundle with the main conference proceedings.
- July 12, 2010: Submission deadline
- August 6, 2010: Acceptance notification
- August, 13 2010: Early registration deadline
- August, 26, 2010: Camera ready version of accepted papers
- September 27, 2010: Workshop held at IEEE SASO in Budapest, Hungary.
08:30 → 09:30 Registration
09:30 → 10:10 J. Beal - A basis set of operators for space-time computations
10:10 → 10:50 D. Duchier, J. Durand-Lose & M. Senot - Massively parallel automata in Euclidian space-time
11:00 – 11:30 Coffee break
11:30 → 12:10 J. Baran, P. Petrovic & M. Schoenauer - Irregular cellular automata: a compact representation
12:10 → 13:00 Demos
13:00 – 14:00 Lunch break
14:00 → 14:40 L. Bigo, A. Spicher & O. Michel - Spatial programming for music representation and analysis
14:40 → 15:20 M. Banâtre, F. Allard & P. Courderc - A spatial computing approach for integrity checking of object groups
15:30 – 16:00 Coffee break
16:00 → 16:40 A. Sampson & G. Smith - Gravity points in potential-field approaches to self-organisation
16:40 → 17:30 Open discussions
- Dr. Jacob Beal (BBN Technologies, USA)
- Prof. Olivier Michel (Univ. Paris 12, France)
- Dr. Antoine Spicher (Univ. Paris 12, France)
- Prof. Cristian Borcea (New Jersey Institute of Technology, USA)
- Dr. Jonathan Bachrach (Makani Power, USA)
- Prof. Daniel Coore (University of West Indies, Mona)
- Julius Degesys (Harvard)
- Prof. Andre deHon (U Penn)
- Prof. Giovanna Di Marzo Serugendo (Univ. London)
- Dr. Rene Doursat (Institut des Systemes Complexes)
- Dr. Jean-Louis Giavitto (CNRS - IBISC, France)
- Prof. Frederic Gruau (University Paris Sud)
- Prof. Mark Jelasity (Hungarian Academy of Sciences and University of Szeged, Hungary)
- Dr. Luidnel Maignan (INRIA Saclay, France)
- Ulrik Pagh Schultz (University of Southern Denmark)
- Prof. Christof Teuscher (Portland State University)
- Dr. Danny Weyns (K.U.Leuven, Belgium)
- Dr. Eiko Yoneki (University of Cambridge, UK)
- Ron Weiss (Princeton)
- Chih-Han Yu (Harvard)