Coverage control for mobile sensing networks

Distributed coverage games for mobile visual sensor networks

Motivated by current challenges in data-intensive sensor networks, we formulate a coverage optimization problem for mobile visual sensors as a (constrained) repeated multi-player game. Each visual sensor tries to optimize its own coverage while minimizing the processing cost. We present two distributed learning algorithms where each sensor only remembers its own utility values and actions played during the last plays. These algorithms are proven to be convergent in probability to the set of (constrained) Nash equilibria and global optima of certain coverage performance metric, respectively.

网约车平台内协调基于车辆的移动感知任务的机制设计

Mechanism design for coordinating vehicle-based mobile sensing tasks within the ride-hailing platform

本文针对网约车平台中整合移动感知任务的问题，提出错峰运行策略和带预算约束的拍卖机制，以低成本激励司机参与感知任务，实验证明其能在不影响网约车服务的同时提高感知任务完成率。

Dynamic Compressed Sensing of Unsteady Flows with a Mobile Robot

Large-scale environmental sensing with a finite number of mobile sensors is a challenging task that requires a lot of resources and time. This is especially true when features in the environment are spatiotemporally changing with unknown or partially known dynamics. Fortunately, these dynamic features often evolve in a low-dimensional space, making it possible to capture their dynamics sufficiently well with only one or several properly planned mobile sensors. This paper investigates the problem of dynamic compressed sensing of an unsteady flow field, which takes advantage of the inherently lo…

Adaptive Algorithms for Coverage Control and Space Partitioning in Mobile Robotic Networks

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, dis…

协调移动网络覆盖与车辆路径规划：一种双列生成方法

Coordinating mobile network coverage and vehicle routing: a double column generation approach

本文提出一种双列生成算法求解带时间窗的联合作业发射车辆路径问题，协调任务车辆与移动发射车辆作业以保障5G网络覆盖，经加速优化后算法在大小规模算例中均表现出优异的计算性能与可扩展性。

移动感知车队可重复访问的路径规划

Route planning of mobile sensing fleets for repeatable visits

本文提出可重复访问的开放式团队定向越野问题（OTOP-RV），并定制自适应大邻域搜索算法，在随机与真实VOCs感知案例中验证了其高效性与实用性。