With the rapid development of wireless communication, mobile computing, and GPS technologies, drivers' route decisions nowadays rely more on navigation services, such as Google or Waze. However, these navigation s...
详细信息
With the rapid development of wireless communication, mobile computing, and GPS technologies, drivers' route decisions nowadays rely more on navigation services, such as Google or Waze. However, these navigation services don't always come with improved traffic conditions. Individual drivers often make independent and selfish route decisions that are not systematically favorable and thus often result in severe congestions. This study aims to alleviate such problems by exploiting the information gaps between individuals and the central planner (CP). Specifically, we develop a correlated equilibrium routing mechanism (CeRM) for the CP, which drives a group of vehicles' route choices to an equilibrium with a systematically optimal traffic condition while still satisfying individuals' selfish nature. Participating drivers would only be better off by following the suggested routing guidance than navigating on their best responses to real-time traffic information. The CeRM is modeled as a nonconvex and nonlinear program involving a large-scale of users. A distributed Augmented Lagrangian algorithm (D-AL) is developed to efficiently solve the CeRM to provide online real-time navigation service, taking advantage of the onboard computation resources of individual vehicles. Considering the D-AL relies on the wireless communications between vehicles and the CP, we proved the convergence robustness of the D-AL against random communication failures and derived the convergence rate upper bound as a function of the communication failure probability. It is noticed that the convergence rate of the DAL degrades dramatically as the communication failure probability increases, which hampers the applicability of implementing the CeRM in practice. To improve the solution algorithm's resilience in the computation performance, we further designed and proved an acceleration scheme aided D-AL (aD-AL) to expedite the convergence rate under the high likelihood of communication failures. Numeric
Distributed optimization algorithms for security-constrained economic dispatch (SCED) problems have been the subject of significant research interest in recent years. However, existing distributed SCED algorithms can ...
详细信息
Distributed optimization algorithms for security-constrained economic dispatch (SCED) problems have been the subject of significant research interest in recent years. However, existing distributed SCED algorithms can be ineffective in the presence of malicious participants and inefficient in the absence of a coordinator. On the other hand, blockchain, an emerging technique known as the trust machine, has not shown its potential to address the above challenges in state-of-the-art literature. This paper proposes a blockchain-based distributed SCED algorithm. Using blockchain to form a coordination committee and enable balance among committee members, the proposed method allows the use of hierarchical SCED algorithms in the absence of a coordinator and can disable malicious participants. Numerical results show the robustness and necessity of the proposed blockchain-based SCED algorithm, by comparing the SCED results with and without blockchain.
暂无评论