By Topic

Sensing Locations Positioning for Multi-robot Inspection Planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Faigl, J. ; Dept. of Cybern., Czech Tech. Univ. in Prague ; Kulich, M.

Problems of cooperative multi-robot inspection and exploration play an important role in many practical applications. This paper presents an algorithm for inspection planning based on decomposition of the problem into two subproblems - art gallery problem (AGP) that finds guards (sensing locations) and multiple traveling salesmen problem (MTSP) that connects the found guards by routes. While standard approaches for art gallery problem try to minimize a number of guards, the proposed method is designed to optimise lengths found by a MTSP solver and therefore to minimise time needed by a team of robots to inspect the working environment. The proposed algorithm has been implemented and tested. Influence of the method to quality of the inspection planning solution and comparison with the randomized dual sampling schema are discussed

Published in:

Distributed Intelligent Systems: Collective Intelligence and Its Applications, 2006. DIS 2006. IEEE Workshop on

Date of Conference:

15-16 June 2006