Header logo is


2010


no image
Using an Infinite Von Mises-Fisher Mixture Model to Cluster Treatment Beam Directions in External Radiation Therapy

Bangert, M., Hennig, P., Oelfke, U.

In pages: 746-751 , (Editors: Draghici, S. , T.M. Khoshgoftaar, V. Palade, W. Pedrycz, M.A. Wani, X. Zhu), IEEE, Piscataway, NJ, USA, Ninth International Conference on Machine Learning and Applications (ICMLA), December 2010 (inproceedings)

Abstract
We present a method for fully automated selection of treatment beam ensembles for external radiation therapy. We reformulate the beam angle selection problem as a clustering problem of locally ideal beam orientations distributed on the unit sphere. For this purpose we construct an infinite mixture of von Mises-Fisher distributions, which is suited in general for density estimation from data on the D-dimensional sphere. Using a nonparametric Dirichlet process prior, our model infers probability distributions over both the number of clusters and their parameter values. We describe an efficient Markov chain Monte Carlo inference algorithm for posterior inference from experimental data in this model. The performance of the suggested beam angle selection framework is illustrated for one intra-cranial, pancreas, and prostate case each. The infinite von Mises-Fisher mixture model (iMFMM) creates between 18 and 32 clusters, depending on the patient anatomy. This suggests to use the iMFMM directly for beam ensemble selection in robotic radio surgery, or to generate low-dimensional input for both subsequent optimization of trajectories for arc therapy and beam ensemble selection for conventional radiation therapy.

ei pn

Web DOI [BibTex]

2010


Web DOI [BibTex]


no image
Coherent Inference on Optimal Play in Game Trees

Hennig, P., Stern, D., Graepel, T.

In JMLR Workshop and Conference Proceedings Volume 9: AISTATS 2010, pages: 326-333, (Editors: Teh, Y.W. , M. Titterington ), JMLR, Cambridge, MA, USA, Thirteenth International Conference on Artificial Intelligence and Statistics, May 2010 (inproceedings)

Abstract
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, they learn on-policy values by propagating information upwards in the tree, but not between sibling nodes. Here, we present a generative model and a corresponding approximate message passing scheme for inference on the optimal, off-policy value of nodes in smooth AND/OR trees, given random roll-outs. The crucial insight is that the distribution of values in game trees is not completely arbitrary. We define a generative model of the on-policy values using a latent score for each state, representing the value under the random roll-out policy. Inference on the values under the optimal policy separates into an inductive, pre-data step and a deductive, post-data part. Both can be solved approximately with Expectation Propagation, allowing off-policy value inference for any node in the (exponentially big) tree in linear time.

ei pn

PDF Web [BibTex]

PDF Web [BibTex]


Graph signature for self-reconfiguration planning of modules with symmetry
Graph signature for self-reconfiguration planning of modules with symmetry

Asadpour, M., Ashtiani, M. H. Z., Spröwitz, A., Ijspeert, A. J.

In Proceedings of the 2009 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages: 5295-5300, IEEE, St. Louis, MO, 2010 (inproceedings)

Abstract
In our previous works we had developed a framework for self-reconfiguration planning based on graph signature and graph edit-distance. The graph signature is a fast isomorphism test between different configurations and the graph edit-distance is a similarity metric. But the algorithm is not suitable for modules with symmetry. In this paper we improve the algorithm in order to deal with symmetric modules. Also, we present a new heuristic function to guide the search strategy by penalizing the solutions with more number of actions. The simulation results show the new algorithm not only deals with symmetric modules successfully but also finds better solutions in a shorter time.

dlg

DOI [BibTex]

DOI [BibTex]


Roombots - Towards decentralized reconfiguration with self-reconfiguring modular robotic metamodules
Roombots - Towards decentralized reconfiguration with self-reconfiguring modular robotic metamodules

Spröwitz, A., Laprade, P., Bonardi, S., Mayer, M., Moeckel, R., Mudry, P., Ijspeert, A. J.

In Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 1126-1132, IEEE, Taipeh, 2010 (inproceedings)

Abstract
This paper presents our work towards a decentralized reconfiguration strategy for self-reconfiguring modular robots, assembling furniture-like structures from Roombots (RB) metamodules. We explore how reconfiguration by loco- motion from a configuration A to a configuration B can be controlled in a distributed fashion. This is done using Roombots metamodules—two Roombots modules connected serially—that use broadcast signals, lookup tables of their movement space, assumptions about their neighborhood, and connections to a structured surface to collectively build desired structures without the need of a centralized planner.

