The coalition structure core is accessible.

We prove the existence of an upper bound for the number of blockings required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blockings. Primitive recursive algorithms are provided to locate accessibility paths.Structure;

The minimal dominant set is a non-empty core-extension.

A set of outcomes for a TU-game in characteristic function form is dominant if it is, with respect to an outsider-independent dominance relation, accessible (or admissible)and closed. This outsider-independent dominance relation is restrictive in the sense that a deviating coalition cannot determine the payoffs of those coalitions that are not involved in the deviation. The minimal (for inclusion) dominant set is non-empty and for a game with a non-empty coalition structure core, the minimal dominant set returns this core.

The coalition structure core is accessible

We prove the existence of an upper bound for the number of blockings required to get from one imputation to another provided that accessibility holds. The bound depends only on the number of players in the TU game considered. For the class of games with non-empty cores this means that the core can be reached via a bounded sequence of blockings. Primitive recursive algorithms are provided to locate accessibility paths.status: publishe

The minimal dominant set is a non-empty core-extension

A set of outcomes for a TU-game in characteristic function form is dominant if it is, with respect to an outsider-independent dominance relation, accessible (or admissible)and closed. This outsider-independent dominance relation is restrictive in the sense that a deviating coalition cannot determine the payoffs of those coalitions that are not involved in the deviation. The minimal (for inclusion) dominant set is non-empty and for a game with a non-empty coalition structure core, the minimal dominant set returns this core.status: publishe

A hybrid autonomous robot navigation method based on artificial intelligence and soft computing techniques

The main problem to be solved for autonomous indoor robots is that the environment where they have to move safety is only partially known and possibly dynamically changing. In this paper a hybrid navigation method is proposed, using two techniques that deal with a priori information and sensory data separately, thus blending the intelligence and optimality of global navigation methods with the reactivity and low complexity of local ones. The first, global navigation module, based on a priori information, chooses intermediary goals for the local navigation module, for which the so called A* algorithm is used. The second part, carrying out the (local) navigation relying on sensory data, applies a fuzzy-neural representation of an improved potential field based guiding navigation tool. Vision based obstacle detection is implemented by difference detection based on a combination of RGB and HSV representations of the pixels. Copyright (C) 2003 IFAC.Int Federat Automat Control, IEEE, Int Fuzzy Syst Assoc, Neural Networks So