Entropy based algorithm for combinatorial optimization problems with mobile sites and resources

Puneet Sharma; Srinivasa Salapaka; Carolyn Beck

doi:10.1109/ACC.2008.4586665

Entropy based algorithm for combinatorial optimization problems with mobile sites and resources

Puneet Sharma, Srinivasa Salapaka, Carolyn Beck

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

In this paper, we propose an algorithm for solving combinatorial resource allocation problems with mobile sites and resources.We consider the instantaneous coverage problem, which is formulated in a Maximum Entropy Principle (MEP) framework, and identify a metric for optimal coverage between mobile sites and resources. This metric, referred to as the Free Energy has been motivated by principles of statistical physics. The determination of resource locations and velocities is cast as a control problem to ensure that the time derivative of Free Energy function is always non-increasing. This guarantees coverage through the time horizon. The issues of scalability and localization are also addressed by taking into account interresource interaction levels.

Original language	English (US)
Title of host publication	2008 American Control Conference, ACC
Pages	1255-1260
Number of pages	6
DOIs	https://doi.org/10.1109/ACC.2008.4586665
State	Published - 2008
Event	2008 American Control Conference, ACC - Seattle, WA, United States Duration: Jun 11 2008 → Jun 13 2008

Publication series

Name	Proceedings of the American Control Conference
ISSN (Print)	0743-1619

Other

Other	2008 American Control Conference, ACC
Country/Territory	United States
City	Seattle, WA
Period	6/11/08 → 6/13/08

ASJC Scopus subject areas

Electrical and Electronic Engineering

Online availability

10.1109/ACC.2008.4586665

Library availability

Discover UIUC Full Text

Cite this

@inproceedings{f76732fc1e4b48e885acb122fc2024f7,

title = "Entropy based algorithm for combinatorial optimization problems with mobile sites and resources",

abstract = "In this paper, we propose an algorithm for solving combinatorial resource allocation problems with mobile sites and resources.We consider the instantaneous coverage problem, which is formulated in a Maximum Entropy Principle (MEP) framework, and identify a metric for optimal coverage between mobile sites and resources. This metric, referred to as the Free Energy has been motivated by principles of statistical physics. The determination of resource locations and velocities is cast as a control problem to ensure that the time derivative of Free Energy function is always non-increasing. This guarantees coverage through the time horizon. The issues of scalability and localization are also addressed by taking into account interresource interaction levels.",

author = "Puneet Sharma and Srinivasa Salapaka and Carolyn Beck",

year = "2008",

doi = "10.1109/ACC.2008.4586665",

language = "English (US)",

isbn = "9781424420797",

series = "Proceedings of the American Control Conference",

pages = "1255--1260",

booktitle = "2008 American Control Conference, ACC",

note = "2008 American Control Conference, ACC ; Conference date: 11-06-2008 Through 13-06-2008",

}

TY - GEN

T1 - Entropy based algorithm for combinatorial optimization problems with mobile sites and resources

AU - Sharma, Puneet

AU - Salapaka, Srinivasa

AU - Beck, Carolyn

PY - 2008

Y1 - 2008

N2 - In this paper, we propose an algorithm for solving combinatorial resource allocation problems with mobile sites and resources.We consider the instantaneous coverage problem, which is formulated in a Maximum Entropy Principle (MEP) framework, and identify a metric for optimal coverage between mobile sites and resources. This metric, referred to as the Free Energy has been motivated by principles of statistical physics. The determination of resource locations and velocities is cast as a control problem to ensure that the time derivative of Free Energy function is always non-increasing. This guarantees coverage through the time horizon. The issues of scalability and localization are also addressed by taking into account interresource interaction levels.

AB - In this paper, we propose an algorithm for solving combinatorial resource allocation problems with mobile sites and resources.We consider the instantaneous coverage problem, which is formulated in a Maximum Entropy Principle (MEP) framework, and identify a metric for optimal coverage between mobile sites and resources. This metric, referred to as the Free Energy has been motivated by principles of statistical physics. The determination of resource locations and velocities is cast as a control problem to ensure that the time derivative of Free Energy function is always non-increasing. This guarantees coverage through the time horizon. The issues of scalability and localization are also addressed by taking into account interresource interaction levels.

UR - http://www.scopus.com/inward/record.url?scp=52449097835&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52449097835&partnerID=8YFLogxK

U2 - 10.1109/ACC.2008.4586665

DO - 10.1109/ACC.2008.4586665

M3 - Conference contribution

AN - SCOPUS:52449097835

SN - 9781424420797

T3 - Proceedings of the American Control Conference

SP - 1255

EP - 1260

BT - 2008 American Control Conference, ACC

T2 - 2008 American Control Conference, ACC

Y2 - 11 June 2008 through 13 June 2008

ER -

Entropy based algorithm for combinatorial optimization problems with mobile sites and resources

Abstract

Publication series

Other

ASJC Scopus subject areas

Online availability

Library availability

Related links

Fingerprint

Cite this