On Multiagent Exploration

This paper describes a technique for multi-agent exploration of an unknown environment, that improves the quality of the map by reducing the inaccuracies that occur over time from dead reckoning errors. We present an algorithmic solution, simulation results, as well as a cost analysis and experimental data. The approach is based on using a pair of robots that observe one another’s behaviour, thus greatly reducing odometry errors. We assume the robots can both directly sense nearby obstacles and see one another. We have implemented both these capabilities with actual robots in our lab. By exploiting the ability of the robots to see one another, we can detect opaque obstacles in the environment independent of their surface reflectance properties. 1

[1]  S. Sitharama Iyengar,et al.  Robot navigation in unknown terrains using learned visibility graphs. Part I: The disjoint convex obstacle case , 1987, IEEE Journal on Robotics and Automation.

[2]  Margrit Betke,et al.  Mobile robot localization using landmarks , 1997, IEEE Trans. Robotics Autom..

[3]  V. Chvátal A combinatorial theorem in plane geometry , 1975 .

[4]  Vladimir J. Lumelsky,et al.  Dynamic path planning in sensor-based terrain acquisition , 1990, IEEE Trans. Robotics Autom..

[5]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[6]  Michael Jenkin,et al.  Robotic exploration as graph construction , 1991, IEEE Trans. Robotics Autom..

[7]  P. Freedman,et al.  Environment Exploration Using “ Just-inTime ” Sensor Fusion , 1996 .

[8]  Michael R. M. Jenkin,et al.  Experiments in sensing and communication for robot convoy navigation , 1995, Proceedings 1995 IEEE/RSJ International Conference on Intelligent Robots and Systems. Human Robot Interaction and Cooperative Robots.

[9]  Robin R. Murphy,et al.  Sensor fusion , 1998 .

[10]  Tucker R. Balch,et al.  Communication in reactive multiagent robotic systems , 1995, Auton. Robots.

[11]  Gregory Dudek,et al.  Just-in-time sensing: efficiently combining sonar and laser range data for exploring unknown worlds , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[12]  Jun Ota,et al.  Mobile Robot Navigation Using Artificial Landmarks. , 2000 .

[13]  Steve Fisk,et al.  A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.

[14]  Jun Tani,et al.  Model-based learning for mobile robot navigation from the dynamical systems perspective , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[15]  T. Shermer Recent Results in Art Galleries , 1992 .

[16]  Godfried T. Toussaint,et al.  On Approximating Polygonal Curves in Two and Three Dimensions , 1994, CVGIP Graph. Model. Image Process..

[17]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[18]  Kokichi Sugihara,et al.  Some location problems for robot navigation using a single camera , 1988, Computer Vision Graphics and Image Processing.

[19]  Gregory Dudek,et al.  Multi-Robot Exploration of an Unknown Environment, Efficiently Reducing the Odometry Error , 1997, IJCAI.