This article investigates the distributed time-varying optimization problem for second-order multiagent systems (MASs) under limited interaction ranges. The goal is to seek the minimum of the sum of local time-varying cost functions (CFs), where each CF is only available to the corresponding agent. Limited communication range refers to the scenario where the agents have limited sensing and communication capabilities, that is, a pair of agents can communicate with each other only if their distance is within a certain range. To handle such a problem, a new continuous connectivity-preserving mechanism is presented to preserve the connectivity of the considered network. Then, two distributed optimization algorithms are presented to solve the optimization problem with time-varying CFs and time-invariant CFs, respectively. Theoretical analysis and two numerical examples are provided to verify the effectiveness of the methods.

Imagine you want to send money to a friend overseas. Wouldn't it be good if you didn't have to pay hefty fees to the intermediaries, and your friend received the funds very quickly? Now imagine ordering parts to make a product in your manufacturing plant. Wouldn't it be great if you were able to verify where each part comes from and have access to a reliable certificate on its quality automatically? Also think about dealing with energy use or selling off your excess solar energy as a prosumer. Wouldn't it be nice if you could purchase cheaper energy or sell it profitably at ease?