5 March 2021 in IEEE Transactions on Control Systems Technology
This brief addresses distributed continuous-time optimization problems with time-varying objective functions. The goal is for multiple agents to cooperatively minimize the sum of local time-varying objective functions with only local interaction and information while explicitly taking into account distributed adaptive gain design. Here, the optimal point is time varying and creates an optimal trajectory. First, for the unconstrained case, a distributed nonsmooth algorithm coupled with a state-dependent gain is proposed. It is shown that the interaction gain for each agent can be computed according to the variation of the Hessian and gradient information of the convex local objective functions so that the algorithm can solve the time-varying optimization problem without imposing a bound on any information about the local objective functions. Second, for the case where there exist common time-varying linear equality constraints, an extended algorithm is presented, where local Lagrangian functions are introduced to address the equality constraints. The asymptotic convergence of both algorithms to the optimal solution is proved. Numerical simulations are presented to illustrate the theoretical results. In addition, the one proposed algorithm is experimentally implemented and validated on a multi-Crazyflie platform.
21 October 2014 in IEEE Transactions on Wireless Communications
In the spectrum auction, if a buyer locates in a “critical” place, interfering with a lot of other buyers, his occupancy of the spectrum may deprive many other transmission opportunities. In this paper, we propose a Location-aware Online Truthful doUble auction Scheme (LOTUS), which incorporates the buyers' location information into auction mechanism design. In the online auction, the biggest challenge is how to allocate the spectrums based on the knowledge in the current time slot, without knowing the spectrum requests that may come afterward. To solve this problem, we propose considering the opportunity cost of allocating the spectrum to a buyer based on his local interference conditions. We introduce the “interference discount” to markdown a buyer's bid if he induces a wide range of interference. Furthermore, we take into account the spectrum heterogeneity and design mechanisms that guarantee the economic robustness of the auction. The simulation results show that LOTUS outperforms the existing online auction mechanism, significantly improving buyers' and sellers' utility.
20 August 2012 in IEEE Transactions on Vehicular Technology
Femto base stations (FBSs) are cost-effective choices for wireless service providers (WSPs) to provide better indoor coverage and capacity in cellular networks. With the introduction of femtocells, spectrum allocation among macro base stations (MBSs) and numerous FBSs becomes challenging. WSPs will allocate resources among hierarchical infrastructures to mitigate mutual interference and maximize WSPs' revenue from service provisioning. In this paper, we propose a channel allocation and service provision framework to help WSPs allocate resources and increase revenue. The spectrum allocation and revenue maximization problem is formulated as a convex problem, and a centralized method is proposed to efficiently solve it. We also propose a distributed algorithm called LD (based on Lagrangian decomposition) to achieve a near-optimal solution with low computational and communication complexity, which can be used when the system is on a large scale. The simulation results show that our scheme can significantly improve the system's revenue.
27 August 2025 in Artificial Intelligence