Paper Info
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 inter-resource interaction levels.
Year
DOI
Venue
2008
10.1109/ACC.2008.4586665
Seattle, WA
Keywords
DocType
ISSN
combinatorial mathematics,distributed algorithms,maximum entropy methods,optimisation,resource allocation,statistical analysis,combinatorial optimization problem,combinatorial resource allocation problem,control problem,distributed algorithm,free energy function,instantaneous coverage problem,maximum entropy principle based algorithm,mobile sites-resources problem,statistical physics,time horizon,motion control,entropy,maximum entropy principle,free energy,resource management,algorithm design and analysis,distributed computing,physics
Conference
0743-1619 E-ISBN : 978-1-4244-2079-7
ISBN
Citations 
PageRank 
978-1-4244-2079-7
3
0.41
References 
Authors
7
3
Name
Order
Citations
PageRank
Puneet Sharma127138.61
Salapaka, S.230.41
Carolyn L. Beck340160.19