Abstract
Traditional path planning approach is generally focused on finding a single one shortest path given the temporal or spatial constraints. However, the strategy of single-one optimal path is unable to adapt to various situations in real applications. For example, in the scenarios of vehicle patrolling and search &rescue, the comprehensiveness of coverage is much more important. Rather than finding a single one optimal shortest path as the traditional path planning does, our path inference approach aims at inferring all the possible paths which satisfy the specified temporal and spatial constraints. Path inference is able to provide more valuable insights for internet routing, migration pattern study, urban construction and adversary profiling. In this work, we propose a novel path inference algorithm based on Voronoi graph. We model the 2D geospatial topology with Voronoi cells according to the spatial constraint, represent the adjacency relationships of Voronoi cells with an adjacency matrix and infer all the possible paths in the derived Voronoi graph satisfying the user-specified temporal and spatial constraints. Experimental results indicate that our path inference algorithm based on Voronoi graph is able to perform more delicately and efficiently than the traditional path planning approach in term of both space partition and path inference.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Zhang, T., Chai, L.: Path planning for UAVs and multiple targets. Command Inf. Syst. Technol. 11(06), 32–36 (2020)
Gevargiz, P.: Control and Path Planning of Multi-Agent Systems: Artificial Potential Field Algorithm. California State University, Northridge (2019)
Fan, X., Guo, Y., Liu, H., Wei, B., Lyu, W.: Improved artificial potential field method applied for AUV path planning. Math. Probl. Eng. 2020, 1–21 (2020)
Sao, P., Kannan, R., Gera, P., Vuduc, R.: A supernodal all-pairs shortest path algorithm. In: Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 250–261 (2020)
Kannan, V., Appasamy, S., Kandasamy, G.: Comparative study of fuzzy Floyd Warshall algorithm and the fuzzy rectangular algorithm to find the shortest path. In: AIP Conference Proceedings, vol. 2516, no. 1, p. 200029. AIP Publishing LLC (2022)
Gong, Y., Chen, K., Niu, T., Liu, Y.: Grid-based coverage path planning with NFZ avoidance for UAV using parallel self-adaptive ant colony optimization algorithm in cloud IoT. J. Cloud Comput. 11(1), 29 (2022)
Hu, Y., Yang, S.X.: A novel knowledge-based genetic algorithm for robot path planning in complex environments. arXiv preprint arXiv:2209.01482 (2022)
Polak, A.: Bellman-Ford is optimal for shortest hop-bounded paths. arXiv preprint arXiv:2211.07325 (2022)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Xu, X. (2023). Path Inference Based on Voronoi Graph. In: Fujita, H., Wang, Y., Xiao, Y., Moonis, A. (eds) Advances and Trends in Artificial Intelligence. Theory and Applications. IEA/AIE 2023. Lecture Notes in Computer Science(), vol 13926. Springer, Cham. https://doi.org/10.1007/978-3-031-36822-6_13
Download citation
DOI: https://doi.org/10.1007/978-3-031-36822-6_13
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-36821-9
Online ISBN: 978-3-031-36822-6
eBook Packages: Computer ScienceComputer Science (R0)