Show simple item record

dc.contributor.authorRodriguez, Samuel
dc.contributor.authorAmato, Nancy M.
dc.date.accessioned2016-02-28T05:52:37Z
dc.date.available2016-02-28T05:52:37Z
dc.date.issued2011
dc.identifier.citationRodriguez S, Amato NM (2011) Roadmap-Based Level Clearing of Buildings. Lecture Notes in Computer Science: 340–352. Available: http://dx.doi.org/10.1007/978-3-642-25090-3_29.
dc.identifier.issn0302-9743
dc.identifier.issn1611-3349
dc.identifier.doi10.1007/978-3-642-25090-3_29
dc.identifier.urihttp://hdl.handle.net/10754/599518
dc.description.abstractIn this paper we describe a roadmap-based approach for a multi-agent search strategy to clear a building or multi-story environment. This approach utilizes an encoding of the environment in the form of a graph (roadmap) that is used to encode feasible paths through the environment. The roadmap is partitioned into regions, e.g., one per level, and we design region-based search strategies to cover and clear the environment. We can provide certain guarantees within this roadmap-based framework on coverage and the number of agents needed. Our approach can handle complex and realistic environments where many approaches are restricted to simple 2D environments. © 2011 Springer-Verlag.
dc.description.sponsorshipThis research supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266 by THECB NHARP award 000512-0097-2009, byChevron, IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by KingAbdullah University of Science and Technology (KAUST).
dc.publisherSpringer Nature
dc.titleRoadmap-Based Level Clearing of Buildings
dc.typeBook Chapter
dc.identifier.journalLecture Notes in Computer Science
dc.contributor.institutionTexas A and M University, College Station, United States
kaust.grant.numberKUS-C1-016-04


This item appears in the following Collection(s)

Show simple item record