Cooperative terrain model acquisition by a team of two or three point-robots
- Oak Ridge National Lab., TN (United States)
- DePauw Univ., Greencastle (India)
We address the model acquisition problem for an unknown planar terrain by a team of two or three robots. The terrain is cluttered by a finite number of polygonal obstacles whose shapes and positions are unknown. The robots are point-sized and equipped with visual sensors which acquire all visible parts of the terrain by scan operations executed from their locations. The robots communicate with each other via wireless connection. The performance is measured by the number of the sensor (scan) operations which are assumed to be the most time-consuming of all the robot operations. We employ the restricted visibility graph methods in a hierarchical setup. For terrains with convex obstacles and for teams of n(= 2, 3) robots, we prove that the sensing time is reduced by a factor of 1/n. For terrains with concave corners, the performance of the algorithm depends on the number of concave regions and their depths. A hierarchical decomposition of the restricted visibility graph into n-connected and (n - 1)-or-less connected components is considered. The performance for the n(= 2, 3) robot team is expressed in terms of the sizes of n-connected components, and the sizes and diameters of (n - 1)-or-less connected components.
- Research Organization:
- Oak Ridge National Lab., TN (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- AC05-84OR21400
- OSTI ID:
- 219466
- Report Number(s):
- CONF-960448--15; ON: DE96008791
- Country of Publication:
- United States
- Language:
- English
Similar Records
On autonomous terrain model acquisition by a mobile robot
On terrain acquisition by a finite-sized mobile robot in plane