Art gallery theorems and algorithms
Art gallery theorems and algorithms
The power of a pebble: exploring and mapping directed graphs
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
A frontier-based approach for autonomous exploration
CIRA '97 Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation
Complexity Analysis of Real-Time Reinforcement Learning Applied to Finding Shortest Paths in Deterministic Domains
Easy and hard testbeds for real-time search algorithms
AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 1
Robomote: enabling mobility in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
AMIRoLoS an active marker internet-based robot localization system
Robotics and Autonomous Systems
Profile-matching techniques for on-demand software management in sensor networks
EURASIP Journal on Wireless Communications and Networking
Coverage and latency aware actor placement mechanisms in WSANs
International Journal of Sensor Networks
Maximizing connected coverage via controlled actor relocation in wireless sensor and actor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the lifetime of wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Robot Navigation in a Networked Swarm
ICIRA '08 Proceedings of the First International Conference on Intelligent Robotics and Applications: Part I
Clustering of wireless sensor and actor networks based on sensor distribution and connectivity
Journal of Parallel and Distributed Computing
Rapid exploration of unknown areas through dynamic deployment of mobile and stationary sensor nodes
Autonomous Agents and Multi-Agent Systems
An obstacle-free and power-efficient deployment algorithm for wireless sensor networks
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Dual-swarm features and its challenges for system of sensor networks and mobile multi-robots
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Towards cooperation of heterogeneous, autonomous robots: A case study of humanoid and wheeled robots
Robotics and Autonomous Systems
A dead-end free deployment algorithm for wireless sensor networks with obstacles
Proceedings of the 6th International Wireless Communications and Mobile Computing Conference
Cooperative self-organization in a heterogeneous swarm robotic system
Proceedings of the 12th annual conference on Genetic and evolutionary computation
A practical robot coverage algorithm for unknown environments
MICAI'10 Proceedings of the 9th Mexican international conference on Advances in artificial intelligence: Part I
Journal of Intelligent and Robotic Systems
Reducing communication detection and eavesdropping using mobile agent relay networks
Proceedings of the Winter Simulation Conference
Hi-index | 0.00 |
We consider the problem of coverage and exploration of an unknown dynamic environment using a mobile robot(s). The environment is assumed to be large enough such that constant motion by the robot(s) is needed to cover the environment. We present an efficient minimalist algorithm which assumes that global information is not available (neither a map, nor GPS). Our algorithm deploys a network of radio beacons which assists the robot(s) in coverage. This network is also used for navigation. The deployed network can also be used for applications other than coverage. Simulation experiments are presented which show the collaboration between the deployed network and mobile robot(s) for the tasks of coverage/exploration, network deployment and maintenance (repair), and mobile robot(s) recovery (homing behavior). We present a theoretical basis for our algorithm on graphs and show the results of the simulated scenario experiments.