@inbook{d398bc570c354b92b75d4da32a550e25,
title = "Communication models for a cooperative network of autonomous agents",
abstract = "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.",
keywords = "communication models, wireless agents, local search, path planning, mixed integer linear program, greedy randomize adaptive search procedure",
author = "Ashwin Arulselvan and Commander, {Clayton W.} and Hirsch, {Michael J.} and Pardalos, {Panos M.}",
year = "2009",
month = may,
day = "25",
doi = "10.1007/978-0-387-88617-6_15",
language = "English",
isbn = "9780387886169",
volume = "30",
series = "Springer Optimization and Its Applications (SOIA)",
publisher = "Springer",
pages = "411--431",
editor = "Art Chaovalitwongse and Kevin Furman and Panos Pardalos",
booktitle = "Computational Optimization and Logistics Challenges in the Enterprise",
}