ICRA 2011 Paper Abstract


Paper TuA112.4

Zhang, Yu (Tony) (University of Tennessee), Parker, Lynne (University of Tennessee)

Solution Space Reasoning to Improve IQ-ASyMTRe in Tightly-Coupled Multirobot Tasks

Scheduled for presentation during the Regular Sessions "Distributed Robot Systems I" (TuA112), Tuesday, May 10, 2011, 09:05−09:20, Room 5H

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on March 30, 2020

Keywords Distributed Robot Systems


In our prior work, we proposed the IQ-ASyMTRe architecture as a general method to combine coalition formation and execution for tightly-coupled multirobot tasks. IQ-ASyMTRe extends the ASyMTRe architecture by introducing several new mechanisms to provide more flexibility for coalition formation as well as to facilitate coalition execution. On the other hand, these mechanisms also change the process of reasoning about solutions and further increase the complexity of the solution space. In this paper, we provide improvements for utilizing the IQ-ASyMTRe architecture based on reasoning about the solution space. We introduce a method in which the exponential growth of the number of potential solutions to be searched can be avoided; instead, the search space is only of linear size for certain tasks. Unnecessary potential solutions are removed to further increase online efficiency. Moreover, the relationships between the created solution space and the complete solution space are studied, and are utilized to provide more coverage of the complete solution space for arbitrary tasks. Although these improvements are discussed with respect to IQ-ASyMTRe, they are also applicable to architectures that approach the generality that IQ-ASyMTRe achieves. Robot simulation and experimental results are provided to demonstrate that the generation and searching of the solution space can be done online (which was impractical previously even for tasks with relatively modest complexities) for certain



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-03-30  00:46:24 PST  Terms of use