: This paper describes a long-terra project to install socially interactive, autonomousmobile robots in public spaces. We have deployed four robots over the last three years, accum...
Polynomial time complexity is the usual ‘threshold’ for distinguishing the tractable from the intractable and it may seem reasonable to adopt this notion of tractability in th...
This paper compares three penalty terms with respect to the efficiency of supervised learning, by using first- and second-order learning algorithms. Our experiments showed that fo...
The paper reports on the foundations and experimental results with a model checker for component connectors modelled by networks of channels in the calculus Reo. The specificatio...
In this paper, the multiagent coordination problem is studied. This problem is addressed for a class of robots for which control Lyapunov functions can be found. The main result is...