【24h】

A Novel Agent Based Depth First Search Algorithm

机译:基于代理的深度优先搜索算法

获取原文

摘要

Artificial intelligent techniques provide different kind of searching methods in tree structure and those methods are implemented sequential and parallel manner using structured programming. Depth-first search is a tree search algorithm which enables the traversal from source node to neighbour nodes adjacent to source node in a graph and implemented sequentially in this fashion. The improvement of the sequential Depth-first search is sought in several research studies. One of the solutions to the improvement of Depth-first search is the design of multi agent system for the searching problem. In this research study, the proposed multi agent system for Depth-first search divides the entire graph into several clusters using bi-connected region method and consigns the agents to each cluster to perform the Depth-first search sequentially. The proposed method reveals the significance improvement in terms of the performance measure of the system than sequential Depth-first search.
机译:人工智能技术在树形结构中提供了不同种类的搜索方法,并且这些方法使用结构化编程以顺序和并行方式实现。深度优先搜索是一种树形搜索算法,它使从源节点遍历到图中的与源节点相邻的邻居节点成为可能,并且以此方式顺序执行。在一些研究中寻求对顺序深度优先搜索的改进。改进深度优先搜索的解决方案之一是针对搜索问题的多主体系统的设计。在本研究中,提出的用于深度优先搜索的多主体系统使用双向连接区域方法将整个图分成几个集群,并将代理分配给每个集群以依次执行深度优先搜索。与顺序深度优先搜索相比,所提出的方法在系统性能指标方面显示出显着的改进。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号