Multi-robot cooperative pursuit based on association rule data mining

Authors:
Jun Li;Qi-shu Pan;Bing-rong Hong;Mao-hai Li
Affiliations:
School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China;School of Computer Science and Technology, Harbin Institute of Technology, Harbin, China
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 7
Year:
2009

Citing 5
Cited 0

Mining Sequential Patterns: Generalizations and Performance Improvements

EDBT '96 Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology
Mining Sequential Patterns

ICDE '95 Proceedings of the Eleventh International Conference on Data Engineering
Sparse cooperative Q-learning

ICML '04 Proceedings of the twenty-first international conference on Machine learning
Data mining for agent reasoning: A synergy for training intelligent agents

Engineering Applications of Artificial Intelligence
A framework for pursuit evasion games in Rn

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

An approach of cooperative hunting for multiple mobile targets by multi-robot is presented, which divides the pursuiting process into forming the pursuiting groups and capturing the targets. The data sets of attribute relationship is built by consulting many factors about capturing evaders, then the interesting rules can be found by data mining from the data sets to build the pursuiting groups. Through doping out the positions of targets, the members of pursuiting can confirm their destinations. Based on these extensions, a kind of multi-robot cooperative pursuit algorithm that allows dynamic alliance is proposed. The simulation results show that the mobile evaders can be captured effectively and efficiently, and prove the feasibility and validity of the given algorithm under dynamic environment.