Home /Research /A Generalized Framework for Solving Tightly-coupled Multirobot Planning Problems
OTHER

A Generalized Framework for Solving Tightly-coupled Multirobot Planning Problems

Nidhi Kalra, Dave Ferguson, Anthony Stentz

Year
2007
Citations
21

Abstract

In this paper, we present the generalized version of the Hoplites coordination framework designed to efficiently solve complex, tightly-coupled multirobot planning problems. Our extensions greatly increase the flexibility with which teammates can both plan and coordinate with each other; consequently, we can apply Hoplites to a wider range of domains and plan coordination between robots more efficiently. We apply our framework to the constrained exploration domain and compare Hoplites in simulation to competing distributed and centralized approaches. Our results demonstrate that Hoplites significantly outperforms both approaches in terms of the quality of solutions produced while remaining computationally competitive with much simpler approaches. We further demonstrate features such as scalability and validate our approach with field results from a team of large autonomous vehicles performing constrained exploration in an outdoor environment

Keywords

ScalabilityComputer scienceFlexibility (engineering)Plan (archaeology)Domain (mathematical analysis)Distributed computingRange (aeronautics)Field (mathematics)RobotArtificial intelligence

Related papers

Browse all OTHER papers