Timed Languages, Dyadic Approximations and Regular Tree Grammars

Hybrid Systems and AI: Modeling Analysis and Control of Discrete Plus Continuous Systems

Volume

Papers from the 1999 AAAI Spring Symposium

Contents

Our research on the modelization of the loop actionperception for an autonomous robot has led us naturally towards a tree-like representation of that interaction: a node is labeled by a perceptive context of the robot, the different branches correspond to the various available actions and the children nodes are then the effect of these different actions on the original context. This tree-like view allows us to state rigorously the problems of viable control in terms of games: the existence of a controller is reduced to the existence of strategies which allow to walk through the trees representing the system in order to remain within a given class of contexts (viability goal). Such game approaches are widely used in computer science (BL69; Mos89; NYY92), and appear in hybrid control theory too (TLS98).