Communication models for a cooperative network of autonomous agents

Ashwin Arulselvan, Clayton W. Commander, Michael J. Hirsch, Panos M. Pardalos

Research output: Chapter in Book/Report/Conference proceedingChapter


We consider the problem of maximizing the total connectivity for a set of wireless agents in a mobile ad hoc network. That is, given a set of wireless units each having a start point and a destination point, our goal is to determine a set of routes for the units which maximizes the overall connection time between them. Known as the cooperative communication problem in mobile ad hoc networks (ccpm), this problem has several military applications including coordination of rescue groups, path planning for unmanned air vehicles, and geographical exploration and target recognition. The CCPM is NP-hard; therefore heuristic development has been the major focus of research. In this work, we survey the CCPM examining first some early combinatorial formulations and solution techniques. Then we introduce new continuous formulations and compare the results of several case studies. By removing the underlying graph structure, we are able to create a more realistic model of the problem as supported by the numerical evidence.
Original languageEnglish
Title of host publicationComputational Optimization and Logistics Challenges in the Enterprise
EditorsArt Chaovalitwongse, Kevin Furman, Panos Pardalos
Place of PublicationBoston, MA
Number of pages20
ISBN (Print)9780387886169
Publication statusPublished - 25 May 2009

Publication series

NameSpringer Optimization and Its Applications (SOIA)


  • communication models
  • wireless agents
  • local search
  • path planning
  • mixed integer linear program
  • greedy randomize adaptive search procedure


Dive into the research topics of 'Communication models for a cooperative network of autonomous agents'. Together they form a unique fingerprint.

Cite this