Adaptive Deployment of Mobile Robotic Networks

被引:33
作者
Le Ny, Jerome [1 ]
Pappas, George J. [2 ]
机构
[1] Ecole Polytech, Dept Elect Engn, Montreal, PQ H3T 1J4, Canada
[2] Univ Penn, Dept Elect & Syst Engn, Philadelphia, PA 19104 USA
关键词
Adaptive algorithms; coverage control problems; dynamic vehicle routing problems; partitioning algorithms; potential field based motion planning; stochastic gradient descent algorithms;
D O I
10.1109/TAC.2012.2215512
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper considers deployment problems where a mobile robotic network must optimize its configuration in a distributed way in order to minimize a steady-state cost function that depends on the spatial distribution of certain probabilistic events of interest. Moreover, it is assumed that the event location distribution is a priori unknown, and can only be progressively inferred from the observation of the actual event occurrences. Three classes of problems are discussed in detail: coverage control problems, spatial partitioning problems, and dynamic vehicle routing problems. In each case, distributed stochastic gradient algorithms optimizing the performance objective are presented. The stochastic gradient view simplifies and generalizes previously proposed solutions, and is applicable to new complex scenarios, such as adaptive coverage involving heterogeneous agents. Remarkably, these algorithms often take the form of simple distributed rules that could be implemented on resource-limited platforms.
引用
收藏
页码:654 / 666
页数:13
相关论文
共 50 条
  • [1] [Anonymous], GEN VORONOI PARTITIO
  • [2] [Anonymous], 2007, THESIS U CALIFORNIA
  • [3] [Anonymous], 2000, Spatial tessellations: concepts and applications of Voronoi diagrams
  • [4] [Anonymous], DISTRIBUTED CONTROL
  • [5] [Anonymous], ADAPTIVE ROBOT DEPLO
  • [6] [Anonymous], P C DEC CONTR SEV SP
  • [7] [Anonymous], 1998, PROB APPL S, DOI 10.1007/b98894
  • [8] [Anonymous], THESIS MIT CAMBRIDGE
  • [9] [Anonymous], P 6 INT S DARS FUK J
  • [10] [Anonymous], 1995, FACILITY LOCATION SU