UNMANNED GROUND COMBAT VEHICLE CONTROLE USING RELAY COMMUNICATION TECHNIQUE
B. Kishor Kumar, G. Raaga Darshini · 2018
A number of Indian military research projects are working toward the goal of producing Robotic ground vehicle systems capable of executing surveillance, reconnaissance, obstacle-clearing, and infantry tasks in the absence of, or with minimal, human interaction.This paper represents the design, development, and validation of a metal-based autonomous robotic system for the military application. Security is the first priority in today’s unsecured life. In the existing system used to design a robotic system for military applications using Bluetooth technology.The focus of this paper is on some of the subsystems found in these vehicles, such as control, monitoring and detecting objects by using Zigbee technology. Here in this paper robot is controlled by Computer. The purpose of the paper is to monitor the locations by using cam which is connected to the robot. In this paper consists of two sections, one is transmitter section and another one is receiver section. The instructions are such as left, right, front, back are processed and that any instruction once person giving then automatically robotic controlling by own if when any obstacles, metals can be detected. When unmanned ground combat vehicles (UGCVs) are used for surveillance, information must often be transmitted to a base station in real time. However, limited communication ranges and the common requirement of free line of sight may make direct transmissions from distant targets impossible. This problem can be solved using relay chains consisting of one or more intermediate relay UGCVs. This leads to the problem of positioning such relays given known obstacles while taking into account a possibly mission-specific quality measure. The maximum quality of a chain may depend strongly on the number of UGCVs allocated. Therefore, it is desirable to either generate a chain of maximum quality given the available UGCVs or allow a choice from a spectrum of Pareto-optimal chains corresponding to different trade-offs between the number of UGCVs used and the resulting quality. In this paper, we define several problems continuous in a three-dimensional setting. We show how sets of Pareto-optimal chains can be generated using graph search and present a new label-correcting algorithm generating such chains significantly more efficiently than the best-known algorithms in the literature. Finally, we present a new dual ascent algorithm with better performance for certain tasks and situations.