An Optimal Path Algorithm for Autonomous Searching Robots

This source preferred by Mihai Dupac

Authors: Popirlan, C.-I. and Dupac, M.

http://inf.ucv.ro/~ami/index.php/ami/article/view/264/258

Journal: Annals of University of Craiova - Mathematics and Computer Science Series

Volume: 36

Pages: 37-48

ISSN: 1223-6934

Constructing architecture and generating optimal paths for autonomous robots are some of the heavily studied subjects in mobile agents applications. The aim of this paper is to find and analyze a optimal path algorithm for a group of autonomous robots using agent-based architecture in a virtual reality environment. The optimal path is determined by a heuristic approach, A-Star algorithm. The master-slave architecture control the communication between robots (slave agents) and the mobile agent (master). The robots communicate with the mobile agents to generate an optimal path (time and collision-free optimal path) by presenting all the subsequent trajectories while navigating among various obstacles. The results are conducted to show the effectiveness of the proposed architecture.

The data on this page was last updated at 04:40 on November 19, 2017.