Navigating in unfamiliar geometric terrain
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Theoretical Computer Science
How to learn an unknown environment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Efficient learning of typical finite automata from random walks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Piecemeal learning of an unknown environment
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Information and Computation
Diversity-based inference of finite automata
Journal of the ACM (JACM)
Inference of finite automata using homing sequences
Information and Computation
Piecemeal graph exploration by a mobile robot (extended abstract)
COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Robot navigation with range queries
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Exactly Learning Automata of Small Cover Time
Machine Learning - Special issue on the eighth annual conference on computational learning theory, (COLT '95)
Exploring unknown environments
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Randomized robot navigation algorithms
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A competitive strategy for learning a polygon
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Exploring unknown undirected graphs
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Efficient algorithms for learning to play repeated games against computationally bounded adversaries
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
PHA*: performing A* in unknown physical environments
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Tree exploration with little memory
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
The power of a pebble: exploring and mapping directed graphs
Information and Computation
Optimal Graph Exploration without Good Maps
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Improved approximation algorithms for the freeze-tag problem
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Can we elect if we cannot compare?
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Tree exploration with little memory
Journal of Algorithms
Optimal graph exploration without good maps
Theoretical Computer Science
Utility-based multi-agent system for performing repeated navigation tasks
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Multi-agent Physical A* with Large Pheromones
Autonomous Agents and Multi-Agent Systems
Distributed navigation in an unknown physical environment
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Efficient pebbling for list traversal synopses with application to program rollback
Theoretical Computer Science
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Map construction of unknown graphs by multiple agents
Theoretical Computer Science
International Journal of Robotics Research
Theoretical Computer Science
Distributed chasing of network intruders
Theoretical Computer Science
Robust and Efficient Covering of Unknown Continuous Domains with Simple, Ant-Like A(ge)nts
International Journal of Robotics Research
On the Power of Local Orientations
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
PHA*: finding the shortest path with A* in an unknown physical environment
Journal of Artificial Intelligence Research
Multi-robot tree and graph exploration
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Remembering without memory: Tree exploration by asynchronous oblivious robots
Theoretical Computer Science
Efficient pebbling for list traversal synopses
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fault-tolerant simulation of message-passing algorithms by mobile agents
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Coverage, exploration, and deployment by a mobile robot and communication network
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Computing without communicating: ring exploration by asynchronous oblivious robots
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Rendezvous of mobile agents in directed graphs
DISC'10 Proceedings of the 24th international conference on Distributed computing
Optimal map construction of an unknown torus
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Pure topological mapping in mobile robotics
IEEE Transactions on Robotics
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
How many oblivious robots can explore a line
Information Processing Letters
Distributed security algorithms by mobile agents
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Real-Time search algorithms for exploration and mapping
KES'06 Proceedings of the 10th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part I
Power-Aware collective tree exploration
ARCS'06 Proceedings of the 19th international conference on Architecture of Computing Systems
Covering a continuous domain by distributed, limited robots
ANTS'06 Proceedings of the 5th international conference on Ant Colony Optimization and Swarm Intelligence
Exploring an unknown environment with an intelligent virtual agent
AIMSA'06 Proceedings of the 12th international conference on Artificial Intelligence: methodology, Systems, and Applications
Smart robot teams exploring sparse trees
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Distributed exploration of an unknown graph
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Effective elections for anonymous mobile agents
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Black hole search in directed graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Deterministic network exploration by anonymous silent agents with local traffic reports
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Collecting information by power-aware mobile agents
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
| Hi-index | 0.01 |