Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource Searching

Fandel Lin, Hsun Ping Hsieh

研究成果: Article同行評審


Transportation between satellite cities or inside the city center has always been a crucial factor in contributing to a better quality of life. This article focuses on multi-criteria distributed and competitive route planning for stationary resources in regions where neither real-time nor historical availability of the targeted resource is accessible. We propose an inference-than-planning approach, with an availability inference for stationary resources in areas with no sensor coverage and a distributed routing where no information is shared among agents. We leverage the inferred availability and network structure in the searching space to suggest a two-stage algorithm with three relaxing policies: adjacent cruising, on-orbital annealing, and orbital transitioning. We take two publicly accessible parking-slot datasets from San Francisco and Melbourne for evaluation. Overall results show that the proposed availability inference model can retain decent performance. Furthermore, our proposed routing algorithm maintains the quality of solutions by achieving the Pareto-optimal between searching experience and resource utilization among baseline and state-of-the-art methods under various circumstances.

期刊ACM Transactions on Spatial Algorithms and Systems
出版狀態Published - 2023 11月 21

All Science Journal Classification (ASJC) codes

  • 訊號處理
  • 資訊系統
  • 建模與模擬
  • 電腦科學應用
  • 幾何和拓撲
  • 離散數學和組合


深入研究「Exploiting Network Structure in Multi-criteria Distributed and Competitive Stationary-resource Searching」主題。共同形成了獨特的指紋。