Learning metric-topological maps for indoor mobile robot navigation
Artificial Intelligence
Artificial intelligence: a new synthesis
Artificial intelligence: a new synthesis
Frontier-based exploration using multiple robots
AGENTS '98 Proceedings of the second international conference on Autonomous agents
Control Systems with Actuator Saturation: Analysis and Design
Control Systems with Actuator Saturation: Analysis and Design
Coordination for Multi-Robot Exploration and Mapping
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Genetic Algorithms for Adaptive Motion Planning of an Autonomous Mobile Robot
CIRA '97 Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation
Sensor-based coverage with extended range detectors
IEEE Transactions on Robotics
Technical Communique: Null controllable region of LTI discrete-time systems with input saturation
Automatica (Journal of IFAC)
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 0.00 |
Target detecting and dynamic coverage are fundamental tasks in mobile robotics and represent two important features of mobile robots: mobility and perceptivity. This paper establishes the constrained motion model and sensor model of a mobile robot to represent these two features and defines the k-step reachable region to describe the states that the robot may reach. We show that the calculation of the k-step reachable region can be reduced from that of 2k reachable regions with the fixed motion styles to k + 1 such regions and provide an algorithm for its calculation. Based on the constrained motion model and the k-step reachable region, the problems associated with target detecting and dynamic coverage are formulated and solved. For target detecting, the k-step detectable region is used to describe the area that the robot may detect, and an algorithm for detecting a target and planning the optimal path is proposed. For dynamic coverage, the k-step detected region is used to represent the area that the robot has detected during its motion, and the dynamic-coverage strategy and algorithm are proposed. Simulation results demonstrate the efficiency of the coverage algorithm in both convex and concave environments.