Baillieul, John (Boston Univ.), Grace, Jeremy (Boston Univ.)

The Fastest Random Search of a Class of Building Interiors

Scheduled for presentation during the Mini-Symposium "Control and estimation of multiagent systems" (ThP11), Thursday, July 27, 2006, 15:45−16:10, Room 104a

17th International Symposium on Mathematical Theory of Networks and Systems, July 24-28, 2006, Kyoto, Japan

This information is tentative and subject to change. Compiled on May 19, 2024

Abstract

A simple abstraction in which a building interior is represented as a connected graph is presented. Search and surveillance algorithms may then be described as dynamical systems on these graphs. It is shown how purely local, decentralized rules for random movement will lead to a random walk in which there is a prescribed likelihood of visitation to each part of the graph. It is shown how uniform coverage can be achieved most rapidly and how the parallelism afforded by multiple agents can be most effectively utilized.