Given a graph G, we intend to partition its nodes into two sets of equal size so as to minimize the sum of the cost of the edges having end-points in different sets. This problem, called the uniform Graph Partitioning Problem (GPP), is known to be NP-Complete. In this paper we propose the first reported learning-automaton based solution to the problem. We compare this new solution to various re...

Our aim is to enable natural and intuitive spoken dialogue between users and the Bremen robotic wheelchair "Rolland" (Röfer & Lankenau 1998), in order to instruct the robot to move to other places autonomously. The purpose of our interdisciplinary work is to develop specific functionalities matching potential users’ intuitive expectations. Our current focus is on a detailed qualitative analysis...

he Bremen Autonomous Wheelchair project covers a variety of research issues that include spatial cognition, safe systems, and mobility assistance for the handicapped. Emphasizing one or the other of these cornerstones provides various views of the wheelchair Rolland (Fig. 1). Within the framework of the priority program " Spatial Cognition " of the Deutsche Forschungsgemeinschaft, the main topi...