Exactly learning automata with small cover time
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Malicious Omissions and Errors in Answers to Membership Queries
Machine Learning
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Application of ε -testers algorithms under sketch calculation model in robot navigation problem
ICS'09 Proceedings of the 13th WSEAS international conference on Systems
Utility-based on-line exploration for repeated navigation in an embedded graph
Artificial Intelligence
Application of Ɛ-testers algorithms under sketch and streaming calculation model in robot navigation
WSEAS Transactions on Computers
Factoring the Mapping Problem: Mobile Robot Map-building in the Hybrid Spatial Semantic Hierarchy
International Journal of Robotics Research
Modeling a student's behavior in a tutorial-like system using learning automata
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Learning robust plans for mobile robots from a single trial
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Probabilistic exploration in planning while learning
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Discretized bayesian pursuit --- a new scheme for reinforcement learning
IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Hi-index | 0.01 |
It is often useful for a robot to construct a spatial representation of its environment from experiments and observations, in other words, to learn a map of its environment by exploration. In addition, robots, like people, make occasional errors in perceiving the spatial features of their environments. We formulate map learning as the problem of inferring from noisy observations the structure of a reduced deterministic finite automaton. We assume that the automaton to be learned has a distinguishing sequence. Observation noise is modeled by treating the observed output at each state as a random variable, where each visit to the state is an independent trial and the correct output is observed with probability exceeding 1/2. We assume no errors in the state transition function.Using this framework, we provide an exploration algorithm to learn the correct structure of such an automaton with probability 1 − δ, given as inputs δ, an upper bound m on the number of states, a distinguishing sequence s, and a lower bound α 1/2 on the probability of observing the correct output at any state. The running time and the number of basic actions executed by the learning algorithm are bounded by a polynomial in δ−l, m, |s|, and (1/2-α)−1.We discuss the assumption that a distinguishing sequence is given, and present a method of using a weaker assumption. We also present and discuss simulation results for the algorithm learning several automata derived from office environments.