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

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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 languageEnglish (US)
Title of host publication2008 American Control Conference, ACC
Number of pages6
StatePublished - Sep 30 2008
Event2008 American Control Conference, ACC - Seattle, WA, United States
Duration: Jun 11 2008Jun 13 2008

Publication series

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


Other2008 American Control Conference, ACC
Country/TerritoryUnited States
CitySeattle, WA

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Entropy based algorithm for combinatorial optimization problems with mobile sites and resources'. Together they form a unique fingerprint.

Cite this