Constraints on locational optimization problems

S. Salapaka, A. Khalak, M. A. Dahleh

Research output: Contribution to journalConference articlepeer-review


This paper discusses a clustering approach to locational optimization in the context of UAV mission planning. In particular, the Deterministic Annealing (DA) algorithm from the data compression literature is adapted to address such problems, which bears a strong analogy to the statistical physics formulation of the annealing process (i.e. material transformation under a decreasing temperature schedule). The mission planning domain motivates several extensions to DA to handle the case of heterogeneous UAVs, multiple resource types, and fungible and non-fungible resource types. These extensions introduce constraints on the basic optimization problem. Algorithmically, these are addressed by modifications to the free energy of the DA algorithm. An analysis of the algorithm shows that the iterations at a given temperature are of the form of a Decent Method, which motivates scaling principles which tend to accelerate convergence. Finally, an application of the algorithm to the UAV prepositioning problem is discussed.

Original languageEnglish (US)
Pages (from-to)1741-1746
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
StatePublished - 2003
Externally publishedYes
Event42nd IEEE Conference on Decision and Control - Maui, HI, United States
Duration: Dec 9 2003Dec 12 2003

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization


Dive into the research topics of 'Constraints on locational optimization problems'. Together they form a unique fingerprint.

Cite this