Handle URI:
http://hdl.handle.net/10754/599518
Title:
Roadmap-Based Level Clearing of Buildings
Authors:
Rodriguez, Samuel; Amato, Nancy M.
Abstract:
In 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.
Citation:
Rodriguez 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.
Publisher:
Springer Science + Business Media
Journal:
Lecture Notes in Computer Science
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
2011
DOI:
10.1007/978-3-642-25090-3_29
Type:
Book Chapter
ISSN:
0302-9743; 1611-3349
Sponsors:
This 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).
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorRodriguez, Samuelen
dc.contributor.authorAmato, Nancy M.en
dc.date.accessioned2016-02-28T05:52:37Zen
dc.date.available2016-02-28T05:52:37Zen
dc.date.issued2011en
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.en
dc.identifier.issn0302-9743en
dc.identifier.issn1611-3349en
dc.identifier.doi10.1007/978-3-642-25090-3_29en
dc.identifier.urihttp://hdl.handle.net/10754/599518en
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.en
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).en
dc.publisherSpringer Science + Business Mediaen
dc.titleRoadmap-Based Level Clearing of Buildingsen
dc.typeBook Chapteren
dc.identifier.journalLecture Notes in Computer Scienceen
dc.contributor.institutionTexas A and M University, College Station, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.