Detection techniques based on the absence of any knowledge of the received carrier phase are referred to as non-coherent detection techniques. The optimum receiver under such a scenario is well known to be a structure that incorporates a form of square-law detection. This demodulation through M matched filters, where each one corresponds to the transmitted base band signals, the decision variab...

VII. CONCLUSION In this paper, optimal path planning for robot manipulator is presented that utilizes a variational technique. A simplified robot arm is considered to facilitate geometric collision checking scheme. This is incorporated in the variational technique to develop a collision avoidance strategy. The collision checking scheme is rather stringent. However, it reduces the computational ...

In this paper, a simple, non-sensitive, robust, and accurate computational procedure is presented and it does not require a prior knowledge of a reference trajectory for computing the optimum trajectory for minimum-time-toclimb to a prescribed final altitude of a supersonic aircraft. From the program, we fnst generate the possible range of initial Mach numbers, initial altitudes and climb times...

Abstract. The principle of low-gain integral control for finite-dimensional systems is well known. More recently, low-gain integral control results have been obtained for classes of infinite-dimensional systems. In this paper we show that integral control with a simple and natural adaptation of the integrator gain achieves tracking of constant reference signals for every exponentially stable, m...

This paper presents direct settings and rigorous solutions of the main Statistical Inference problems. It shows that rigorous solutions require solving multidimensional Fredholm integral equations of the first kind in the situation where not only the right-hand side of the equation is an approximation, but the operator in the equation is also defined approximately. Using Stefanuyk-Vapnik theory...

This paper describes and evaluates the performance of various reinforcement learning algorithms with shortest path algorithms that are widely used for routing packets through the network. Shortest path routing is the simplest policy used for routing the packets along the path having minimum number of hops. In high traffic or high mobility conditions, the shortest path get flooded with huge numb...

Internet routing protocols, such as Open Shortest Path First (OSPF), compute a shortest path tree from each node to other nodes in the network, using link-state information. Such protocols do not consider the queueing situation at a given node. An alternate path of higher cost may be more convenient to use than the optimum path when a long queue is present at the node. This paper proposes a new...