A Formal Concept Analysis Method for Path Planning Based on Formal Contexts
Journal of Computer Science and Artificial Intelligence · 11.02.2025 · 2 (1) · 15-21
DOI: 10.54097/k08npz81 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Computer Science and Artificial Intelligence, online erschienen am 11.02.2025. Verfasst von Weibo Yang und 3 weiteren Autor:innen. Die Arbeit nennt 30 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).
Abstract (Originalsprache)
Path planning is widely applied in various fields, including robotic movement and 3D printing. In this paper, we propose a path planning method by combining formal concept analysis and the Q-learning algorithm to study grid map path planning. First, a grid map is represented as a formal context, and based on formal concept analysis theory, the necessary region concepts are defined and introduced into the Q-learning algorithm to obtain the optimal path. Finally, through system experiments, it has been proven that using the necessary region concept can reduce redundant information and the effectiveness of this method. The experimental results demonstrate that this method can identify an optimal path with fewer inflection points. This study may provide a new way to achieve optimal path planning based on formal concept analysis.
Zitieren
APA
Yang, W., Hou, S., Qi, Z., & Zhi, H. (2025). A Formal Concept Analysis Method for Path Planning Based on Formal Contexts. Journal of Computer Science and Artificial Intelligence, 2(1), 15-21. https://doi.org/10.54097/k08npz81
Vancouver
Yang W, Hou S, Qi Z, Zhi H. A Formal Concept Analysis Method for Path Planning Based on Formal Contexts. Journal of Computer Science and Artificial Intelligence. 2025;2(1):15-21. doi:10.54097/k08npz81
BibTeX
@article{Yang2025,
author = {Yang, Weibo and Hou, Shouming and Qi, Zhenhao and Zhi, Huilai},
title = {A Formal Concept Analysis Method for Path Planning Based on Formal Contexts},
journal = {Journal of Computer Science and Artificial Intelligence},
year = {2025},
volume = {2},
number = {1},
pages = {15--21},
doi = {10.54097/k08npz81}
}
EUVIMED