dlg

DOI [BibTex]

DOI [BibTex]


Automatic Gait Generation in Modular Robots: to Oscillate or to Rotate? that is the question
Automatic Gait Generation in Modular Robots: to Oscillate or to Rotate? that is the question

Pouya, S., van den Kieboom, J., Spröwitz, A., Ijspeert, A. J.

In Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pages: 514-520, IEEE, Taipei, 2010 (inproceedings)

Abstract
Modular robots offer the possibility to design robots with a high diversity of shapes and functionalities. This nice feature also brings an important challenge: namely how to design efficient locomotion gaits for arbitrary robot structures with many degrees of freedom. In this paper, we present a framework that allows one to explore and identify highly different gaits for a given arbitrary- shaped modular robot. We use simulated robots made of several Roombots modules that have three rotational joints each. These modules have the interesting feature that they can produce both oscillatory movements (i.e. periodic movements around a rest position) and rotational movements (i.e. with continuously increasing angle), leading to very rich locomotion patterns. Here we ask ourselves which types of movements —purely oscillatory, purely rotational, or a combination of both— lead to the fastest gaits. To address this question we designed a control architecture based on a distributed system of coupled phase oscillators that can produce synchronized rotations and oscillations in many degrees of freedom. We also designed a specific optimization algorithm that can automatically design hybrid controllers, i.e. controllers that use oscillations in some joints and rotations in others, for fast gaits. The proposed framework is verified by multiple simulations for several robot morphologies. The results show that (i) the question whether it is better to oscillate or to rotate depends on the morphology of the robot, and that in general it is best to do both, (ii) the optimization framework can successfully generate hybrid controllers that outperform purely oscillatory and purely rotational ones, and (iii) the resulting gaits are fast, innovative, and would have been hard to design by hand.

dlg

DOI [BibTex]

DOI [BibTex]

2009


Roombots-mechanical design of self-reconfiguring modular robots for adaptive furniture
Roombots-mechanical design of self-reconfiguring modular robots for adaptive furniture

Spröwitz, A., Billard, A., Dillenbourg, P., Ijspeert, A. J.

In Proceedings of the 2009 IEEE International Conference on Robotics and Automation (ICRA), pages: 4259-4264, IEEE, Kobe, 2009 (inproceedings)

Abstract
We aim at merging technologies from information technology, roomware, and robotics in order to design adaptive and intelligent furniture. This paper presents design principles for our modular robots, called Roombots, as future building blocks for furniture that moves and self-reconfigures. The reconfiguration is done using dynamic connection and disconnection of modules and rotations of the degrees of freedom. We are furthermore interested in applying Roombots towards adaptive behaviour, such as online learning of locomotion patterns. To create coordinated and efficient gait patterns, we use a Central Pattern Generator (CPG) approach, which can easily be optimized by any gradient-free optimization algorithm. To provide a hardware framework we present the mechanical design of the Roombots modules and an active connection mechanism based on physical latches. Further we discuss the application of our Roombots modules as pieces of a homogenic or heterogenic mix of building blocks for static structures.

dlg

DOI [BibTex]

2009


DOI [BibTex]

2007


An easy to use bluetooth scatternet protocol for fast data exchange in wireless sensor networks and autonomous robots
An easy to use bluetooth scatternet protocol for fast data exchange in wireless sensor networks and autonomous robots

Mockel, R., Spröwitz, A., Maye, J., Ijspeert, A. J.

In Proceedings of the 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems, pages: 2801-2806, IEEE, San Diego, CA, 2007 (inproceedings)

Abstract
We present a Bluetooth scatternet protocol (SNP) that provides the user with a serial link to all connected members in a transparent wireless Bluetooth network. By using only local decision making we can reduce the overhead of our scatternet protocol dramatically. We show how our SNP software layer simplifies a variety of tasks like the synchronization of central pattern generator controllers for actuators, collecting sensory data and building modular robot structures. The whole Bluetooth software stack including our new scatternet layer is implemented on a single Bluetooth and memory chip. To verify and characterize the SNP we provide data from experiments using real hardware instead of software simulation. This gives a realistic overview of the scatternet performance showing higher order effects that are difficult to be simulated correctly and guaranties the correct function of the SNP in real world applications.

dlg

DOI [BibTex]

2007


DOI [BibTex]