Allerton 2015 Paper Abstract

Close

Paper ThA1.1

Castanon, David (Boston University), Ding, Huanyu (Boston University)

Optimal Solutions for Multi-Agent Adaptive Coordinated Search

Scheduled for presentation during the Invited Session "Distributed Decision Making" (ThA1), Thursday, October 1, 2015, 08:30−08:50, Library

53rd Annual Allerton Conference on Communication, Control, and Computing, Sept 29-Oct 2, 2015, Allerton Park and Retreat Center, Monticello, IL, USA

This information is tentative and subject to change. Compiled on November 19, 2019

Keywords Stochastic Systems and Control, Multi-Agent Systems and Robot Control, Information Theory

Abstract

The problem of searching for an unknown object occurs in important applications, ranging from security, medicine and defense. Modern sensors have significant processing capabilities that allow for in situ processing and exploitation of the information to select what additional information to collect. In this paper, we discuss a class of dynamic, adaptive search problems involving multiple sensors sensing for a single stationary object, and formulate them as stochastic control problems with imperfect information. The objective of these problems is related to information entropy. This allows for a complete characterization of the optimal strategies and the optimal cost for the resulting finite-horizon stochastic control problems. We show that the computation of optimal policies can be reduced to solving a finite number of strictly concave maximization problems. We further show that the solution can be decoupled into a finite number of scalar concave maximization problems. We illustrate our results with experiments using multiple sensors searching for a single object.

 

 

All Content © PaperCept, Inc..


This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-11-19  13:12:13 PST  Terms of use